ECE 861 / CSE 861 Computer Communication Networks I (861)
A foundational and analytical understanding of network architecture, error control, queuing analysis, and network
dimensioning. A student taking this course is expected to:
- Be exposed to a basic history of networking
- Be familiar with architectural concepts of layering and circuit and packet switching
- Master various error control techniques and their analyses
- Be familiar with different queuing models and their application to networking
- Master elementary Markov chain analysis and be able to use them to model network systems
- Be familiar to M/G/1 queues, residual lifetime, and priority queuing
- Be familiar with Jackson’s Theorem and product form analyses
- Be familiar with Little’s Law and use it in different network scenarios
- Master concepts of shortest path routing and use Dijkstra and Bellman Ford on different network graphs
- Be familiar with issues of convergence, looping, and overhead in routing
ECE 862 / CSE 862 Computer Communication Networks II (862)
A foundational and analytical understanding of network architecture, error control, queuing analysis, and network
dimensioning. A student taking this course is expected to:
- Master concepts in shortest path routing including analysis of correctness, convergence, and complexity
- Be familiar with asynchronous routing protocols, routing on the Internet, and routing on other historical networks.
- Be familiar with window-based flow control and its analysis using closed queueing networks
- Be familiar with TCP congestion control and its advantages and disadvantages.
- Be exposed to a simplified analysis of TCP/IP window control
- Be familiar to the concepts of multi-access communications
- Be familiar to polling and analyses of polled systems
- Master simplified analysis of Aloha and slotted Aloha
- Be exposed to other historical and current random-access techniques
- Be familiar with P2P networks and their analysis.
- Be exposed to some of the open research problems in networking.