Estimation Of Available Bandwidth Research Articles

Access network selection based on available bandwidth estimation for heterogeneous networks

With the new 5G trend, the amount of heterogeneous networks (HetNets) has increased exponentially. Cooperation between the most commonly used HetNets such as: WiFi and Long Term Evolution (LTE) is required to ensure a balanced traffic load which benefits the end user with maximum throughput and high quality of service. A balanced traffic problem with WiFi- LTE heterogeneous wireless networks is selecting which network to use, LTE or WiFi, if both are available. In other words, a node would have to send/receive traffic using either LTE or WiFi. We address this issue and propose both a WiFi available bandwidth estimation technique called “Available Bandwidth with Error Probability (ABEP)” and a traffic steering strategy to improve the performance of WiFi-LTE wireless networks. Our approach provides a better estimation of available bandwidth in WiFi with respect to relevant bandwidth estimation techniques. The bandwidth utilization in a WiFi Network is obtained at an initial stage of the traffic steering strategy. The steering of traffic is then triggered depending on events and the network conditions. Different from other approaches, our proposed traffic steering algorithm considers both a minimum bandwidth and a minimum SNR threshold to connect to WiFi, which are necessary to have an efficient transmission. One of the benefits of our approach regards reducing the use of the LTE network and its corresponding monetary charges.

Round-Trip Time and Available Bandwidth Estimation Based Congestion Window Reduction Algorithm of MPTCP in Lossy Satellite Networks

A significant enhancement in recent communication systems is Satellite Communications. The performance improvement of the transmission control protocol (TCP) in satellite communications has been an active research area. Multipath TCP (MPTCP) ensures a robust solution than the regular TCP. However, the performance degradation in satellite networks due to the link asymmetry, high loss and high latency cannot distinguish the packet losses caused by network congestions from the losses properly. In this paper, a round-trip time detection-based algorithm is proposed using available bandwidth estimation (ABE) to mitigate the issue of blind decreasing of congestion window upon detecting the packet loss over lossy satellite networks. Experiments are done using the NS-2 network simulator to compare the various congestion control algorithms of both TCP and MPTCP over satellite networks. Simulations results from the experiments show that our proposed algorithm outperforms the existing algorithms which are mentioned in this article.

MODIFIED PASSIVE AVAILABLE BANDWIDTH ESTIMATION IN IEEE 802.11 WLAN

Quality of Service provisioning for real-time multimedia applications is largely determined by a network’s available bandwidth. Until now, there is no standard method for estimating bandwidth on wireless networks. Therefore, in this study, a mathematical model called Modified Passive Available Bandwidth Estimation (MPABE) was developed to estimate the available bandwidth passively on a Distributed Coordination Function (DCF) wireless network on the IEEE 802.11 protocol. The mathematical model developed was a modification of three existing mathematical models, namely Available Bandwidth Estimation (ABE), Cognitive Passive Estimation of Available Bandwidth V2 (cPEAB-V2), and Passive Available Bandwidth Estimation (PABE). The proposed mathematical model gave emphasis on what will be faced to estimate available bandwidth and will help in building strategies to estimate available bandwidth on IEEE 802.11. The developed mathematical model consisted of idle period synchronisation between sender and receiver, the overhead probability occurring in the Medium Access Control (MAC) layer, as well as the successful packet transmission probability. Successful packet transmission was influenced by three variables, namely the packet collision probability caused by a number of neighbouring nodes, the packet collision probability caused by traffic from hidden nodes, and the packet error probability. The proposed mathematical model was tested by comparing it with other relevant mathematical models. The performance of the four mathematical models was compared with the actual bandwidth. Using a series of experiments that have been performed, it was found that the proposed mathematical model is approximately 26% more accurate than ABE, 36% more accurate than cPEABV2, and 32% more accurate than PABE.

Exploiting flexible functional split in converged software defined access networks

5G targets to offer a huge network capacity to support the expected unprecedented traffic growth due mainly to mobile and machine-type services. Thus, the 5G access network has to comply with very challenging architectural requirements. Mobile network scalability is achieved by playing appropriately with the centralization of network functions and by applying the functional split introducing the fronthaul. Although more advantageous in terms of network management and performance optimization, low-layer functional split options require larger bandwidth and lower latency to be guaranteed by the fronthaul in the access network, while preserving other concurrent fiber-to-the-x services. Thus, advanced mechanisms for the efficient management of available resources in the access network are required to control jointly both radio and optical domains. Softwarized mobile and optical segments facilitate the introduction of dedicated protocols to enable the inter-working of the two control planes. This paper proposes a new cooperation scheme to manage the adaptive flexible functional split in 5G networks conditioned to the resource availability in the optical access network. Techniques for the accurate estimation of available bandwidth and the associated real-time selection of the best suitable functional split option are investigated. Results show that the proposed software defined converged approach to wavelength and bandwidth management guarantees the optimal allocation of optical resources. The triple exponential smoothing forecasting technique enables efficient coexistence of mobile fronthaul and fixed connectivity traffic in the network, reducing traffic impairments with respect to other well-known forecasting techniques, while keeping the same level of centralization.

Analytical Available Bandwidth Estimation in Wireless Ad-hoc Networks Considering Mobility in 3-Dimensional Space

Estimation of available bandwidth for ad hoc networks has always been open and active challenge for the researchers. A lot of literature is proposed in the last 20 years to evaluate the residual bandwidth. The main objective of the work being admission of new flow in the network with the constraint that any existing current transmission is not affected. One of the prime factors affecting the estimation process is the collision among packets. These collisions trigger the backoff algorithm that leads to wastage of the usable bandwidth. Although a lot of state of art solutions were proposed, but they suffer from various flaws and shortcoming. Other factor contributing to the inaccuracy in existing solution is the mobility of nodes. Node mobility leads to instability of links leading to data losses and delay which impact the bandwidth. The current paper proposes an analytical approach named Analytical Available Bandwidth Estimation Including Mobility (AABWM) to estimate ABW on a link. The major contributions of the proposed work are: i) it uses mathematical models based on renewal theory to calculate the collision probability of data packets which makes the process simple and accurate, ii) consideration of mobility under 3-D space to predict the link failure and provides an accurate admission control. Extensive simulations in NS-2 are carried out to compare the performance of the proposed model against the existing solutions.

Optimization of Probe Train Size for Available Bandwidth Estimation in High-speed Networks

Available bandwidth parameter is a crucial characteristic in terms of networking and data transmission. The beforehand knowledge of its value and use of this parameter in various traffic engineering algorithms and QoS calculations is a key for high-efficient multigigabit data transport in nowadays networks. The challenge in available bandwidth estimations is not only in its accuracy and processing speed but also in the reduction of the amount of probe traffic injected into the network by keeping an adequate level of estimation accuracy. In this paper we extend existing active probing measurement algorithms for end-to-end available bandwidth estimation along with methods to reduce estimation times and amount of injected traffic while keeping measurement accuracy constant and even reducing the uncertainty of estimations. The main goal of this research was to detect a sufficient ratio of MTU, packet train size with the link capacity and available bandwidth (AvB) in up to 10 Gbps networks. In order to explore measurement accuracy under different conditions, a new tool for the AvB estimation named Kite2 has been developed and is presented in the paper. Comparative performance of AvB estimations using Kite2, Kite and Yaz is presented. Finally we calculate with statistical means dependency between the estimation error probability, measurement probing overhead and the measurement time.

Estimation of Available Bandwidth for High Capacity Links Over Industrial Applications

Transmission Control Protocol (TCP) is built on the concept of self-clocking technique and this concept based on several characteristics. The slow-start mechanism represents the prime technique for usage the operative network resource. The objective of the slow start mechanism is to create a TCP connection in an optimal state - run for network route rapidly without giving a disproportionate load to the network. Due to the rate of packet transferred is limited by the bandwidth of the narrowest bottleneck alongside the connection pipe, then, the transferring rate cannot exceed this bandwidth and the maximum rate competitions the permissible bandwidth of the link that own narrowest bandwidth over end-to-end connections. In large bandwidth networks, the mechanism of slow-start does not perform suitably and may cause considerable degradation in network performance. Therefore, it's necessary to develop a new slow-start technique that can increase the packet transferring over large bandwidth links environments. This article investigates the behaviour of TCP protocol after applying a technique based on using available bandwidth estimation to detect the current level of the network slow-start threshold (ssthresh) in high capacity links used over industrial application.

Mobility-Prediction-Aware Bandwidth Reservation Scheme for Mobile Networks

Bandwidth is an extremely valuable and scarce resource in mobile networks; therefore, efficient mobility-aware bandwidth reservation is necessary to support multimedia applications (e.g., video streaming) that require quality of service (QoS). In this paper, we propose a distributed bandwidth reservation scheme called the mobility-prediction-aware bandwidth reservation (MPBR) scheme. The objective of MPBR is to reduce handoff call dropping rate and maintain acceptable new call blocking rate while providing efficient bandwidth utilization. MPBR consists of 1) a handoff time estimation (HTE) scheme that aims to estimate the time windows when a user will perform handoffs along the path to his destination, 2) an available bandwidth estimation (ABE) scheme that aims to estimate in advance available bandwidth, during the computed time windows in the cells to be traversed by the user to his destination, and 3) an efficient call admission control (ECaC) scheme that aims to control bandwidth allocation in the network cells. The simulation results show that MPBR outperforms existing schemes in terms of reducing handoff call dropping rate.

Adaptive Multistreaming Over Network Via SCTP

The idea of this paper is related to the transmission of streaming media passed through a stream control transmission protocol (SCTP). This paper evaluates the performance of the SCTP with adaptive streams. This is done by adding new methods for setting the number of streams, that can be applied to an SCTP and that can utilize new, characteristic of SCTP features. A SCTP sender adaptively enables or disables multistreaming based on comparison between the estimates of available bandwidth and current congestion window size. It is desired to improve goodput under congestion. to evaluate the effect of communication through computer simulation using the INET framework for simulation tools OMNet++.This software will be setup under windows O.S, and finally will compare the variation between the proposed method and SCTP using normal streams.

Performance Study of an Admission Controller for Wireless Networks

Determining if there is enough bandwidth to allow admit a new flow into a wireless network is a complex task. To solve this problem, various methods have been proposed for estimating bandwidth. We study through simulations the performance of a new algorithm that has theoretical guarantees to correctly determine the available bandwidth without disturbing other flows that are currently being served. Specifically, we studied how the selection of the algorithm parameters affect its speed of convergence and accuracy of the estimates of available bandwidth. The results confirm the theoretical results and are used to determine the best parameters for rapid convergence with minimal estimation error.

BEST-AP: Non-intrusive estimation of available bandwidth and its application for dynamic access point selection

The coverage area of Access Points (APs) in Wireless Local Area Networks (WLANs) often overlaps considerably. Hence, a station can potentially associate with many APs. In traditional IEEE 802.11 systems, the station associates to the AP with the strongest signal. This strategy may result in load imbalance between APs and thus low overall network throughput. This paper proposes a new mechanism for selecting the “best” AP based on a novel available bandwidth estimation scheme. The available bandwidth provided by an AP depends mainly on the signal quality and the load on the wireless channel. Based on measurements we first analyze how those factors vary stochastically over time and motivate why a frequent estimation of available bandwidth is necessary. We then develop BEST-AP, a system for Bandwidth ESTimation of Access Points, which uses regular data traffic to estimate the available bandwidth from all APs in reach in a non-intrusive way, even if they are on a different channel. Based on OpenFlow, BEST-AP allows the station to be associated with multiple APs simultaneously and to switch between APs with low overhead. Using the available bandwidth estimates, the system exploits the “best” AP for longer duration while probing the less good APs for shorter durations to update the bandwidth estimations. The evaluation in a WLAN testbed shows that with background load created from real WLAN traces, the dynamic selection of APs improves the throughput of a station by around 81%, compared to a static selection. When the station is mobile, the throughput increases by 176% on average.

Toward efficient estimation of available bandwidth for IEEE 802.11-based wireless networks

Accurately measuring the available bandwidth information is critical for providing QoS (Quality of Service) assurance, especially for the bandwidth-limited 802.11-based wireless networks. However, the shared nature of wireless medium and IEEE 802.11 MAC pose great challenges for estimating the bandwidth accurately. This paper tends to tackle this issue. In particular, based on our formal definition of available bandwidth in IEEE 802.11-based wireless networks, a novel Passive Available Bandwidth Estimation (PABE) approach is proposed. In PABE, the effective link capacity is analyzed by considering the random factors in transmission like backoff and the retransmission of frame. To estimate the available channel idle time ratio (CITR), a new, lower threshold (named No Collision Sensing Range threshold, NCSR-threshold) is introduced, and the underestimation problem raised by the new threshold is compensated by the non-affect case analysis. Our approach incurs very low cost to the network without any explicit message overhead. Through extensive simulation, our data validate that our approach consistently achieves much better performance than other existing algorithms in terms of estimation accuracy.

Available bandwidth estimation for the network paths with multiple tight links and bursty traffic

Available bandwidth (ABW) estimation is useful for various applications such as network management, traffic engineering, and rate-based multimedia streaming. Most of the ABW estimation methods are based on the fluid cross-traffic model. Inevitably, their estimation accuracy is limited in the network environments with bursty cross-traffic. In this paper, we apply packet trains (a series of probing packets) and a modified Ping to probe the ABW of a network path. Our proposed probing method can identify several tight links along a path and can infer their individual ABWs. The ABW estimation algorithm developed in this study, GNAPP, is also based on the fluid traffic model, but it can effectively filter out probing noise incurred in networks that carry bursty traffic. The algorithm employs not only the gaps of any two consecutive probing packets but also those of nonadjacent probing packets for ABW estimation. Thus, the number of samples for ABW estimation increases significantly without resorting to sending more probing packets and the estimation efficiency and accuracy are improved. In addition, two-stage filtering and moving averages are used in GNAPP for reducing estimation errors. Numerical results demonstrate that the estimation scheme based on GNAPP can achieve good accuracy even when the traffic is bursty and there are multiple tight links on the path being observed. Thus, it outperforms other well-known ABW estimation tools.

Concurrent multipath transmission with forward error correction mechanism to overcome burst packet losses for delay-sensitive video streaming in wireless home networks

Wireless multimedia home servers are the next generation of home entertainment systems. The provision of high quality time-critical video streaming applications in indoor environments is very challenging due to high attenuation and interference caused by the walls and the contention in the shared wireless channel. This paper proposes a Delay-sensitive Multipath Forward Error Correction (DM-FEC) mechanism involving an estimation of available bandwidth and a mathematical analytical model with which the appropriate transmission rate, the FEC block length, and the FEC redundancy on each path in a multipath environment can be determined to solve previous problems. The DM-FEC mechanism not only selects the appropriate transmission rate and FEC redundancy on each path but also adaptively adjusts the FEC block length and concurrently sends data over multiple paths to overcome burst packet losses which otherwise can cause the video frame to be unplayable and impede the timely recovery of video information.

Source routing: Best rout using genetic algorithm

The success of distributed multimedia traffic presents many challenges to the network designer, certain bandwidth as well as bounds on delay, loss probability and jitter in order to maintain reception quality are issues of Constraint Base Routing (CBR). Flow routing requires deterministic path coordination in comparison with data routing. This paper presents a new technique for best CBR-rout path computation using genetic algorithm. Available bandwidth, delay jitter, and path availability are the fitness function, the genetic algorithm try to optimize. Source routed packets were established to hold the complete elected path in packet header. All studies made on NS2 simulator, where SARBE approach for rapid on-line estimation of available bandwidth shows performance optimization on OSPF algorithm for multimedia streaming applications.

A New Routing Protocol in Wireless Ad-hoc Networks with Multiple Radios and Channels

We propose a new routing protocol, MCQosR, that is based on bandwidth estimation, admission control, and a routing metric, MCCR - suitable for wireless ad-hoc networks with multiple radios and channels. To use the full capacity of a wireless link, we assume a node with multiple radios for full duplex operation, and a radio using multiple channels to exclude route-intra interference. This makes it possible to use the capacity of a wireless link. Then, to provide bandwidth and delay guarantee, we have a radio with a fixed channel for layer-3 data reception at each node, used to estimate the available bandwidth and expected delay of a wireless link. Based on the estimate of available bandwidth and delay, we apply the call admission control to a new call requiring bandwidth and delay guarantee. New calls with traffic that will overflow link or network capacity are rejected so the accepted calls can use the required bandwidth and delay. Finally, we propose a routing metric, MCCR, which considers the channel contentions and collisions of a wireless link operating in CSMA/CA.. MCCR is useful for finding a route with less traffic and distributing traffic over the network to prevent network congestion as much as possible. The simulation of the MCQosR protocol and the MCCR metric shows traffic is distributed and guaranteed service is provided for accepted calls.

Available bandwidth estimation and admission control for QoS routing in wireless mesh networks

This article presents an integrated admission control and routing mechanism for multi-rate wireless mesh networks. Admission control depends on precise estimates of available bandwidth at involved nodes and the bandwidth consumption required by a new flow. Estimating these parameters in wireless networks is challenging due to the shared and open nature of the wireless channel. Existing available bandwidth estimation techniques do not accurately consider interference from neighboring nodes and flow bandwidth requirement estimates or act overly conservative, restricting opportunities for parallel transmission due to spatial reuse. We propose the DCSPT method for available bandwidth estimation, based on dual carrier sensing with parallel transmission awareness. We also introduce a packet probing-based available bandwidth estimation method, suitable for legacy device implementations, and verify it experimentally. These techniques are integrated in an admission control mechanism designed for a hop-by-hop routing protocol (LUNAR), enabling alternate route identification when shortest paths are congested. Our protocol uses temporal accounting to enable bandwidth estimation across links using different bit-rates. Simulation results demonstrate that our admission control mechanism can effectively control the traffic load while considering parallel transmission opportunities, leading to cumulative system throughput improvements up to 80% compared to more conservative approaches. We further show that additional gains in system throughput come without significant cost in terms of packet delivery ratio or end-to-end delay and discuss our implementation experience on the ORBIT wireless research testbed.

Locating available bandwidth bottlenecks

The spatio-temporal available bandwidth estimator (STAB), a new edge-based probing tool, locates thin links - those links with less available bandwidth than all the links preceding them - on end-to-end network paths. By localizing thin links, STAB facilitates network operations and troubleshooting, provides insight into what causes network congestion, and aids network-aware applications. The tool uses special chirp-probing trains, featuring an exponential flight pattern of packets, which have the advantage of employing few packets while giving an accurate estimate of available bandwidth.

TCP-Jersey for Wireless IP Communications

Improving the performance of the transmission control protocol (TCP) in wireless Internet protocol (IP) communications has been an active research area. The performance degradation of TCP in wireless and wired-wireless hybrid networks is mainly due to its lack of the ability to differentiate the packet losses caused by network congestions from the losses caused by wireless link errors. In this paper, we propose a new TCP scheme, called TCP-Jersey, which is capable of distinguishing the wireless packet losses from the congestion packet losses, and reacting accordingly. TCP-Jersey consists of two key components, the available bandwidth estimation (ABE) algorithm and the congestion warning (CW) router configuration. ABE is a TCP sender side addition that continuously estimates the bandwidth available to the connection and guides the sender to adjust its transmission rate when the network becomes congested. CW is a configuration of network routers such that routers alert end stations by marking all packets when there is a sign of an incipient congestion. The marking of packets by the CW configured routers helps the sender of the TCP connection to effectively differentiate packet losses caused by network congestion from those caused by wireless link errors. This paper describes the design of TCP-Jersey, and presents results from experiments using the NS-2 network simulator. Results from simulations show that in a congestion free network with 1% of random wireless packet loss rate, TCP-Jersey achieves 17% and 85% improvements in goodput over TCP-Westwood and TCP-Reno, respectively; in a congested network where TCP flow competes with VoIP flows, with 1% of random wireless packet loss rate, TCP-Jersey achieves 9% and 76% improvements in goodput over TCP-Westwood and TCP-Reno, respectively. Our experiments of multiple TCP flows show that TCP-Jersey maintains the fair and friendly behavior with respect to other TCP flows.

Optimal adaptive bandwidth monitoring for qos based retrieval

Network aware multimedia delivery applications are a class of applications that provide certain level of quality of service (QoS) guarantees to end users while not assuming underlying network resource reservations. These applications guarantee QoS parameters like media object transmission time limit by actively monitoring the available bandwidth of the network and adapting the object to a target size that can be transmitted within a given time limit. A critical problem is how to obtain an accurate enough estimation of available bandwidth while not wasting too much time in bandwidth testing. In this paper, we present an algorithm to determine optimal amount of bandwidth testing given a probabilistic confidence level for network-aware multimedia object retrieval applications. The model treats the bandwidth testing as sampling from an actual bandwidth population. It uses statistical estimation method to quantify the benefit of each new bandwidth-testing sample, which is used to determine the optimal amount of bandwidth testing by balancing the benefit with the cost of each sample. Our implementation and experiments shows the algorithm determines the optimal amount of bandwidth testing effectively with minimum computation overhead.