• Title/Summary/Keyword: Node disjoint path

Search Result 38, Processing Time 0.028 seconds

Resilient Packet Transmission (RPT) for the Buffer Based Routing (BBR) Protocol

  • Rathee, Geetanjali;Rakesh, Nitin
    • Journal of Information Processing Systems
    • /
    • v.12 no.1
    • /
    • pp.57-72
    • /
    • 2016
  • To provide effective communication in the wireless mesh network (WMN), several algorithms have been proposed. Since the possibilities of numerous failures always exist during communication, resiliency has been proven to be an important aspect for WMN to recover from these failures. In general, resiliency is the diligence of the reliability and availability in network. Several types of resiliency based routing algorithms have been proposed (i.e., Resilient Multicast, ROMER, etc.). Resilient Multicast establishes a two-node disjoint path and ROMER uses a credit-based approach to provide resiliency in the network. However, these proposed approaches have some disadvantages in terms of network throughput and network congestion. Previously, the buffer based routing (BBR) approach has been proposed to overcome these disadvantages. We proved earlier that BBR is more efficient in regards to w.r.t throughput, network performance, and reliability. In this paper, we consider the node/link failure issues and analogous performance of BBR. For these items we have proposed a resilient packet transmission (RPT) algorithm as a remedy for BBR during these types of failures. We also share the comparative performance analysis of previous approaches as compared to our proposed approach. Network throughput, network congestion, and resiliency against node/link failure are particular performance metrics that are examined over different sized WMNs.

Load-Balanced One-hop Overlay Multipath Routing with Path Diversity

  • Liao, Jianxin;Tian, Shengwen;Wang, Jingyu;Li, Tonghong;Qi, Qi
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.2
    • /
    • pp.443-461
    • /
    • 2014
  • Overlay routing has emerged as a promising approach to improve reliability and efficiency of the Internet. For one-hop overlay source routing, when a given primary path suffers from the link failure or performance degradation, the source can reroute the traffic to the destination via a strategically placed relay node. However, the over-heavy traffic passing through the same relay node may cause frequent package loss and delay jitter, which can degrade the throughput and utilization of the network. To overcome this problem, we propose a Load-Balanced One-hop Overlay Multipath Routing algorithm (LB-OOMR), in which the traffic is first split at the source edge nodes and then transmitted along multiple one-hop overlay paths. In order to determine an optimal split ratio for the traffic, we formulate the problem as a linear programming (LP) formulation, whose goal is to minimize the worse-case network congestion ratio. Since it is difficult to solve this LP problem in practical time, a heuristic algorithm is introduced to select the relay nodes for constructing the disjoint one-hop overlay paths, which greatly reduces the computational complexity of the LP algorithm. Simulations based on a real ISP network and a synthetic Internet topology show that our proposed algorithm can reduce the network congestion ratio dramatically, and achieve high-quality overlay routing service.

A Node-disjoint Path Selection Algorithm in Mobile Ad Hoc Networks (모바일 애드혹 네트워크에서의 노드디스조인트 경로 탐색 알고리즘)

  • Lee, Dong-Ho;Song, Byung-Hun;Chung, Kwang-Sue
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2010.06d
    • /
    • pp.278-282
    • /
    • 2010
  • 모바일 애드혹 네트워크에서의 멀티패스 라우팅 프로토콜은 기존의 단일패스 라우팅 프로토콜에 비하여 대역폭을 효율적으로 사용할 수 있고 혼잡을 완화시킬 수 있으며, 데이터 전달의 신뢰성을 제공할 수 있다. 하지만 멀티패스 라우팅 프로토콜에서의 경로 탐색 과정은 오버헤드가 크고 계산의 복잡도 또한 높다. 본 논문에서는 무선 애드혹 네트워크에서의 멀티패스 라우팅을 위한 효율적인 노드디스조인트 경로 탐색 알고리즘을 제안한다. 제안하는 알고리즘은 지연된 RREP(Route Reply) 패킷을 사용하여 최적의 노드 디스조인트 경로를 탐색하고 그중 간섭 및 충돌의 영향이 적은 경로 집합을 선택한다. 이를 통해 빠르게 트래픽을 분산시킬 수 있고 충돌로 인한 오류의 발생을 낮추어 신뢰성을 높일 수 있다. 실험을 통하여 제안하는 경로 탐색 알고리즘이 최적의 멀티패스를 선택함을 확인하였다.

  • PDF

Performance Evaluation of Multi-path Source Routing Protocol according to Mobility Model (이동성 모델에 따른 다중경로 소스 라우팅 프로토콜의 성능평가)

  • Kim, Su-Sun;Kim, Moon Jeong
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.16 no.8
    • /
    • pp.5559-5564
    • /
    • 2015
  • A variety of routing protocols targeted specifically at mobile ad-hoc network environments have been developed. Mobile ad-hoc network is a self-organizing temporary network, operating without the aid of any established wired infrastructure. The proposed protocol supports seamless communication services between the mobile hosts within a mobile ad-hoc network environments. In particular, our protocol makes faster route re-establishment possible by maintaining multiple paths in each mobile host, and also, the protocol provides reliable communication environments. We compare the performance of RWP model with that of LW model. This paper shows delivery ratio with single path and non-disjoint multiple path according to mobility model and node numbers.

Transient Multipath routing protocol for low power and lossy networks

  • Lodhi, Muhammad Ali;Rehman, Abdul;Khan, Meer Muhammad;Asfand-e-yar, Muhammad;Hussain, Faisal Bashir
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.4
    • /
    • pp.2002-2019
    • /
    • 2017
  • RPL routing protocol for low-power and lossy networks is an Internet Engineering Task Force (IETF) recommended IPv6 based protocol for routing over Low power Lossy Networks (LLNs). RPL is proposed for networks with characteristics like small packet size, low bandwidth, low data rate, lossy wireless links and low power. RPL is a proactive routing protocol that creates a Directed Acyclic Graph (DAG) of the network topology. RPL is increasingly used for Internet of Things (IoT) which comprises of heterogeneous networks and applications. RPL proposes a single path routing strategy. The forwarding technique of RPL does not support multiple paths between source and destination. Multipath routing is an important strategy used in both sensor and ad-hoc network for performance enhancement. Multipath routing is also used to achieve multi-fold objectives including higher reliability, increase in throughput, fault tolerance, congestion mitigation and hole avoidance. In this paper, M-RPL (Multi-path extension of RPL) is proposed, which aims to provide temporary multiple paths during congestion over a single routing path. Congestion is primarily detected using buffer size and packet delivery ratio at forwarding nodes. Congestion is mitigated by creating partially disjoint multiple paths and by avoiding forwarding of packets through the congested node. Detailed simulation analysis of M-RPL against RPL in both grid and random topologies shows that M-RPL successfully mitigates congestion and it enhances overall network throughput.

Implementation of a Network Provisioning System with User-driven and Trusty Protection Management

  • Lim, H.
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.11
    • /
    • pp.4720-4738
    • /
    • 2015
  • Proper management on user-driven virtual circuits (VCs) is essential for seamless operation of virtual networks. The Network Provisioning System (NPS) is useful software for creating user-driven VCs automatically and must take fault management into account for physical layer impairments on user-driven VCs. This paper addresses a user-driven and trusty protection management in an NPS with an open standard Network Service Interface (NSI), as a contribution to show how to implement the user-driven and trusty protection management required for user-driven VCs. In particular, it provides a RESTful web service Interface for Configuration and Event management (RICE) that enable management of a distinguished data and control plane VC status between Network Service Agents (NSAs) in the event of a node or link fault and repair in a domain. This capability represents a contribution to show how network and protection events in a domain can be monitored between NSAs (NPSs with the NSI) in multiple domains. The implemented NPS controls and manages both the primary and backup VC with disjoint path in a user-driven manner. A demonstration to verify RICE API's capability is addressed for the trusty protection in the dynamic VC network.

Parallel Paths in Folded Hyper-Star Graph (Folded 하이퍼-스타 그래프의 병렬 경로)

  • Lee, Hyeong-Ok;Choi, Jung;Park, Seung-Bae;Cho, Chung-Ho;Lim, Hyeong-Seok
    • The Transactions of the Korea Information Processing Society
    • /
    • v.6 no.7
    • /
    • pp.1756-1769
    • /
    • 1999
  • Parallel paths in an interconnection network have some significance in that message transmission time can be reduced because message is divided into packets and transmitted in parallel through several paths, and also an whose nodes has 2n binary bit string, is an interconnection network which has a lower network cost than hypercube and its variation. In this paper, we analyze node disjoint parallel path in Folded Hyper-Star graph FHS(2n,n) proposed as the topology of parallel computers and, using the result, prove that the fault diameter of a Folded Hyper-Star graph FHS(2n,n) is 2n-1.

  • PDF

Reliable Extension Scheme using Multiple Paths in Wireless Ad-hoc Networks (무선 애드-혹 네트워크의 다중 경로를 이용한 신뢰적인 확장 기법)

  • Kim, Moon-Jeong;Eom, Young-Ik
    • Journal of KIISE:Information Networking
    • /
    • v.34 no.3
    • /
    • pp.218-225
    • /
    • 2007
  • As the research on home network technologies, sensor network technologies, and ubiquitous network technologies makes rapid progresses, wireless ad-hoc network have attracted a lot of attention. A wireless mobile ad-hoc network is a temporary network formed by a collection of wireless mobile nodes without the aid of any existing network infrastructure or centralized administration, and it is suitable for ubiquitous computing environments. In this paper, we suggest an extension scheme of a wireless mobile ad-hoc network based on limited multiple paths source routing protocol. This scheme reduces the overhead of route re-establishment and re-registration by maintaining link/node non-disjoint multiple paths between mobile hosts in a wireless mobile ad-hoc network or a mobile host in a wireless mobile ad-hoc network and a base station supporting fixed network services. By maintaining multiple paths, our scheme provides short end-to-end delay and is reliable extension scheme of a wireless mobile ad-hoc network to a fixed network. In this paper, our simulations show that our scheme outperforms existing schemes with regards to throughput and end-to-end delay. Also we show that our scheme outperforms multi-paths approach using disjoint routes with regards to routing overhead.