• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.47 no.11
• /
• pp.49-58
• /
• 2010

In this paper, we present a methodology for fast segment restoration under multiple simultaneous link failures in mesh-type MPLS networks. The salient feature of the methodology is that both resilience and QoS constraint conditions have been taken into account for fast segment restoration. For fast restoration, a sufficient condition for testing the existence of backup segments with guaranteed-resilience has been derived for a mesh-type MPLS network. The algorithms for constructing backup segments which can meet both resilience and QoS constraint conditions are then presented with illustrating examples. Finally, simulation has been done to show the efficiency of the proposed segment restoration algorithms.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.7
• /
• pp.1541-1548
• /
• 2012

This paper proposes a new multipath-based routing protocol on MANETs with Fast-Recovery of failures. The proposed protocol establishes the primary and secondary paths between a source and a destination considering the end-to-end packet reception reliability of routes. The primary path is used to transmit messages, and the secondary path is used to recover the path when detecting failures on the primary path. If a node detects a link failure during message transmission, it can recover the path locally by switching from the primary to the secondary path. By allowing the intermediate nodes to recover locally the route failure, the proposed protocol can reduce the number of packet loss and the amount of control packets for setting up new paths. The simulation result using QualNet simulator shows that the proposed protocol was about 10-20% higher than other protocols in terms of end-to-end message delivery ratio and the fault recovery time in case of link fault was about 3 times faster than the other protocols.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.6B
• /
• pp.728-737
• /
• 2011

For the real time monitoring and tracking of shipping container which is one of the core objects for global logistics, Wireless Ad-Hoc Network technology might be needed in stacking environments such as ports, yards and ships. In this paper, we propose a container network routing protocol suitable for port or yard stacking environments which include some constraints such as shadow area problem from metal material, frequent movement of container, etc. With this protocol in which a mesh network algorithm is applied, every container data packet can be delivered to the sink node reliably even with frequent join/leave of container nodes. As soon as a node on path gets malfunction, alternative backup path is supported with notice to neighbor node, which makes constant total optimal path. We also verified that the performance of proposed protocol is better than AODV, one of previous major MANet(Mobile Ad-Hoc Network) protocol with a function for alternative path, which says the proposed protocol is better for frequent join/leave and variable link quality.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.1
• /
• pp.233-241
• /
• 2013

One fundamental issue in ad hoc networks is the alternative node election problem, which reflects how well a sensor network is monitored or tracked by sensors. In this paper, we proposed EEAP(Energy-Efficient Alternative Paths). This is a method of selecting an alternative node for path routing management. When some node disconnection on the path routing, using pre-selected backup node provides immediately recover the path recovery. When selecting an alternative node of Step-Parents head node on the path management, the node's energy level and distance information are cared in context-awareness. This is not only increased the system's capacity cost effectively, but also reduce transmission power entire nodes consume energy. As a result, each node could efficiently management and improves the life time for mobile host and extends system coverage.

• 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.

• ETRI Journal
• /
• v.29 no.4
• /
• pp.524-526
• /
• 2007

In this letter, we study the multicast protection problem in sparse-splitting wavelength-division multiplexing (WDM) optical network, and propose a novel multicast protection algorithm called the shared source-leaf path-based protection (SLPP) algorithm. Unlike the proposals in previous studies, the backup paths derived by SLPP can share wavelength with the primary tree in sparse-splitting WDM networks. Simulations are used to evaluate the effectiveness of the SLPP algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.10B
• /
• pp.841-848
• /
• 2004

In case of failure in the IP network services should be provided via a backup path which fully meets QoS requirements. In this regard, we in this paper suggest simple-PFC(5-PFC) to restore single link failure, iterative-PFC(i-PFC) for multiple link failures, and fault_node Avoidance-PFC(a-PFC) for failures of nodes such as routers. Taking the minimum cost rerouting problem into account, we compare and analyze performance of those three mechanisms carrying out Direct_destination Rerouting(DR).

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.10c
• /
• pp.378-380
• /
• 2000

재경로설정이란 MPLS 망에서 보호해야 할 트래픽이 노드나 링크가 에러이거나 혼잡이 발생했을 때 대체경로로 그 트래픽을 우회시켜 신뢰성 있는 서비스를 제공하는 기술이다. 본 논문에서 제안하는 기법은 QoS 및 최단경로를 고려하여 동적으로 대체(backup) 경로를 설정하는 방법이다. 노드 에러를 탐지했을 경우에는 에러를 탐지한 노드가 에러가 발생한 노드의 다음 노드까지 QoS 및 최단경로를 고려하여 대체 경로를 설정하고 링크 에러를 탐지했을 경우에는 두 노드 사이에 QoS 및 최단경로를 고려하여 대체 경로를 설정함으로써 신뢰성 있는 데이터 전송을 보장할 수 있다. 본 논문에서 제안하는 기법의 타당성을 검증하기 위하여 시뮬레이션을 통하여 기존에 제안된 기법들과 비교 분석한다.

• Proceedings of the IEEK Conference
• /
• 2003.11c
• /
• pp.227-230
• /
• 2003

Mobile SCTP (mSCTP) is a new scheme which can be used to provide seamless handover for the mobile node. The reason that is possible is because of the SCTP extension which provides a method to reconfigure IP address on an existing SCTP association (ADDIP). While mSCTP focuses on an association originated ken mobile node (MN) toward fixed correspondent node (CN), mSCTP with Mobile IP support an association originated from CN toward MN by using the Home Agent in Mobile IP and location management. However, there are still some problems related to communication interruption. In this paper, we present a new scheme to solve these problems. The main idea of this scheme is using the home address of MN as a backup path of an SCTP association.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.9B
• /
• pp.791-798
• /
• 2004

In case of failure in the IP network, services should be provided via a backup path which fully meets QoS requirements. In this regard, we in this paper suggest simple-PFC(s-PFC) to restore single link failure, iterative-PFC(i-PFC) for multiple link failures, and fault_node Avoidance-PFC(a-PFC) for failures of nodes such as routers. Taking the minimum cost rerouting problem into account, we compare and analyze performance of those three mechanisms carrying out Direct-destination Rerouting(DR).