Emmanuel Lochin

DAPS: Intelligent delay-aware packet scheduling for multipath transport

The increasing heterogeneity and asymmetry in wireless network environments makes QoS guarantees in terms of delays and throughput a challenging task. In this paper, we study a novel scheduling algorithm for multipath transport called Delay Aware Packet Scheduling (DAPS) which aims to reduce the receivers buffer blocking time considered as a main parameter to enhance the QoS in wireless environments. We develop an analytical model of maximum receivers buffer blocking time and extend the DAPS algorithm considering implementation issues. Performance evaluations based on ns-2 simulations highlight the enhanced QoS that DAPS can provide. With reference to the classical multipath transport protocol CMT-SCTP, we observe a significant reductions of the receivers buffer occupancy, down by 77%, and the application delay, down by 63%.

On-the-Fly Erasure Coding for Real-Time Video Applications

This paper introduces a robust point-to-point transmission scheme: Tetrys, that relies on a novel on-the-fly erasure coding concept which reduces the delay for recovering lost data at the receiver side. In current erasure coding schemes, the packets that are not rebuilt at the receiver side are either lost or delayed by at least one RTT before transmission to the application. The present contribution aims at demonstrating that Tetrys coding scheme can fill the gap between real-time applications requirements and full reliability. Indeed, we show that in several cases, Tetrys can recover lost packets below one RTT over lossy and best-effort networks. We also show that Tetrys allows to enable full reliability without delay compromise and as a result: significantly improves the performance of time constrained applications. For instance, our evaluations present that video-conferencing applications obtain a PSNR gain up to 7 dB compared to classic block-based erasure codes.

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.

Rethinking reliability for long-delay networks

Delay Tolerant Networking (DTN) is currently an open research area following the interest of space companies in the deployment of Internet protocols for the space Internet. Thus, these last years have seen an increase in the number of DTN protocol proposals such as Saratoga or LTP-T. However, the goal of these protocols are more to send much error-free data during a short contact time rather than operating to a strictly speaking reliable data transfer. Beside this, several research work have proposed efficient acknowledgment schemes based on the SNACK mechanism. However, these acknowledgement strategies are not compliant with the DTN protocol principle. In this paper, we propose a novel reliability mechanism with an implicit acknowledgment strategy that could be used either within these new DTN proposals or in the context of multicast transport protocols. This proposal is based on a new erasure coding concept specifically designed to operate efficient reliable transfer over bi-directional links.

Revisiting old friends: is CoDel really achieving what RED cannot?

We use ns-2 simulations to compare REDs gentle_ mode to CoDel in terms of their ability to reduce the latency for various TCP variants. We use a common dumbbell topol- ogy with Pareto background traffic, and measure the packet delays and transmission time of a 10 MB FTP transfer. In our scenarios, we find that CoDel reduces the latency by 87%, but RED still manages to reduce it by 75%. However, the use of CoDel results in a transmission time 42% longer than when using RED. In light of its maturity, we therefore argue that RED could be considered as a good candidate to tackle Bufferbloat.

Mitigating Receiver's Buffer Blocking by Delay Aware Packet Scheduling in Multipath Data Transfer

Reliable in order multipath data transfer under asymmetric heterogeneous network conditions has known problems related to receivers buffer blocking, caused by out of order packet arrival. Several mitigation techniques have been proposed to address this issue mostly by using various packet retransmission schemes, load-balancing and bandwidth-estimation based mechanisms. In comparison to the existing reactive techniques for buffer block mitigation, we propose a novel and yet simpler to implement, delay aware packet scheduling scheme for multipath data transfer over asymmetric network paths, that proactively minimizes the blocking inside receivers buffer. Our initial simulation results show that, in comparison to the default round robin packet scheduler, by using our proposed delay aware packet scheduling scheme, we can significantly improve overall performance while notably minimizing the receivers buffer usage, which is also beneficial for multi-homed hand-held mobile devices with limited buffering capacity, which, due to their multi-homing and heterogeneous wireless network features (i.e. availability of 3G and Wi-Fi) are also one of the most common use cases for multi-path transport.

When should I use network emulation

The design and development of a complex system requires an adequate methodology and efficient instrumental support in order to early detect and correct anomalies in the functional and non-functional properties of the tested protocols. Among the various tools used to provide experimental support for such developments, network emulation relies on real-time production of impairments on real traffic according to a communication model, either realistically or not. This paper aims at simply presenting to newcomers in network emulation (students, engineers, etc.) basic principles and practices illustrated with a few commonly used tools. The motivation behind is to fill a gap in terms of introductory and pragmatic papers in this domain. The study particularly considers centralized approaches, allowing cheap and easy implementation in the context of research labs or industrial developments. In addition, an architectural model for emulation systems is proposed, defining three complementary levels, namely hardware, impairment, and model levels. With the help of this architectural framework, various existing tools are situated and described. Various approaches for modeling the emulation actions are studied, such as impairment-based scenarios and virtual architectures, real-time discrete simulation, and trace-based systems. Those modeling approaches are described and compared in terms of services, and we study their ability to respond to various designer needs to assess when emulation is needed.

Improvements in DCCP congestion control for satellite links

We propose modifications in the TCP-Friendly Rate Control (TFRC) congestion control mechanism from the Datagram Congestion Control Protocol (DCCP) intended for use with real-time traffic, which are aimed at improving its performance for long delay (primarily satellite) links. Firstly, we propose an algorithm to optimise the number of feedback messages per round trip time (RTT) rather than use the currently standard of at least one per RTT, based on the observed link delay. We analyse the improvements achievable with proposed modification in different phases of congestion control and present results from simulations with modified ns-2 DCCP and live experiments using the modified DCCP Linux kernel implementation. We demonstrate that the changes results in improved slow start performance and a reduced data loss compared to standard DCCP, while the introduced overhead remains acceptable.

IREEL: remote experimentation with real protocols and applications over an emulated network

This paper presents a novel e-learning platform called IREEL. IREEL is a virtual laboratory allowing students to drive experiments with real Internet applications and end-to-end protocols in the context of networking courses. This platform consists in a remote network emulator offering a set of pre-defined applications and protocol mechanisms. Experimenters configure and control the emulation and the end-systems behavior in order to perform tests, measurements, and observations on protocols or applications operating under controlled specific networking conditions. A set of end-to-end mechanisms, mainly focusing on transport and application-level protocols, are currently available. IREEL is scalable and easy to use thanks to an ergonomic web interface.

Modelling the delay distribution of Binary Spray and Wait routing protocol

This article proposes a stochastic model to obtain the end-to-end delay law between two nodes of a Delay Tolerant Network (DTN). We focus on the commonly used Binary Spray and Wait (BSW) routing protocol and propose a model that can be applied to homogeneous or heterogeneous networks (i.e. when the inter-contact law parameter takes one or several values). To the best of our knowledge, this is the first model allowing to estimate the delay distribution of Binary Spray and Wait DTN protocol in heterogeneous networks. We first detail the model and propose a set of simulations to validate the theoretical results.