@INPROCEEDINGS{ IKR:034635,
PAGES = {210--219},
MONTH = {July},
YEAR = {2002},
BOOKTITLE = {{Proceedings of the 15th ITC Specialist Seminar on Internet Traffic Engineering and Traffic Management}},
TITLE = {{New modifications of the exponential moving average algorithm for bandwidth estimation}},
AUTHOR = {Burgstahler, L. AND Neubauer, M.},
ABSTRACT = {In this paper, we describe three different modifications of the Exponential Moving Average (EMA) algorithm that can be used for bandwidth estimation. Bandwidth estimation algorithms have to be deployed by nodes in connectionless networks (e.g. IP networks) that perform Quality of Service (QoS) routing based on the available bandwidth. Since applications do not signal their bandwidth requirements in such networks, estimation is the nodes' only way to gain knowledge about the status of the links. To use the results of the estimation for routing purposes, several constraints have to be fulfilled: The algorithm should react fast to changes in bandwidth, should converge sufficiently fast to the actual used bandwidth, but should show a certain independence of short-term peaks. Furthermore the algorithm should not be overly complex in terms of computing time and storage. We will compare the modified algorithms to the basic EMA algorithm.}
}