2016 Communication Network

Font size  SML

Register update notification mail Add to favorite lecture list
Academic unit or major
Computer Science
Instructor(s)
Yamaoka Katsunori 
Course component(s)
Lecture     
Day/Period(Room No.)
Thr1-2(S622)  
Group
-
Course number
ZUS.M301
Credits
2
Academic year
2016
Offered quarter
3-4Q
Syllabus updated
2017/1/11
Lecture notes updated
-
Language used
Japanese
Access Index

Course description and aims

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.

Student learning outcomes

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

Keywords

Queueing Theory, Computer Network Protocol, Switching and Exchanging

Competencies that will be developed

Specialist skills Intercultural skills Communication skills Critical thinking skills Practical and/or problem-solving skills

Class flow

Lectures only.

Course schedule/Required learning

  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.
Class 2 Data communication methods: Automatic Repeat request(ARQ) (Stop-and-Wait ARQ) Behaviour of Stop-and Wait ARQ, and performance analysis method of it should be understood.
Class 3 Data communication methods: Automatic Repeat request(ARQ) (Go-back-N ARQ) Behaviour of Go-back-N ARQ, and performance analysis method of it should be understood.
Class 4 Circuit switching: Switch construction methods Relations between performance and cost on switch construction should be understood.
Class 5 Packet exchanging: Multiple access (Random access) Behaviour of random access protocol, and performance analysis method of it should be understood.
Class 6 Packet exchanging: Multiple access (Carrier Sense Multiple Access (CSMA)) Behaviour of CSMA, and performance analysis method of it should be understood.
Class 7 Queueing theory: Basic of probability theory, Poisson and exponential distributions Poisson and exponential distributions should be understood.
Class 8 Queueing theory: Overview of queueing systems, Kendall’s notation Poisson and exponential distributions should be understood.
Class 9 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.
Class 10 Queueing theory: M/M/1 model and Littl's formulra
Class 11 Queueing theory: M/M/1/K model and M/M/s model
Class 12 Queueing theory: Reliability analysis of systems
Class 13 Queueing theory: M/G/1 and Pollaczek-Khintchine formula
Class 14 Queueing theory: Teletraffic Theory and loss system
Class 15 Queueing theory: Heterogeneous Traffic Analysis

Textbook(s)

TBD

Reference books, course materials, etc.

Nothing

Assessment criteria and methods

Examination only.

Related courses

  • ICT.M202 : Probability and Statistics (ICT)
  • ICT.C301 : Foundations of Communication Network
  • ICT.C305 : Network Architecture and Control
  • ICT.C315 : Cryptographic Technology and Network Security
  • ICT.C309 : Multimedia Distribution Technology
  • ICT.C506 : Advanced Information and Communication Network

Prerequisites (i.e., required knowledge, skills, courses, etc.)

Basic of Probability and Statistics are required.

Contact information (e-mail and phone)    Notice : Please replace from "[at]" to "@"(half-width character).

yamaoka[at]ce.titech.ac.jp

Office hours

Please e-mail to Yamaoka (yamaoka@ce.titech.ac.jp) in advance.

Page Top