Abstract
Proposals for ATM connection admission control (CAC) algorithms are often based on real time calculation of the admissible load consistent with a given cell loss probability (CLP) and buffer length. These calculations rely on a wide range of analytical models, but the models rely on the analysis of two fundamental components of queueing behaviour: the burst scale component and the cell scale component, where the latter is always present and can be modelled by an M/D/1 queue. We present some new and accurate closed form approximations for the M/D/1 queue, which can be arranged to yield expressions for the cell loss probability, the admissible load and the buffer length. We use our results to derive expressions for traffic that may include both time and space priority cells.
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.
