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

ABSTRACT 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.

0 Bookmarks
 · 
77 Views
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: This study examines the random waypoint model widely used in the simulation studies of mobile ad hoc networks. Our findings show that this model fails to provide a steady state in that the average nodal speed consistently decreases over time, and therefore should not be directly used for simulation. We show how unreliable results can be obtained by using this model. In particular, certain ad hoc routing metrics can drop by as much as 40% over the course of a 900-second simulation using the random waypoint model. We give both an intuitive and a formal explanation for this phenomenon. We also propose a simple fix of the problem and discuss a few alternatives. Our modified random waypoint model is able to reach a steady state and simulation results are presented.
    Proceedings - IEEE INFOCOM 03/2003;
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: In this paper, we address the problem of routing in intermittently connected networks. In such networks there is no guarantee that a fully connected path between source and destination exists at any time, rendering traditional routing protocols unable to deliver messages between hosts. There does, however, exist a number of scenarios where connectivity is intermittent, but where the possibility of communication still is desirable. Thus, there is a need for a way to route through networks with these properties. We propose PRoPHET, a probabilistic routing protocol for intermittently connected networks and compare it to the earlier presented Epidemic Routing protocol through simulations. We show that PRoPHET is able to deliver more messages than Epidemic Routing with a lower communication overhead.
    09/2004: pages 239-254;
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Intermittently connected mobile networks are wireless networks where most of the time there does not exist a complete path from the source to the destination. There are many real networks that follow this model, for example, wildlife tracking sensor networks, military networks, vehicular ad hoc networks, etc. In this context, conventional routing schemes fail, because they try to establish complete end-to-end paths, before any data is sent. To deal with such networks researchers have suggested to use flooding-based routing schemes. While flooding-based schemes have a high probability of delivery, they waste a lot of energy and suffer from severe contention which can significantly degrade their performance. Furthermore, proposed efforts to reduce the overhead of flooding-based schemes have often been plagued by large delays. With this in mind, we introduce a new family of routing schemes that "spray" a few message copies into the network, and then route each copy independently towards the destination. We show that, if carefully designed, spray routing not only performs significantly fewer transmissions per message, but also has lower average delivery delays than existing schemes; furthermore, it is highly scalable and retains good performance under a large range of scenarios. Finally, we use our theoretical framework proposed in our 2004 paper to analyze the performance of spray routing. We also use this theory to show how to choose the number of copies to be sprayed and how to optimally distribute these copies to relays.
    IEEE/ACM Transactions on Networking 03/2008; 16(1):77-90. · 2.01 Impact Factor

Full-text (2 Sources)

Download
27 Downloads
Available from
May 21, 2014