Practical dynamic traffic grooming in large WDM mesh networks

Quang-Dzung Ho; Man-Seop Lee

2nd International ICST Conference on Broadband Networks

Research Article

Practical dynamic traffic grooming in large WDM mesh networks

Cite: BibTeX Plain Text

@INPROCEEDINGS{10.1109/ICBN.2005.1589744,
    author={Quang-Dzung Ho and Man-Seop Lee},
    title={Practical dynamic traffic grooming in large WDM mesh networks},
    proceedings={2nd International ICST Conference on Broadband Networks},
    publisher={IEEE},
    proceedings_a={BROADNETS},
    year={2006},
    month={2},
    keywords={},
    doi={10.1109/ICBN.2005.1589744}
}

Quang-Dzung Ho
Man-Seop Lee
Year: 2006
Practical dynamic traffic grooming in large WDM mesh networks
BROADNETS
IEEE
DOI: 10.1109/ICBN.2005.1589744

Quang-Dzung Ho¹^,*, Man-Seop Lee¹

1: Optical Internet Research Center (O IRC), Information an d Communications University

*Contact email: hqdung@icu.ac.kr

Abstract

The problem of dynamic traffic grooming in optical mesh networks is usually solved by applying the Dijsktra's algorithm on an auxiliary graph. Although such algorithms can give very good performance since they have a global view of the whole network, they are very time-consuming and thus cannot be applied in large networks. Therefore, maybe for the first time, we propose a heuristic algorithm to reduce the required computations by minimizing the size of the graph. The simulations in a typical mesh network conclusively demonstrate that our algorithm is very time-efficient while performing better than existing algorithms

Published: 2006-02-13
Publisher: IEEE

: http://dx.doi.org/10.1109/ICBN.2005.1589744