Prof. Bruce Maggs
Prof. Shang-Hua Teng
Prof. Tom Leighton
We will discuss numerous research problems that are related to the internet. Sample topics include: routing algorithms such as BGP, communication protocols such as TCP, algorithms for intelligently selecting a resource in the face of uncertainty, bandwidth sensing tools, load balancing algorithms, streaming protocols, determining the structure of the internet, cost optimization, DNS-related problems, visualization, and large-scale data processing. The seminar is intended for students who are ready to work on challenging research problems. Each lecture will discuss:
A modest amount of background information will be provided so that the importance and context of the problems can be understood. No previous study of the internet is required, but experience with algorithms and/or theoretical computer science at the graduate/research level is needed.
Maggs, Bruce, Ravi Sundaram, Shang-Hua Teng, and Tom Leighton. 18.996 Topics in Theoretical Computer Science : Internet Research Problems, Spring 2002. (MIT OpenCourseWare: Massachusetts Institute of Technology), http://ocw.mit.edu/courses/mathematics/18-996-topics-in-theoretical-computer-science-internet-research-problems-spring-2002 (Accessed). License: Creative Commons BY-NC-SA