Solving Static Traffic Grooming with an Auxiliary Graph Model in WDM Mesh Networks

Huaxiong Yao; Zongkai   Yang; Liang Ou; Xiansi  Tan

1st International ICST Conference on Communications and Networking in China

Research Article

Solving Static Traffic Grooming with an Auxiliary Graph Model in WDM Mesh Networks

Cite: BibTeX Plain Text

@INPROCEEDINGS{10.1109/CHINACOM.2006.344860,
    author={Huaxiong Yao and Zongkai   Yang and Liang Ou and Xiansi  Tan},
    title={Solving Static Traffic Grooming with an Auxiliary Graph Model in WDM Mesh Networks},
    proceedings={1st International ICST Conference on Communications and Networking in China},
    publisher={IEEE},
    proceedings_a={CHINACOM},
    year={2007},
    month={4},
    keywords={},
    doi={10.1109/CHINACOM.2006.344860}
}

Huaxiong Yao
Zongkai Yang
Liang Ou
Xiansi Tan
Year: 2007
Solving Static Traffic Grooming with an Auxiliary Graph Model in WDM Mesh Networks
CHINACOM
IEEE
DOI: 10.1109/CHINACOM.2006.344860

Huaxiong Yao¹, Zongkai Yang¹, Liang Ou¹, Xiansi Tan²

1: Dept. Electronic and Information engineering, Huazhong University of Science and Technology, Wuhan, China, 430074
2: Air Force Radar Academy, Wuhan, China, 430019

Abstract

As optical networks grow form SONET rings to arbitrary mesh topology, traffic grooming on wavelength-division multiplexing (WDM) mesh networks have become an extremely important research issue. To solve this problem, we propose a transceiver saving auxiliary graph (TSAG) model for traffic grooming in WDM mesh networks. Based on the proposed auxiliary graph, the number of transceivers utilized can be greatly reduced for static traffic grooming. This was validated by simulation results, which also shows that the TSAG model has higher throughput compared to other auxiliary graph models.

Published: 2007-04-10
Publisher: IEEE

: http://dx.doi.org/10.1109/CHINACOM.2006.344860