An Infrastructure for Fault-tolerant Wide-area Location and Routing

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, faulttolerant, and resilient under load. This paper presents the architecture and algorithms of Tapestry and explores their advantages through a number of experiments.

[1]  David Reeves Boggs.  Internet broadcasting , 1982 .

[2]  Charles E. Perkins,et al.  IP Mobility Support , 1996, RFC.

[3]  Rajmohan Rajaraman,et al.  Accessing Nearby Copies of Replicated Objects in a Distributed Environment , 1999, Theory of Computing Systems.

[4]  Robert Tappan Morris,et al.  Resilient overlay networks , 2001, SOSP.

[5]  John Wroclawski,et al.  A framework for scalable global IP-anycast (GIA) , 2000, CCRV.

[6]  Srinivasan Seshan,et al.  A network measurement architecture for adaptive applications , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[7]  Paul Francis,et al.  An architecture for a global Internet host distance estimation service , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[8]  Deborah Estrin,et al.  Advances in network simulation , 2000, Computer.

[9]  Franz J. Hauck,et al.  Locating objects in wide-area systems , 1998, IEEE Commun. Mag..

[10]  Peter Druschel,et al.  Pastry: Scalable, distributed object location and routing for large-scale peer-to- , 2001 .

[11]  William Adjie-Winoto,et al.  The design and implementation of an intentional naming system , 2000, OPSR.

[12]  David R. Karger,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.

[13]  David R. Cheriton,et al.  An Architecture for Content Routing Support in the Internet , 2001, USITS.

[14]  Ben Y. Zhao,et al.  OceanStore: an architecture for global-scale persistent storage , 2000, SIGP.

[15]  Henning Schulzrinne,et al.  Wide Area Network Service Location , 1997 .

[16]  Mark Handley,et al.  A scalable content-addressable network , 2001, SIGCOMM 2001.

[17]  Steven McCanne,et al.  An active service framework and its application to real-time multimedia transcoding , 1998, SIGCOMM '98.

[18]  Hari Balakrishnan,et al.  Resilient overlay networks , 2001, SOSP.

[19]  Yakov Rekhter,et al.  An Architecture for IP Address Allocation with CIDR , 1993, RFC.

[20]  Ben Y. Zhao,et al.  Bayeux: an architecture for scalable and fault-tolerant wide-area data dissemination , 2001, NOSSDAV '01.

[21]  Ellen W. Zegura,et al.  How to model an internetwork , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[22]  Ben Y. Zhao,et al.  Silverback: A Global-Scale Archival System , 2001 .

[23]  David R. Karger,et al.  A scalable location service for geographic ad hoc routing , 2000, MobiCom '00.

[24]  Stephen E. Deering,et al.  Host extensions for IP multicasting , 1986, RFC.

[25]  A. Rowstron,et al.  Past: persistent and anonymous storage in a peer-to-peer networking environment , 2001 .

[26]  Ben Y. Zhao,et al.  An Architecture for Secure Wide-Area Service Discovery , 2002, Wirel. Networks.

[27]  Antony I. T. Rowstron,et al.  Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems , 2001, Middleware.

[28]  Kirk L. Johnson,et al.  Overcast: reliable multicasting with on overlay network , 2000, OSDI.

[29]  Dina Katabi,et al.  A framework for scalable global IP-anycast (GIA) , 2000, SIGCOMM 2000.

[30]  Steven McCanne,et al.  RMX: reliable multicast for heterogeneous networks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[31]  Rajmohan Rajaraman,et al.  Accessing Nearby Copies of Replicated Objects in a Distributed Environment , 1997, SPAA '97.

[32]  Srinivasan Seshan,et al.  A case for end system multicast , 2002, IEEE J. Sel. Areas Commun..