By Topic

Design of WDM networks under economy of scale pricing and 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., Toronto Univ., Ont. ; Zhi-Quan Luo

Given a combination of unprotected and dedicated edge-disjoint path (1+1) protected connection requests and a finite set of fiber types, we consider the problem of allocating fibers on the links of a WDM network at minimum cost, such that all connection requests can be simultaneously realized. Each fiber type, is characterized by its capacity and its cost per unit length, where costs reflect an economy of scale. It is known that a solution induced by "simply" routing each unprotected (respectively 1+1 protected) connection along the shortest path (respectively shortest pair of edge-disjoint paths) minimizes the total wavelength mileage, but may not minimize the total fiber cost. In this paper, we quantify the increase in fiber cost due to shortest path routing. In particular, we prove that the total cost of a shortest path based solution is guaranteed to lie within a certain factor of the minimum possible cost. This leads also to the fact that shortest path routing is asymptotically cost-optimal for a large total number of connection requests. Furthermore, for sparse topologies, e.g., the ring, the ShuffleNet and the mesh(-torus), we show that shortest path routing is asymptotically cost-optimal in large-scale networks supporting all-to-all communication. En route, we prove that by shortest path routing we obtain a provably optimal solution to the linear programming (LP-) relaxation of the problem. We have thus presented a provably good upper bound and a lower bound on the total fiber cost, that can be computed in polynomial-time. These bounds can be used as benchmarks against which heuristic approaches are compared

Published in:

Selected Areas in Communications, IEEE Journal on  (Volume:24 ,  Issue: 4 )