MIT Libraries logoDSpace@MIT

MIT
View Item 
  • DSpace@MIT Home
  • MIT Libraries
  • MIT Theses
  • Graduate Theses
  • View Item
  • DSpace@MIT Home
  • MIT Libraries
  • MIT Theses
  • Graduate Theses
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

NATRON : overlay routing to oblivious destinations

Author(s)
Yip, Alexander Siumann, 1979-
Thumbnail
DownloadFull printable version (1.447Mb)
Other Contributors
Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.
Advisor
Robert T. Morris.
Terms of use
M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission. http://dspace.mit.edu/handle/1721.1/7582
Metadata
Show full item record
Abstract
This thesis presents NATRON, a system in which an overlay network of nodes cooperates to improve unicast routing to non-participating hosts. Previous overlay systems have used overlay routing to improve communication between participating hosts; they were unable to exploit overlay routing to non-participating hosts. NATRON uses a combination of IP tunneling and network address translation to allow members of the overlay to communicate with hosts outside the overlay network via other overlay members. In order to estimate the potential performance improvement a system like NATRON might provide, we performed an exhaustive test on a multi-site Internet testbed. Our results show that a system that always guesses the best intermediate node could reduce the average HTTP transfer time by 18% and reduce the number of downloads lasting longer than 30 seconds by 16%. We implemented a working NATRON and a heuristic for choosing intermediate overlay nodes, but we find that our heuristic can only exploit 22% of the potential performance gains. We conclude that overlay routing to oblivious hosts has good potential for performance enhancement but further work is needed to develop a path choice heuristic.
Description
Thesis (M.Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2002.
 
Includes bibliographical references (p. 51-53).
 
Date issued
2002
URI
http://hdl.handle.net/1721.1/29724
Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Publisher
Massachusetts Institute of Technology
Keywords
Electrical Engineering and Computer Science.

Collections
  • Graduate Theses

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

Login

Statistics

OA StatisticsStatistics by CountryStatistics by Department
MIT Libraries
PrivacyPermissionsAccessibilityContact us
MIT
Content created by the MIT Libraries, CC BY-NC unless otherwise noted. Notify us about copyright concerns.