Data networks Lecture 1 Introduction Eytan Modiano
Data Networks Lecture 1 Introduction Eytan Modiano Eytan Modiano Slide 1
6.263: Data Networks Fundamental aspects of network Design and Analysis: Architecture Layering Topology design Protocols Pt -to-Pt Multiple access End-to-end Algorithms Error recovery Routing Flow Contro Analysis tools Probabilistic modeling Queueing Theory
6.263: Data Networks • Fundamental aspects of network Design and Analysis: – Architecture Layering Topology design – Protocols Pt.-to-Pt. Multiple access End-to-end – Algorithms Error recovery Routing Flow Control – Analysis tools Probabilistic modeling Queueing Theory Eytan Modiano Slide 2
Course Information Lecturer: Professor Eytan Modiano Requirements grading About one problem set per week(10% of grade Project (5% of grade Midterm exam(35 %) Final Exam during finals week(50%) Prerequisite Policy: 6.041, or an equivalent class in probability Textbook: Bertsekas Gallager, Data Networks(2nd Edition)
Course Information • Lecturer: Professor Eytan Modiano • Requirements & Grading – About one problem set per week (10% of grade) – Project (5% of grade) – Midterm exam (35 %) – Final Exam during finals week (50%) • Prerequisite Policy: 6.041, or an equivalent class in probability • Textbook: Bertsekas & Gallager, Data Networks (2nd Edition) Eytan Modiano Slide 3
Tentative syllabus LEC# TOPICS Introduction, OSI 7-layer architecture Data Link Layers, Framing, error detection Retransmission algorithms 4 Retransmission algorithms Queueing Models- Introduction Little's theorem M/M/1, M/M/m, queues etc Networks of queues M/G/I queues, M/G/I w/vacations M/G/I queues and reservations, priority queues Stability of queueing systems M/G/1 queue occupancy distribution 0
Tentative syllabus LEC # TOPICS 1 Introduction, OSI 7-layer architecture 2 Data Link Layers, Framing, error detection 3 Retransmission Algorithms 4 Retransmission Algorithms 5 Queueing Models - Introduction & Little's theorem 6 M/M/1, M/M/m, queues etc. 7 Networks of queues 8 M/G/1 queues, M/G/1 w/ vacations 9 M/G/1 queues and reservations, priority queues 10 Stability of queueing systems 11 M/G/1 queue occupancy distribution 12 Quiz Eytan Modiano Slide 4
Tentative syllabus, continued LEC# TOPICS Multiple access aloha Stabilized Aloha. Tree Algorithms CSMACSMA/CD and Ethernet High-Speed LANS, Token rings, Satellite reservations Introduction to switch architecture 18 High Speed Switch Scheduling Broadcast routing spanning trees 20 Shortest path routing 21 Distributed routing algorithms, optimal routing 22 Flow Control-Window/Credit Schemes Flow Control-Rate Based Schemes Transport layer and TCP/IP ATM Networks 26 Special topic: Optical Networks, Wireless networks Final Exam during final exam week, date and time to be announced
Tentative syllabus, continued LEC # TOPICS 13 Multiple access & Aloha 14 Stabilized Aloha, Tree Algorithms 15 CSMA, CSMA/CD and Ethernet 16 High-speed LANs, Token rings, Satellite reservations 17 Int roduction to switch architecture 18 High Speed Switch Scheduling 19 Broadcast routing & Spanning t rees 20 Shortest p ath routing 21 Distributed routing algorithms, optimal routing 22 Flow Control - Window/Credit Schemes 23 Flow Control - Rate Based Schemes 24 Transport layer and TCP/IP 25 ATM Networks 26 Special topic: Optical Networks, Wireless n etworks Final Exam during final exam week. Date and time to be announced. Eytan Modiano Slide 5