By Topic

New models for admission control of priority traffic in ATM networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Schormans, J. ; Dept. of Electron. Eng., QMW, London, UK ; Pitts, J.

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

Published in:

Global Telecommunications Conference, 1996. GLOBECOM '96. 'Communications: The Key to Global Prosperity  (Volume:1 )

Date of Conference:

18-22 Nov 1996