Basic theories and principles of information and communication networks are lectured on including data communication protocols, circuit and packet switching, and networking. And, performance analysis methods are studied including protocol analysis methods and queueing theory (teletraffic theory) based on a probabilistic approach.
By the end of this course, students will be able to:
1. understand network architecture;
2. design data communication protocols;
3. design media access protocols;
4. design switching and exchanging systems by using queueing theory;
5. design network systems by using queueing theory
Queueing Theory, Computer Network Protocol, Switching and Exchanging
✔ Specialist skills | Intercultural skills | Communication skills | Critical thinking skills | ✔ Practical and/or problem-solving skills |
Lectures only.
Course schedule | Required learning | |
---|---|---|
Class 1 | Overview of information and communication network: circuit switching and packet exchanging, OSI reference model Basic mechanism of circuit switching and packet exchanging, and a concept of OSI reference model should be understood. | Explain the difference between circuit switching and packet exchanging, and OSI reference model. |
Class 2 | Data communication methods: Automatic Repeat request(ARQ) Behaviour of some basic ARQs, and performance analysis method of them should be understood. | Explain the behaivour and performance analysis of ARQ. |
Class 3 | Circuit switching: Switch capacity analysis methods Relations between performance and cost on switch construction should be understood. | Explain the Switch construction methods. |
Class 4 | Packet exchanging: Multiple access (Random access) Behaviour of random access protocol, and performance analysis method of it should be understood. | Explain the random access protocols and their analysis methods. |
Class 5 | Packet exchanging: Multiple access (Carrier Sense Multiple Access (CSMA)) Behaviour of CSMA, and performance analysis method of it should be understood. | Explain the CSMA. |
Class 6 | Queueing theory: Basic of probability theory, Poisson and exponential distributions Poisson and exponential distributions should be understood. | Explain the poisson and exponential distributions. |
Class 7 | Queueing theory: Overview of queueing systems, Kendall’s notation | Explain the Kendall's notation. |
Class 8 | Queueing theory: M/M/1/1 model, Performance analysis method by using state transition diagram Performance analysis method by using state transition diagram should be understood on M/M/1/1 model. | Explain the M/M/1/1 model. |
Class 9 | Queueing theory: M/M/1 model and Littl's formula | Explain the M/M/1 model and Little's formula. |
Class 10 | Queueing theory: M/M/1/K model and M/M/s model | Explain the M/M/1/K model and M/M/s model. |
Class 11 | Queueing theory: Reliability analysis of systems | Explain the reliability analysis of systems. |
Class 12 | Queueing theory: M/G/1 model and Pollaczek-Khintchine formula | Explain the M/G/1 model. |
Class 13 | Queueing theory: Teletraffic Theory and loss system | Explain the Teletraffic Theory. |
Class 14 | Queueing theory: Heterogeneous Traffic Analysis | Explain the Heterogeneous Traffic Analysis. |
To enhance effective learning, students are encouraged to spend approximately 100 minutes preparing for class and another 100 minutes reviewing class content afterwards (including assignments) for each class.
They should do so by referring to textbooks and other course material.
TBD
Lecture materials are available.
Examination only.
Basic of Probability and Statistics are required.
yamaoka[at]ict.e.titech.ac.jp
Please e-mail to Yamaoka (yamaoka@ict.e.titech.ac.jp) in advance.