Share Email Print
cover

Proceedings Paper

A novel burst assembly scheme for optical burst switching networks
Author(s): Zhaobiao Lu; Hongbo Wang; Min Zhang; Peida Ye
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper 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.

Paper Details

Date Published: 5 December 2005
PDF: 6 pages
Proc. SPIE 6022, Network Architectures, Management, and Applications III, 602240 (5 December 2005); doi: 10.1117/12.634942
Show Author Affiliations
Zhaobiao Lu, Beijing Univ. of Posts and Telecommunications (China)
Hongbo Wang, Beijing Univ. of Posts and Telecommunications (China)
Min Zhang, Beijing Univ. of Posts and Telecommunications (China)
Peida Ye, Beijing Univ. of Posts and Telecommunications (China)


Published in SPIE Proceedings Vol. 6022:
Network Architectures, Management, and Applications III
Kwok-wai Cheung; Gee-Kung Chang; Guangcheng Li; Ken-Ichi Sato, Editor(s)

© SPIE. Terms of Use
Back to Top