Supporting Rapid Mobility via Locality in an Overlay Network

In this paper, we present Mobile Tapestry, an extension to the Tapestry overlay network protocol, that enables scalable, fault-tolerant, and timely delivery of network messages, including multimedia streams, to and from rapidly moving nodes. Mobile Tapestry efficiently supports individual mobile nodes and, by using an approach we call hierarchical mobility, it also supports large groups of mobile nodes simultaneously moving together. Mobile Tapestry leverages the Tapestry''s locality mechanisms to reduce the latency and bandwidth of mobility update traffic, while eliminating the routing inefficiencies and availability problems of IP-based mobility protocols, such as Mobile IP. Our simulation results show that Mobile Tapestry significantly outperforms Mobile IP by providing lower latency and higher fault tolerance for message delivery.

[1]  Charles E. Perkins,et al.  Mobility support in IPv6 , 1996, MobiCom '96.

[2]  Ben Y. Zhao,et al.  Brocade: Landmark Routing on Overlay Networks , 2002, IPTPS.

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

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

[5]  John R. Douceur,et al.  The Sybil Attack , 2002, IPTPS.

[6]  S. Bradner.  Xerox PARC , 1996 .

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

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

[9]  Srinivasan Seshan,et al.  Improving reliable transport and handoff performance in cellular wireless networks , 1995, Wirel. Networks.

[10]  Ian F. Akyildiz,et al.  Recent advances in wireless networking technology , 1995, Wirel. Networks.

[11]  David B. Johnson.  Scalable support for transparent mobile host internetworking , 1995, Wirel. Networks.

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

[13]  John Kubiatowicz,et al.  Probabilistic location and routing , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

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

[15]  Scott Shenker,et al.  Internet indirection infrastructure , 2002, SIGCOMM 2002.

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

[17]  Ralph E. Droms,et al.  Dynamic Host Configuration Protocol , 1993, RFC.

[18]  Ben Y. Zhao,et al.  An Infrastructure for Fault-tolerant Wide-area Location and Routing , 2001 .

[19]  Charles E. Perkins,et al.  A Mobile Host Protocol Supporting Route Optimization and Authentication , 1995, IEEE J. Sel. Areas Commun..

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

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

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

[23]  Ben Y. Zhao,et al.  Distributed Object Location in a Dynamic Network , 2004, Theory of Computing Systems.