• Title/Summary/Keyword: fast-recovery of failures

Search Result 14, Processing Time 0.024 seconds

MRFR - Multipath-based Routing Protocol with Fast-Recovery of Failures on MANETs

  • Ngo, Hoai Phong;Kim, Myung Kyun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.7 no.2
    • /
    • pp.271-287
    • /
    • 2013
  • We propose a new multipath-based reliable routing protocol on MANETs, Multipath-based Reliable routing protocol with Fast-Recovery of failures (MRFR). For reliable message transmission, MRFR tries to find the most reliable path between a source and a destination considering the end-to-end packet reception reliability of the routes. The established path consists of a primary path that is used to transmit messages, and the secondary paths that are used to recover the path when detecting failures on the primary path. After establishing the path, the source transmits messages through 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 locally recover the route failure, the proposed protocol can handle the dynamic topological change of the MANETs efficiently. The simulation result using the QualNet simulator shows that the MRFR protocol performs better than other protocols in terms of the end-to-end message delivery ratio and fault-tolerance capability.

MRFR - Multipath-based Routing Protocol with Fast-Recovery of Failures on MANETs

  • Ngo, Hoai Phong;Kim, Myung Kyun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.6 no.12
    • /
    • pp.3081-3099
    • /
    • 2012
  • We propose a new multipath-based reliable routing protocol on MANETs, Multipath-based Reliable routing protocol with Fast-Recovery of failures (MRFR). For reliable message transmission, MRFR tries to find the most reliable path between a source and a destination considering the end-to-end packet reception reliability of the routes. The established path consists of a primary path that is used to transmit messages, and the secondary paths that are used to recover the path when detecting failures on the primary path. After establishing the path, the source transmits messages through 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 locally recover the route failure, the proposed protocol can handle the dynamic topological change of the MANETs efficiently. The simulation result using the QualNet simulator shows that the MRFR protocol performs better than other protocols in terms of the end-to-end message delivery ratio and fault-tolerance capability.

Fast Recovery Routing Algorithm for Software Defined Network based Operationally Responsive Space Satellite Networks

  • Jiang, Lei;Feng, Jing;Shen, Ye;Xiong, Xinli
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.7
    • /
    • pp.2936-2951
    • /
    • 2016
  • An emerging satellite technology, Operationally Responsive Space (ORS) is expected to provide a fast and flexible solution for emergency response, such as target tracking, dense earth observation, communicate relaying and so on. To realize large distance transmission, we propose the use of available relay satellites as relay nodes. Accordingly, we apply software defined network (SDN) technology to ORS networks. We additionally propose a satellite network architecture refered to as the SDN-based ORS-Satellite (Sat) networking scheme (SDOS). To overcome the issures of node failures and dynamic topology changes of satellite networks, we combine centralized and distributed routing mechanisms and propose a fast recovery routing algorithm (FRA) for SDOS. In this routing method, we use centralized routing as the base mode.The distributed opportunistic routing starts when node failures or congestion occur. The performance of the proposed routing method was validated through extensive computer simulations.The results demonstrate that the method is effective in terms of resoving low end-to-end delay, jitter and packet drops.

Faster Detouring for Data Plane Failures in Software Defined Networks (SDN에서 데이터 평면 장애를 해결하는 빠른 우회 기법)

  • Thorat, Pankaj;Yeom, Sanggil;Choo, Hyunseung
    • Annual Conference of KIPS
    • /
    • 2016.04a
    • /
    • pp.124-126
    • /
    • 2016
  • Successful deployment of the Software Defined Network (SDN) depends on its ability to cope up with network failures. There are various types of failures that may occur in an SDN. The most common are switch and link failures. It is necessary to recover the network from failures for a continuous service availability. But for the real-time services fast recovery from the failure is required to minimize the service disruption time. In the proposed work, we focused on minimizing the recovery time after the failure is detected. Once the failure is detected, the controller involvement is needed to dynamically reroute the failure disrupted flows from the failed component to an alternate path. The aim of the proposed scheme is to provide a traffic management scheme which can react to the dynamic network events by rapidly modifying the forwarding behavior of the switches for faster in-band network adaptability. The proposed scheme (1) Considers the shared data and control path delay (2) Optimally utilize the network resources (3) Eliminates the need of constant monitoring overhead at the controller which results into faster detouring and ultimately rapid recovery.

A Routing Protocol with Fast-Recovery of Failures Using Backup Paths on MANETs (MANET에서 백업경로를 이용한 빠른 경로복구 능력을 가진 라우팅 프로토콜)

  • Thai, Ahn Tran;Kim, Myung-Kyun
    • 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.

Large Scale Failure Adaptive Routing Protocol for Wireless Sensor Networks (무선 센서 네트워크를 위한 대규모 장애 적응적 라우팅 프로토콜)

  • Lee, Joa-Hyoung;Seon, Ju-Ho;Jung, In-Bum
    • The KIPS Transactions:PartA
    • /
    • v.16A no.1
    • /
    • pp.17-26
    • /
    • 2009
  • Large-scale wireless sensor network are expected to play an increasingly important role for the data collection in harmful area. However, the physical fragility of sensor node makes reliable routing in harmful area a challenging problem. Since several sensor nodes in harmful area could be damaged all at once, the network should have the availability to recover routing from node failures in large area. Many routing protocols take accounts of failure recovery of single node but it is very hard these protocols to recover routing from large scale failures. In this paper, we propose a routing protocol, which we refer to as LSFA, to recover network fast from failures in large area. LSFA detects the failure by counting the packet loss from parent node and in case of failure detection LSFAdecreases the routing interval to notify the failure to the neighbor nodes. Our experimental results indicate clearly that LSFA could recover large area failures fast with less packets than previous protocols.

FTCARP: A Fault-Tolerant Routing Protocol for Cognitive Radio Ad Hoc Networks

  • Che-aron, Zamree;Abdalla, Aisha Hassan;Abdullah, Khaizuran;Rahman, Md. Arafatur
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.2
    • /
    • pp.371-388
    • /
    • 2014
  • Cognitive Radio (CR) has been recently proposed as a promising technology to remedy the problems of spectrum scarcity and spectrum underutilization by enabling unlicensed users to opportunistically utilize temporally unused licensed spectrums in a cautious manner. In Cognitive Radio Ad Hoc Networks (CRAHNs), data routing is one of the most challenging tasks since the channel availability and node mobility are unpredictable. Moreover, the network performance is severely degraded due to large numbers of path failures. In this paper, we propose the Fault-Tolerant Cognitive Ad-hoc Routing Protocol (FTCARP) to provide fast and efficient route recovery in presence of path failures during data delivery in CRAHNs. The protocol exploits the joint path and spectrum diversity to offer reliable communication and efficient spectrum usage over the networks. In the proposed protocol, a backup path is utilized in case a failure occurs over a primary transmission route. Different cause of a path failure will be handled by different route recovery mechanism. The protocol performance is compared with that of the Dual Diversity Cognitive Ad-hoc Routing Protocol (D2CARP). The simulation results obviously prove that FTCARP outperforms D2CARP in terms of throughput, packet loss, end-to-end delay and jitter in the high path-failure rate CRAHNs.

Methodology of Resilient Dynamic Path Management in GMPLS Network under Multiple Link Failures (GMPLS 네트워크에서 다중 경로 장애 발생시 Resilience를 만족하는 동적 경로 관리 방법)

  • Park Jong-Tae;Lee Wee-Hyuk;Kwon Jung-Ho
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.5B
    • /
    • pp.397-404
    • /
    • 2006
  • As an increase in recent optical network-based IP services, GMPLS management framework becomes more important than ever before. In this paper, we propose the dynamic GMPLS path management algorithm, which can satisfy the users with their traffic engineering recovery requirements and find out the best backup service path under multiple link failures. To be more specific, we are deriving the soluble conditions of a backup path which is satisfied in a GMPLS network. In addition, through proposing the fast backup path selection algorithm, we can sufficiently satisfy a user's recovery requirement and minimally protect the suspension of the service against a link failure.

WDM Optical Network Restoration and Spare Resource Planning using Multiple Ring-Cover (다중 링 구조를 이용한 WDM 통신망 복구 및 자원 예약 기법)

  • Hwang, Ho-Young;Lim, Sung-Soo
    • The KIPS Transactions:PartC
    • /
    • v.12C no.6 s.102
    • /
    • pp.891-900
    • /
    • 2005
  • This paper studies network recovery methods for WDM optical mesh networks, concentrating on improving spare resource utilization. The resource efficiency can be obtained by sharing spare resources needed for network recovery. To improve the sharability of spare resources in WDM networks, methods to share backup paths us well as spare capacity should be studied. The proposed method in this paper uses multiple ring-covers and this method provides fast and simple recovery operation by exploiting the characteristics of logical ring topology, and also provides efficient resource utilization by using multiple distributed backup paths to improve the sharability of overall spare resources in the networks. This method can provide layered reliability to network service by enabling hierarchical robustness against multiple failures. The performance results show that the proposed method provide improved resource efficiency for single failure and enhanced robustness for multiple failures.

Management and Control Scheme for Next Generation Packet-Optical Transport Network (차세대 패킷광 통합망 관리 및 제어기술 연구)

  • Kang, Hyun-Joong;Kim, Hyun-Cheol
    • Convergence Security Journal
    • /
    • v.12 no.1
    • /
    • pp.35-42
    • /
    • 2012
  • Increase of data traffic and the advent of new real-time services require to change from the traditional TDM-based (Time Division Multiplexing) networks to the optical networks that soft and dynamic configuration. Voice and lease line services are main service area of the traditional TDM-based networks. This optical network became main infrastructure that offer many channel that can convey data, video, and voice. To provide high resilience against failures, Packet-optical networks must have an ability to maintain an acceptable level of service during network failures. Fast and resource optimized lightpath restoration strategies are urgent requirements for the near future Packet-optical networks with a Generalized Multi-Protocol Label Switching(GMPLS) control plane. The goal of this paper is to provide packet-optical network with a hierarchical multi-layer recovery in order to fast and coordinated restoration in packet-optical network/GMPLS, focusing on new implementation information. The proposed schemes do not need an extension of optical network signaling (routing) protocols for support.