• Title/Summary/Keyword: Packet forwarding

Search Result 216, Processing Time 0.023 seconds

Ethernet-Based Avionic Databus and Time-Space Partition Switch Design

  • Li, Jian;Yao, Jianguo;Huang, Dongshan
    • Journal of Communications and Networks
    • /
    • v.17 no.3
    • /
    • pp.286-295
    • /
    • 2015
  • Avionic databuses fulfill a critical function in the connection and communication of aircraft components and functions such as flight-control, navigation, and monitoring. Ethernet-based avionic databuses have become the mainstream for large aircraft owning to their advantages of full-duplex communication with high bandwidth, low latency, low packet-loss, and low cost. As a new generation aviation network communication standard, avionics full-duplex switched ethernet (AFDX) adopted concepts from the telecom standard, asynchronous transfer mode (ATM). In this technology, the switches are the key devices influencing the overall performance. This paper reviews the avionic databus with emphasis on the switch architecture classifications. Based on a comparison, analysis, and discussion of the different switch architectures, we propose a new avionic switch design based on a time-division switch fabric for high flexibility and scalability. This also merges the design concept of space-partition switch fabric to achieve reliability and predictability. The new switch architecture, called space partitioned shared memory switch (SPSMS), isolates the memory space for each output port. This can reduce the competition for resources and avoid conflicts, decrease the packet forwarding latency through the switch, and reduce the packet loss rate. A simulation of the architecture with optimized network engineering tools (OPNET) confirms the efficiency and significant performance improvement over a classic shared memory switch, in terms of overall packet latency, queuing delay, and queue size.

An Efficient Update Algorithm for Packet Classification With TCAM (TCAM을 이용한 패킷 분류를 위한 효율적인 갱신 알고리즘)

  • Jeong Haejin;Song Ilseop;Lee Yookyoung;Kwon Taeckgeun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.2A
    • /
    • pp.79-85
    • /
    • 2006
  • Generally, it is essential that high-speed routers, switches, and network security appliances should have an efficient packet classification scheme in order to achieve the high-speed packet forwarding capability. For the multi-gigabit packet-processing network equipment the high-speed content search hardware such as TCAM and search engine is recently used to support the content-based packet inspection. During the packet classification process, hundreds and thousands of rules are applied to provide the network security policies regarding traffic screening, traffic monitoring, and traffic shaping. In addition, these rules could be dynamically changed during operations of systems if anomaly traffic patterns would vary. Particularly, in the high-speed network, an efficient algorithm that updates and reorganizes the packet classification rules is critical so as not to degrade the performance of the network device. In this paper, we have proposed an efficient update algorithm using a partial-ordering that can relocate the dynamically changing rules at the TCAM. Experimental results should that our algorithm does not need to relocate existing rules feature until 70$\%$ of TCAM utilization.

Pathless Multihop Packet Forwarding Protocol for Inter-vehicular Communication (차량간 통신을 위한 비경로형 멀티 홉 패킷 포워딩 프로토콜)

  • Lee, Woo-Sin;Lee, Hyuk-Joon
    • Journal of KIISE:Information Networking
    • /
    • v.34 no.5
    • /
    • pp.328-339
    • /
    • 2007
  • Conventional topology-based routing protocols are not suitable for inter-vehicular communication, where frequent route updates are necessary due to continuous and abrupt changes in network topology Position-based routing protocols are widely accepted to better serve their purpose in such a scenario as they do not require path discovery or maintenance. However they have to deal with the overhead of the location service and inaccurate position information. This paper proposes the MMFP (Multi-hop MAC Forwarding Protocol) for inter-vehicle communication that relies on reachability information collected from received packets in making a forwarding decision without path discovery. The MMFP is designed as an extension to the IEEE 802.11 MAC layer to ensure accuracy in its time-critical operations. This paper also presents some simulation results that demonstrate the superior performance of the MMFP over AODV in a realistic inter-vehicular communication.

Performance Analysis of GeoRouting Protocol in Vehicle Communication Environment (차량 통신 환경에서GeoRouting 프로토콜 성능 분석)

  • An, Sung-Chan;Lee, Joo-Young;Jung, Jae-Il
    • Journal of IKEEE
    • /
    • v.18 no.3
    • /
    • pp.427-434
    • /
    • 2014
  • The Multihop Routing of vehicle communication environment is difficult to maintain due to heavy fluctuation of network topology and routing channel according to the movement of the vehicle, road property, vehicle distribution. We implemented GeoNetworking on the basis of ETSI(European Telecommunication Standard Institute) to maintain the vehicle safety service. GeoNetworking has its own way that delivers the data through the Unicast and Broadcast. In this paper, we compared performance index such as packet delivery ratio, end-to-end delay about GeoNetworking using the QualNet Network Simulator. Previous research assessed performance of GeoUnicast. This research has been additionally performed about GeoBroadcast, and we progressed algorithm performance through the comparison of CBF(Contention based Forwarding) of GeoUnicast with Greedy forwarding of GeoBroadcast.

Self-Adaptive Location Checking Mechanism in Mobile Ad-hoc Networks (모바일 애드혹 네트워크에서 자가 적응형 위치 검증 기법)

  • Youn, Joo-Sang;Kim, Young-Hyun;Pack, Sang-Heon
    • The KIPS Transactions:PartC
    • /
    • v.17C no.3
    • /
    • pp.281-290
    • /
    • 2010
  • In geographic forwarding algorithms, traditional route maintenance requires mobile nodes periodically exchange beacon messages with their neighbors. In beacon message based forwarding scheme, a longer interval reduces the number of beacons needed, but may result in significant location errors. Conversely, a shorter interval guarantees more accurate location information, but induces control overheads.Therefore, the fixed or dynamic interval scheme based forwarding schemes cannot adapt well to different mobility environments. Also, existing schemes result in the uncertainty of neighbor node's position in the forwarding table of mobile node. Therefore, this paper presents a self-adaptive location checking mechanism based proactive geo-routing algorithm for beacon-based geographic routing. Simulation results show that the proposed routing algorithm not only significantly increases the relay transmission rate but also guarantees the high end-to-end packet delivery in low and high mobility environments.

PMIPv6 Global Handover Mechanism using Multicast Source Based Forwarding (멀티캐스트 소스기반 포워딩을 이용한 PMIPv6 글로벌 핸드오버 메커니즘)

  • Choi, Hoan-Suk;Lee, Jang-Hyun;Rhee, Woo-Seop
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.7B
    • /
    • pp.745-759
    • /
    • 2011
  • In this paper, we propose the global handover mechanism that is able to provide the unlimited range of next-generation multimedia mobile services in an integrated environment. This mechanism consists of a multicast source based forwarding scheme and a global session management scheme. Global session management scheme provides LMA session information management, global mobility and route optimization. Multicast source based forwarding scheme delivers data between previously attached LMA and newly attached LMA without packet loss. In addition, this scheme removes the redundancy of buffered data. We present a performance evaluation and features analysis by the simulations using the ns-2. Global session management scheme has a less handover latency, propagation delay and signaling cost than the conventional methods. Multicast source based forwarding scheme can deliver buffer data without loss and it has less buffer size than conventional method.

Analysis of Forwarding Schemes for Push-based Information Service in Connected Vehicles over NDN (커넥티드 차량 엔디엔 네트워크 안에 푸쉬 기반 정보 서비스를 위한 전달 기법 분석)

  • Lim, Huhnkuk
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.25 no.2
    • /
    • pp.280-285
    • /
    • 2021
  • When VNDN technology is used as a communication technology for infotainment application services of connected vehicles, it is possible to realize data-centric networking technology in which data is the subject of communication.Vehicle security attacks and hacks, performance degradation during long-distance data transmission, and frequent data loss It is possible to innovate the limitations of the current host-oriented Internet-based infotainment application service technology of connected vehicles. The data packet forwarding issue to deliver critical information data that is very sensitive to delay in the VNDN on a push-based basis to RSU (Road Side Unit), etc. is one of the issues to be solved for realizing VNDN-based application services. We comprehensively analyze existing forwarding techniques to support push-based data traffic under the environment, and compare and analyze each technique in terms of performance.

A Bit-Map Trie for the High-Speed Longest Prefix Search of IP Addresses (고속의 최장 IP 주소 프리픽스 검색을 위한 비트-맵 트라이)

  • 오승현;안종석
    • Journal of KIISE:Information Networking
    • /
    • v.30 no.2
    • /
    • pp.282-292
    • /
    • 2003
  • This paper proposes an efficient data structure for forwarding IPv4 and IPv6 packets at the gigabit speed in backbone routers. The LPM(Longest Prefix Matching) search becomes a bottleneck of routers' performance since the LPM complexity grows in proportion to the forwarding table size and the address length. To speed up the forwarding process, this paper introduces a data structure named BMT(Bit-Map Tie) to minimize the frequent main memory accesses. All the necessary search computations in BMT are done over a small index table stored at cache. To build the small index table from the tie representation of the forwarding table, BMT represents a link pointer to the child node and a node pointer to the corresponding entry in the forwarding table with one bit respectively. To improve the poor performance of the conventional tries when their height becomes higher due to the increase of the address length, BMT adopts a binary search algorithm for determining the appropriate level of tries to start. The simulation experiments show that BMT compacts the IPv4 backbone routers' forwarding table into a small one less than 512-kbyte and achieves the average speed of 250ns/packet on Pentium II processors, which is almost the same performance as the fastest conventional lookup algorithms.

A Handover Mechanism for QoS Guarantee in WiBro (초고속 휴대 인터넷 망에서 서비스 품질 보장을 위한 핸드오버 메커니즘)

  • Yeom Hong-Ju;Kim Hwa-Sung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.7A
    • /
    • pp.659-665
    • /
    • 2006
  • When using the Mobile IP which is the representative technology to secure the mobility in general IP networks, the packet loss during the handover is inescapable. To remedy the packet loss problem, the smooth handover was introduced. However, the smooth handover causes the packets sequence disruption during the packet forwarding procedure and it may result in the degradation of the network performance. The same problem also occurs in the WiBro (High-speed Portable Internet) system that is the next generation portable IP service system. The WiBro system, which provides the high speed data service just like xDSL and leased line in wired internet, aims to guarantee the portability, mobility, and the differentiated service based on IEEE 802.16. So, the handover mechanisms that solve the problems of packet loss and packet sequence distribution are required in the WiBro system. In this paper, we propose the handover mechanism and the packet sequence control algorithm that provide the reliability and the differentiated service for the unicast service in the WiBro system.

Study of Router Advertisement application plan in IPv6 router (IPv6 라우터에서의 Router Advertisement 적용 방안에 관한 연구)

  • Shin, Young-Soo;Yang, Mi-Jeong;Gang, Yu-Hwa;Kim, Tae-Il
    • Proceedings of the KIEE Conference
    • /
    • 2005.10b
    • /
    • pp.469-471
    • /
    • 2005
  • Paper searches Neighbor Discovery Protocol's IPv6 address AutoConfiguration function that is IPv6's point technology. Also, I study plan to apply Router Advertisement function to Router. Router is formed whole system by Routing Process Card that do manager and Line Card that take charge of Packet Forwarding. Present plan that embody Router Advertisement function to Line Card.

  • PDF