Topics in theoretical computer science : internet research problems

Master

In Maynard (USA)

Price on request

Description

  • Type

    Master

  • Location

    Maynard (USA)

  • Start date

    Different dates available

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:

Facilities

Location

Start date

Maynard (USA)
See map
02139

Start date

Different dates availableEnrolment now open

Questions & Answers

Add your question

Our advisors and other users will be able to reply to you

Who would you like to address this question to?

Fill in your details to get a reply

We will only publish your name and question

Reviews

Subjects

  • TCP
  • Communication Training
  • Algorithms
  • DNS
  • Internet

Course programme

Lectures: 1 session / week, 3 hours / session


Tom Leighton, Bruce Maggs (CMU/Akamai), Ravi Sundaram (Akamai), and Shang-Hua Teng (BU/Akamai)


Introduction to Algorithms: 6.046 or 18.410


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.


The class will not have any exams. Students will be asked to scribe lecture notes. Each lecture will have an assigned "scribe", whose job is to take notes for later distribution to the class. The notes should not be a simple copy of what is written on the white/blackboard. They have to be written to show that the scribe understands the material.


Please use the following LaTeX package to prepare the notes


Students will be asked to scribe lecture notes. Each lecture will have an assigned "scribe", whose job is to take notes for later distribution to the class. The notes should not be a simple copy of what is written on the white/blackboard. They have to be written to show that the scribe understands the material.


Don't show me this again


This is one of over 2,200 courses on OCW. Find materials for this course in the pages linked along the left.


MIT OpenCourseWare is a free & open publication of material from thousands of MIT courses, covering the entire MIT curriculum.


No enrollment or registration. Freely browse and use OCW materials at your own pace. There's no signup, and no start or end dates.


Knowledge is your reward. Use OCW to guide your own life-long learning, or to teach others. We don't offer credit or certification for using OCW.


Made for sharing. Download files for later. Send to friends and colleagues. Modify, remix, and reuse (just remember to cite OCW as the source.)


Learn more at Get Started with MIT OpenCourseWare


Topics in theoretical computer science : internet research problems

Price on request