Abstract
In today''s chaotic network, data and services are mobile and replicated widely for availability, durability, and locality. Components within this infrastructure interact in rich and complex ways, greatly stressing traditional approaches to name service and routing. This paper explores an alternative to traditional approaches called Tapestry. Tapestry is an overlay location and routing infrastructure that provides location-independent routing of messages directly to the closest copy of an object or service using only point-to-point links and without centralized resources. The routing and directory information within this infrastructure is purely soft state and easily repaired. Tapestry is self-administering, fault-tolerant, and resilient under load. This paper presents the architecture and algorithms of Tapestry and explores their advantages through a number of experiments.
Keywords
Computer scienceDistributed computingRouting (electronic design automation)Computer networkDirectoryLocalityFault toleranceService (business)Policy-based routingObject (grammar)Static routingWorld Wide WebRouting protocolArtificial intelligenceBusiness
Related Publications
SkipNet: a scalable overlay network with practical locality properties
Abstract: Scalable overlay networks such as Chord, CAN, Pastry, and Tapestry have recently emerged as flexible infrastructure for building large peer-to-peer systems. In practic...
The Grid 2: Blueprint for a New Computing Infrastructure
Preface Foreword 1. Grids in Context 2. Computational Grids I Applications 3 Distributed Supercomputing Applications 4 Real-Time Widely Distributed Instrumentation Systems 5 Dat...
Algorithmic Design of the Globe Wide-Area Location Service
We describe the algorithmic design of a worldwide location service for distributed objects. A distributed object can reside at multiple locations at the same time, and offers a ...
An architecture for a global Internet host distance estimation service
There is an increasing need for Internet hosts to be able to quickly and efficiently learn the distance, in terms of metrics such as latency or bandwidth, between Internet hosts...
A loop-free extended Bellman-Ford routing protocol without bouncing effect
Distributed algorithms for shortest-path problems are important in the context of routing in computer communication networks. We present a protocol that maintains the shortest-p...
Publication Info
- Year
- 2001
- Type
- article
- Citations
- 624
- Access
- Closed
External Links
Citation Metrics
624
OpenAlex
Cite This
Ben Y. Zhao,
John Kubiatowicz,
Anthony D. Joseph
(2001).
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and.
.