Design of a Fast Restoration Mechanism for Virtual Path-Based ATM Networks

Authors:
Chao-Ju Hou
Affiliations:
-
Venue:
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Year:
1997

Citing 3
Cited 4

Data networks

Data networks
The Asynchronous Transfer Mode: a tutorial

Computer Networks and ISDN Systems - Special issue on the ATM—asynchronous transfer mode
Optimizing the system of virtual paths

IEEE/ACM Transactions on Networking (TON)

Routing Virtual Circuits with Temporal QoS Requirements in Virtual Path-Based ATM Networks

IEEE Transactions on Computers
An agent based adaptive bandwidth allocation scheme for multimedia applications

Journal of Systems and Software - Special issue: Adaptive multimedia computing
Admission of high priority real-time calls in an ATM network via bandwidth reallocation and dynamic rerouting of active channels

RTSS'10 Proceedings of the 21st IEEE conference on Real-time systems symposium
An improved scheme for self-healing in ATM networks

Computer Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we propose a fast restoration mechanism for virtual path-based ATM networks. Given an ATM network topology, the capacity of each physical link, and the primary virtual path (VP) layout at system initialization, the proposed mechanism pre-assigns to each primary VP one backup VP such that (P1) the failure of a single node/link does not lead to the failure of both the primary and backup VPs, (P2) the alternate backup VP is routed on a path with the shortest hop count among all possible paths with sufficient bandwidth between the two VP terminators, and (P3) the maximum link load is minimized.During system operation, if a physical node/link fails, the proposed mechanism restores the VPs that traverse the failed node/link simply by redirecting cells on the failed VPs to their corresponding backup VPs. Moreover, the proposed mechanism also locates (i) new VPs for injured backup VPs that traverse the failed node/link, and (ii) second-generation backup VPs for newly-activated backup VPs that replace their corresponding failed primary VPs, both in a decentralized manner.We elaborate on all the component algorithms, and discuss how to configure the functionalities as software daemons that reside at each network node. The proposed mechanism is shown via event-driven simulation to be practically feasible in fast restoring failed VPs in a cost effective manner.