Open AccessBurst segmentation for void-filling scheduling and its performance evaluation in optical burst switching
Author(s) -
Wei Tan,
Sheng Wang,
Lemin Li
Publication year - 2004
Publication title -
optics express
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.394
H-Index - 271
ISSN - 1094-4087
DOI - 10.1364/opex.12.006615
Subject(s) - computer science , optical burst switching , scheduling (production processes) , router , burst switching , the internet , packet switching , computer network , network packet , algorithm , distributed computing , wavelength division multiplexing , optical performance monitoring , optics , transmission delay , mathematical optimization , wavelength , physics , mathematics , world wide web
As a promising solution for the next generation optical Internet, optical burst switching still has much to be improved, especially the design of core routers. This paper mainly focuses on channel scheduling algorithms of core routers and proposes a new practical scheduling algorithm. In the new algorithm, burst segmentation, one of the contention resolution schemes that are another major concern in core router design, is introduced. The proposed algorithm is analyzed theoretically and evaluated by computer simulations. The results show that the new algorithm, compared with existing traditional scheduling algorithms, can lower the packet loss probability and enhance the link utilization and network performance.