Share Email Print

Proceedings Paper

Burst segmentation for void-filling scheduling in optical burst switching
Author(s): Wei Tan; Yonghong Pan; Lemin Li
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

As a promising solution for the next generation optical Internet, optical burst switching still has much to be improved, especially on the design of core routers. This paper mainly focuses on the channel scheduling algorithms of core routers and proposes a new scheduling algorithm. The new scheduling algorithm integrates burst segmentation, one of contention resolution schemes that are another major concern in the core router design. The simulation results show that the new algorithm, compared to existing scheduling algorithms, can effectively lower the packet loss probability and is of great benefit to the network performance.

Paper Details

Date Published: 7 May 2004
PDF: 6 pages
Proc. SPIE 5281, Optical Transmission, Switching, and Subsystems, (7 May 2004); doi: 10.1117/12.517218
Show Author Affiliations
Wei Tan, Univ. of Electronic Science and Technology of China (China)
Yonghong Pan, Univ. of Electronic Science and Technology of China (China)
Lemin Li, Univ. of Electronic Science and Technology of China (China)

Published in SPIE Proceedings Vol. 5281:
Optical Transmission, Switching, and Subsystems
Cedric F. Lam; Chongcheng Fan; Norbert Hanik; Kimio Oguchi, Editor(s)

© SPIE. Terms of Use
Back to Top