Scheduled System Maintenance:
Some services will be unavailable Sunday, March 29th through Monday, March 30th. We apologize for the inconvenience.
By Topic

Single and multipath logical topology design and traffic grooming algorithm in IP over WDM 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
$31 $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)
Kwangil Lee ; Dept. of Electr. & Comput. Eng. & Inst. for Syst. Res., Maryland Univ., College Park, MD, USA ; Shayman, M.

In this paper we investigate single- and multipath logical topology design and traffic grooming algorithms. Since the problem of the optimal logical topology design for all traffic demands is NP-complete, we design a logical topology by sequentially constructing the shortest path for one source-destination pair at a time. In the single path case, the demand for each source-destination pair must be routed on a single path. In the multipath case, if it is not feasible to route a demand on a single path, the traffic demand is divided into multiple subdemands and a path is provided for each subdemand. Each path is a locally optimized path in the sense that there are no other paths with less hop count that may be constructed from existing links and newly created links. We propose heuristic algorithms for logical topology design and traffic grooming in both the single path and multipath cases. The performance of these algorithms in terms of weighted hop count and throughput is evaluated using the GLASS/SSF simulator. The results indicate that a proposed single path algorithm outperforms other known algorithms in terms of weighted hop count and throughput. Also, we observed that multipath algorithms improve network throughput and a multipath algorithm with widest-shortest paths reduces the weighted hop count compared to single path algorithms.

Published in:

Computer Communications and Networks, 2003. ICCCN 2003. Proceedings. The 12th International Conference on

Date of Conference:

20-22 Oct. 2003