Abstract
SummaryWe consider an ideal link with bounded, independent, and identically distributed stochastic arrival and capacity processes. We use the theory of effective bandwidth and the theory of generating functions to improve known results about the queue process. Specifically, we prove better bounds on the probability distribution function and the tail distribution function of queue lengths.
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 callMore From: Concurrency and Computation: Practice and Experience
Disclaimer: 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.
