<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-09-19T06:32:22Z</responseDate><request verb="GetRecord" identifier="oai:dspace.mit.edu:1721.1/29724" metadataPrefix="dim">https://dspace.mit.edu/server/oai/request</request><GetRecord><record><header><identifier>oai:dspace.mit.edu:1721.1/29724</identifier><datestamp>2022-01-13T07:54:29Z</datestamp><setSpec>com_1721.1_7582</setSpec><setSpec>com_1721.1_7581</setSpec><setSpec>col_1721.1_131023</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:doc="http://www.lyncode.com/xoai" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="advisor" lang="en_US">Robert T. Morris.</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="author" lang="en_US">Yip, Alexander Siumann, 1979-</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="other" lang="en_US">Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="department">Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2006-03-24T16:19:28Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2006-03-24T16:19:28Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="copyright" lang="en_US">2002</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued" lang="en_US">2002</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/1721.1/29724</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="oclc" lang="en_US">54038633</dim:field>
   <dim:field mdschema="dc" element="description" lang="en_US">Thesis (M.Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2002.</dim:field>
   <dim:field mdschema="dc" element="description" lang="en_US">Includes bibliographical references (p. 51-53).</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en_US">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.</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="statementofresponsibility" lang="en_US">by Alexander Siumann Yip.</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="degree" lang="en_US">M.Eng.</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="extent" lang="en_US">53 p.</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="extent">1518020 bytes</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="extent">1517824 bytes</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="mimetype">application/pdf</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="mimetype">application/pdf</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en_US">eng</dim:field>
   <dim:field mdschema="dc" element="publisher" lang="en_US">Massachusetts Institute of Technology</dim:field>
   <dim:field mdschema="dc" element="rights" lang="en_US">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.</dim:field>
   <dim:field mdschema="dc" element="rights" qualifier="uri">http://dspace.mit.edu/handle/1721.1/7582</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Electrical Engineering and Computer Science.</dim:field>
   <dim:field mdschema="dc" element="title" lang="en_US">NATRON : overlay routing to oblivious destinations</dim:field>
   <dim:field mdschema="dc" element="type" lang="en_US">Thesis</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="mimetype">application/pdf</dim:field>
   <dim:field mdschema="dspace" element="authorsordered">false</dim:field>
   <dim:field mdschema="dspace" element="entity" qualifier="type">Publication</dim:field>
   <dim:field mdschema="others" element="access-status">unknown</dim:field>
   <dim:field mdschema="others" element="access-status">unknown</dim:field>
   <dim:field mdschema="cerif" element="openaire" authority="" confidence="-1">&lt;Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="0be0a6d3-b737-4593-bbb1-5f9c5e925795">
	&lt;Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843&lt;/Type>
	&lt;Language>eng&lt;/Language>
   	&lt;Title>NATRON : overlay routing to oblivious destinations&lt;/Title>
   	&lt;PublishedIn>
    	&lt;Publication>
      	&lt;/Publication>
   	&lt;/PublishedIn>
   	&lt;PublicationDate>2002&lt;/PublicationDate>
   	&lt;Authors>
      	&lt;Author>
        	&lt;DisplayName>Yip, Alexander Siumann, 1979-&lt;/DisplayName>
         	&lt;Affiliation>
         		&lt;OrgUnit>
         		&lt;/OrgUnit>
         	&lt;/Affiliation>
      	&lt;/Author>
	&lt;/Authors>
   	&lt;Editors>
	&lt;/Editors>
    &lt;Publishers>
        &lt;Publisher>
            &lt;DisplayName>Massachusetts Institute of Technology&lt;/DisplayName>
            &lt;OrgUnit />
        &lt;/Publisher>
    &lt;/Publishers>
    &lt;License>http://dspace.mit.edu/handle/1721.1/7582&lt;/License>
    &lt;Keyword>Electrical Engineering and Computer Science.&lt;/Keyword>
   	&lt;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.&lt;/Abstract>
	&lt;Access xmlns="http://purl.org/coar/access_right" 
    >
    &lt;/Access>
&lt;/Publication>
</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>