• Title/Summary/Keyword: Mobility Anchor Point

Search Result 49, Processing Time 0.051 seconds

A Study of Performance Enhancement in Hierarchical Mobile IPv6 using Fast-Handoff

  • Kim, Hong-Sik;Kim, Hyun-Yong;Jung, Joseph;Song, Joo-Seok
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2004.05a
    • /
    • pp.1417-1420
    • /
    • 2004
  • The combination of Fast-Handoff and Hierarchical Mobile IPv6 (F-HMIPv6) allows the anticipation of the layer3 handoff such that data traffic can be efficiently redirected to the mobile node's new location before it moves there. However, after moving to the new Access Router (NAR), if the mobile node (MN) sends the Local Binding Update (LBU) to the Mobility Anchor Point (MAP) before receiving all of the buffered packet from the NAR, the MN may receive the general packet from the MAP. That is, the MN may simultaneously receive two types of packet which has different sequence number. These cause the confusion in packet order, and the MN sends the dup ack for the packet retransmission to the CN. It results in the degradation of the TCP performance. Therefore, we propose the scheme for minimizing the out-of-sequence packet in F-HMIPv6.

  • PDF

Improving Performance of HMIPv6 Networks with Adaptive TUE Selection Scheme (적응적 MAP 선택을 통한 HMIPv6 네트워크의 성능 향상 알고리즘)

  • Chung, Won-Sik;Lee, Su-Kyoung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.11B
    • /
    • pp.945-952
    • /
    • 2006
  • In hierarchical mobile IPv6 networks, when an inter-domain handover occurs, mobile nodes suffer from excessive signaling traffic and long handover latency, resulting in possible disruption of ongoing connections. Further, the selection of MAP and its load status critically affect the overall system performance. Therefore, we propose a dynamic MAP selection scheme that seeks to distribute load among MAPs as well as reduces inter-domain handovers. Performance is evaluated from not only an analytic model of average signaling cost but also simulation. The analytical and simulation results show that our proposed scheme improves load distributedness and reduces inter-domain handovers and signaling cost compared to another existing IETF based approach.

A CRN Discovery Scheme for NSIS based Aggregated Resource Reservations (NSIS 기반 군집 자원예약을 위한 CRN 발견 방안)

  • Byun, Hae-Sun;Lee, Mee-Jeong
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2007.05a
    • /
    • pp.1163-1166
    • /
    • 2007
  • 핸드오버가 발생하는 이동망 환경에서 주요 이슈 중 하나는 핸드오버 후 MN(Mobile Node)의 트래픽이 전송될 새로운 경로 상에 자원 재예약을 위한 지연 시간을 최소화하는 것이다. 이를 위해, 데이터 전달 경로가 변경된 경로에서만 자원예약 시그널링이 이루어지도록 CRN(Crossover Node)을 발견하는 것이 중요하다. 이동망 환경에서 자원 재예약을 위한 CRN은 SID(Session ID)를 이용하여 발견될 수 있다. 그러나 HMIPv6 네트워크에서 MAP(Mobility Anchor Point)과 HA(Home Agent)간 군집(Aggregate) 자원 예약이 이루어진 경우에서는 SID를 이용하여 CRN을 발견할 수 없다. 왜냐하면, MN의 핸드오버 후, 종단간 SID는 동일할지라도 이전 MAP과 HA간 설립된 세션의 군집 SID가 새로운 MAP과 HA간 설립된 세션의 군집 SID와 다르기 때문이다. 이에, 본 논문에서는 HMIPv6 네트워크에서의 CRN 발견방안을 제안한다. 제안하는 방안에서는 시그널링 메시지에 이전 군집 세션 정보를 포함하여 전달함으로서 시그널링 메시지가 목적지까지 도달하기 전에 CRN이 발견될 수 있도록 하였다. 제안하는 방안은 군집 자원예약이 갖는 시그널링 및 플로우별 상태 정보 감소 효과를 그대로 유지하면서, MN의 핸드오버 후, 자원 재예약을 위한 지연 시간을 단축시킴으로서 통신 성능을 향상 시킬 수 있을 것으로 기대된다.

  • PDF

An Efficient Multicast Scheme for Hierarchical Mobile IPv6 (계층적 Mobile IPv6를 위한 효율적 멀티캐스트 방안)

  • Kim, Byung-Soon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.7A
    • /
    • pp.597-602
    • /
    • 2005
  • This paper proposes an efficient multicast scheme for the hierarchical mobile IPv6(HMIPv6). If a mobility anchor point(MAP) in a new domain does not support multicasting, an entering group member cannot join the multicast group through the new MAP The group member thus keeps receiving multicast packets from its home agent(HA) using Mobile IPv6 (MIPv6). This increases the propagation delay of binding update (BU) messages. However, our scheme enables an entering group member to keep receiving packets from the old multicast MAP. It can also reduce tunneling costs, total delivery costs and handover latency. We simulated the performance of our scheme by comparing it with the seamless multicast handover in a hierarchical mobile Pv6 (M-HMIPv6) using the delivery cost and handover latency factors.

MAP Selection Mechanisms based on location of mobile node in Hierarchical Mobile IPv6 (HMIPv6 에서 이동노드의 위치에 따른 MAP 선택기법)

  • Nam, Hyun-Jae;Han, Byung-Jin;Lee, Jong-Hyouk;Chung, Tai-Myoung
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2007.11a
    • /
    • pp.1073-1076
    • /
    • 2007
  • HMIPv6 (Hierarchical Mobile IPv6)는 MAP (Mobility Anchor Point)을 이용하여 이동노드를 효율적으로 관리하는 방안을 제시하였다. MAP 에 걸리는 부하는 HMIPv6 로 구성된 네트워크에 진입한 이동노드가 어느 MAP 을 선정하느냐에 따라 달라진다. MAP 을 선정하는 방법으로 이동노드의 이동속도나 MAP 과 이동노드의 거리를 고려하여 선택하는 방법 등이 연구되었다. 하지만 이들은 각각 이동속도 측정을 위한 추가적인 비용이 발생하거나 특정 MAP 에 몰리는 현상을 효과적으로 해결하지 못하는 문제점이 있다. 본 논문은 HMIPv6 로 구성된 네트워크에서 네트워크 관리지역의 중앙부분을 지나는 이동노드가 바깥부분을 지나는 이동노드보다 해당 네트워크에 오래 머무른다는 사실에 착안하여 지역정보 기반의 MAP 선정기법을 제안한다. 제안하는 기법은 우선 네트워크 관리지역 내에 분포된 MAP 들을 지역정보에 기반하여 계층적으로 구성한다. 그 다음, 중앙부분을 지나는 이동노드에게 보다 넓은 지역을 담당하는 높은 레벨의 MAP 을 선정하고 바깥부분을 지나는 이동노드에게 보다 좁은 지역을 담당하는 낮은 레벨의 MAP 을 선정한다. 이로써 전체적으로 발생하는 바인딩 업데이트 비용을 줄이고 MAP 의 로드밸런싱 효과를 얻는다.

  • PDF

ROHMIP : Route Optimization Employing HMIP Extension for Mobile Networks (ROHMIP : 이동망에서 확장된 HMIP를 적용한 경로 최적학)

  • Rho, Kyung-Taeg;Jung, Soo-Mok
    • Journal of the Korea Society of Computer and Information
    • /
    • v.12 no.6
    • /
    • pp.235-242
    • /
    • 2007
  • Network Mobility Basic Support protocol reduces location-update signaling by making network movements transparent to the mobile nodes (MNs) behind the mobile router (MR), but causes some problems such as sub-optimal routing and multiple encapsulations. This paper proposes an Route Optimization Employing HMIP Extension for Mobile Networks (ROHMIP) scheme for nested nubile networks support which introduces HMIP concept with relation information between MNNs behind a MR and the MR in order to localize handoff, to optimize routing and especially reduce handoff signal overhead. With ROHMIP, a mobile network node (MNN) behind a MR performs route optimization with a correspondent node (CN) as the MR sends a binding update message (BU) to mobility anchor point (MAP) via root-MR on behalf of all active MNNs when the mobile network moves. This paper describes the new mechanisms and provides simulation results which indicate that our proposal reduces transmission delay, handoff latency and signaling overhead.

  • PDF

An Adaptive Load Control Scheme in Hierarchical Mobile IPv6 Networks (계층적 모바일 IP 망에서의 적응형 부하 제어 기법)

  • Pack Sang heon;Kwon Tae kyoung;Choi Yang hee
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.10A
    • /
    • pp.1131-1138
    • /
    • 2004
  • In Hierarchical Mobile Ipv6 (HMIPv6) networks, the mobility anchor point (MAP) handles binding update (BU) procedures locally to reduce signaling overhead for mobility. However, as the number of mobile nodes (MNs) handled by the MAP increases, the MAP suffers from the overhead not only to handle signaling traffic but also to Process data tunneling traffic. Therefore, it is important to control the number of MNs serviced by the MAP, in order to mitigate the burden of the MAP. We propose an adaptive load control scheme, which consists of two sub-algorithms: threshold-based admission control algorithm and session-to-mobility ratio (SMR) based replacement algorithm. When the number of MNs at a MAP reaches to the full capacity, the MAP replaces an existing MN at the MAP, whose SMR is high, with an MN that just requests binding update. The replaced MN is redirected to its home agent. We analyze the proposed load control scheme using the .Markov chain model in terms of the new MN and the ongoing MN blocking probabilities. Numerical results indicate that the above probabilities are lowered significantly compared to the threshold-based admission control alone.

A Crossover Node Discovery and Local Repair Mechanism for Reducing the Signaling Delay of Resource Reservation on HMIPv6 Networks (HMIPv6 네트워크에서 자원예약 시그널링 지연을 줄이기 위한 크로스오버 노드 발견 및 지역적 자원 갱신 방안)

  • Byun, Hae-Sun;Lee, Mee-Jeong
    • The KIPS Transactions:PartC
    • /
    • v.15C no.1
    • /
    • pp.37-44
    • /
    • 2008
  • In order to minimize the signaling delay for a resource reservation on the new routing path after the handover of Mobile Node(MN) is completed, it is important to discover the crossover node where the old and new routing paths meet. With the 크로스오버 노드 being found, the signaling messages only need to be transferred on the changed part of the end-to-end path. The crossover node is generally discovered using the end-to-end Session ID(SID) of the established session between MN and Correspondent Node(CN). However, in the Hierarchical Mobile IPv6(HMIPv6) network, if the Mobile Anchor Point (MAP) reserves the resource by aggregate with the Home Agent(HA), the crossover node discovery cannot be performed in the general way since the aggregate SID that has established between the previous MAP and HA is different from the that of the current MAP and HA after MN's handover. In this paper, we propose a mechanism to discover the crossover node within the tunnel between the MAP and the HA in an HMIPv6 network, assuming that the Next Steps in Signaling(NSIS) is deployed for the resource reservation and the aggregate reservation is applied over the MAP and HA tunnel. The local repair required for the change of path is performed upon the crossover node discovery. The simulation results show that the proposed scheme reduces the signaling delay for the reservation and outperforms the existing scheme with respect to throughput during the handover.

Improving Transmission Performance of Real Time Traffic in HMIPv6 (HMIPv6에서 실시간 트래픽의 전송 성능 향상 방안)

  • Park, Won-Gil;Kim, Byung-Gi
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.11B
    • /
    • pp.960-968
    • /
    • 2006
  • HMIPv6 improved the handover management of basic MIPv6 by introducing the new protocol agent MAP. In this new protocol, MAP instead of the Mobile Node intercepts all packets and redirects the packets to CoA of the Mobile Node. However, this process may degrade the network performance due to the centralization phenomenon of registration occurring in the hierarchical MAP structure. ffe propose two schemes to improve real time traffic performance. First proposal is a MAP selection mettled in which MAP is selected based on traffic characteristics. And we also propose differentiated traffic processing scheme with multi-level queues when Home Agent or Correspondent Nodes process Binding Update messages. Performances of the proposed scheme are analyzed. Analysis result shows that our model has good performance in the respect of location update cost and total cost of Mobile Nodes.