• Title/Summary/Keyword: 2단계 포워딩 방식

Search Result 4, Processing Time 0.02 seconds

A study of Distributed QoS Routing Performance with Implicit 2-level Information (암시적 3단계 정보를 갖는 분산 QoS 라우팅 성능 연구)

  • Han, Jeong-Su;Jeong, Jin-Uk
    • The KIPS Transactions:PartC
    • /
    • v.9C no.1
    • /
    • pp.141-148
    • /
    • 2002
  • In this paper, we study the various performance of Distributed QoS Routing according to how many level of routing table information in router. And we study Flooding and recently proposed 2-level forwarding, and compare with performance of implicit 3-level forwarding. Performance factors are message overhead that is generated on Distributed QoS Routing and Route Setup success Rate, Connection blocking rate, Network Utilization. They can decide the accuracy of routing information in rouser. Our simulation shows that more level of routing table information have, lower message overhead generate but lower performance at other factors because of inaccuracy of routing information.

A High PErformance Lookup Controller for ATM based IP Packet Forwarding Engine (ATM 기반 IP 패킷 포워딩 엔진을 위한 고성능 룩업 제어기)

  • Choi, Byeong-Cheol;Kwak, Dong-Yong;Lee, Jeong-Tae
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.4B
    • /
    • pp.298-305
    • /
    • 2003
  • In this paper, we proposed a high performance lookup controller for IP packet forwarding engine of ATM based label edge routers. The lookup controller is designed to provide services such as MPLS, VPN, ELL, and RT services as well as the best effort. For high speed searching for IP addresses, we employed a TCAM based hardware search device not using traditional algorithmic approaches. We also implement lookup control functions into FPGA for fast processing of packet header and lookup control. The proposed lookup controller is designed to support differenciated services for users and to process in pipelined mechanism for performance improvement. A two-step search scheme is also applied to perform lookup for the key combined with multi-field of packet header. We found that the proposed lookup controller provides the performance of about 16M packets per second through simulations.

Cluster-based Delay-adaptive Sensor Scheduling for Energy-saving in Wireless Sensor Networks (센서네트워크에서 클러스터기반의 에너지 효율형 센서 스케쥴링 연구)

  • Choi, Wook;Lee, Yong;Chung, Yoo-Jin
    • Journal of the Korea Society for Simulation
    • /
    • v.18 no.3
    • /
    • pp.47-59
    • /
    • 2009
  • Due to the application-specific nature of wireless sensor networks, the sensitivity to such a requirement as data reporting latency may vary depending on the type of applications, thus requiring application-specific algorithm and protocol design paradigms which help us to maximize energy conservation and thus the network lifetime. In this paper, we propose a novel delay-adaptive sensor scheduling scheme for energy-saving data gathering which is based on a two phase clustering (TPC). The ultimate goal is to extend the network lifetime by providing sensors with high adaptability to the application-dependent and time-varying delay requirements. The TPC requests sensors to construct two types of links: direct and relay links. The direct links are used for control and forwarding time critical sensed data. On the other hand, the relay links are used only for data forwarding based on the user delay constraints, thus allowing the sensors to opportunistically use the most energy-saving links and forming a multi-hop path. Simulation results demonstrate that cluster-based delay-adaptive data gathering strategy (CD-DGS) saves a significant amount of energy for dense sensor networks by adapting to the user delay constraints.

Implementation and Performance Evaluation of Reporting Interval-adaptive Sensor Control Scheme for Energy Efficient Data Gathering (에너지 효율적 센서 데이터 수집을 위한 리포팅 허용 지연시간 적응형 센서 제어 기법 구현 및 성능평가)

  • Shon, Tae-Shik;Choi, Hyo-Hyun
    • The KIPS Transactions:PartC
    • /
    • v.17C no.6
    • /
    • pp.459-464
    • /
    • 2010
  • Due to the application-specific nature of wireless sensor networks, the sensitivity to such a requirement as data reporting latency may vary depending on the type of applications, thus requiring application-specific algorithm and protocol design paradigms which help us to maximize energy conservation and thus the network lifetime. In this paper, we implement and evaluate a novel delay-adaptive sensor scheduling scheme for energy-saving data gathering which is based on a two phase clustering (TPC), in wireless sensor networks. The TPC is implemented on sensor Mote hardwares. With the help of TPC implemented, sensors selectively use direct links for control and forwarding time critical sensed data and relay links for data forwarding based on the user delay constraints given. Implementation study shows that TPC helps the sensors to increase a significant amount of energy while collecting sensed data from sensors in a real environment.