Referenced Items are not available for this document.
This paper proposes to reorder data bursts before allocating channels, which outperforms the conventional channel scheduling algorithms in terms of the burst loss probability, significantly reducing the voids (unused time slots). The proposed channel scheduling algorithm works better when used with a non-degenerate fiber delay lines (FDLs) buffer.
Published in:
High Performance Switching and Routing, 2002. Merging Optical and IP Technologies. Workshop on
Date of Conference: 2002
- Page(s):
- 194 - 198
- Print ISBN:
- 4-88552-184-X
- INSPEC Accession Number:
- 7515713
- Digital Object Identifier :
- 10.1109/HPSR.2002.1024234
- 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.
