On the problem of capacity allocation and flow assignment in self-healing ATM networks
In the current overlay transport networks, IP/ATM/SONET/DWDM, each layer manages its own control plane, each control plane acting independently of what happens in the other. In the course of recent years, the generalized multi-protocol label switching (GMPLS) has emerged as the new unified control plane for all the above transport layers. As such, the already installed ATM core resource management features must be reused as a particular implementation of GMPLS, either directly or with some adaptations. Among such transferable research work are studies related to the problem of capacity allocation and flow assignment in self-healing ATM networks. This problem has been investigated by many authors, using two main design approaches: the path-based and the link-based approaches. In the path-based design approach, the focus in almost all proposed solutions has been to determine the optimal spare capacity and backup virtual paths (BVPs) allocation for all traffic flows. To our knowledge, no study has been done to quantify the impact of the selection of BVPs on the optimized spare capacity allocation (SCA). In this paper, we address this issue by comparing four SCA design schemes quantitatively in terms of spare capacity requirements (SCRs). The comparison is based on spare optimization, a single link failure or node failure scenario, and 100% restoration. We also introduce a link-based design approach of the above problem and show that the solution obtained is adequate in terms of grade of service and quality of service requirements. (C) 2007 Elsevier B.V. All rights reserved.
flow assignment self-healing link-based approach spare capacity allocation atm network design path-based approach