Cart (Loading....) | Create Account
Close category search window
 

Performance analysis of space-priority mechanisms in an input and output queueing ATM switch

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 $31
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)
Lee, J.Y. ; Dept. of Inf. Commun., Chung Nam Nat. Univ., Taejon, South Korea ; Un, C.K.

In future high-speed integrated networks asynchronous transfer mode (ATM) switches should be able to accommodate diverse types of applications with different quality of services (QOS) and traffic requirements. Thus some types of priority control schemes are needed in ATM switches to increase the utilisation of switches and satisfy the QOS of each traffic type. The authors consider a nonblocking input and output queueing ATM switch with capacity m in which two classes of traffic are admitted. Each input queue adopts one of two space-priority mechanisms, partial push-out and partial buffer sharing, which assign priorities for buffer access to each traffic type according to its loss probability constraints. The distribution of input queue length and loss probabilities of each traffic class are obtained using the matrix-geometric solution method and their performance compared. Numerical analysis and simulation indicate that the switch utilisation with space-priority mechanisms satisfying the QOS of each traffic class is much higher than that of the switch without control and the required buffer size is reduced while satisfying the same QOS. The partial push-out scheme has a somewhat higher throughput than the partial buffer sharing scheme but the latter is preferred to the former owing to its lower implementation complexity

Published in:

Communications, IEE Proceedings-  (Volume:144 ,  Issue: 4 )

Date of Publication:

Aug 1997

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.