Abstract
The leaky bucket algorithm is analyzed for on-off data sources. A fictitious queue is used to model the behavior of the leaky bucket algorithm, and a two-state Markov-modulated rate process is used to model the on-off data source. The analysis applies to buffered and unbuffered leaky buckets with rejecting or marking of violating data. Simple, closed-form expressions are derived that relate the leaky bucket parameters (bucket size and rate) and the on-off source characteristics to the loss and mark probabilities and the leaky bucket queuing delay. The required bucket size is shown to increase linearly with the average number of bits generated during an on period, and increase logarithmically with the decrease in loss or mark probability. For a buffered leaky bucket, it is also shown that the bucket size increases logarithmically with the decrease in the average delay in the leaky bucket queue. >
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
