Erlang capacity and uniform approximations for shared unbuffered resources
IEEE/ACM Transactions on Networking (TON)
The hop-limit approach for spare-capacity assignment in survivable networks
IEEE/ACM Transactions on Networking (TON)
Fair-efficient call admission control policies for broadband networks—a game theoretic framework
IEEE/ACM Transactions on Networking (TON)
Restoration strategies and spare capacity requirements in self-healing ATM networks
IEEE/ACM Transactions on Networking (TON)
Routing and Dimensioning in Circuit-Switched Networks
Routing and Dimensioning in Circuit-Switched Networks
Comparison of two path restoration schemes in self-healing networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Virtual path control for ATM networks with call level quality of service guarantees
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
Learning automata-based bus arbitration for shared-medium ATM switches
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
An efficient adaptive bus arbitration scheme for scalable shared-medium ATM switch
Computer Communications
Fiberoptic circuit network design under reliability constraints
IEEE Journal on Selected Areas in Communications
Public network integrity-avoiding a crisis in trust
IEEE Journal on Selected Areas in Communications
Fast restoration of ATM networks
IEEE Journal on Selected Areas in Communications
Survivable ATM mesh networks: Techniques and performance evaluation
Journal of Systems and Software
Performance evaluation of bandwidth allocation in ATM networks
International Journal of Business Information Systems
| Hi-index | 0.24 |
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.