• Title/Summary/Keyword: dynamic multipath

Search Result 48, Processing Time 0.202 seconds

A Node-disjoint Multipath Discovery Method by Local Route Discovery based on AODV (AODV기반의 지역경로탐색을 이용한 노드 비중첩 다중 경로 검색 기법)

  • Jin, Dong-Xue;Kim, Young-Rag;Kim, Chong-Gun
    • The KIPS Transactions:PartC
    • /
    • v.14C no.1 s.111
    • /
    • pp.87-94
    • /
    • 2007
  • In mobile ad hoc networks the most popular on demand routing protocols are the Dynamic Source Routing (DSR) protocol and the Ad hoc On demand Distance Vector (AODV) routing protocol. These and other representative standard routing protocols are designed to find and maintain only a single path. Whenever there is a link break on the active route, source node has to invoke a route discovery process from the beginning and it causes a lot of overhead. Multipath routing protocols, which can alleviate these problems by establishing multiple alternative paths between a source and a destination, are widely studied. In this paper we propose a node disjoint multipath discovery technique based on AODV local route discovery. This technique can find and build completely separated node disjoint multi paths from a source to a destination as many as possible. It will make routing more robust and stable.

SPMLD: Sub-Packet based Multipath Load Distribution for Real-Time Multimedia Traffic

  • Wu, Jiyan;Yang, Jingqi;Shang, Yanlei;Cheng, Bo;Chen, Junliang
    • Journal of Communications and Networks
    • /
    • v.16 no.5
    • /
    • pp.548-558
    • /
    • 2014
  • Load distribution is vital to the performance of multipath transport. The task becomes more challenging in real-time multimedia applications (RTMA), which impose stringent delay requirements. Two key issues to be addressed are: 1) How to minimize end-to-end delay and 2) how to alleviate packet reordering that incurs additional recovery time at the receiver. In this paper, we propose sub-packet based multipath load distribution (SPMLD), a new model that splits traffic at the granularity of sub-packet. Our SPMLD model aims to minimize total packet delay by effectively aggregating multiple parallel paths as a single virtual path. First, we formulate the packet splitting over multiple paths as a constrained optimization problem and derive its solution based on progressive approximation method. Second, in the solution, we analyze queuing delay by introducing D/M/1 model and obtain the expression of dynamic packet splitting ratio for each path. Third, in order to describe SPMLD's scheduling policy, we propose two distributed algorithms respectively implemented in the source and destination nodes. We evaluate the performance of SPMLD through extensive simulations in QualNet using real-time H.264 video streaming. Experimental results demonstrate that: SPMLD outperforms previous flow and packet based load distribution models in terms of video peak signal-to-noise ratio, total packet delay, end-to-end delay, and risk of packet reordering. Besides, SPMLD's extra overhead is tiny compared to the input video streaming.

Power-aware Dynamic Path Selection Scheme in AOMDV(Ad hoc On-demand Distance Vector) (AOMDV(Ad hoc On-demand Multipath Distance Vector)에서의 전력을 고려한 동적 경로 선택 기법)

  • Lee, Jang-Su;Kim, Sung-Chun
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.45 no.1
    • /
    • pp.42-50
    • /
    • 2008
  • Unlike a cellular network, a mobile ad hoc network(MANET) is constructed only by mobile nodes without access point. Mobile nodes in MANET operate with scarce resources and restricted battery. If battery of intermediate node is exhausted, overall network might be diverged. Therefore, power-aware is really important. An on-demand multipath routing protocol which is proposed to compensate for shortcoming of on-demand single path routing protocol can reduce mute discovery overhead because route discovery starts only when all routes are disconnected. AOMDV(Ad hoc On-demand Multipath Distance Vector) which is on-demand multipath routing protocol based on AODV, reduces 40% of route discovery frequency. However, AOMDV have none of power-aware. So AOMDV have problem that route discovery for power exhaustion is not reduced at all. This paper proposes new power-aware path selection algorithm for AOMDV and scheme that broadcast REER packets when mobile node's battery can be gone. Performance comparison of proposed algorithm with AOMDV using ns-2 simulator shows that route discovery of proposed algorithm is reduced maximally 36.57% than AOMDV's.

Load Balancing in MPLS Networks (MPLS 네트워크에서의 부하 분산 방안)

  • Kim, Sae-Rin;Song, Jeong-Hwa;Lee, Mee-Jeong
    • The KIPS Transactions:PartC
    • /
    • v.9C no.6
    • /
    • pp.893-902
    • /
    • 2002
  • MPLS enables efficient explicit routing, and thus provides great advantages in supporting traffic engineering. Exploiting this capability, we Propose a load balancing scheme which deploys a multipath routing. It is named LBM (Load Balancing in MPLS networks), and targets at efficient network utilization as well as performance enhancement. LBM establishes multiple LSP (Label Switched Path)s between a pair of ingress-egress routers, and distributes traffic over these LSPs at the new level. Its routing decision is based on both the length and the utilization of the paths. In order to enhance the efficiency of a link usage, a link is limited to be used by shorter paths as its utilization becomes higher Longer paths are considered to be candidate alternative paths as the utilization of shorter paths becomes higher. Simulation experiments are performed in order to compare the performance of LBM to that of static shortest path only scheme as well as the other representative dynamic multipath traffic distribution approaches. The simulation results show that LBM outperforms the compared approaches, and the performance gain is more significant when the traffic distribution among the ingress-egress pairs is non-uniform.

Dynamic Position of Vehicles using AHRS IMU Sense (AHRS IMU 센서를 이용한 이동체의 동적 위치 결정)

  • Back Ki-Suk;Lee Jong-Chool;Hong Soon-Hyun;Cha Sung-Yeoul
    • Proceedings of the Korean Society of Surveying, Geodesy, Photogrammetry, and Cartography Conference
    • /
    • 2006.04a
    • /
    • pp.77-81
    • /
    • 2006
  • GPS cannot determine random errors such as multipath and signal cutoff caused by surrounding environment that determines the visibility of satellites and the speed of data creation and transmission is lower than the speed of vehicles, it is difficult to determine accurate dynamic positions. Thus this study purposed to implement a method of deciding the accurate dynamic position of vehicles by combining AHRS (Attitude Heading Reference System) IMU (Initial Measurement Unit) based on low-priced MEMS (Micro Electro Mechanical System) in order to provide the information of attitude, position and speed at a high transmission rate without external help. This study conducted an initialization test to decide dynamic position using AHRS IMU sensor, and derived attitude correction angles of vehicles against time through regression analysis. The roll angle was $y=(A{\times}10^{-6})x^2 -(B{\times}10^{-5})x+Cr{\times}10^{-2}$ and the pitch angle was $y=(A{\times}10^{-6})x^2-(B{\times}10^{-7})x+C{\times}10^{-2}$, each of which was derived from second-degree polynomial regression analysis. It was also found that the heading angle was stabilized with variation less than $1^{\circ}$ after 60 seconds.

  • PDF

Dynamic Source Multi-path Routing Protocol for Wireless Ad-hoc Network Environments (무선 에드-혹 네트워크 환경을 위한 동적다중경로라우팅 프로토콜)

  • Kim, Moon-Jeong;Eom, Young-Ik
    • Journal of KIISE:Information Networking
    • /
    • v.28 no.3
    • /
    • pp.336-346
    • /
    • 2001
  • A wireless ad-hoc network is a temporal network formed by a collection of wireless mobile nodes without the aid of any existing network infrastnlcture or centralized administration. Currently, numerous routing protocols have been developed for changing messages between nodes in a wireless ad-hoc network. Applications of wireless ad-hoc network technology are various and proper routing protocol must be used according to application domain or network size. In a wireless ad-hoc network. some hosts want services from fixed networks. For supporting such services, it is necessary to interconnect wireless ad-hoc networks and fixed networks. The DSMIHDynamic Source Multipath Routing) protocol, proposed in this paper, focuses on supporting seamless communication services between the nodes within a wireless ad-hoc network and providing fixed networks to the mobile hosts in wireless an-hoc networks. In DSMR protocol, each node need not broadcast routing messages periodically. and mobile hosts that to send data packets initiate route request and route establishment procedure. By maintaining multiple paths in each node. faster route re-establishment is also possible in our scheme.

  • PDF

A Study on Ad-Hoc Routing Protocol using Table-Driven DSR (테이블 구동 DSR을 이용한 에드혹 라우팅 프로토콜에 관한 연구)

  • 유기홍;하재승
    • Journal of the Korea Computer Industry Society
    • /
    • v.2 no.9
    • /
    • pp.1209-1218
    • /
    • 2001
  • In this dissertation, we propose a dynamic source routing protocol supporting asymmetric path for mobile ad hoc networks. At present, the existing dynamic source routing protocol supports only symmetric path for routing. However, in fact, there can exist unidirectional links due to asymmetric property of mobile termenals or current wireless environment. Thus, we implement a mobile ad hoc routing protocol supporting asymmetric routing path, which is fit for more general wireless environment. Especially, the proposed protocol uses an improved multipath maintenance method in order to perform rapid route reconfiguration when route error due to mobility is detected.

  • PDF

New approach to dynamic load balancing in software-defined network-based data centers

  • Tugrul Cavdar;Seyma Aymaz
    • ETRI Journal
    • /
    • v.45 no.3
    • /
    • pp.433-447
    • /
    • 2023
  • Critical issues such as connection congestion, long transmission delay, and packet loss become even worse during epidemic, disaster, and so on. In this study, a link load balancing method is proposed to address these issues on the data plane, a plane of the software-defined network (SDN) architecture. These problems are NP-complete, so a meta-heuristic approach, discrete particle swarm optimization, is used with a novel hybrid cost function. The superiority of the proposed method over existing methods in the literature is that it provides link and switch load balancing simultaneously. The goal is to choose a path that minimizes the connection load between the source and destination in multipath SDNs. Furthermore, the proposed work is dynamic, so selected paths are regularly updated. Simulation results prove that with the proposed method, streams reach the target with minimum time, no loss, low power consumption, and low memory usage.

Simulator for Dynamic 2/3-Dimensional Switching of Computing Resources

  • Ki, Jang-Geun;Kwon, Kee-Young
    • International Journal of Internet, Broadcasting and Communication
    • /
    • v.12 no.3
    • /
    • pp.9-17
    • /
    • 2020
  • In this paper, as part of the research for the infrastructure of very high flexible and reconfigurable data center using very high speed crossbar switches, we developed a simulator that can model two and three dimensional connection structure of switches with an efficient control algorithm using software defined network and verified the functions and analyzed the performance accordingly. The simulator consists of a control module and a switch module that was coded using Python language based on the Mininet and Ryu Openflow frameworks. The control module dynamically controls the operation of switching cells using a shortest multipath algorithm to calculate efficient paths adaptively between configurable computing resources. Performance analysis by using the simulator shows that the three-dimensional switch architecture can accommodate more hosts per port and has about 1.5 times more successful 1:n connections per port with the same number of switches than the two-dimensional architecture. Also simulation results show that connection length in a 3-dimensional way is shorter than that of 2-dimensional way and the unused switch ratio in a 3-dimensional case is lower than that of 2-dimensional cases.

A Study on Dynamic Trigger Threshold in Indoor Positioning System (실내 위치 추정 시스템에서의 동적 트리거 임계값에 관한 연구)

  • Oh, Jongtaek
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.15 no.6
    • /
    • pp.155-161
    • /
    • 2015
  • As the popularity of the smartphone becomes increase, indoor smartphone positioning technology has been actively studied. The acoustic signal generated from the smartphone is received from the several microphones at the relative positioning system, and the trigger signal is proposed to mitigate the multipath effect and the effect is verified. But for the simple trigger method, there would be error occurred according to the variation of the distance or surrounding noise. In this paper, in order to resolve the problems, the dynamic trigger threshold technology is proposed and its effect is verified by the experiment.