scholarly journals Estimating Available Bandwidth using End-To-End Delay Increase Rate

For real-time services such as voice over internet protocol, video conferencing and peer-to-peer streaming, end-to-end bandwidth estimation is very essential. Several available techniques for estimating bandwidth have been suggested such as Magictrain, IGI / PTR, pathChirp, Yaz and ASSOLO. However, in terms of the accuracy of available bandwidth estimation and/or network load efficiency, these techniques have disadvantages. In this article, we present an available technique of estimating bandwidth consisting of two features to provide high accuracy estimation and low efficiency of network load. One feature is the accessible bandwidth assessment feature that uses the end-to-end delay increase rate to directly calculate the available bandwidth. The other feature is the rate adjustment algorithm which adjusts the mistake calculated using the available bandwidth assessment feature between the real accessible bandwidth and the accessible bandwidth. The suggested method's rate adjustment algorithm is based on Magictrain's because Magictrain offers high precision in estimating accessible bandwidth. Finally, in terms of estimation precision and network load efficiency, we compare the suggested technique with Magictrain using computer simulation and show the effectiveness of the suggested technique

2003 ◽  
Vol 14 (03) ◽  
pp. 503-523 ◽  
Author(s):  
William C. Grimmell ◽  
Nageswara S. V. Rao

Routing in the newer generation of network transmission methods may be performed at various levels of the IP stack such as datagram, TCP stream, and application levels. It is important in the use of these methods to compute the routes that minimize the end-to-end delays for the specific routing mechanism. We formulate an abstract network path computation problem, the dynamic quickest path problem, to encompass a number of message forwarding mechanisms including circuit switching, Internet Protocol, and their variations. This problem deals with the transmission of a message from a source to a destination with the minimum end-to-end delay over a network with propagation delays and dynamic bandwidth constraints on the links. The available bandwidth for each link is specified as a piecewise constant function. We present for each message forwarding mechanism or mode an algorithm to compute a path with the minimum end-to-end delay for a given message size. Our algorithms with suitable network restrictions have polynomial time complexity in the size of the network and total number of segments in the bandwidth list.


Sign in / Sign up

Export Citation Format

Share Document