(2014-05-27) Aderounmu, Adesola G.; Oluwatope, Ayodeji O.; Obembe, Olufemi.; Ogwu, Francis J.
This paper takes an initiative from TOPP [3] and SLoPS [1]and its essence is to reduce the number of probing
and error inherent in estimating the available bandwidth along a network path. This paper aims at proposing
an algorithm for estimating available bandwidth with shorter measurement latency. Our method that is
iterative generates new probing rates by proportionally decreasing an initial probing rate as a function of
backlogged delays as a result of extra traffics along the path. The proposed algorithm, when implemented in
ns2 under same simulation setup in TOPP; produced the available bandwidth estimate at about 30% of the
number of iterations required for TOPP with a relative estimation error of 5% against 9% in TOPP