An asymptotically optimal greedy algorithm for large optical burst switching systems

Authors:
Lachlan L. H. Andrew;Yuliy Baryshnikov;E. G. Coffman;Stephen V. Hanly;Jolyon White
Affiliations:
The University of Melbourne, Australia;Bell Labs, Lucent Technologies;Columbia University;-;-
Venue:
ACM SIGMETRICS Performance Evaluation Review - Special issue on the fifth workshop on MAthematical performance Modeling and Analysis (MAMA 2003)
Year:
2003

Citing 6
Cited 0

Terabit burst switching

Journal of High Speed Networks - Special issue on optical networking
Optical burst switching (OBS) - a new paradigm for an optical Internet

Journal of High Speed Networks - Special issue on optical networking
Techniques for optical packet switching and optical burst switching

IEEE Communications Magazine
Optical burst switching for service differentiation in the next-generation optical Internet

IEEE Communications Magazine
Control architecture in optical burst-switched WDM networks

IEEE Journal on Selected Areas in Communications
QoS performance of optical burst switching in IP-over-WDM networks

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

As the number of wavelengths in OBS systems increases, the utilization achievable for a given blocking probability can be made to approach 100%. This paper shows that this property applies to a wavelength allocation algorithm of greedy type. Another property of this rule, one shared by most other wavelength assignment algorithms, is that, since lost traffic tends to occur near destinations, where the resource usage wasted by such traffic is large, very low blocking probabilities are important for efficient operation. To help identify regions of low blocking probability, we derive an asymptotically exact condition for zero blocking probabilities; it has a form reminiscent of the stability condition of the M/G/1 queue.