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.

[1]  Andre Girard,et al.  Routing and Dimensioning in Circuit-Switched Networks , 1990 .

[2]  Zbigniew Dziong,et al.  Fair-efficient call admission control policies for broadband networks—a game theoretic framework , 1996, TNET.

[3]  Yijun Xiong,et al.  Virtual network concept and its applications for resource management in ATM based networks , 1996, Proceedings of the International IFIP-IEEE Conference on Broadband Communications, Global Infrastructure for the Information Age.

[4]  Mohammad S. Obaidat,et al.  Learning automata-based bus arbitration for shared-medium ATM switches , 2002, IEEE Trans. Syst. Man Cybern. Part B.

[5]  Zbigniew Dziong,et al.  Virtual network concept and its applications for resource management in ATM based networks , 1996 .

[6]  Hyong S. Kim,et al.  Joint optimization of capacity and flow assignment for self-healing ATM networks , 1995, Proceedings IEEE International Conference on Communications ICC '95.

[7]  Mohammad S. Obaidat,et al.  DRA: a new buffer management scheme for wireless atm networks using aggregative large deviation principle , 2003, Comput. Commun..

[8]  Yu Liu,et al.  Approximating optimal spare capacity allocation by successive survivable routing , 2005, TNET.

[9]  Wayne D. Grover,et al.  Near optimal spare capacity planning in a mesh restorable network , 1991, IEEE Global Telecommunications Conference GLOBECOM '91: Countdown to the New Millennium. Conference Record.

[10]  Moshe Dror,et al.  Fiberoptic circuit network design under reliability constraints , 1989, IEEE J. Sel. Areas Commun..

[11]  John C. McDonald,et al.  Public network integrity-avoiding a crisis in trust , 1994, IEEE J. Sel. Areas Commun..

[12]  I. Woungang,et al.  Comparison of the VP, CVP and VN approaches in ATM network design , 1999, IEEE ATM Workshop '99 Proceedings (Cat. No. 99TH8462).

[13]  Mohammad S. Obaidat,et al.  Modeling and Simulation of Adaptive Available Bit Rate Voice over Asynchronous Transfer Mode Networks , 2002, Simul..

[14]  Subrahmanyam Dravida,et al.  Fast restoration of ATM networks , 1994, IEEE J. Sel. Areas Commun..

[15]  Debasis Mitra,et al.  Erlang capacity and uniform approximations for shared unbuffered resources , 1994, TNET.

[16]  M. Herzberg,et al.  The hop-limit approach for spare-capacity assignment in survivable networks , 1995, TNET.

[17]  M. Minoux,et al.  Subgradient optimization and large scale programming : an application to optimum multicommodity network synthesis with security constraints , 1981 .

[18]  Hideki Sakauchi,et al.  A self-healing network with an economical spare-channel assignment , 1990, [Proceedings] GLOBECOM '90: IEEE Global Telecommunications Conference and Exhibition.

[19]  J. Bicknell,et al.  A fast distributed network restoration algorithm , 1993, Proceedings of Phoenix Conference on Computers and Communications.

[20]  Aurel A. Lazar,et al.  Virtual path control for ATM networks with call level quality of service guarantees , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[21]  Lorne Mason,et al.  Restoration strategies and spare capacity requirements in self-healing ATM networks , 1997, Proceedings of INFOCOM '97.

[22]  Mohammad S. Obaidat,et al.  An efficient adaptive bus arbitration scheme for scalable shared-medium ATM switch , 2001, Comput. Commun..

[23]  Lorne Mason,et al.  Comparison of two path restoration schemes in self-healing networks , 2002, Comput. Networks.