Fairness-based traffic grooming in survivable WDM mesh networks

Rongxi He; Haibo Wen; Limin Song; Lemin Li; Lei Guo; Hongbin Luo

doi:10.1117/12.572674

Fairness-based traffic grooming in survivable WDM mesh networks

Rongxi He^*
, Haibo Wen
, Limin Song
, Lemin Li
, Lei Guo
, Hongbin Luo

^*Corresponding author for this work

Research output: Contribution to journal › Conference article › peer-review

1 Scopus citations

Abstract

Under the constraints of the number of transceivers per node and wavelength continuity, the fairness issue of connections with different bandwidth granularities in survivable traffic-grooming WDM mesh networks is investigated. An extended wavelength-plane graph (EWG) model and two dynamic grooming path protection algorithms with considering blocking fairness are proposed. Based on dynamic traffic with different load, the performance of our schemes has been evaluated via simulations. The results show that they provide good blocking fairness while at the same time ensure a small increase in the overall traffic blocking probability.

Original language	English
Article number	134
Pages (from-to)	923-932
Number of pages	10
Journal	Proceedings of SPIE - The International Society for Optical Engineering
Volume	5626
Issue number	PART 2
DOIs	https://doi.org/10.1117/12.572674
State	Published - 2005
Externally published	Yes
Event	Network Architectures, Management, and Applications II - Beijing, China Duration: 9 Nov 2004 → 11 Nov 2004

Keywords

Fairness
Mesh networks
Path protection
Traffic grooming
Wavelength division multiplexing (WDM)

Access to Document

10.1117/12.572674

Cite this

@article{38de286301854885ac94c26c543fd873,

title = "Fairness-based traffic grooming in survivable WDM mesh networks",

abstract = "Under the constraints of the number of transceivers per node and wavelength continuity, the fairness issue of connections with different bandwidth granularities in survivable traffic-grooming WDM mesh networks is investigated. An extended wavelength-plane graph (EWG) model and two dynamic grooming path protection algorithms with considering blocking fairness are proposed. Based on dynamic traffic with different load, the performance of our schemes has been evaluated via simulations. The results show that they provide good blocking fairness while at the same time ensure a small increase in the overall traffic blocking probability.",

keywords = "Fairness, Mesh networks, Path protection, Traffic grooming, Wavelength division multiplexing (WDM)",

author = "Rongxi He and Haibo Wen and Limin Song and Lemin Li and Lei Guo and Hongbin Luo",

year = "2005",

doi = "10.1117/12.572674",

language = "英语",

volume = "5626",

pages = "923--932",

journal = "Proceedings of SPIE - The International Society for Optical Engineering",

issn = "0277-786X",

publisher = "SPIE",

number = "PART 2",

note = "Network Architectures, Management, and Applications II ; Conference date: 09-11-2004 Through 11-11-2004",

}

TY - JOUR

T1 - Fairness-based traffic grooming in survivable WDM mesh networks

AU - He, Rongxi

AU - Wen, Haibo

AU - Song, Limin

AU - Li, Lemin

AU - Guo, Lei

AU - Luo, Hongbin

PY - 2005

Y1 - 2005

N2 - Under the constraints of the number of transceivers per node and wavelength continuity, the fairness issue of connections with different bandwidth granularities in survivable traffic-grooming WDM mesh networks is investigated. An extended wavelength-plane graph (EWG) model and two dynamic grooming path protection algorithms with considering blocking fairness are proposed. Based on dynamic traffic with different load, the performance of our schemes has been evaluated via simulations. The results show that they provide good blocking fairness while at the same time ensure a small increase in the overall traffic blocking probability.

AB - Under the constraints of the number of transceivers per node and wavelength continuity, the fairness issue of connections with different bandwidth granularities in survivable traffic-grooming WDM mesh networks is investigated. An extended wavelength-plane graph (EWG) model and two dynamic grooming path protection algorithms with considering blocking fairness are proposed. Based on dynamic traffic with different load, the performance of our schemes has been evaluated via simulations. The results show that they provide good blocking fairness while at the same time ensure a small increase in the overall traffic blocking probability.

KW - Fairness

KW - Mesh networks

KW - Path protection

KW - Traffic grooming

KW - Wavelength division multiplexing (WDM)

UR - https://www.scopus.com/pages/publications/18944370578

U2 - 10.1117/12.572674

DO - 10.1117/12.572674

M3 - 会议文章

AN - SCOPUS:18944370578

SN - 0277-786X

VL - 5626

SP - 923

EP - 932

JO - Proceedings of SPIE - The International Society for Optical Engineering

JF - Proceedings of SPIE - The International Society for Optical Engineering

IS - PART 2

M1 - 134

T2 - Network Architectures, Management, and Applications II

Y2 - 9 November 2004 through 11 November 2004

ER -

Fairness-based traffic grooming in survivable WDM mesh networks

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this