CptS 557 Advanced Computer Networks
Course Information
- Time and Location:
- Instructor: Prof. Min Sik Kim
- E-mail: msk@eecs.wsu.edu
- EME 133, 335-1846
- Office hours: Mon 9:10-10:00, Fri 2:30-3:30, and by
appointment
Course Description
This is an advanced graduate-level course in computer
networks. It covers fundamental principles in computer network
research. Topics include protocol mechanisms, network design and
implementation principles and practices, performance analysis and
measurement.
Prerequisites
Introductory course in computer networks (CptS 455, CptS
555, or equivalent).
Textbook
There is no textbook for the course. Reading materials will
be posted on the course web page.
Grading
This course will involve three exams and homework
assignments. Grades will be determined as follows:
- Midterm exams: 50% (25% each)
- Final exam: 35%
- Homework assignments: 15%
Topics
- Network architecture
- PSTN
- ATM
- Optical networks
- (optional) Rajiv Ramaswami and Kumar N. Sivarajan. Optical Networks: A Practical Perspective,
2nd ed., 2002. (Chapters 2, 7, and 8. Available
online)
- Internet
- Network elements
- Exact matching
- Perfect
hash function. Wikipedia.
- Robert
J. Souza, P. G. Krishnakumar, Cüneyt M. Özveren, Robert J. Simcoe,
Barry A. Spinney, Robert E. Thomas, and Robert J. Walsh. GIGAswitch
system: a high-performance packet-switching platform. Digital Technical Journal,
6(1):9-22, 1994. [PDF]
- Prefix matching
- Packet classification
- Switching
- Nick McKeown, Adisak Mekkittikul, Venkat
Anantharam, and Jean Walrand. Achieving 100% throughput in an
input-queued switch. IEEE
Transactions on communications, 47(8):1260-1267, August
1999. [PDF]
- Devavrat Shah, Paolo Gioccone, and Balaji
Prabhakar. An efficient randomized algorithm for input-queued switch
scheduling. IEEE Micro,
22(1):10-18, January 2002. [PDF]
- Queue management
- Network services
- Routing and switching
- Linear Programming
- Traffic engineering
- Bernard Fortz, Jennifer Rexford, and Mikkel Thorup.
Traffic engineering with traditional IP routing protocols. IEEE Communications Magazine,
40(10):118-124, October 2002. [PDF]
- Yufei Wang, Zheng Wang, and Leah Zhang. Internet
traffic engineering without full mesh overlaying. In Proceedings of IEEE INFOCOM 2001,
April 2001. [PDF]
- Ashwin
Sridharan, Roch Guérin, and Christophe Diot. Achieving near-optimal
traffic engineering solutions for current OSPF/IS-IS networks. IEEE/ACM Transactions on Networking,
13(2):234-247, April 2005. [PDF]
- Robert G. Galleger. A minimum delay routing
algorithm using distributed computation. IEEE
Transactions on Communications, 25(1):73-85, January 1977.
[PDF]
- Congestion control
- Network experiments
- Simulation
- Jungkeun Yoon, Mingyan Liu, and Brian Noble. Random
waypoint considered harmful. In Proceedings
of IEEE INFOCOM 2003, March 2003. [PDF]
- Measurements

- Network Tomography

- Network security