Robust streaming in delay tolerant networks

Delay Tolerant Networks (DTN) do not provide any end to end connectivity guarantee. Thus, transporting data over such networks is a tough challenge as most of Internet applications assume a form of persistent end to end connection. While research in DTN has mainly addressed the problem of routing in various mobility contexts with the aim to improve bundle delay delivery and data delivery ratio, little attention has been paid to applications. This paper investigates the support of streaming-like applications over DTN. We identify how DTN characteristics impact on the overall performances of these applications and present Tetrys, a transport layer mechanism, which enables robust streaming over DTN. Tetrys is based on an on the fly coding mechanism able to ensure full reliability without retransmission and fast in-order bundle delivery in comparison to classical erasure coding schemes. We evaluate our Tetrys prototype on real DTN connectivity traces captured from the Rollerblading tour in Paris. Simulations show that on average, Tetrys clearly outperforms all other reliability schemes in terms of bundles delivery service

Evaluating Mobility Pattern Space Routing for DTNs

Because a delay tolerant network (DTN) can often be partitioned, the problem of routing is very challenging. However, routing benefits considerably if one can take advantage of knowledge concerning node mobility. This paper addresses this problem with a generic algorithm based on the use of a high-dimensional Euclidean space, that we call MobySpace, constructed upon nodes' mobility patterns. We provide here an analysis and the large scale evaluation of this routing scheme in the context of ambient networking by replaying real mobility traces. The specific MobySpace evaluated is based on the frequency of visit of nodes for each possible location. We show that the MobySpace can achieve good performance compared to that of the other algorithms we implemented, especially when we perform routing on the nodes that have a high connection time. We determine that the degree of homogeneity of mobility patterns of nodes has a high impact on routing. And finally, we study the ability of nodes to learn their own mobility patterns.Comment: IEEE INFOCOM 2006 preprin

Flexible and dynamic network coding for adaptive data transmission in DTNs

Existing network coding approaches for Delay-Tolerant Networks (DTNs) do not detect and adapt to congestion in the network. In this paper we describe CafNC (Congestion aware forwarding with Network Coding) that combines adaptive network coding and adaptive forwarding in DTNs. In CafNC each node learns the status of its neighbours, and their egonetworks in order to detect coding opportunities, and codes as long as the recipients can decode. Our flexible design allows CafNC to efficiently support multiple unicast flows, with dynamic traffic demands and dynamic senders and receivers. We evaluate CafNC with two real connectivity traces and a realistic P2P application, introducing congestion by increasing the number of unicast flows in the network. Our results show that CafNC improves the success ratio, delay and packet loss, as the number of flows grows in comparison to no coding and hub-based static coding, while at the same time achieving efficient utilisation of network resources. We also show that static coding misses a number of coding opportunities and increases packet loss rates at times of increased congestion

Data availability in challenging networking environments in presence of failures

This Doctoral thesis presents research on improving data availability in challenging networking environments where failures frequently occur. The thesis discusses the data retrieval and transfer mechanisms in challenging networks such as the Grid and the delay-tolerant networking (DTN). The Grid concept has gained adaptation as a solution to high-performance computing challenges that are faced in international research collaborations. Challenging networking is a novel research area in communications. The first part of the thesis introduces the challenges of data availability in environment where resources are scarce. The focus is especially on the challenges faced in the Grid and in the challenging networking scenarios. A literature overview is given to explain the most important research findings and the state of the standardization work in the field. The experimental part of the thesis consists of eight scientific publications and explains how they contribute to research in the field. Focus in on explaining how data transfer mechanisms have been improved from the application and networking layer points of views. Experimental methods for the Grid scenarios comprise of running a newly developed storage application on the existing research infrastructure. A network simulator is extended for the experimentation with challenging networking mechanisms in a network formed by mobile users. The simulator enables to investigate network behavior with a large number of nodes, and with conditions that are difficult to re-instantiate. As a result, recommendations are given for data retrieval and transfer design for the Grid and mobile networks. These recommendations can guide both system architects and application developers in their work. In the case of the Grid research, the results give first indications on the applicability of the erasure correcting codes for data storage and retrieval with the existing Grid data storage tools. In the case of the challenging networks, the results show how an application-aware communication approach can be used to improve data retrieval and communications. Recommendations are presented to enable efficient transfer and management of data items that are large compared to available resources

Enabling E2E reliable communications with adaptive re-encoding over delay tolerant networks

Reliable end-to-end (E2E) communication in Delay Tolerant Network (DTN) is a challenging task due to long delay and frequent link disruptions. To enable reliability, the IETF is currently looking at strategies to integrate erasure coding mechanisms inside DTN architecture. The objective is to extend the ability of the existing DTN bundle fragmentation mechanism to support cases where bundles have a high probability of being lost. To date, discussions agree that an intermediate node can re-encode bundles, leaving all decoding process at the destination node in order to let intermediate node operations be as simple as possible. We propose to study and analyze possible re-encoding strategies at intermediate nodes using an on-the-fly coding paradigm. We also investigate how re-encoding and acknowledgment strategies based on this coding scheme would enable reliable E2E communication. Finally, we propose an adaptive mechanism with low complexity that deals with both re-routing events and network dynamics which are common in the context of DTN. Simulation results show that re-encoding at the relay and the adaptive mechanism allows a significant reduction in terms of network overhead injected by erasure codes while ensuring the E2E reliability

Forward correction and fountain codes in delay tolerant networks

Abstract—Delay tolerant Ad-hoc Networks make use of mobility of relay nodes to compensate for lack of permanent connectivity and thus enable communication between nodes that are out of range of each other. To decrease delivery delay, the information that needs to be delivered is replicated in the network. Our objective in this paper is to study replication mechanisms that include coding in order to improve the probability of successful delivery within a given time limit. We propose an analytical approach that allows to quantify tradeoffs between resources and performance measures (energy and delay). We study the effect of coding on the performance of the network while optimizing parameters that govern routing. Our results, based on fluid approximations, are compared to simulations which validate the model 1. Index Terms—Forward correction, fountain codes, delay tolerant networks I

Properties of a DTN Packet Forwarding Scheme Inspired By Themodynamics

In this thesis, we develop a discrete time model of a recently proposed algorithm, inspired by thermodynamics, for message routing in Disruption Tolerant Networks (DTNs). We model the evolution of the temperature at the nodes as a stochastic switched linear system and show that the temperatures converge in distribution to a unique stationary distribution that is independent of initial conditions. The proof of this result borrows tools from Iterated Random Maps (IRMs) and Queuing theory. Lastly, we simulate the proposed algorithm, using a variety of mobility models, in order to observe the performance of the algorithm under various conditions