Share Email Print
cover

Proceedings Paper

Capacity planning of link restorable optical networks under dynamic change of traffic
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

Future backbone networks shall require full-survivability and support dynamic changes of traffic demands. The Generalized Survivable Networks (GSN) was proposed to meet these challenges. GSN is fully-survivable under dynamic traffic demand changes, so it offers a practical and guaranteed characterization framework for ASTN / ASON survivable network planning and bandwidth-on-demand resource allocation4. The basic idea of GSN is to incorporate the non-blocking network concept into the survivable network models. In GSN, each network node must specify its I/O capacity bound which is taken as constraints for any allowable traffic demand matrix. In this paper, we consider the following generic GSN network design problem: Given the I/O bounds of each network node, find a routing scheme (and the corresponding rerouting scheme under failure) and the link capacity assignment (both working and spare) which minimize the cost, such that any traffic matrix consistent with the given I/O bounds can be feasibly routed and it is single-fault tolerant under the link restoration scheme. We first show how the initial, infeasible formal mixed integer programming formulation can be transformed into a more feasible problem using the duality transformation of the linear program. Then we show how the problem can be simplified using the Lagrangian Relaxation approach. Previous work has outlined a two-phase approach for solving this problem where the first phase optimizes the working capacity assignment and the second phase optimizes the spare capacity assignment. In this paper, we present a jointly optimized framework for dimensioning the survivable optical network with the GSN model. Experiment results show that the jointly optimized GSN can bring about on average of 3.8% cost savings when compared with the separate, two-phase approach. Finally, we perform a cost comparison and show that GSN can be deployed with a reasonable cost.

Paper Details

Date Published: 6 December 2005
PDF: 11 pages
Proc. SPIE 6022, Network Architectures, Management, and Applications III, 602213 (6 December 2005); doi: 10.1117/12.636252
Show Author Affiliations
Kwok Shing Ho, The Chinese Univ. of Hong Kong (Hong Kong China)
Kwok Wai Cheung, The Chinese Univ. of Hong Kong (Hong Kong China)


Published in SPIE Proceedings Vol. 6022:
Network Architectures, Management, and Applications III
Kwok-wai Cheung; Gee-Kung Chang; Guangcheng Li; Ken-Ichi Sato, Editor(s)

© SPIE. Terms of Use
Back to Top