DMCA
Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems (2001)
| Citations: | 2074 - 49 self |
BibTeX
@MISC{Rowstron01pastry:scalable,,
author = {Antony Rowstron and Peter Druschel},
title = {Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems},
year = {2001}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
This paper presents the design and evaluation of Pastry, a scalable, distributed object location and routing scheme for wide-area peer-to-peer applications. Pastry provides application-level routing and object location in a potentially very large overlay network of nodes connected via the Internet. It can be used to support a wide range of peer-to-peer applications like global data storage, global data sharing, and naming. An insert operation in Pastry stores an object at a user-defined number of diverse nodes within the Pastry network. A lookup operation reliably retrieves a copy of the requested object if one exists. Moreover, a lookup is usually routed to the node nearest the client issuing the lookup (by some measure of proximity), among the nodes storing the requested object. Pastry is completely decentralized, scalable, and self-configuring; it automatically adapts to the arrival, departure and failure of nodes. Experimental results obtained with a prototype implementation on a simulated network of 100,000 nodes confirm Pastry's scalability, its ability to self-configure and adapt to node failures, and its good network locality properties.
Keyphrases
distributed object location large-scale peer-to-peer system pastry store peer-to-peer application global data sharing lookup operation object location pastry network application-level routing good network locality property prototype implementation wide range simulated network wide-area peer-to-peer application insert operation global data storage diverse node experimental result large overlay network user-defined number
