Translator Disclaimer
5 December 2005 Longest queue first scheduled assembly for optical burst switching networks
Author Affiliations +
Proceedings Volume 6022, Network Architectures, Management, and Applications III; 602240 (2005) https://doi.org/10.1117/12.634942
Event: Asia-Pacific Optical Communications, 2005, Shanghai, China
Abstract
Proposed in this paper is a novel burst assembly scheme called longest queue first scheduled assembly (LQF-SA) mechanism, where burst assembly and burst scheduling for optical burst-switching networks are integrated. In the proposed mechanism, ingress edge nodes have multiple assembly queues where IP packets are stored according to their egresses and QoS classes. Among these queues, the longest one is scheduled to assemble bursts by a scheduler at a fixed interval. In real networks, traffic usually distributes non-uniformly and there exists heavier traffic between some source and destination pairs. Simulation results show that LQF-SA could adapt well to the non-uniform traffic profiles. Furthermore, even under uniform traffic, LQF-SA is also super to round-robin scheduled assembly (RR-SA) in terms of burst size distribution, assembly efficiency, and burst loss rate.
© (2005) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Zhaobiao Lu, Hongbo Wang, Min Zhang, and Peida Ye "Longest queue first scheduled assembly for optical burst switching networks", Proc. SPIE 6022, Network Architectures, Management, and Applications III, 602240 (5 December 2005); https://doi.org/10.1117/12.634942
PROCEEDINGS
6 PAGES


SHARE
Advertisement
Advertisement
Back to Top