An asymptotically optimal greedy algorithm for large optical burst switching systems

Lachlan L.H. Andrew, Yuliy Baryshnikov, E. G. Coffman, Stephen V. Hanly, Jolyon White

Research output: Contribution to journalArticle

3 Citations (Scopus)

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.

Original languageEnglish
Pages (from-to)14-16
Number of pages3
JournalPerformance Evaluation Review
Volume31
Issue number2
DOIs
Publication statusPublished - Sep 1 2003
Externally publishedYes

Fingerprint

Optical burst switching
Blocking probability
Switching systems
Wavelength
Telecommunication traffic

All Science Journal Classification (ASJC) codes

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications

Cite this

Andrew, L. L. H., Baryshnikov, Y., Coffman, E. G., Hanly, S. V., & White, J. (2003). An asymptotically optimal greedy algorithm for large optical burst switching systems. Performance Evaluation Review, 31(2), 14-16. https://doi.org/10.1145/959143.959152

An asymptotically optimal greedy algorithm for large optical burst switching systems. / Andrew, Lachlan L.H.; Baryshnikov, Yuliy; Coffman, E. G.; Hanly, Stephen V.; White, Jolyon.

In: Performance Evaluation Review, Vol. 31, No. 2, 01.09.2003, p. 14-16.

Research output: Contribution to journalArticle

Andrew, LLH, Baryshnikov, Y, Coffman, EG, Hanly, SV & White, J 2003, 'An asymptotically optimal greedy algorithm for large optical burst switching systems', Performance Evaluation Review, vol. 31, no. 2, pp. 14-16. https://doi.org/10.1145/959143.959152
Andrew, Lachlan L.H. ; Baryshnikov, Yuliy ; Coffman, E. G. ; Hanly, Stephen V. ; White, Jolyon. / An asymptotically optimal greedy algorithm for large optical burst switching systems. In: Performance Evaluation Review. 2003 ; Vol. 31, No. 2. pp. 14-16.
@article{ffad66147fa44829a768e4bf6dcb4d45,
title = "An asymptotically optimal greedy algorithm for large optical burst switching systems",
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.",
author = "Andrew, {Lachlan L.H.} and Yuliy Baryshnikov and Coffman, {E. G.} and Hanly, {Stephen V.} and Jolyon White",
year = "2003",
month = "9",
day = "1",
doi = "10.1145/959143.959152",
language = "English",
volume = "31",
pages = "14--16",
journal = "Performance Evaluation Review",
issn = "0163-5999",
publisher = "Association for Computing Machinery (ACM)",
number = "2",

}

TY - JOUR

T1 - An asymptotically optimal greedy algorithm for large optical burst switching systems

AU - Andrew, Lachlan L.H.

AU - Baryshnikov, Yuliy

AU - Coffman, E. G.

AU - Hanly, Stephen V.

AU - White, Jolyon

PY - 2003/9/1

Y1 - 2003/9/1

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

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

UR - http://www.scopus.com/inward/record.url?scp=33646409557&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33646409557&partnerID=8YFLogxK

U2 - 10.1145/959143.959152

DO - 10.1145/959143.959152

M3 - Article

AN - SCOPUS:33646409557

VL - 31

SP - 14

EP - 16

JO - Performance Evaluation Review

JF - Performance Evaluation Review

SN - 0163-5999

IS - 2

ER -