A recursive estimator of worst-case burstiness

Author

Valaee, Shahrokh

Volume

9

Issue

2

fYear

2001

fDate

4/1/2001 12:00:00 AM

Firstpage

211

Lastpage

222

Abstract

The leaky-bucket regulator has several potential roles in the operation of future transport networks; among them, the bounding of possible source trajectories in implementations of worst-case approaches to network design. It seems plausible that there will be applications whose specific traffic characteristics are known a priori neither to the user nor to the network; in such cases, a recursive algorithm for setting the leaky-bucket parameters may prove useful. We devise such an algorithm here. The leaky-bucket parameters are computed recursively over a limited period of observation of the source behavior. We provide an explicit characterization of the dynamics of the estimator, and the results of a simulation study of performance in the case of real source trajectories

Keywords

queueing theory; recursive estimation; telecommunication networks; telecommunication traffic; QoS; estimator dynamics; iterative algorithm; leaky-bucket parameters; leaky-bucket regulator; network design; performance; quality of service; real source trajectories; recursive algorithm; recursive estimator; simulation study; single-server queue; source behavior; source trajectories bounding; traffic characteristics; transport networks; worst-case burstiness; Availability; Bandwidth; Computational modeling; Quality of service; Recursive estimation; Reflection; Regulators; Switches; Telecommunication traffic; Traffic control;

fLanguage

English

Journal_Title

Networking, IEEE/ACM Transactions on

Publisher

ieee

ISSN

1063-6692

Type

jour

DOI

10.1109/90.917077

Filename

917077