• Title/Summary/Keyword: IP Routing

Search Result 365, Processing Time 0.025 seconds

A Low Latency Handoff Scheme with Lossless Remote Subscription for Real-time Multimedia Communications in Mobile IP Environments (모바일 IP환경에서의 실시간 멀티미디어 통신을 위한 무손실 원격지 가입 저 지연 핸드오프)

  • Kim Ho-cheal;Kim Young-tak
    • Journal of KIISE:Information Networking
    • /
    • v.31 no.6
    • /
    • pp.620-632
    • /
    • 2004
  • IP is not suitable for mobile nodes by network-based routing because mobile nodes are dynamically change their network attachment point. Mobile-IP is an IETF standard providing continuous access to the Internet for mobile nodes, but it has the triangle routing problem. Also it has a performance degradation problem by massive packet loss during layer 3 handoff of mobile nodes. Especially, two IETF multicast support schemes for Mobile-IP do not guarantee the quality of realtime multimedia services because they have several problems such as long routing path, packet duplication(hi-directional tunneling) and massive packet loss(remote subscription). In this paper, we propose a lossless remote subscription scheme that guarantees the quality of realtime multimedia services over Mobile-IP. From the result of simulation, we verified that the proposed scheme in this paper can reduce the delay time of remote subscription by the effect of the low latency handoff scheme that is extended to apply to the multicast group management and it requires only 0.58% buffer spaces of the previously proposed lossless remote subscription scheme.

SNMP Information based Hierarchical Routing Mechanism for Fast Handoff in Mobile IP (모바일 IP에서 Fast Handoff를 위한 SNMP 정보 기반 계층 라우팅 메커니즘)

  • 류상훈;박수현;이이섭;장한이;백두권
    • Journal of KIISE:Information Networking
    • /
    • v.31 no.2
    • /
    • pp.131-145
    • /
    • 2004
  • Mobile IP has been designed only to maintain communications as mobile devices move from a place to a place, so it does not guarantee Quality of Service (QoS). Hierarchical MIPv6 improved QoS somewhat using Mobility Anchor Point(MAP), but QoS guarantee problem still remains. QoS in mobile IP is important to provide multimedia and real-timeapplications services in a mobile environment, and QoS is closely related to handoff delay. Therefore, handoff delay problem is actively studied as a main issue in mobile IP research area to guarantee QoS. In this paper, we suggest SNMP Information-based routing that adds keyword management method to Information-based routing in an active network in order to resolve such a problem, Suggested QoS controlled method and existing handoff method, simulations are carried out with NS-2 for performance evaluation. The results of simulations show an improvement on handoff delay, and consequently the QoS improvement.

Network Architecture and Routing Protocol for Supporting Mobile IP in Mobile Ad Hoc Networks (이동 애드 혹 네트워크의 Mobile IP 지원을 위한 네트워크 구조 및 라우팅 프로토콜)

  • Oh, Hoon;TanPhan, Anh
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.1A
    • /
    • pp.24-35
    • /
    • 2008
  • We propose a tree-based integrated network of infrastructure network and mobile ad hoc network to effectively support Mobile IP for mobile ad hoc networks and also proposed a network management protocol for formation and management of the integrated network and a tree-based routing protocol suitable for the integrated network. The integrated network has fixed gateways(IGs) that connect two hybrid networks and the mobile nodes in the network form a small sized trees based on the mobile nodes that are in the communication distance with a IG. A new node joins an arbitrary tree and is registered with its HA and FA along tree path. In addition, the proposed protocol establishes a route efficiently by using the tree information managed in every node. We examined the effectiveness of the tree-based integrated network for some possible network deployment scenarios and compared our routing protocol against the Mobile IP supported AODV protocol.

The States of art for Routing and Addressing Problems (ROAP) (인터넷 라우팅 및 어드레싱 문제 해결을 위한 최근 동향)

  • You, Tae-Wan;Lee, Seung-Yun
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2007.10a
    • /
    • pp.822-825
    • /
    • 2007
  • 현재 인터넷 아키텍처가 가지고 있는 가장 큰 문제는 routing과 addressing의 핵심으로 사용되는 IP 주소의 의미의 중복 (overloading semantics)이다. 즉 IP 주소는 라우팅을 위한 정보 (how), 단말의 위치 정보 (where), 그리고 이 외에 전송 계층 상위에서 사용되는 단말의 식별자 정보(who)로 사용되며, 이 의미 중복은 결국 global routing의 scalability문제를 발생시키게 된다. 즉 이러한 IP 주소의 의미 중복을 분리한다면 멀티호밍, Traffic engineering, 그리고 renumbering 등을 scalability에 영향을 주지 않고 이것들을 지원할 수 있게 되는 것이다. IETF는 이러한 라우팅과 어드레싱의 확장성 문제를 해결하기 위하여 68차 IETF 회의에서 ROAP (ROuing and Addressing Problem) BoF (Birds of a Feather) 회의를 공식적으로 개최 하였으며, 이를 통해 결정된 사항은 새로운 인터넷 아키텍처를 설계하기 위해 식별자(Identifier)와 위치정보(locator)를 분리하는 구조(ID/Loc 분리) 또는 다중 계층의 위치정보 획득이 가능한 구조(Multi-level locator design)로의 새로운 아키텍처를 만드는 것이다. 이 작업은 ROPA BoF회의 이후 IRTF의 RRG (Routing Research Group)에서 계속적으로 진행되고 있으며, 현재 관련 많은 솔루션들이 나온 상황이다. 본 논문은 이러한 ROAP에 관한 기본적인 설명과 함께, 문제점 그리고 논의되고 있는 솔루션들의 분류, 목적, 그리고 공통 이슈들에 대한 최근 동향을 설명한다.

  • PDF

A Propagated-Mode LISP-DDT Mapping System (전달모드 LISP-DDT 매핑 시스템에 관한 연구)

  • Ro, Soonghwan
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.65 no.12
    • /
    • pp.2211-2217
    • /
    • 2016
  • The Locator/Identifier Separation Protocol (LISP) is a new routing architecture that implements a new semantic for IP addressing. It enables the separation of IP addresses into two new numbering spaces: Endpoint Identifiers (EIDs) and Routing Locators (RLOCs). This approach will solve the issue of rapid growth of the Internet's DFZ (default-free zone). In this paper, we propose an algorithm called the Propagated-Mode Mapping System to improve the map request process of LISP-DDT.

A Parallel Multiple Hashing Architecture Using Prefix Grouping for IP Address Lookup (프리픽스 그룹화를 이용한 병렬 복수 해슁 IP 주소 검색 구조)

  • Kim Hye ran;Jung Yeo jin;Yim Chang boon;Lim Hye sook
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.3B
    • /
    • pp.65-71
    • /
    • 2005
  • The primary function of the Internet routers is to forward incoming packets toward their final destinations. IP address lookup is one of the most important functions in evaluating router performance since IP address lookup should be performed in wire-speed for the hundred-millions of incoming packets per second. With CIDR, the IP prefixes of routing table have arbitrary lengths, and hence address lookup by exact match is no longer valid. As a result, when packets arrive, routers compare the destination IP addresses of input packets with all prefixes in its routing table and determine the most specific entry among matching entries, and this is called the longest prefix matching. In this paper, based on parallel multiple hashing and prefix grouping, we have proposed a hardware architecture which performs an address lookup with a single memory access.

Energy Reduction Methods using Energy-aware QoS Routing Scheme and Its Characteristics in IP Networks (IP Network에서 Energy-aware QoS Routing에 의한 에너지 감소 방법 및 특성)

  • Han, Chimoon
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.49 no.9
    • /
    • pp.27-34
    • /
    • 2012
  • Today the energy consumption of ICT networks is about 10% of the worldwide power consumption and will be remarkably increased in the near future. For that reason, the energy saving topics of ICT networks are actually studying in various research institutes. This paper studies the possible energy saving methods assuring the QoS of networks on network level. This paper assumed the energy consumption models according to energy profiles of node and link in IP networks. Especially it formulates the energy problem of a minimum energy consumption with various energy profile models and suggests the methods of energy-aware QoS routing under energy saving and network QoS sustaining condition. It shows the large difference of energy saving according to energy profiles and the possibility of energy saving by using the appropriate energy profile model in the simulation experiment. This paper shows that min_used_path(MP) heuristic of energy-aware QoS routing is the excellent method compared with other heuristic methods as view of reduction ratio of nodes and links and energy saving effect under network QoS sustaining condition. As a result, this paper confirms that the min_used_path(MP) heuristic of energy-aware QoS routing can get energy saving and sustaining of network QoS in IP networks.

QoS controlled handoff by SNMP information-based routing in active network (액티브 네트워크에서 SNMP 정보기반 라우팅을 이용한 핸드오프 QoS 향상 기법)

  • Jang, Hani;Park, Soo-Hyun;Baik, Doo-Kwon
    • The KIPS Transactions:PartC
    • /
    • v.9C no.6
    • /
    • pp.883-892
    • /
    • 2002
  • Mobile IP has been designed only to maintain communications as they move from place to place, so it doesn't guarantee Quality of Service (QoS). QoS in mobile IP is important to provide multimedia and real-time applications services in mobile environment, and it is closely related to handoff delay. Therefore, handoff delay problem is actively studied to guarantee QoS as a main issue in mobile IP research area. In this paper, we suggest SNMP Information-based routing that adds keyword management method to Information-based routing in active network in order to resolve such a problem, and then suggest QoS controlled handoff based on SNMP Information-based routing. After modeling of suggested method and existing handoff method, simulations are carried out with NS -2 for performance evaluation. The results of simulations show the some improvement on handoff delay, and therefore on QoS improvement.

Enabling Route Optimization for Large Networks with Location Privacy Consideration

  • Thanh Vu Truong;Yokota Hidetoshi;Urano Yoshiyori
    • Proceedings of the IEEK Conference
    • /
    • summer
    • /
    • pp.42-46
    • /
    • 2004
  • Mobile IP [9] was introduced to help the mobile user to be contacted with a single IP address even though the point-of-access changes. However, mobile IP creates the so-called 'triangle routing' which makes the delays for data packets longer, as well as creating unnecessary traffic at the home network of the mobile user. To overcome this, Route Optimization (RO) for mobile IP [1] was proposed, which eliminated the triangle routing phenomenon. But [l] requires that the network protocol stack of all existing hosts to change. Privacy is also another matter to be considered. This paper introduces a scheme called Peer Agent scheme to implement RO for mobile IP without requiring existing hosts to change. Method to preserve location privacy while still enabling RO is also considered.

  • PDF

Determining the shortest paths by using the history of IP network traffic records (IP 네트워크에서 트래픽 레코드를 이용한 최단 거리 결정 기법)

  • Hong, Sung-Hyuck
    • Journal of Digital Convergence
    • /
    • v.10 no.4
    • /
    • pp.223-228
    • /
    • 2012
  • There are many algorithms to improve the network traffic and to avoid losing packets in the network. This paper proposed determining the shortest paths for hops, which are in the middle of the source and destination. The shortest path in this paper means the fastest path between them. Recently, dynamic routing algorithm is currently used now but this paper suggests the fastest paths between the source and the destination is by using the record of the network traffic history. People are using the networking and the network traffic is always corresponding to how many people use the networking in specific time. Therefore, I can predict the network condition by referring to the history of network traffic record, and then the shortest path can be produced without using RIP too much. It will be helpful to improve the network traffic.