Abstract
Using backup virtual paths (BVPs) has been proposed as one of the approaches to restore failed VPs in ATM networks. This scheme simplifies the restoration process but may require longer restoration time and larger number of VPIs. In this paper, we propose the Ring BVP (RBVP) scheme which overcomes the longer restoration time and the overprovisioning problems of the previously proposed BVP scheme. The RBVP scheme maintains some number of ring shaped BVPs for each elementary cycle (e-cycle; a shortest possible cycle containing a specific edge) and allows all the links in an e-cycle to share the corresponding RBVP for any link failures in the e-cycle. Since in the RBVP scheme the restoration process is localized only to a failed link, failed VPs can be restored almost twice faster than the previously proposed BVP scheme. Also since a RBVP can be shared by more than one VPs, less number of VPIs are allocated for the VP restoration.
| Original language | English |
|---|---|
| Pages | 1383-1387 |
| Number of pages | 5 |
| State | Published - 1997 |
| Event | Proceedings of the 1997 IEEE Global Telecommunications Conference. Part 2 (of 3) - Phoenix, AZ, USA Duration: 3 Nov 1997 → 8 Nov 1997 |
Conference
| Conference | Proceedings of the 1997 IEEE Global Telecommunications Conference. Part 2 (of 3) |
|---|---|
| City | Phoenix, AZ, USA |
| Period | 3/11/97 → 8/11/97 |