• Title/Summary/Keyword: IP Router

Search Result 211, Processing Time 0.03 seconds

A Study on QoS Interface for open programmable Router (개방형 프로그래머블 라우터를 위한 QoS 인터페이스 연구)

  • Lee, Jin-Su;Hong, Seon-Mi;Kim, Tae-Il;Jin, Sung-Il
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2000.10b
    • /
    • pp.1533-1536
    • /
    • 2000
  • 근래 인터넷을 통한 대용량의 멀티미디어 데이터와 여러 종류의 사용자 서비스를 충족하기 위해서 네트워크에 대한 연구가 활발히 진행되어지고 있다. 따라서 본 논문에서는 차세대 개방형 네트워크에 적용할 수 있는 라우터를 위한 객체 지향적 Open Orogrammable Interface 기술을 연구함으로써 앞으로 IP Router에 도입될 정책이나 구성의 동적 변경에 유연성 있게 대처할 수 있고, 향후 수요가 급증하게 될 다양한 대용량 멀티미디어 데이터와 여러 종류의 QoS 에도 능동적으로 대처할 수 있는 방안을 제시한다.

  • PDF

Improvement of Handoff-state and QOS in Wireless Environment

  • Jeong, You-Sun;Choe, U-Gin
    • Journal of information and communication convergence engineering
    • /
    • v.8 no.1
    • /
    • pp.1-5
    • /
    • 2010
  • In this paper, we propose for improving QoS in wireless micro cellular network using Cellular-IP/PRC(Paging Route Cache) with Paging Cache and Route Cache in Cellular-IP and propose for performance of realtime and non-real time handoff service using Handoff state machine Paging Route Cache. Although the Cellular-IP/PRC technology is devised for mobile internet communication, it bas its vulnerability in frequent handoff environment. On the other hand, Cellular IP combines the capability of cellular networks to provide high performance handoff and efficient location management of active and idle mobile users with the inherent flexibility, robustness and scalability found in IP networks. Also Cellular-IP/PRC use semi-soft handoff. During semi-soft hand off a mobile host may be in contact with either of the old and new base stations and receive packets from them. Packets intended to the mobile node are sent to both base stations and buffered, so when the mobile host eventually moves to the new location it can continue to receive packets without interruption. It should be suitable for realtime service such as multimedia traffic. But, much waste of resource will occur in this method, especially for non-real time services such as FTP and E-mail. Therefore, a new algorithm that performs different handoff according to characteristic of each traffic by use of reserved field in IP packet is proposed in this thesis. This hand off state machine using differentiated handoff improves quality of services in Cellular-IP/PRC. Suggested algorithm shows better performance than existing technology in wireless mobile internet communication environment. Matlab simulation results are improving QoS, show call drop and call blocking provided to Paging Router Cache during handoff state machine in Cellular-IP/PRC.

An Improved Model Design for Traceback Analysis Time Based on Euclidean Distance to IP Spoofing Attack (IP 스푸핑 공격 발생 시 유클리드 거리 기반의 트레이스 백 분석시간 개선 모델)

  • Liu, Yang;Baek, Hyun Chul;Park, Jae Heung;Kim, Sang Bok
    • Convergence Security Journal
    • /
    • v.17 no.5
    • /
    • pp.11-18
    • /
    • 2017
  • Now the ways in which information is exchanged by computers are changing, a variety of this information exchange method also requires corresponding change of responding to an illegal attack. Among these illegal attacks, the IP spoofing attack refers to the attack whose process are accompanied by DDoS attack and resource exhaustion attack. The way to detect an IP spoofing attack is by using traceback information. The basic traceback information analysis method is implemented by comparing and analyzing the normal router information from client with routing information existing in routing path on the server. There fore, Such an attack detection method use all routing IP information on the path in a sequential comparison. It's difficulty to responding with rapidly changing attacks in time. In this paper, all IP addresses on the path to compute in a coordinate manner. Based on this, it was possible to analyze the traceback information to improve the number of traceback required for attack detection.

Pushback based Advanced ICMP Traceback Mechanism Against DDoS Attack (DDoS 공격에 대한 Pushback 기반 개선된 ICMP Traceback 기법)

  • Lee Hyung-Woo
    • Journal of Internet Computing and Services
    • /
    • v.5 no.1
    • /
    • pp.85-97
    • /
    • 2004
  • Distributed Denial-of-Service(DDoS) attack prevent users from accessing services on the target network by spoofing its origin source address with a large volume of traffic. The objective of IP Traceback is to determine the real attack sources, as well as the full path taken by the attack packets. Existing IP Traceback methods can be categorized as proactive or reactive tracing. Proactive tracing(such as packet marking and messaging) prepares information for tracing when packets are in transit. Reactive tracing starts tracing after an attack is detected. In this paper, we propose a "advanced ICMP Traceback" mechanism. which is based on the modified push back system. Proposed mechanism can detect and control DDoS traffic on router and can generate ICMP Traceback message for reconstructing origin attack source.ck source.

  • PDF

Transmission Performance Evaluation of MPR-based Wireless Communication System Applying for Disaster Investigation (재난조사 활용을 위한 MPR기반 무선통신 전송 성능 평가)

  • Kim, Seong Sam;Shin, Dong Yoon;Noh, Hyun Ju
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.22 no.3
    • /
    • pp.754-762
    • /
    • 2021
  • Seamless wireless communication network access technology enables users to guarantee service continuity. Hence, it is necessary for disaster situations in which network service may be interrupted. The Multi-path router is a technology to improve network stability and strengthen field operability, particularly in a disaster environment where network failure can occur by providing high-performance data transmission using multi-communication networks and network security by VPN-based wireless IP. In this paper, a prototype system for an MPR-based wireless communication network was proposed to improve the operation performance for disaster field investigation applications. A comparative experiment was performed on various data transmission performances with the existing single wireless communication network. In addition, another experiment was conducted by measuring the data packet transmission and receiving performance in the existing/new wireless communication system first and then assessing the UDP transmission performance in a single router environment to understand the transmission capability of the new MPR. The experimental results showed that the sending and receiving performance was improved by approximately double that of the existing single wireless communication system. The proposed prototype system is expected to allow users to share and disseminate collected on-site data more quickly and efficiently during a disaster site investigation.

Design of Compact Data Integration and Convergence Device Using Esp8266 Module (Esp8266모듈을 이용한 소형 데이터 통합 및 융합장치 설계)

  • Lee, Dong-Seok;Lim, Joong-Soo
    • Journal of the Korea Convergence Society
    • /
    • v.8 no.2
    • /
    • pp.15-20
    • /
    • 2017
  • In this paper, Esp8266, Node.js, and TCP / IP socket communication are used to design a compact data integration device. This device is designed to configure server and client using Esp8266 module that supports Wifi connection and to support bidirectional data transmission using TCP / IP socket communication. The server is configured using the Node.js operating system, and the database is integrated using Mysql. The network is designed to have a separate IP address by assigning a private IP address to the router, such as a home network. This device can transmit data bidirectionally, store individual client data on the server side, and can check the flow of data transmitted bidirectionally through wire-shark, so that it can be used as a compact real-time data integration and convergence device.

Weighted Binary Prefix Tree for IP Address Lookup (IP 주소 검색을 위한 가중 이진 프리픽스 트리)

  • Yim Changhoon;Lim Hyesook;Lee Bomi
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.11B
    • /
    • pp.911-919
    • /
    • 2004
  • IP address lookup is one of the essential functions on internet routers, and it determines overall router performance. The most important evaluation factor for software-based IP address lookup is the number of the worst case memory accesses. Binary prefix tree (BPT) scheme gives small number of worst case memory accesses among previous software-based schemes. However the tree structure of BPT is normally unbalanced. In this paper, we propose weighted binary prefix tree (WBP) scheme which generates nearly balanced tree, through combining the concept of weight to the BPT generation process. The proposed WBPT gives very small number of worst case memory accesses compared to the previous software-based schemes. Moreover the WBPT requires comparably small size of memory which can be fit within L2 cache for about 30,000 prefixes, and it is rather simple for prefix addition and deletion. Hence the proposed WBPT can be used for software-based If address lookup in practical routers.

High-speed W Address Lookup using Balanced Multi-way Trees (균형 다중 트리를 이용한 고속 IP 어드레스 검색 기법)

  • Kim, Won-Iung;Lee, Bo-Mi;Lim, Hye-Sook
    • Journal of KIISE:Information Networking
    • /
    • v.32 no.3
    • /
    • pp.427-432
    • /
    • 2005
  • Packet arrival rates in internet routers have been dramatically increased due to the advance of link technologies, and hence wire-speed packet processing in Internet routers becomes more challenging. As IP address lookup is one of the most essential functions for packet processing, algorithm and architectures for efficient IP address lookup have been widely studied. In this paper, we Propose an efficient I address lookup architecture which shows yeW good Performance in search speed while requires a single small-size memory The proposed architecture is based on multi-way tree structure which performs comparisons of multiple prefixes by one memory access. Performance evaluation results show that the proposed architecture requires a 280kByte SRAM to store about 40000 prefix samples and an address lookup is achieved by 5.9 memory accesses in average.

An Implementation of Explicit Multicast with Mobile IP for Small Group Communications in Mobile Networks (이동통신환경에서의 소규모 그룹통신을 위한 XMIP 프로토콜의 구현)

  • PARK IN-SOO;PARK YONG-JIN
    • The KIPS Transactions:PartC
    • /
    • v.12C no.2 s.98
    • /
    • pp.267-280
    • /
    • 2005
  • In this paper, we implement and verify XMIP integrating IETF Mobile IP and the Explicit Multicast mechanism for a great number of small group multicast communications. U a source node sends Xcast packets explicitly inserting destination nodes into the headers, each Xcast router decides routes and forwards the packets toward each destination node based on unicast routing table without the support of multicast trees. n is a straightforward and simple multicast mechanism just based on a unicast routing table without maintaining multicast states because of the inheritance from the Explicit Multicast mechanism. This research modifies and extends the functionality of IETF Mobile IP's mobility agents, such as HA/FA to HA+/FA+ respectively, considering interworking with Xcast networks. Xcast packets captured by HA+ are forwarded into X-in-X tunnel interfaces for each FA+ referred to the binding table of HA.. This X-in-X tunneling mechanism can effectively solve the traffic concentration problem of IETF Mobile IP multicast services. Finally WLAN-based testbed is built and a multi-user Instant messenger system is developed as a Xcast application for finally verify the feasibility of the implemented XMIP/Xcast protocols.

A Strategy of the Link Saving Routing and Its Characteristics for QoS Aware Energy Saving(QAES) in IP Networks (IP Network에서 QoS Aware Energy Saving(QAES)을 위한 링크 절약 라우팅의 한 방법 및 특성)

  • Han, Chimoon;Kim, Sangchul
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.51 no.5
    • /
    • pp.76-87
    • /
    • 2014
  • Today the energy consumption of ICT networks is about 10% of the worldwide power consumption and is predicted to increase remarkably in the near future. For this reason, this paper studies energy saving strategies assuring the network-level QoS. In the strategies, the energy consumption of NIC(network interface card) on both endpoint of links decreases by selecting links and making them sleep when the total traffic volume of the IP network is lower than a threshold. In this paper, we propose a heuristic routing algorithm based on so-called delegating/delegated routers, and evaluate its characteristics using computer simulation considering network-level QoS. The selection of sleep links is determined in terms of the number of traffic paths (called min_used path) or the amount of traffics(called min_used traffic) through those kinks. To our experiment, the min_used traffic method shows a little better energy saving but the increased path length compared to the min_used path method. Those two methods have better energy saving characteristics than the random method. This paper confirms that the delegating/delegated router-based routing algorithm results in energy saving effects and sustains network-level QoS in IP networks.