By Topic

Practical dynamic traffic grooming in large WDM mesh networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Quang-Dzung Ho ; Opt. Internet Res. Center, Inf. & Commun. Univ., Daejeon, South Korea ; Man-Seop Lee

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 in:

2nd International Conference on Broadband Networks, 2005.

Date of Conference:

7-7 Oct. 2005