Date Added: Aug 2012
The authors consider the problem of synchronizing prioritized data on two distinct hosts in Disruption-Tolerant Networks (DTNs). To this effect, they 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 communication and computational complexity primarily tied to the number of differences between the hosts rather than the amount of the data overall and a memoryless fast restart after interruption. They provide a novel analysis of this protocol, substantiating a high-probability performance bound and memoryless fast-restart in logarithmic time.