Clustering techniques for traffic grooming in optical WDM mesh networks

Ding Zhemin; Mounir Hamdi

Clustering techniques for traffic grooming in optical WDM mesh networks

Ding Zhemin^*
, Mounir Hamdi

^*Corresponding author for this work

Hong Kong University of Science and Technology

Research output: Contribution to conference › Paper › peer-review

13 Citations (Scopus)

Abstract

In this paper, we are trying to study the traffic grooming problem by minimizing overall network cost that includes the transceivers required as well as the number of wavelengths. A mathematical formulation of the traffic grooming problem in mesh networks is proposed. We also describe a heuristic using Blocking Island (BI) paradigm. Simulations have been carried out to prove effectiveness of our heuristic.

Original language	English
Pages	2711-2715
Number of pages	5
Publication status	Published - 2002
Externally published	Yes
Event	GLOBECOM'02 - IEEE Global Telecommunications Conference - Taipei, Taiwan, Province of China Duration: 17 Nov 2002 → 21 Nov 2002

Conference

Conference	GLOBECOM'02 - IEEE Global Telecommunications Conference
Country/Territory	Taiwan, Province of China
City	Taipei
Period	17/11/02 → 21/11/02

Cite this

@conference{efa57c97b56e4239b92de80753a245c1,

title = "Clustering techniques for traffic grooming in optical WDM mesh networks",

abstract = "In this paper, we are trying to study the traffic grooming problem by minimizing overall network cost that includes the transceivers required as well as the number of wavelengths. A mathematical formulation of the traffic grooming problem in mesh networks is proposed. We also describe a heuristic using Blocking Island (BI) paradigm. Simulations have been carried out to prove effectiveness of our heuristic.",

author = "Ding Zhemin and Mounir Hamdi",

year = "2002",

language = "English",

pages = "2711--2715",

note = "GLOBECOM'02 - IEEE Global Telecommunications Conference ; Conference date: 17-11-2002 Through 21-11-2002",

}

TY - CONF

T1 - Clustering techniques for traffic grooming in optical WDM mesh networks

AU - Zhemin, Ding

AU - Hamdi, Mounir

PY - 2002

Y1 - 2002

N2 - In this paper, we are trying to study the traffic grooming problem by minimizing overall network cost that includes the transceivers required as well as the number of wavelengths. A mathematical formulation of the traffic grooming problem in mesh networks is proposed. We also describe a heuristic using Blocking Island (BI) paradigm. Simulations have been carried out to prove effectiveness of our heuristic.

AB - In this paper, we are trying to study the traffic grooming problem by minimizing overall network cost that includes the transceivers required as well as the number of wavelengths. A mathematical formulation of the traffic grooming problem in mesh networks is proposed. We also describe a heuristic using Blocking Island (BI) paradigm. Simulations have been carried out to prove effectiveness of our heuristic.

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

M3 - Paper

AN - SCOPUS:0036966593

SP - 2711

EP - 2715

T2 - GLOBECOM'02 - IEEE Global Telecommunications Conference

Y2 - 17 November 2002 through 21 November 2002

ER -

Clustering techniques for traffic grooming in optical WDM mesh networks

Abstract

Conference

Other files and links

Fingerprint

Cite this