Dynamic Grooming Algorithms for Survivable WDM Mesh Networks

Haibo Wen, Lemin Li, Rongxi He, Hongfang Yu, Sheng Wang, Na Song

Research output: Contribution to journalArticle

60 Citations (Scopus)

Abstract

Within a WDM grooming mesh network and under the constraints of the number of transceivers per node and wavelength continuity, we propose a novel dynamic grooming graph which models the number of transceivers per node in addition to the usage of wavelength and bandwidth resources. Based on the grooming graph, we first propose a dynamic traffic-grooming algorithm called integrated grooming algorithm (IGA). And we also propose two dynamic survivable traffic-grooming algorithms, which are called protection per lightpath trafficgrooming algorithm (PPL) and protection per connection traffic-grooming algorithm (PPC). These algorithms are evaluated via simulations.

Original languageEnglish (US)
Pages (from-to)253-263
Number of pages11
JournalPhotonic Network Communications
Volume6
Issue number3
DOIs
StatePublished - Nov 2003
Externally publishedYes

Fingerprint

Wavelength division multiplexing
mesh
traffic
transmitter receivers
Transceivers
Wavelength
continuity
wavelengths
resources
bandwidth
Bandwidth
simulation

Keywords

  • Grooming graph
  • Path protection
  • Traffic grooming
  • Wavelength division multiplexing

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Information Systems
  • Atomic and Molecular Physics, and Optics

Cite this

Dynamic Grooming Algorithms for Survivable WDM Mesh Networks. / Wen, Haibo; Li, Lemin; He, Rongxi; Yu, Hongfang; Wang, Sheng; Song, Na.

In: Photonic Network Communications, Vol. 6, No. 3, 11.2003, p. 253-263.

Research output: Contribution to journalArticle

Wen, Haibo ; Li, Lemin ; He, Rongxi ; Yu, Hongfang ; Wang, Sheng ; Song, Na. / Dynamic Grooming Algorithms for Survivable WDM Mesh Networks. In: Photonic Network Communications. 2003 ; Vol. 6, No. 3. pp. 253-263.
@article{e932ab0e2af44d3593d0f1fb5eb3a310,
title = "Dynamic Grooming Algorithms for Survivable WDM Mesh Networks",
abstract = "Within a WDM grooming mesh network and under the constraints of the number of transceivers per node and wavelength continuity, we propose a novel dynamic grooming graph which models the number of transceivers per node in addition to the usage of wavelength and bandwidth resources. Based on the grooming graph, we first propose a dynamic traffic-grooming algorithm called integrated grooming algorithm (IGA). And we also propose two dynamic survivable traffic-grooming algorithms, which are called protection per lightpath trafficgrooming algorithm (PPL) and protection per connection traffic-grooming algorithm (PPC). These algorithms are evaluated via simulations.",
keywords = "Grooming graph, Path protection, Traffic grooming, Wavelength division multiplexing",
author = "Haibo Wen and Lemin Li and Rongxi He and Hongfang Yu and Sheng Wang and Na Song",
year = "2003",
month = "11",
doi = "10.1023/A:1025627320965",
language = "English (US)",
volume = "6",
pages = "253--263",
journal = "Photonic Network Communications",
issn = "1387-974X",
publisher = "Springer Netherlands",
number = "3",

}

TY - JOUR

T1 - Dynamic Grooming Algorithms for Survivable WDM Mesh Networks

AU - Wen, Haibo

AU - Li, Lemin

AU - He, Rongxi

AU - Yu, Hongfang

AU - Wang, Sheng

AU - Song, Na

PY - 2003/11

Y1 - 2003/11

N2 - Within a WDM grooming mesh network and under the constraints of the number of transceivers per node and wavelength continuity, we propose a novel dynamic grooming graph which models the number of transceivers per node in addition to the usage of wavelength and bandwidth resources. Based on the grooming graph, we first propose a dynamic traffic-grooming algorithm called integrated grooming algorithm (IGA). And we also propose two dynamic survivable traffic-grooming algorithms, which are called protection per lightpath trafficgrooming algorithm (PPL) and protection per connection traffic-grooming algorithm (PPC). These algorithms are evaluated via simulations.

AB - Within a WDM grooming mesh network and under the constraints of the number of transceivers per node and wavelength continuity, we propose a novel dynamic grooming graph which models the number of transceivers per node in addition to the usage of wavelength and bandwidth resources. Based on the grooming graph, we first propose a dynamic traffic-grooming algorithm called integrated grooming algorithm (IGA). And we also propose two dynamic survivable traffic-grooming algorithms, which are called protection per lightpath trafficgrooming algorithm (PPL) and protection per connection traffic-grooming algorithm (PPC). These algorithms are evaluated via simulations.

KW - Grooming graph

KW - Path protection

KW - Traffic grooming

KW - Wavelength division multiplexing

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

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

U2 - 10.1023/A:1025627320965

DO - 10.1023/A:1025627320965

M3 - Article

VL - 6

SP - 253

EP - 263

JO - Photonic Network Communications

JF - Photonic Network Communications

SN - 1387-974X

IS - 3

ER -