Conference Paper

Delay performance of a Publish Subscribe system deployed over a memory-constrained, Delay Tolerant Network

DIE, Univ. di Roma Tor Vergata, Rome, Italy
DOI: 10.1109/Med-Hoc-Net.2011.5970489 Conference: Ad Hoc Networking Workshop (Med-Hoc-Net), 2011 The 10th IFIP Annual Mediterranean
Source: DBLP


In this work we assess the delay performance of a Publish Subscribe system built on top of a Delay Tolerant Network (DTN) composed of nodes with limited storage capacities. Many DTN routing protocols replicate the same data over several nodes, in order to deliver data to destination in a faster or in a more reliable way. Of course, increasing the number of replicas has the effect of decreasing the delivery delay perceived by the users, but increases the use of the system memory. Our goal is to investigate the trade-off between reduction of delay and storage requirements when nodes are memory constrained, in a Topic-based, Publish Subscribe system where we have different topics with different popularity. We provide some insights in this trade-off, which implies some unanticipated issues, and propose simple rules to dimension the number of replicas per topic. To this end, we derive analytical models and we validate them with simulations.

Download full-text


Available from: Laura Bracciale, Oct 04, 2015
24 Reads
  • [Show abstract] [Hide abstract]
    ABSTRACT: Message replication is often used to improve the delivery ratio in delay-tolerant networks because of the short-lived wireless connectivity environment. However, packet replication may easily incur large resource consumption and finally result in network congestion. This paper proposes a probabilistic packet acceptance and drop algorithm (PAD), which adaptively controls congestion for delay-tolerant networks. In PAD algorithm, the queue length and the input/output rate are combined to detect congestion. Based on the congestion state, each node determines the probability of accepting or dropping packets to obtain a good trade-off between high delivery ratio and low overhead. Furthermore, based on the birth–death model, we construct the continuous-time Markov chain to analyze the delivery ratio of a packet. Theory analysis and simulation results show that PAD increases the delivery ratio by more than 130% with least overhead. Meanwhile, it also achieves the shortest average end-to-end delay when the buffer of a node is severely limited. Copyright © 2015 John Wiley & Sons, Ltd.
    Concurrency and Computation Practice and Experience 01/2015; DOI:10.1002/cpe.3455 · 1.00 Impact Factor