By Topic

A recursive estimator of worst-case burstiness

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)

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

Published in:

Networking, IEEE/ACM Transactions on  (Volume:9 ,  Issue: 2 )