8 February 2005 Framework for planning survivable optical mesh network with dynamic demands and single-link failure protection
Author Affiliations +
Abstract
We introduce a new survivable network concept called the “Generalized Survivable Network” (GSN), which has the special property that it remains survivable no matter how traffic is provisioned dynamically, as long as the input and output constraints at the nodes are fixed. We study a network synthesis problem called the Virtual Topology Mapping Problem (VTMP), which aims at finding the edge capacities for a given physical network topology with the I/O constraints at the nodes that will make it a GSN. Two concepts, tau-matization and sigma-tization are introduced. Tau-matization refers to the conversion of any physical network into a non-blocking network. Sigma-tization refers to the conversion of a multi-edge-connected network into a fully survivable network with the necessary edge capacities. We develop a basic framework for solving the VTMP problem of GSN. We obtain a lower bounding procedure, an upper bounding procedure and a heuristic called MMRA for solving the tau-matization problem. The lower bounding procedure has a very nice analytic form that can be solved by the simplex method in polynomial time. Some experimental results are given. We have shown that the actual cost of developing a GSN with the MMRA heuristic is within 10 - 35% from the absolute lower bound and much less than the tremendous cost that is generally thought would be needed to realize a GSN (a reduction of 85% to 95% from the upper bound). The framework is applicable to ASTN / ASON survivable network planning and bandwidth-on-demand resource allocation.
© (2005) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Kwok-Shing Ho, Kwok-wai Cheung, "Framework for planning survivable optical mesh network with dynamic demands and single-link failure protection", Proc. SPIE 5626, Network Architectures, Management, and Applications II, (8 February 2005); doi: 10.1117/12.576980; https://doi.org/10.1117/12.576980
PROCEEDINGS
11 PAGES


SHARE
Back to Top