hp home products & services support solutions how to buy
hp logo - invent
corner hp labs corner
search search
contact hp contact hp
hp labs home hp labs home
about hp labs about hp labs
research research
news and events news and events
careers @ labs careers @ labs
technical reports technical reports
talks and speeches talks and speeches
worldwide sites worldwide sites
corner corner
HP Labs Technical Reports

Click here for full text: Postscript PDF

Maximal Effective Bandwidth under "Leaky Bucket" Constraints

Walsh, Cormac


Keyword(s): worst case traffic; leaky bucket; generic cell rate algorithm; effective bandwidth

Abstract: Please Note. This abstract contains mathematical formulae which cannot be represented here. We investigate the worst possible behaviour of a stationary source if the traffic emanating from it is constrained to have a peak rate no greater than and to obey a "leaky bucket" constraint with bucket size and leak rate . The quantity to be maximised is the effective bandwidth function which governs the asymptotic loss rate when a large number of such sources pass through a single server queue. We conjecture the form of the worse case traffic in general and prove the conjecture for the special case when T, the timescale parameter of the effective bandwidth, is less than both / ( - ) and / , the times taken respectively to fill and empty the leaky bucket.

16 Pages

Back to Index

printing icon
printing instructions printing instructions
Privacy Statement Legal Notices © 1994-2001 Hewlett-Packard Company