Impact of persistent storage on the DTN routing performance
03 Jan 2012-pp 513-524
TL;DR: This paper proposes a Time in Primary Scheduling (TiPS) policy with two variants (one using local information and the other using global information) that outperforms the contemporary buffer scheduling policies with respect to the persistent storage framework.
Abstract: The store, carry, and forward paradigm of the Delay- Tolerant Network (DTN) architecture enables a node to carry messages for a long period of time. This long-term storage is supported by the DTN architecture with the usage of persistent storage; however to the best of our knowledge, the routing/scheduling framework that incorporates support for persistent storage has not been addressed much in the DTN literature. In this paper, we investigate the impact of persistent storage on the routing performance over different buffer scheduling policies. Our extensive simulation studies demonstrate that they exhibit an improvement in delivery ratio, but with a compromise on delivery delay. This shows the pressing need for a new scheduling policy to tap the complete potential of the persistent storage. To this end, we propose a Time in Primary Scheduling (TiPS) policy with two variants (one using local information and the other using global information) that outperforms the contemporary buffer scheduling policies with respect to the persistent storage framework.
Citations
More filters
References
More filters
01 Jan 2000
TL;DR: This work introduces Epidemic Routing, where random pair-wise exchanges of messages among mobile hosts ensure eventual message delivery and achieves eventual delivery of 100% of messages with reasonable aggregate resource consumption in a number of interesting scenarios.
Abstract: Mobile ad hoc routing protocols allow nodes with wireless adaptors to communicate with one another without any pre-existing network infrastructure. Existing ad hoc routing protocols, while robust to rapidly changing network topology, assume the presence of a connected path from source to destination. Given power limitations, the advent of short-range wireless networks, and the wide physical conditions over which ad hoc networks must be deployed, in some scenarios it is likely that this assumption is invalid. In this work, we develop techniques to deliver messages in the case where there is never a connected path from source to destination or when a network partition exists at the time a message is originated. To this end, we introduce Epidemic Routing, where random pair-wise exchanges of messages among mobile hosts ensure eventual message delivery. The goals of Epidemic Routing are to: i) maximize message delivery rate, ii) minimize message latency, and iii) minimize the total resources consumed in message delivery. Through an implementation in the Monarch simulator, we show that Epidemic Routing achieves eventual delivery of 100% of messages with reasonable aggregate resource consumption in a number of interesting scenarios.
4,355 citations
"Impact of persistent storage on the..." refers background or methods in this paper
...The work in the latter (also called as constrained buffer model) mainly focuses on the buffer scheduling policies (such as drop tail, drop front, random schedule and Global Buffer Scheduling and Drop (GBSD) [8], [11]) and their role in improving the routing performance....
[...]
...The routing protocol under consideration is the epidemic routing protocol with VACCINE recovery scheme [11]....
[...]
...2 Related Work In the context of buffer size of the node, the system models in the DTN literature can be classified as infinite buffer [10] and finite buffer (single primary queue) [8], [11], [12] models....
[...]
25 Aug 2003
TL;DR: This work proposes a network architecture and application interface structured around optionally-reliable asynchronous message forwarding, with limited expectations of end-to-end connectivity and node resources.
Abstract: The highly successful architecture and protocols of today's Internet may operate poorly in environments characterized by very long delay paths and frequent network partitions. These problems are exacerbated by end nodes with limited power or memory resources. Often deployed in mobile and extreme environments lacking continuous connectivity, many such networks have their own specialized protocols, and do not utilize IP. To achieve interoperability between them, we propose a network architecture and application interface structured around optionally-reliable asynchronous message forwarding, with limited expectations of end-to-end connectivity and node resources. The architecture operates as an overlay above the transport layers of the networks it interconnects, and provides key services such as in-network data storage and retransmission, interoperable naming, authenticated forwarding and a coarse-grained class of service.
3,511 citations
"Impact of persistent storage on the..." refers background in this paper
...1 Introduction Delay-Tolerant Networks (DTNs) [4], [7] are the challenged networks that are used in highly dynamic environments where end-to-end connectivity is not always possible....
[...]
22 Aug 2005
TL;DR: A new routing scheme, called Spray and Wait, that "sprays" a number of copies into the network, and then "waits" till one of these nodes meets the destination, which outperforms all existing schemes with respect to both average message delivery delay and number of transmissions per message delivered.
Abstract: Intermittently connected mobile networks are sparse wireless networks where most of the time there does not exist a complete path from the source to the destination. These networks fall into the general category of Delay Tolerant Networks. There are many real networks that follow this paradigm, for example, wildlife tracking sensor networks, military networks, inter-planetary networks, etc. In this context, conventional routing schemes would fail.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 significantly reduce the overhead of flooding-based schemes have often be plagued by large delays. With this in mind, we introduce a new routing scheme, called Spray and Wait, that "sprays" a number of copies into the network, and then "waits" till one of these nodes meets the destination.Using theory and simulations we show that Spray and Wait outperforms all existing schemes with respect to both average message delivery delay and number of transmissions per message delivered; its overall performance is close to the optimal scheme. Furthermore, it is highly scalable retaining good performance under a large range of scenarios, unlike other schemes. Finally, it is simple to implement and to optimize in order to achieve given performance goals in practice.
2,712 citations
Additional excerpts
...2 Related Work In the context of buffer size of the node, the system models in the DTN literature can be classified as infinite buffer [10] and finite buffer (single primary queue) [8], [11], [12] models....
[...]
01 Apr 2007
TL;DR: This document describes an architecture that addresses a variety of problems with internetworks having operational and performance characteristics that make conventional (Internet-like) networking approaches either unworkable or impractical.
Abstract: This document describes an architecture for delay-tolerant and
disruption-tolerant networks, and is an evolution of the architecture
originally designed for the Interplanetary Internet, a communication
system envisioned to provide Internet-like services across
interplanetary distances in support of deep space exploration. This
document describes an architecture that addresses a variety of
problems with internetworks having operational and performance
characteristics that make conventional (Internet-like) networking
approaches either unworkable or impractical. We define a message-
oriented overlay that exists above the transport (or other) layers of
the networks it interconnects. The document presents a motivation for
the architecture, an architectural overview, review of state
management required for its operation, and a discussion of application
design issues. This document represents the consensus of the IRTF DTN
research group and has been widely reviewed by that group. This memo
provides information for the Internet community.
975 citations
TL;DR: The random waypoint model is a commonly used mobility model for simulations of wireless communication networks and some of its fundamental stochastic properties are investigated, including the transition length and time of a mobile node between two waypoints, the spatial distribution of nodes, and the direction angle at the beginning of a movement transition.
Abstract: The random waypoint model is a commonly used mobility model for simulations of wireless communication networks. By giving a formal description of this model in terms of a discrete-time stochastic process, we investigate some of its fundamental stochastic properties with respect to: (a) the transition length and time of a mobile node between two waypoints, (b) the spatial distribution of nodes, (c) the direction angle at the beginning of a movement transition, and (d) the cell change rate if the model is used in a cellular-structured system area.
The results of this paper are of practical value for performance analysis of mobile networks and give a deeper understanding of the behavior of this mobility model. Such understanding is necessary to avoid misinterpretation of simulation results. The movement duration and the cell change rate enable us to make a statement about the "degree of mobility" of a certain simulation scenario. Knowledge of the spatial node distribution is essential for all investigations in which the relative location of the mobile nodes is important. Finally, the direction distribution explains in an analytical manner the effect that nodes tend to move back to the middle of the system area.
888 citations
"Impact of persistent storage on the..." refers methods in this paper
...We consider a system of N nodes moving according to Random-WayPoint (RWP) mobility model [3] in a...
[...]