Close category search window
 

Performance analysis of iterative scheduling algorithms for ATM input-queued switches

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

3 Author(s)
Motoyama, S. ; Dept. of Telematics, Campinas Univ., Brazil ; Ono, L.M. ; Mavigno, M.C.

The performance of three iterative algorithms for input-queued ATM switches is studied. Mathematical models are proposed for throughput and cell delay analyses and compared to simulation results. The results show that the three algorithms have high throughputs and very low cell delays

Published in:
Telecommunications Symposium, 1998. ITS '98 Proceedings. SBT/IEEE International

Date of Conference: 9-13 Aug 1998

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 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.