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

Search Result 376, Processing Time 0.026 seconds

Traffic Load & Lifetime Deviation based Power-aware Routing Protocol for MANET (MANET에서 트래픽 부하와 노드 수명 편차에 기반한 power-aware 라우팅 프로토콜)

  • Kim, Dong-Hyun;Ha, Rhan
    • Journal of KIISE:Information Networking
    • /
    • v.33 no.5
    • /
    • pp.395-406
    • /
    • 2006
  • In ad hoc networks, the limited battery capacity of nodes affects a lifetime of network Recently, a large variety of power-aware routing protocols have been proposed to improve an energy efficiency of ad hoc networks. Existing power-aware routing protocols basically consider the residual battery capacity and transmission power of nodes in route discovery process. This paper proposes a new power-aware routing protocol, TDPR(Traffic load & lifetime Deviation based Power-aware Routing protocol), that does not only consider residual battery capacity and transmission power, but also the traffic load of nodes and deviation among the lifetimes of nodes. It helps to extend the entire lifetime of network and to achieve load balancing. Simulations using ns-2[14] show the performance of the proposed routing protocol in terms of the load balancing of the entire network, the consumed energy capacity of nodes, and an path's reliability TDPR has maximum 72% dead nodes less than AODV[4], and maximum 58% dead nodes less than PSR[9]. And TDPR consumes residual energy capacity maximum 29% less than AODV, maximum 15% less than PSR. Error messages are sent maximum 38% less than PSR, and maximum 41% less than AODV.

An Improved Reactive Chord for Minimizing Network Traffic and Request Latency (트래픽 및 요청 지연을 최소화한 향상된 리액티브 Chord)

  • Yoon, Yong-Hyo;Kwak, Hu-Keun;Kim, Cheong-Ghil;Chung, Kyu-Sik
    • The KIPS Transactions:PartC
    • /
    • v.16C no.1
    • /
    • pp.73-82
    • /
    • 2009
  • The peers in the Chord method send messages periodically to keep the routing table updated. In a mobile P2P network, the peers in the Chord method should send messages more frequently to keep the routing table updated and reduce the failure of a request. However this results in increasing the overall network traffic. In our previous method, we proposed a method to reduce the update load of the routing table in the existing Chord by updating it in a reactive way, but there were disadvantages to generate more traffic if the number of requests per second increases and to have more delay in the request processing time than the existing Chord. In this paper, we propose an improved method of reactive routing table update to reduce the request processing time. In the proposed method, when a data request comes, the routing table is updated only if its information is not recent while it is always updated in the previous method. We perform experiments using Chord simulator (I3) made by UC Berkely. The experimental results show the performance improvement of the proposed method compared to the existing method.

The Implementation of Application Services Using CSCFs of Management (CSCF 노드 관리를 이용한 응용 서비스 구현)

  • Lee, Jae-Oh;Cho, Jae-Hyoung
    • Journal of Internet Computing and Services
    • /
    • v.13 no.2
    • /
    • pp.33-40
    • /
    • 2012
  • Recently, according to increasing the network traffic in the IMS, the role of Network Management System (NMS) is very important because of limited network resource. NMS can perform two kinds of routing ways with the capability of static or dynamic routing. The way of A dynamic routing is more efficient than static routing one because it can make the flow of traffic changeful among nodes in the IMS. Therefore, in this paper, we suggest a management function of NMS, using a dynamic routing algorithm for managing the CSCFs in the IMS. And then we analyze the algorithm by measuring the performance of PoC, one of the prominent application services to be deployed in the IMS.

Performance Evaluation of Network Coding in MANETs for Bidirectional Traffic (MANETs에서 양방향 트래픽에 대한 네트워크 코딩기법의 성능 평가)

  • Kim, Kwan-Woong;Kim, Yong-Kab;Bae, Sung-Hwan;Kim, Dae-Ik
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.7 no.3
    • /
    • pp.491-497
    • /
    • 2012
  • Network coding is that the nodes can combine and mix the packets rather than merely forward them. Therefore, network coding is expected to improve throughput and channel efficiency in the wireless network. Relevant researches have been carried out to adapt network coding to wireless multi-hop network. In this paper, we designed the network coding for bidirectional traffic service in routing layer and IP layer of Ad-hoc network. From the simulation result, the traffic load and the end to end distance effect the performance of the network coding. As end to end distance and the traffic load become larger, the gain of network coding become more increased.

An Efficient Ad Hoc Routing Method for Tactical Networks using Integrated Metrics and Traffic Characteristics (전술 네트워크 환경의 트래픽 특성을 고려한 통합 매트릭 기반 애드혹 라우팅 기법)

  • Roh, Bong-Soo;Hoh, Mi-Jeong;Hwang, Ki-Min;Park, Gui-Soon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.11B
    • /
    • pp.1676-1684
    • /
    • 2010
  • Tactical network environments are characterized by unreliable connectivity, communication links which has limited bandwidth compared to commercial networks and distributed architecture where users have high mobility. The best route should be selected based on the required traffic characteristics which can be a wireless channel environments and a status of nodes which are moving. Those characteristics are self aware and should be a routing decision factor in order to guarantee a reliable data transfer. In this paper we define the requirements of services and traffic characteristics on tactical network environments and suggest the new routing method "AODV-IMTC" based on selective routing metric to enable efficient data transfer in wireless ad hoc networks.

MPLS Internet Traffic Engineering in IP Network (MPLS 인터넷 트래픽 엔지니어링 기술)

  • Jang Hee-Seon;Shi Hyun-Cheul
    • The Journal of Information Technology
    • /
    • v.5 no.4
    • /
    • pp.155-164
    • /
    • 2002
  • MPLS is a integrated technology by using routing function and label swapping in the network layer. Based on the previous forwarding equivalence classes, it adds the fixed length label in ingress of the MPLS domain. For the routing, without the packet header information, it uses label for the forwarding decisions. In this paper, traffic engineering requirements in the MPLS internet will be setup. The traffic engineering function have to be performed previously with the network topology. In addition to, we presents the IP network topology and main function with MPLS signaling protocol.

  • PDF

Partial multipath routing Protocol for multi-hop mesh network (멀티홉 메쉬 네트워크를 위한 부분다중경로 라우팅프로토콜)

  • Lee, Kang-Gun;Park, Hyung-Kun
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2015.05a
    • /
    • pp.598-599
    • /
    • 2015
  • For the wireless mesh networks, efficient routing protocol is required to transmit data from source to destination node through multi-hop transmission. Multipath routing enable the stable data transmission even in the case of traffic congestion or unstable link. In this paper, we propose partial multipath routing which does not make a full multipath but partial for some parts of unstable links. This partial multipath routing reduce the number of nodes for routing and minimized the required power.

  • PDF

Partial Multipath Routing Scheme to avoid interpath interference in Wireless Multimedia Sensor Networks (무선 멀티미디어 센서 네트워크에서 경로간 간섭회피를 위한 부분 다중경로 라우팅 기법)

  • Lee, Kang-Gun;Park, Hyung-Kun
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.19 no.8
    • /
    • pp.1917-1924
    • /
    • 2015
  • Efficient routing algorithm is required to transmit data from source to destination by multi-hop transmission in wireless sensor networks. In the multi-hop transmission, multipath routing can be one of the solutions to cope with the traffic congestion and unstable link condition. In this paper, we propose partial multipath routing which does not establish a secondary full routing path but a partial multipath to complement some poor links, and it can enable stable data transmission and reduce the number of nodes in routing path and the required total power compared with conventional multipath routing.

Defense Techniques of Smishing Attacks Using Electronic signature on Network Environment (전자서명을 이용한 스미싱 공격 방어 기법)

  • Choi, Byung-Hwan
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2014.11a
    • /
    • pp.399-402
    • /
    • 2014
  • 본 논문에서는 스미싱 공격에 대해서 Host기반에 의한 탐지가 아닌 네트워크 기반에서 전자서명을 이용한 모델을 제안한다. 본 모델은 네트워크 기반에서 유입된 트래픽 중 문자 메시지를 분석하여, 문자메시지 중에서 URL이 포함된 경우 트래픽을 우회하여 라우팅을 전환시켜 URL을 포함한 문자메시지 트래픽에 대해서 별도의 망구간으로 분리를 시킨다. 별도 분리된 URL이 포함된 트래픽에 대해서 apk파일 다운로드가 없는 경우에는 통과를 시키고, apk 파일 다운로드를 시도하는 트래픽에 대해서는 전자서명을 검사후, 등록이 안되어 있는 경우 차단을 한다. 이는 기본적으로 전자서명이 되지 않은 apk파일에 대한 다운로드를 원천적으로 봉쇄함으로써 스미싱 공격에 대한 근복적인 방어를 하는 방식이다. 본 모델은 Host기반에서 발생할 수 있는 우회공격을 방지하여 스미싱 위협을 해소할 수 있다. 기존 Host기반 스미싱 방지 모델의 동작 방식과 설계를 통해 장점과 단점을 언급하고 네트워크 기반에서 전자서명을 이용한 스미싱 방어의 타당성을 증명하도록 한다.

Impact and Performance of Mobility Model in Adhoc Network (에드혹 네트워크에서의 모바일 모델의 효과)

  • Singh, Dhananjay;Chung, Wan-Young
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2007.06a
    • /
    • pp.354-359
    • /
    • 2007
  • 모바일 모델은 특히 모바일 에드혹 네트워크의 라우팅에서 가장 중요한 역할을 한다. 에드혹 무선 네트워크에서 모바일 관리는 많은 과제에 직면해 있다. 이동성은 네트워크의 토폴로지를 바꾸기 위해 끊임없이 문제를 야기한다. 정확한 루트를 유지하기 위해서 라우팅 프로토콜은 그러한 변화들을 동적으로 새로이 조정해야만 한다. 따라서 데이터 트래픽 갱신은 중요한 요소이다. 다른 모바일 패턴들은 특수한 네트워크 프로토콜이나 어플리케이션 상에서 일반적인 다른 효과를 가진다. 결과적으로, 네트워크 수행능력은 이동성의 성질에 의해 강하게 좌우될 것이다. 과거의 이동성은 서로 다른 라우팅 프로토콜들 사이에서 네트워크 실행을 평가하는데 다소 가끔 사용되어 졌다. 이 논문에서는 일반적인 몇 개의 모바일 모델과 거의 보기 드문 모바일 모델을 가지고 다양한 네트워크와 라우팅 파라미터들에서의 그들의 충돌에 대해 기술되었다.

  • PDF