ALADDIN
CENTER Carnegie Mellon UniversityCarnegie Mellon Computer Science DepartmentSchool of Computer Science
REU

Funding for this project has been provided by The Berkman Faculty Development Fund.

Aladdin
About
Calendar
People
PROBEs
Workshops
Papers
Education
Related Activities
Corporate
Contact
 
Captcha
Outreach Roadshow

Understanding the Complexity of Distances in the Internet, and the Performance of New Routing Protocols

REU
Student

Faculty
Advisors
Recently, people have been trying to undestand the "complexity" of the distances in the Internet: if these distances are indeed "simple" (in a certain mathematically well-defined sense), we have developed very good routing protocols that store very little extra information in the system.

This project will have two conceptual parts: (1) we will try to find out the "dimension" of distances in the Internet, and (2) we will implement the improved routing protocols and empirically evaluate their performance on real(istic) networks.

Students should be proficient in C/C++, and should have basic background in algorithms. Networking background a plus.

Preliminary Presentation (ppt)
Final Presentation (ppt)

 

This material is based upon work supported by National Science Foundation under Grant No. 0122581.
Any opinions, findings, and conclusions or recommendations expressed in this material are those of the author(s) and do not necessarily reflect the views of the
National Science Foundation