Peter Gilbert, Venugopalan Ramasubramanian, Patrick Stuedi, and Douglas Terry
23 October 2009
Several domains of networking such as Delay Tolerant Networks (DTNs), Mobile Ad hoc Networks (MANETs), and Peer-to-Peer (P2P) networks have the common goal of transporting messages to their intended destinations. These networking domains share many requirements and employ routing protocols that are often
composed of similar mechanisms.
In this paper, we explore the synergy between message routing and data replication and propose the use of topology-independent weakly consistent partial replication systems as a messaging substrate for the above networking domains. These replication systems provide
the key properties of eventual consistency, disruption tolerance, and at-most-once delivery, which translate into guaranteed delivery, failure resilience, and bandwidth efficiency—three much desired and repeatedly implemented aspects of message routing. We outline an implementation of a messaging system on top of a replication platform with content-based filtering and show that our design is general enough to implement many different routing policies employed in DTNs, MANETs, and P2P networks.
In HotNets 2009: Eighth ACM Workshop on Hot Topics in Networks
Publisher Association for Computing Machinery, Inc.
Copyright © 2007 by the Association for Computing Machinery, Inc. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Publications Dept, ACM Inc., fax +1 (212) 869-0481, or email@example.com. The definitive version of this paper can be found at ACM’s Digital Library --http://www.acm.org/dl/.