Prioritized data synchronization for disruption tolerant networks

We consider the problem of synchronizing prioritized data on two distinct hosts in disruption-tolerant networks (DTNs). To this effect, we propose and analyze a new interactive protocol for priority-oriented synchronization, called P-CPI, that is especially efficient in terms of bandwidth usage. This middleware protocol has features that are particularly useful for DTN routing in constrained or tactical environments, including (i) communication and computational complexity primarily tied to the number of differences between the hosts rather than the amount of the data overall and (ii) a memoryless fast restart after interruption. We provide a novel analysis of this protocol, substantiating a high-probability performance bound and memoryless fast-restart in logarithmic time. As a proof of concept, we demonstrate improved delivery rate and reduced metadata and average delay in a DARPA-supported DTN routing application called RAPID.

[1]  Kevin R. Fall,et al.  A delay-tolerant network architecture for challenged internets , 2003, SIGCOMM '03.

[2]  Sachin Agarwal,et al.  On the scalability of data synchronization protocols for PDAs and mobile devices , 2002, IEEE Netw..

[3]  Anders Lindgren,et al.  Probabilistic routing in intermittently connected networks , 2003, MOCO.

[4]  Yaron Minsky,et al.  Set reconciliation with nearly optimal communication complexity , 2003, IEEE Trans. Inf. Theory.

[5]  Lui Sha,et al.  Priority Inheritance Protocols: An Approach to Real-Time Synchronization , 1990, IEEE Trans. Computers.

[6]  Arun Venkataramani,et al.  DTN routing as a resource allocation problem , 2007, SIGCOMM '07.

[7]  Khaled A. S. Abdel-Ghaffar,et al.  An Optimal Strategy for Comparing File Copies , 1994, IEEE Trans. Parallel Distributed Syst..

[8]  Rabin K. Patra,et al.  Using redundancy to cope with failures in a delay tolerant network , 2005, SIGCOMM '05.

[9]  Richard E. Hansen,et al.  Prioritized epidemic routing for opportunistic networks , 2007, MobiOpp '07.

[10]  Konstantinos Psounis,et al.  Fundamental Mobility Properties for Realistic Performance Analysis of Intermittently Connected Mobile Networks , 2007, Fifth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PerComW'07).

[11]  Cauligi S. Raghavendra,et al.  Performance analysis of mobility-assisted routing , 2006, MobiHoc '06.

[12]  John E. Hopcroft,et al.  Correctness of a gossip based membership protocol , 2005, PODC '05.

[13]  Anant Agarwal,et al.  Waiting algorithms for synchronization in large-scale multiprocessors , 1993, TOCS.

[14]  Sachin Agarwal,et al.  Efficient PDA Synchronization , 2003, IEEE Trans. Mob. Comput..

[15]  Brian Gallagher,et al.  MaxProp: Routing for Vehicle-Based Disruption-Tolerant Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[16]  David A. Maltz,et al.  A performance comparison of multi-hop wireless ad hoc network routing protocols , 1998, MobiCom '98.

[17]  Alessandro Panconesi,et al.  Concentration of Measure for the Analysis of Randomized Algorithms , 2009 .