2026-09-19T13:45:56Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/285532022-01-13T07:54:29Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023
Barbara Liskov.
Gupta, Anjali, 1980-
Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
2005-09-27T16:58:36Z
2005-09-27T16:58:36Z
2004
2004
http://hdl.handle.net/1721.1/28553
57403192
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2004.
Includes bibliographical references (p. 51-55).
This thesis examines the problem of locating and accessing an item stored in a large and volatile peer-to-peer system, and presents new ways of organizing items and peers to make this operation fast and efficient. Current structured peer-to-peer routing schemes keep routing information about only a small number of peers in the system, typically logarithmic in the size of the system. They do this under the assumption that it is infeasible to keep more routing information up-to-date since the system is highly volatile. As a result, when a node wants to locate an item, several peers have to be contacted in sequence before enough information is available to determine the location of the item. This makes routing a very long operation. In this thesis, we question this assumption and present two fast peer-to-peer routing algorithms. First, we present a "one hop" routing scheme. We show how to disseminate information about membership changes quickly enough so that peers maintain accurate routing tables with information about all peers in the system. Further, we demonstrate the feasibility of the system with analytical results and simulations. Second, we propose a "two hop" routing scheme for large scale systems of more than a few million peers, where the bandwidth requirements of one hop routing can become too large. This scheme keeps a fixed fraction of the total routing state on each peer, chosen such that the additional delay of routing is minimal.
by Anjali Gupta.
S.M.
55 p.
2687792 bytes
2692427 bytes
application/pdf
application/pdf
en_US
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.
Efficient routing for peer-to-peer systems
Efficient routing for P2P systems
Thesis
application/pdf
false
Publication
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="ec5d00f1-3288-431e-a34a-3ab08fa4d58d">
<Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type>
<Language>en_US</Language>
<Title>Efficient routing for peer-to-peer systems</Title>
<Subtitle>Efficient routing for P2P systems</Subtitle>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>2004</PublicationDate>
<Authors>
<Author>
<DisplayName>Gupta, Anjali, 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>This thesis examines the problem of locating and accessing an item stored in a large and volatile peer-to-peer system, and presents new ways of organizing items and peers to make this operation fast and efficient. Current structured peer-to-peer routing schemes keep routing information about only a small number of peers in the system, typically logarithmic in the size of the system. They do this under the assumption that it is infeasible to keep more routing information up-to-date since the system is highly volatile. As a result, when a node wants to locate an item, several peers have to be contacted in sequence before enough information is available to determine the location of the item. This makes routing a very long operation. In this thesis, we question this assumption and present two fast peer-to-peer routing algorithms. First, we present a "one hop" routing scheme. We show how to disseminate information about membership changes quickly enough so that peers maintain accurate routing tables with information about all peers in the system. Further, we demonstrate the feasibility of the system with analytical results and simulations. Second, we propose a "two hop" routing scheme for large scale systems of more than a few million peers, where the bandwidth requirements of one hop routing can become too large. This scheme keeps a fixed fraction of the total routing state on each peer, chosen such that the additional delay of routing is minimal.</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>