Tapestry: A Resilient Global-Scale Overlay for Service Deployment
Top Cited Papers
- 7 January 2004
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal on Selected Areas in Communications
- Vol. 22 (1) , 41-53
- https://doi.org/10.1109/jsac.2003.818784
Abstract
We present Tapestry, a peer-to-peer overlay routing infrastructure offering efficient, scalable, location-independent routing of messages directly to nearby copies of an object or service using only localized resources. Tapestry supports a generic decentralized object location and routing applications programming interface using a self-repairing, soft-state-based routing layer. The paper presents the Tapestry architecture, algorithms, and implementation. It explores the behavior of a Tapestry deployment on PlanetLab, a global testbed of approximately 100 machines. Experimental results show that Tapestry exhibits stable behavior and performance as an overlay, despite the instability of the underlying network layers. Several widely distributed applications have been implemented on Tapestry, illustrating its utility as a deployment infrastructure.Keywords
This publication has 17 references indexed in Scilit:
- Internet Indirection InfrastructureIEEE/ACM Transactions on Networking, 2004
- Probabilistic location and routingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- ViceroyPublished by Association for Computing Machinery (ACM) ,2002
- Secure routing for structured peer-to-peer overlay networksPublished by Association for Computing Machinery (ACM) ,2002
- SEDAPublished by Association for Computing Machinery (ACM) ,2001
- A data tracking scheme for general networksPublished by Association for Computing Machinery (ACM) ,2001
- Accessing nearby copies of replicated objects in a distributed environmentPublished by Association for Computing Machinery (ACM) ,1997
- An Architecture for IP Address Allocation with CIDRPublished by RFC Editor ,1993
- Concurrent online tracking of mobile usersPublished by Association for Computing Machinery (ACM) ,1991
- Space/time trade-offs in hash coding with allowable errorsCommunications of the ACM, 1970