Leaky Buckets : Sizing and Admission Control (1996)
| Venue: | In Proceedings of the 35th IEEE Conference on Decision and Control |
| Citations: | 4 - 0 self |
BibTeX
@INPROCEEDINGS{Kulkarni96leakybuckets,
author = {V. G. Kulkarni and N. Gautam},
title = {Leaky Buckets : Sizing and Admission Control},
booktitle = {In Proceedings of the 35th IEEE Conference on Decision and Control},
year = {1996}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
In this paper we propose a new unified approach to address simultaneously the issues of traffic policing (using leaky buckets), admission control and network dimensioning. First we compute the effective bandwidth of the output of the leaky bucket (both buffered and unbuffered) . We find a surprising result that effective bandwidth of the output of a buffered leaky bucket is independent of the token pool size. Furthermore, the output effective bandwidth exhibits discontinuous behavior as the token pool size approaches infinity. We use these results in an optimization model to find the "optimal" leaky bucket parameters. We explain how this optimization program can be used to do network dimensioning if the input traffic characteristics are known, or to do connection admission control if the network parameters are fixed. This work was partially supported by NSF Grant No. NCR-9406823 i 1 Introduction The emerging high speed networks are expected to carry a broad range of traffic (video...
