• The KIPS Transactions:PartC
• /
• v.10C no.5
• /
• pp.603-610
• /
• 2003

On the optical network, it is important to build restoration scheme capable to network survivability in preparation of potential failure on communication route. This paper analyze the existing schemes on restoration of failure on the optical network, and propose deferred commit scheme to improve resource utilization and management efficiency. Also, the transfer flow of messages needed for transferring restoration signal are presented in a concrete way and delay time required by shared mesh restoration scheme is explained in a substantial way. Simulation-based comparative analysis of various schemes is performed.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.39 no.11
• /
• pp.1-11
• /
• 2002

To increase network survivability and to guarantee reliable services in MPLS networks, when failures occur either at any link or node of a working path, traffics on the failed path should be switched to other restoration paths. In this paper, we propose a path restoration method using duplication of working paths for link failure and its associated failure detection method, which utilizes OAM cells when all the duplicated links or nodes of the path failed. We analyze the performance of the proposed restoration method and show that especially the method is very efficient to restore high priority traffics. Also, through simulation we prove that the proposed restoration method is superior in performance to several existing methods suggested so far.

• IE interfaces
• /
• v.14 no.2
• /
• pp.148-157
• /
• 2001

This paper considers a network restoration algorithm for all-optical WDM networks. As the increasing traffic and transmission speed, any failure on the networks will lead to loss of huge data and disruption of the services. Therefore, a network restoration algorithm is necessary for the high-speed all-optical networks. This paper suggests a distributed restoration algorithm for line or channel level failures under the dynamic rerouting. For the algorithm, some measures for performance evaluation are explicitly derived and simulation studies are exploited to evaluate its usability by SLAM(Simulation Language for Alternative Modeling) II.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.12
• /
• pp.2744-2754
• /
• 1997

Recently, the Multi-Layer Restoration(MLR) algorithm was proposed by British Telecom(BT) to restore the network failures in Digital Cross-connect System(DCS) mesh survival network[1, 2]. This algorithm has multi restoration stage which is composed of the pre-planned and dynamic restoration. This algorithm is effective its ability in link or node failures. This reason is that it does not restore in the pre-planned rstoration stage but in dynamic restoration stage. In this paper, we propose the MLR with pre-planned Multi-Chooser(PMC) and successive restoration ratio algorithm. This proposed algorithm has a excellent performance for restortion time and ratio, spare channel availability and fast restoration from multiple link failure or node failure. This paper proposed the modeling and restoration algorithm, and analyzed the performance of the algorithm by simulation using OPNET(OPtimized Network Engineering Tools).

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.4B
• /
• pp.306-315
• /
• 2003

On the optical network, it is important to build restoration scheme capable to network survivability in preparation of potential failure on communication route. This analyze the existing schemes on restoration of failure on the optical network, and propose deferred commit scheme to improve resource utilization signal management efficiency. Also, the transfer flow of messages needed for transferring restoration signal are presented in a concrete way and delay time required by shared mesh restoration scheme is explained in a substantial way. Simulation-based comparative analysis of various scheme is performed.

• The KIPS Transactions:PartC
• /
• v.10C no.2
• /
• pp.155-162
• /
• 2003

Fast restoration time and service guarantee are the important goals to achieve the network reliability. In the protection switching scheme, one way to guarantee service fro an application session if a network happens to fail is to establish the restoration path that amounts to the same bandwidth of the working path of the session at the same time. When we setup the restoration path, we can reduce the bandwidth consumption by the restoration path if the path can share the bandwidth required by the other paths. This paper explains the methods how to determine the shared bandwidth of the restoration path in the protection switching scheme, given the maximum bandwidth assigned to a link along the working path. We point out that such sharing algorithm can not reduce the bandwidth consumption by the restoration paths in some cases, which contradict the general conception. We explain why this can happen, and show the simulation results in real network topologies to prove our arguments. We explain the reason of the failure of the sharing effect by the simple sharing algorithm. Finally we propose the way of how we can overcome the failure of the sharing effect, using the complete sharing algorithm based on the link database and showing the results.

• Proceedings of the KIEE Conference
• /
• 1994.07b
• /
• pp.1646-1648
• /
• 1994

In the system of underground transmission line, the rate of electrical failure is very low, but, if once occuring, the failure evolves into a paralysis of the system, the time of restoration is very long, the damage from stopping of power supply is very serious, and the cost of restoration is very great. Because of these problems, you must try to protect the system and equipment from every electrical failure by contributing much carefulness to the design and operation of the underground system. This study summerizes the results of simmulation tests about the effect of installing this protection device on the insulated joint box and the terminal end box.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.11C
• /
• pp.1046-1054
• /
• 2002

In this paper, we propose a subnetwork-based segment restoration scheme to reduce the restoration time and restoration resources. And we compare and analyze the restoration performance according to the size of divided subnetworks. Segment restoration is based on network partitioning where a large network is divided into several small subnetworks and the end-to-end data path is divided into multiple segments according to the subnetworks. In segment restoration, the link/node failure is restored by segment instead of end-to-end path. Because most faults are restored within the subnetwork, the restoration performance can be improved. From the simulation analysis, we verified that the proposed segment restoration has advantage of restoration time and backup resource utilization.

• The Journal of the Korean dental association
• /
• v.19 no.12 s.151
• /
• pp.989-991
• /
• 1981

• The Journal of the Korean dental association
• /
• v.25 no.12 s.223
• /
• pp.1097-1101
• /
• 1987