Joint Scheduling and Buffer Management Policies for DTN Applications of Different Traffic Classes

• Published in: IEEE transactions on mobile computing Vol. 17; no. 12; pp. 2818 - 2834
• Main Authors: Matzakos, Panagiotis, Spyropoulos, Thrasyvoulos, Bonnet, Christian
• Format: Magazine Article
• Language: English
• Published: Los Alamitos IEEE 01.12.2018; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: buffer management policy; Buffers; Computer simulation; Data models; Data replication; Delay; Delay/disruption tolerant networks; Delays; Delivery scheduling; Mobile computing; Optimization; Protocols; QoS provision; Quality of service; Resource management; Routing; scheduling policy; Stability; Traffic delay
• ISSN: 1536-1233; 1558-0660
• DOI: 10.1109/TMC.2018.2816025

Delay/Disruption Tolerant Networks target environments suffering from the instability or lack of end-to-end paths. Store-carry-and forward principle aims to sustain data sessions, and data replication to increase the probability of on-time delivery. However, these techniques require efficient scheduling and buffer management, to comply with limited resources availability (i.e., communication duration, storage). Multiple existing schemes aim to improve, or even optimize the resources usage. Nevertheless, their majority considers equally important application sessions. The few proposals considering different traffic classes, fail to provide real QoS guarantees. In this paper, we formulate the problem of maximizing the performance, subject to distinct QoS constraints (requirements) for each application class. We consider requirements related to delivery probability and delay. Then, we propose a distributed algorithm which: (i) guarantees satisfaction of the individual constraints, when this is feasible given the available resources, and (ii) allocates any remaining resources optimally, to maximize the desired performance metric. We first consider homogeneous mobility, and then extend our analysis to heterogeneous contact rates and sparse contact graphs, that better correspond to real life mobility. Simulation results, based on synthetic and real mobility scenarios, support our theoretical claims and show that our policy outperforms other existing schemes (i.e., ORWAR <xref ref-type="bibr" rid="ref1">[1] and CoSSD <xref ref-type="bibr" rid="ref2">[2] ).