Abstract
In this presentation, we introduce a fast restoration scheme against a link or node failure. Specifically, we apply this scheme to VP (Virtual Path) restoration in ATM (Asynchronous Transfer Mode) networks. Proposed restoration scheme operates on VP-based ATM network. This scheme is a distributed algorithm performed concurrently by network nodes neighboring failed node or link. When a node or link fails, restoration is performed according to the pre-assigned local, regional, and end-to-end restoration scheme. For this, we assigned a restoration level to each network nodes and VPs, respectively. Also, we devise and construct a VP loop, and fast restoration is performed along this loop. This loop is expanded when a failure occurs, and this expanded loop is used for the restoration of the failed VP connection. We define the required VP loop architecture, restoration messages, and restoration procedures. Proposed algorithm is simulated and compared with general flooding restoration scheme. Results show that the proposed loop-expanding restoration scheme can achieve fast restoration goal with a lower burden to network.
| Original language | English |
|---|---|
| Pages | 513-522 |
| Number of pages | 10 |
| Publication status | Published - 1998 |
| Event | Proceedings of the 1998 IEEE Network Operations and Management Symposium. Part 1 (of 3) - New Orleans, LA, USA Duration: 1998 Feb 15 → 1998 Feb 20 |
Other
| Other | Proceedings of the 1998 IEEE Network Operations and Management Symposium. Part 1 (of 3) |
|---|---|
| City | New Orleans, LA, USA |
| Period | 98/2/15 → 98/2/20 |
All Science Journal Classification (ASJC) codes
- Hardware and Architecture
- Electrical and Electronic Engineering