Referenced Items are not available for this document.
We present a simple iterative matching for an input and output buffered switch with multiple switching planes. The suggested algorithm is based on iSLIP and consists of request, grant and accept steps. The pointer update scheme of iSLIP is simplified in the suggested algorithm to enhance a match efficiency and a service fairness. In addition, we show a switch performance is improved when the suggested algorithm is used with an occupancy level of a queue. Using computer simulation under Bernoulli traffic, we show the suggested algorithm is better than iSLIP for cell scheduling of input and output buffered switches
Published in:
ATM (ICATM 2001) and High Speed Intelligent Internet Symposium, 2001. Joint 4th IEEE International Conference on
Date of Conference: 2001
- Page(s):
- 163 - 167
- Meeting Date :
- 22 Apr 2001-25 Apr 2001
- Print ISBN:
- 0-7803-7093-7
- INSPEC Accession Number:
- 7081065
- Conference Location :
- Seoul
- Digital Object Identifier :
- 10.1109/ICATM.2001.932078
- Product Type:
- Conference Publications
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.
