Ben Y. Zhao and John D. Kubiatowicz and Anthony D. Joseph

EECS Department, University of California, Berkeley

Technical Report No. UCB/CSD-01-1141

, 2001

http://www2.eecs.berkeley.edu/Pubs/TechRpts/2001/CSD-01-1141.pdf

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.

---

BibTeX citation:

@techreport{Zhao:CSD-01-1141,
    Author= {Zhao, Ben Y. and Kubiatowicz, John D. and Joseph, Anthony D.},
    Title= {Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and Routing},
    Year= {2001},
    Month= {Apr},
    Url= {http://www2.eecs.berkeley.edu/Pubs/TechRpts/2001/5213.html},
    Number= {UCB/CSD-01-1141},
    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.},
}

EndNote citation:

%0 Report
%A Zhao, Ben Y. 
%A Kubiatowicz, John D. 
%A Joseph, Anthony D. 
%T Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and Routing
%I EECS Department, University of California, Berkeley
%D 2001
%@ UCB/CSD-01-1141
%U http://www2.eecs.berkeley.edu/Pubs/TechRpts/2001/5213.html
%F Zhao:CSD-01-1141