A Continuous Overlay Path Probing Algorithm For Overlay Networks

Bandwidth is a key factor in network technologies and it has been of major importance throughout the history of packet networks. In fact, bandwidth estimation is very beneficial to optimize the performance of end-to-end transport in several overlay applications such as Content Distribution Networks (CDNs), Peer-to-Peer (P2P) file sharing, and dynamic overlay routing. The end-to-end available bandwidth determines the extra bandwidth that can be provided to overlay traffic. Knowledge about the available bandwidth of an overlay path enables dynamic rate adoption and better bandwidth utilization by content distribution schemes in overlay networks. However, the important issue is how to measure the available bandwidth on an end-to-end overlay path without prior knowledge about the physical network. Over the last two decades, researchers have been trying to create algorithms to measure end-to-end available bandwidth and other bandwidth-related metrics accurately, quickly, and without affecting the traffic of the path. Active measurement techniques performed by overlay nodes can provide bandwidth estimations of an end-to-end overlay path. This thesis describes a new algorithm called “COPPA,” which is an in-band path probing algorithm for measuring the end-to-end available bandwidth of an overlay path accurately and continuously. The aim is to provide up-to-date bandwidth information for enhanced content distribution processes in overlay networks. The primary idea is to perform active measurements using the applications’ packets instead of using extra probe packets. Such an in-band probing algorithm reduces measurement overhead on the selected overlay path. Several experiments were carried out using the OMNeT++ simulation framework. The designed algorithm was evaluated using experimental data. The obtained results show that the continuous in-band overlay path probing algorithm (COPPA) provides up-to-date bandwidth information with reduced overhead and minimal impact on the traffic of the path

Distributed Rate Allocation Policies for Multi-Homed Video Streaming over Heterogeneous Access Networks

We consider the problem of rate allocation among multiple simultaneous video streams sharing multiple heterogeneous access networks. We develop and evaluate an analytical framework for optimal rate allocation based on observed available bit rate (ABR) and round-trip time (RTT) over each access network and video distortion-rate (DR) characteristics. The rate allocation is formulated as a convex optimization problem that minimizes the total expected distortion of all video streams. We present a distributed approximation of its solution and compare its performance against H-infinity optimal control and two heuristic schemes based on TCP-style additive-increase-multiplicative decrease (AIMD) principles. The various rate allocation schemes are evaluated in simulations of multiple high-definition (HD) video streams sharing multiple access networks. Our results demonstrate that, in comparison with heuristic AIMD-based schemes, both media-aware allocation and H-infinity optimal control benefit from proactive congestion avoidance and reduce the average packet loss rate from 45% to below 2%. Improvement in average received video quality ranges between 1.5 to 10.7 dB in PSNR for various background traffic loads and video playout deadlines. Media-aware allocation further exploits its knowledge of the video DR characteristics to achieve a more balanced video quality among all streams.Comment: 12 pages, 22 figure

SSthreshless Start: A Sender-Side TCP Intelligence for Long Fat Network

Measurement shows that 85% of TCP flows in the internet are short-lived flows that stay most of their operation in the TCP startup phase. However, many previous studies indicate that the traditional TCP Slow Start algorithm does not perform well, especially in long fat networks. Two obvious problems are known to impact the Slow Start performance, which are the blind initial setting of the Slow Start threshold and the aggressive increase of the probing rate during the startup phase regardless of the buffer sizes along the path. Current efforts focusing on tuning the Slow Start threshold and/or probing rate during the startup phase have not been considered very effective, which has prompted an investigation with a different approach. In this paper, we present a novel TCP startup method, called threshold-less slow start or SSthreshless Start, which does not need the Slow Start threshold to operate. Instead, SSthreshless Start uses the backlog status at bottleneck buffer to adaptively adjust probing rate which allows better seizing of the available bandwidth. Comparing to the traditional and other major modified startup methods, our simulation results show that SSthreshless Start achieves significant performance improvement during the startup phase. Moreover, SSthreshless Start scales well with a wide range of buffer size, propagation delay and network bandwidth. Besides, it shows excellent friendliness when operating simultaneously with the currently popular TCP NewReno connections.Comment: 25 pages, 10 figures, 7 table

Available Bandwidth and RSRP Based Handover Algorithm for LTE/LTE-Advanced Networks Tested in LTE-Sim Simulator

In this paper, we propose a new algorithm that improves the performance of the operation of Handover (HO) in LTE-Advanced (LTE-A) networks. As recognized, Mobility Management (MM) is an important pillar in LTE/LTE-A systems to provide high quality of service to users on the move. The handover algorithms define the method and the steps to follow to ensure a reliable transfer of the UEs from one cell to another without interruption or degradation of the services offered by the network. In this paper, the authors proposed a new handover algorithm for LTE/LTE-A networks based on the measurement and calculation of two important parameters, namely the available bandwidth and the Received Power (RSRP) at the level of eNodeBs. The proposed scheme named LTE Available Bandwidth and RSRP Based Handover Algorithm (LABRBHA) was tested in comparison with well-known algorithms in the literature as the LHHA, LHHAARC and the INTEGRATOR scheme using the open source simulator LTE-Sim. Finally, the network performances were investigated via three indicators: the number of lost packets during the handover operation, the latency as well as the maximum system throughput. The results reported that our algorithm shows remarkable improvements over other transfer schemes

Handover Management in Highly Dense Femtocellular Networks

For dense femtocells, intelligent integrated femtocell/macrocell network architecture, a neighbor cell list with a minimum number of femtocells, effective call admission control (CAC), and handover processes with proper signaling are the open research issues. An appropriate traffic model for the integrated femtocell/macrocell network is also not yet developed. In this paper, we present the major issue of mobility management for the integrated femtocell/macrocell network. We propose a novel algorithm to create a neighbor cell list with a minimum, but appropriate, number of cells for handover. We also propose detailed handover procedures and a novel traffic model for the integrated femtocell/macrocell network. The proposed CAC effectively handles various calls. The numerical and simulation results show the importance of the integrated femtocell/macrocell network and the performance improvement of the proposed schemes. Our proposed schemes for dense femtocells will be very effective for those in research and industry to implement