By Topic

Wavelength Selective WDM Network Design: How Bad is Shortest Path Routing?

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)
Saad, M. ; Dept. of Electr. & Comput. Eng., Univ. of Sharjah, Sharjah, United Arab Emirates ; Zhi-Quan Luo

Given a collection of lightpath requests, we consider the problem of allocating fibers to the links of a WDM network at minimum cost, such that all lightpath requests can be simultaneously realized. It is known that, under modular fiber capacity assumptions, shortest path routing may not minimize the total fiber cost. In this paper, we extend our previous work for wavelength convertible networks, and theoretically quantify the increase in fiber cost due to shortest path routing in networks without wavelength converters. In particular, we prove that shortest path routing is asymptotically cost-optimal in heavily loaded networks, and asymptotically near-optimal in large, sparse networks that support all-to-all communication.

Published in:

Signal Processing and Communications, 2007. ICSPC 2007. IEEE International Conference on

Date of Conference:

24-27 Nov. 2007