16.37
Data-Communication Networks
See description under subject 6.7450J.
Fall 2002 · Data Communication Networks
Topics
- Introduction, OSI 7-Layer Architecture
- Data Link Layers, Framing, Error Detection
- Retransmission Algorithms
- Queueing Models - Introduction & Little’s Theorem
- M/M/1, M/M/m, Queues etc.
- Networks of Queues
- M/G/1 Queues
- M/G/1 Queue Occupancy Distribution
- M/G/1 w/ Vacations, Reservations, Priority Queues
- Stability of Queueing Systems
- Multiple Access & Aloha
- Stabilized Aloha, Tree Algorithms
- CSMA, CSMA/CD and Ethernet
- High-Speed LANs, Token Rings, Satellite Reservations
- Introduction to Switch Architecture
- High Speed Switch Scheduling
- Broadcast Routing & Spanning Trees
- Shortest Path Routing
- Distributed Routing Algorithms, Optimal Routing
- Flow Control - Window/Credit Schemes
- Flow Control - Rate Based Schemes
- Transport Layer and TCP/IP
- ATM Networks
- Special Topic: Optical Networks, Wireless Networks
Readings
- Bertsekas, Dimitri, and Robert Gallager. Data Networks (2nd Edition) . Upper Saddle River, NJ: Prentice Hall, 1991. ISBN: 0132009161.
- Peterson and Davie. Computer Networks (2nd Edition) . San Francisco, CA: Morgan Kaufmann Publishers, 1999. ISBN: 1558605142 .
- Walrand and Varaiya. High Performance Communication Networks . San Francisco, CA: Morgan Kaufmann Publishers, 1996. ISBN: 1558603417.
- Tanenbaum, A. S. Computer Networks . 4th ed. Upper Saddle River, NJ : Prentice Hall, 2003. ISBN: 0130661023.
- Stevens. TCP/IP Illustrated . Reading, MA: Addison-Wesley Pub. Co., c1994-c1996. ISBN: 0201633469.
- Kleinrock, Leonard. Queueing Systems, Vol 1: Theory . New York, NY: Wiley J., 1975. ISBN: 0471491101.
Prerequisites & course information
Same subject as 6.7450J Prereq: 6.3700 or 18.204 G (Fall) 3-0-9 units
Sources
- Course catalogue ↗2026–2027
- MIT OpenCourseWare ↗Fall 2002
- MIT OCW calendar ↗
- MIT OCW syllabus ↗
- Historical MIT OpenCourseWare offering. Named reading entries and schedule topics are automatically extracted from the linked source pages.