Share Email Print

Proceedings Paper

Provisioning connections of different bandwidth granularities in large optical WDM mesh networks with multi-hop grooming capability
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

Dynamic traffic grooming in optical mesh networks is one of the most important and practical problems for designing WDM networks. Most of previous work solves it by applying the Dijsktra's algorithm on an auxiliary graph. Although those 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, we propose a heuristic algorithm to reduce the required computations by minimizing the size of the graph. We compare our algorithm with existing algorithms by extensive simulations. The results demonstrate that our algorithm can significantly reduce the computational complexity and outperform existing algorithms by large margins since it can easily avoid resource-inefficient lightpaths.

Paper Details

Date Published: 28 September 2006
PDF: 9 pages
Proc. SPIE 6354, Network Architectures, Management, and Applications IV, 63542C (28 September 2006); doi: 10.1117/12.691252
Show Author Affiliations
Quang-Dzung Ho, Information and Communications Univ. (South Korea)
Man-Seop Lee, Information and Communications Univ. (South Korea)

Published in SPIE Proceedings Vol. 6354:
Network Architectures, Management, and Applications IV
Yong Hyub Won; Gee-Kung Chang; Ken-ichi Sato; Jian Wu, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?