ECE 54700 - Introduction to Computer Communication Networks

Course Details

Lecture Hours: 3 Credits: 3

Counts as:

  • EE Elective
  • CMPE Special Content Selective

Normally Offered:

Each Fall

Campus/Online:

On-campus and online

Requisites:

ECE 30200

Requisites by Topic:

Probability theory

Catalog Description:

A quantitative study of the issues in design, analysis and operation of computer communication and telecommunication networks as they evolve towards the integrated networks of the future employing both packet and circuit switching technology. The course emphasizes a fundamental understanding of basic network design, routing, dimensioning and control. The students will study various network functions such as error-recovery algorithms, flow control, congestion control, routing, multi-access, switching, etc. They will also study these in the context of current Internet solutions (e.g. TCP, IP, etc.) and future open problems, and possible solutions.

Course Objectives:

To introduce students to the design, analysis and performance evaluation of computer communication and telecommunication networks through an understanding of their architectures and protocols.

Required Text(s):

  1. Communication Networks: A Concise Introduction (available online; link will be provided by the instructor) , 2nd Edition , Walrand, J; Parekh, S. , Morgan & Claypool , 2017 , ISBN No. 1627058877
  2. Network Optimization and Control, Foundations and Trends in Networking, Vol 2 No 3 (available online; link will be provided by the instructor) , Shakkottai, Srinivas; Srikant, R. , 2008
  3. Telecommunication Networks: Protocols, Modeling, and Analysis , Schwartz, Mischa , Addison-Wessley , 1987 , ISBN No. 20116423X

Recommended Text(s):

  1. Communication Networks: An optimization, control, and stochastic networks perspective , Srikant, R.; Ying, L. , Cambridge University Press , 2014 , ISBN No. 1107036054
  2. Data Networks , 2nd Edition , D. Bertsekas and R. Gallagher , Prentice Hall , 1992 , ISBN No. 1107036054

Learning Outcomes:

A student who successfully fulfills the course requirements will have demonstrated:
  1. an understanding of the fundamental principles underlying computer communication networks. [1,3,4]
  2. an ability to obtain mathematical models of networking systems. [1,2,4]
  3. an ability to perform queueing analysis of simpler queueing networks, convergence analysis of routing protocols, and stability analysis of random access mechanisms. [1,2,4]
  4. an ability to solve simple network design and optimization problems to meet specifications in throughput and delay. [1,4]
  5. an ability to use simulation tools for network analysis and design. [1,3,4]

Lecture Outline:

1 Major Topics
1 Historical perspective of networking
2 Main issues in network design and engineering
3 Elementary Queueing theory for network design and admission control
4 Error recovery mechanisms: Examples and performance analysis
5 TCP congestion control: TCP Reno, TCP Vegas, AQM, etc.
6 Fundamentals of network routing: Dijkstra, Bellman Ford, etc.
7 Routing in the current internet: IP routing
8 Multiaccess communication: Polling and random access
9 Open problems and possible solutions

Assessment Method:

Homework, project, exams. (3/2022)