Final Exam: Thursday, Dec. 20, 9am, Rm: 37-212. |
||||||||
|
6.263/16.37: Data Communication Networks
TA Shortcuts
Michael Lewy Room 35-208, X3-6171 Course Headquarters: This is a first class on the fundamentals of data communication networks, their architecture, principles of operations, and performance analyses. One goal will be to give some insight into the rationale of why networks are structured the way they are today and tounderstand the issues facing the designers of next-generation data networks. Much of the class will focus on network algorithms and their performance. Students are expected to have a strong mathematical background and an understanding of probability theory (6.041 is a pre-requisite.). Topics discussed will include: layered network architecture, Link Layer protocols, high-speed packet switching, queueing theory, Local Area Networks, and Wide Area Networking issues including routing and flow control. Requirements & Grading About one problem set per week (10% of grade) Prerequisites 6.041, or an equivalent class in probability. The prerequisite (6.041)
should have been taken prior to 6.263, because from the beginning we assume
solid knowledge of material from 6.041.
Our experience in the past has been that those students with insufficient
background faired poorly in 6.263 and did not benefit from the class.
As mentioned in class, 6.263 is focused on probabilistic modeling and
analysis of protocols, and on queueing theory, both of which heavily rely
upon the prerequisite. Textbook |
||||||||
|
|
||||||||