• Title/Summary/Keyword: 트래픽 라우팅

Search Result 376, Processing Time 0.024 seconds

Visualizaton of Sensing Data Routing with Packet Traffic on Wireless Sensor Network (트래픽을 고려한 Wireless Sensor Network 기반의 센싱 데이터 라우팅 가시화)

  • Yang, Su-Hyun;Song, Eun-Ha;Jeong, Young-Sik
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2011.04a
    • /
    • pp.771-774
    • /
    • 2011
  • 센서 네트워크 환경에서 센서 노드 간의 데이터 전송 중에 트래픽이 발생하거나 토폴로지가 수시로 변하게 됨에 따라 패킷의 손실이 자주 발생하게 된다. 본 논문에서 설계한 VSDR(Visualization Sensing Data Routing)은 GML 문서를 통해 실제 지형을 가시화 하고, Map Object의 장애물 여부를 설정하여 타겟 지역을 구성한다. 또한, AODV와 DSR을 사용하여 센서 노드간의 패킷의 이동경로와 트래픽의 양을 가시화하며, 과다 트래픽이 발생하는 구간은 경로를 변경하여 효율적으로 데이터 전송을 할 수 있다.

Interference-Prediction based Online Routing Aglorithm for MPLS Traffic Engineering (MPLS 트래픽 엔지니어링을 위한 간섭 예측 기반의 online 라우팅 알고리듬)

  • Lee, Dong-Hoon;Lee, Sung-Chang;Ye, Byung-Ho
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.42 no.12
    • /
    • pp.9-16
    • /
    • 2005
  • A new online routing algerian is proposed in this paper, which use the interference-prediction to solve the network congestion originated from extension of Internet scope and increasing amount of traffic. The end-to-end QoS has to be guaranteed in order to satisfy service level agreements (SLAs) in the integrated networks of next generation. For this purpose, bandwidth is allocated dynamically and effectively, moreover the path selection algorithm is required while considering the network performance. The proposed algorithm predicts the level of how much the amount of current demand interferes the future potential traffic, and then minimizes it. The proposed algorithm considers the bandwidth on demand, link state, and the information about ingress-egress pairs to maximize the network performance and to prevent the waste of the limited resources. In addition, the interference-prediction supports the bandwidth guarantee in dynamic network to accept more requests. In the result, the proposed algorithm performs the effective admission control and QoS routing. In this paper, we analyze the required conditions of routing algorithms, the aspect of recent research, and the representative algorithms to propose the optimized path selection algorithm adequate to Internet franc engineering. Based on these results, we analyze the problems of existing algorithms and propose our algorithm. The simulation shows improved performance by comparing with other algorithms and analyzing them.

A Priority Based Multipath Routing Mechanism in the Tactical Backbone Network (전술 백본망에서 우선순위를 고려한 다중 경로 라우팅 방안)

  • Kim, Yongsin;Shin, Sang-heon;Kim, Younghan
    • Journal of KIISE
    • /
    • v.42 no.8
    • /
    • pp.1057-1064
    • /
    • 2015
  • The tactical network is system based on wireless networking technologies that ties together surveillance reconnaissance systems, precision strike systems and command and control systems. Several alternative paths exist in the network because it is connected as a grid to improve its survivability. In addition, the network topology changes frequently as forces and combatants change their network access points while conducting operations. However, most Internet routing standards have been designed for use in stable backbone networks. Therefore, tactical networks may exhibit a deterioration in performance when these standards are implemented. In this paper, we propose Priority based Multi-Path routing with Local Optimization(PMPLO) for a tactical backbone network. The PMPLO separately manages the global and local metrics. The global metric propagates to other routers through the use of a routing protocol, and it is used for a multi-path configuration that is guaranteed to be loop free. The local metric reflects the link utilization that is used to find an alternate path when congestion occurs, and it is managed internally only within each router. It also produces traffic that has a high priority privilege when choosing the optimal path. Finally, we conducted a simulation to verify that the PMPLO can effectively distribute the user traffic among available routers.

A Study on Secure Routing Technique using Trust Model in Mobile Ad-hoc Network (신뢰 모델을 이용한 보안 라우팅 기법에 관한 연구)

  • Yang, Hwan Seok
    • Convergence Security Journal
    • /
    • v.17 no.4
    • /
    • pp.11-16
    • /
    • 2017
  • MANET composed of only mobile node is applied to various environments because of its advantage which can construct network quickly in emergency situation. However, many routing vulnerabilities are exposed due to the dynamic topology and link failures by the movement of nodes. It can significantly degrade network performance. In this paper, we propose a secure routing protocol based on trust model. The domain-based network structure is used for efficient trust evaluation and management of nodes in the proposed technique. The reliability evaluation of nodes was performed by the discard ratio of control packet and data packet of the nodes. The abnormal nodes are detected by performing traffic check and inspecting of nodes on a path that generates excessive traffic in order to increase the efficiency of routing. It is confirmed through experiments of the proposed technique that data transmission is performed securely even if an attack exists on the path.

High Performance QoS Multicast Routing Scheme for Real-Time Mobile Multimedia Applications in Wireless Mesh Networks (무선메쉬네트워크에서 실시간 이동 멀티미디어 응용을 위한 고성능 QoS 멀티캐스트 라우팅 기법)

  • Kang, Moonsik
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.52 no.6
    • /
    • pp.85-94
    • /
    • 2015
  • In this paper, an enhanced QoS multicast routing scheduling scheme is proposed to adapt to a dynamic mobile traffic condition for wireless mesh networks (WMNs). It handles the network QoS by controlling the delay constraints for multimedia applications. The group size will be controlled according to both the current network state and QoS requirements. The dynamic reconstruction of QoS multicast tree can be obtained from preprocessing with both the partial multicast routing scheme and the traffic estimation. Performance evaluation of the proposed scheme is carried out on randomly generated graph derived from the wireless mesh network, by choosing the optimal value related to the appropriate delay bounds. Simulation results show that the proposed scheme can improve the performance of QoS multicast routing for WMNs.

Performance analysis of ZRP supporting QoS for Mobile Ad hoc networks (MANET에 대해 QoS를 지원하는 ZRP의 성능연구)

  • Kwon, Oh-Seong;Jeong, Eui-Hyun;Kim, Jun-Nyun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.3B
    • /
    • pp.224-236
    • /
    • 2003
  • MANET(Mobile Ad hoc networks) is a mobile, multi-hop, and wireless network which is bandwidth constrained, energy constrained, resource constrained, autonomous, and self operating systems with dynamic topology. These constraints make the routing between communicating nodes in ad hoc networks difficult. In this paper we survey several routing protocol for mobile ad hoc networks. Especially, we focus on Zone Routing Protocol, hybrid routing framework suitable for a wide of mobile ad hoc networks and analyze performance of ZRP. In the case of ZRP protocol, it is essential that the use of optimal zone radius for efficient use. Otherwise it was proved through an simulation that performance of whole network is rapidly decrease with greatly increasing overhead of ZRP traffic that need for transmission of packet by IARP or IERP traffic. Also we suggest the process of finding QoS path that use in-band signal for QoS routing in ad hoc network. This method guarantees route that make real time multimedia service for QoS enabled path.

Multicast Routing Protocol in Mobile Networks (이동네트워크 환경에서의 멀티캐스트 라우팅 프로토콜)

  • Sin, Hui-Suk;Seo, Yeong-Ju;An, Seong-Ok
    • Journal of KIISE:Information Networking
    • /
    • v.27 no.4
    • /
    • pp.418-428
    • /
    • 2000
  • 이동호스트를 지원하는 네트워크에서의 멀티캐스트 라우팅은 그룹 멤버의 빈번한 위치 변화를 가져와서 기존의 고정 호스트를 기본으로 설계된 멀티캐스트 라우팅 프로토콜을 적용할 경우 많은 문제점을 발생시킨다. 이런점에서 Mobile-IP를 유니캐스트 라우팅 방식으로 사용하는 이동환경에서의 이동호스트를 위한 몇가지 멀티캐스팅 방법이 제시되었으나 이 방법들 또한 비최적 경로로의 데이터 전송, 비효율적인 데이터 중복 전송, 그리고 빈번한 멀티캐스트 트리의 재구성으로 인한 오버헤드 등의 문제점을 가지고 있다. 따라서 본 논문에서는 이런 문제점들을 구찰하고 이 문제점들을 보와하는 효과적인 멀티캐스트 라우팅 프로토콜을 제안하고자 한다. 제시하는 프로토콜은 Mobile-IP를 사용하는 이동호스트에게 멀티캐스트 서비스를 지원하는 멀티캐스트 에이전트와 이들 멀티캐스트 에이전트들 중에서 선택된 멀티캐스트 포워더를 이용하여 동작한다 이동호스트는 이웃한 멀티캐스트 포워더로부터 데이터를 터널링받거나 또는 로컬네트워크에 위치한 멀티캐스트 라우터로부터 멀티캐스트 데이터를 직접전송받게 된다. 따라서 멀티캐스트 데이터의 전송 경로를 단축시키고 중복되는 데이터 및 터널링으로 전송되는 데이터를 감소시킴으로써 전체 네트워크 트래픽량을 줄이는 효과를 얻을 수 있다. 제시하는 프로토콜의 성능은 다양한 환경의 시뮬레이션을 통하여 확인해 본다.

  • PDF

A Performance Evaluation on Optical Burst Switched Networks and Wavelength Routed Networks (광 버스트 스위칭 네트워크와 파장 라우팅 네트워크의 성능 비교)

  • 유명식;정연미;홍현하
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.5B
    • /
    • pp.404-413
    • /
    • 2003
  • Optical Internet consists of IP domain and optical (WDM) domain, where the wavelength routing (WR) and optical burst switching (OBS) are the promising switching technologies in the optical domain. In this paper, we perform the simulations on the WR network and the OBS network, and compare their performances. It is verified from our simulations that the OBS network performs better than the WR network when the same network resources are given.

An Effective BECN Typed QoS Guaranteeing Mechanism in Optical Burst Switching Networks (광 버스트 교환망에서 BECN 방식의 효과적인 QoS 보장 방법)

  • Choi Young-Bok
    • The KIPS Transactions:PartC
    • /
    • v.13C no.4 s.107
    • /
    • pp.441-446
    • /
    • 2006
  • In recent years, WDM networks have received much attention as the Internet backbone networks because of the explosive growth of the Internet IP-based traffic. The Optical Burst Switching (OBS) has been proposed as an effective optical switching technology in the WDM networks. The OBS has the advantages in 1) the high usage rate of the bandwidth, and 2) no necessity of optical buffer. However, the OBS has the burst-contention problem in the networks. The deflection routing is proposed as one of means to solve this problem. In this paper, we propose a new routing method to minimize burst loss in the deflection routing based networks. In addition, we propose a QoS control method using a new routing algorithm. Finally, we show the variety of the proposed methods by computer simulations.

A Study on Multicast ATM Switch with Tandem Crosspoints (탠덤크로스포인터 멀티캐스트 ATM 스위치 연구)

  • Ryul, Kim-Hong
    • Journal of the Korea Society of Computer and Information
    • /
    • v.11 no.1 s.39
    • /
    • pp.157-165
    • /
    • 2006
  • This paper proposes a new output-buffered multicast ATM switch with tandem crosspoints switching fabric, named the MTCOS(Multicast Tandem Crosspoint Output-buffered Switch). The MTCOS consists of multiple simple crosspoint switch fabrics, named TCSF(Tandem Crosspoint Switch Fabric) , and concentrated output buffers for efficient multicasting. The TCSF resolves the cell delay deviation problem which the self-routing crossbar switches inherently have. Further, it offers multiple concurrent pathes from one input to multiple output ports. It also provides multi-channel switching by easy software configuration and has several desirable characteristics such as scalability, high Performance, and modularity. A shared traffic concentration and output queuing strategies of the MTCOS results in lower cell loss as well as lower cell delay time over a wide range of multicast traffic. Furthermore, it has lower hardware complexity than that of the SCOQ and Knockout multicast switch to achieve the same Knockout concentration rate as the conventional switches. It is shown that the proposed switch can be easily applied to design high performance for any multicast traffic by analytic analysis and computer simulation.

  • PDF