Burst segmentation for void-filling scheduling in optical burst switching

Wei Tan; Yonghong Pan; Lemin Li

doi:10.1117/12.517218

7 May 2004 Burst segmentation for void-filling scheduling in optical burst switching

Wei Tan, Yonghong Pan, Lemin Li

Proceedings Volume 5281, Optical Transmission, Switching, and Subsystems; (2004) https://doi.org/10.1117/12.517218
Event: Asia-Pacific Optical and Wireless Communications, 2003, Wuhan, China

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.

Citation Download Citation

Wei Tan, Yonghong Pan, and Lemin Li "Burst segmentation for void-filling scheduling in optical burst switching", Proc. SPIE 5281, Optical Transmission, Switching, and Subsystems, (7 May 2004); https://doi.org/10.1117/12.517218

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available