2026-09-19T09:51:53Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/179382026-06-06T01:04:24Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023
Umar Saif.
Agrawal, Rahul, 1980-
Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
2005-06-02T19:15:38Z
2005-06-02T19:15:38Z
2004
2004
http://hdl.handle.net/1721.1/17938
56821691
Thesis (M. Eng. and S.B.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2004.
Includes bibliographical references (p. 47).
Recent years have seen a growing interest in overlay networks. Overlay networks simplify the complications of creating and connecting distributed applications on the network by optimizing the underlying IP routing architecture. This thesis presents a programming environment (PEON) for automatically generating, monitoring and adapting an overlay network in response to application requirements and changing network conditions. The system automatically generates and maintains an overlay of routing modules to satisfy the application requirements. The runtime environment employs various constraint-satisfaction-programming (CSP) heuristics to allocate resources between competing applications with varying requirements of bandwidth, latency, and packet loss. The system additionally offers a "Reflection API" that allows an application to monitor and adapt the internal structure of its overlay to fine-tune its parameters.
by Rahul Agrawal.
M.Eng.
S.B.
50 p.
2035915 bytes
2035720 bytes
application/pdf
application/pdf
eng
Massachusetts Institute of Technology
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
Electrical Engineering and Computer Science.
A programming environment for on-demand service overlays
Thesis
application/pdf
false
Publication
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="4dfce35e-1601-483a-9771-ade54060a040">
<Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type>
<Language>eng</Language>
<Title>A programming environment for on-demand service overlays</Title>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>2004</PublicationDate>
<Authors>
<Author>
<DisplayName>Agrawal, Rahul, 1980-</DisplayName>
<Affiliation>
<OrgUnit>
</OrgUnit>
</Affiliation>
</Author>
</Authors>
<Editors>
</Editors>
<Publishers>
<Publisher>
<DisplayName>Massachusetts Institute of Technology</DisplayName>
<OrgUnit />
</Publisher>
</Publishers>
<License>http://dspace.mit.edu/handle/1721.1/7582</License>
<Keyword>Electrical Engineering and Computer Science.</Keyword>
<Abstract>Recent years have seen a growing interest in overlay networks. Overlay networks simplify the complications of creating and connecting distributed applications on the network by optimizing the underlying IP routing architecture. This thesis presents a programming environment (PEON) for automatically generating, monitoring and adapting an overlay network in response to application requirements and changing network conditions. The system automatically generates and maintains an overlay of routing modules to satisfy the application requirements. The runtime environment employs various constraint-satisfaction-programming (CSP) heuristics to allocate resources between competing applications with varying requirements of bandwidth, latency, and packet loss. The system additionally offers a "Reflection API" that allows an application to monitor and adapt the internal structure of its overlay to fine-tune its parameters.</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>