상세정보
학술대회
MPLS Restoration Scheme Using Least-Cost Based Dynamic Backup Path
- 저자
- 안개일, Woojik Chun
- 발행일
- 200107
- 출처
- International Conference on Networking (ICN) 2001 (LNCS 2094), pp.319-328
- 협약과제
- 01MK1200, 사이버순찰 및 침입방어를 위한 네트워크 보안제어기술 개발, 손승원
- 초록
- The path restoration in MPLS is the technique to reroute traffic around a failure in a LSP. The existing path restoration schemes have some difficulty in solving problem such as resource utilization and protection of backup path. This paper proposes a dynamic path restoration scheme using the least-cost based backup path, which may increase resource utilization and protect backup path without requiring longer restoration times. In the proposed scheme, each node on working path has candidate nodes that may become an egress node of backup path. The node that detects a failure finds a node out of the candidate nodes that is used as splicing node of backup path at the lease cost. And then it establishes new backup path up to the node in order to reroute traffic on working path to the backup path. Through simulation, the performance of the proposed scheme is measured and compared with the existing scheme in terms of packet loss, re-ordering of packets, concurrent faults, and resource utilization.
- KSP 제안 키워드
- Backup path, Path Restoration, each node, packet loss, re-ordering, resource utilization