• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.4B
• /
• pp.559-565
• /
• 2010

In Mobile IPv6 handover should be followed by RO(Route Optimization) to support direct communication between a MN(Mobile Node) and CN(Correspondent Node). For this RR MIPv6 must perform RR(Return Routability) procedure before BU(Binding Update) to CN. The Fast Handover for MIPv6(FMIPv6) also performs the RR test for MN to communicate with CN directly. However, Return Routability test has long latency resulting in handover delay in MIPv6. This paper proposes the method to reduce the handover deay by reducing RO latency in FastMobile IPv6.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.20 no.1
• /
• pp.193-202
• /
• 2021

The update of a high-precision map was carried out by modifying the geometric information using ortho-images or point-cloud data as the source data and then reconstructing the relationship between the spatial objects. These series of processes take considerable time to process the geometric information, making it difficult to apply real-time route planning to a vehicle quickly. Therefore, this study proposed a method to update the road network for route planning using a graph data structure and storage type of graph data structure considering the characteristics of the road network. The proposed method was also reviewed to assess the feasibility of real-time route information transmission by applying it to actual road data.

• Journal of Communications and Networks
• /
• v.13 no.4
• /
• pp.408-417
• /
• 2011

The stringent performance requirement for the high efficiency of routing protocols on the Internet can be satisfied by exploiting the threaded border gateway protocol (TBGP) on multi-cores, but the state-of-the-art TBGP performance is restricted by a mass of contentions when racing to access the routing table. To this end, the highly-efficient parallel access approach appears to be a promising solution to achieve ultra-high route processing speed. This study proposes a general routing table structure consisting of two-level tries for fast parallel access, and it presents a heuristic-based divide-and-recombine algorithm to solve a mass of contentions, thereby accelerating the parallel route updates of multi-threading and boosting the TBGP performance. As a projected TBGP, this study also modifies the table operations such as insert and lookup, and validates their correctness according to the behaviors of the traditional routing table. Our evaluations on a dual quad-core Xeon server show that the parallel access contentions decrease sharply by 92.5% versus the traditional routing table, and the maximal update time of a thread is reduced by 56.8 % on average with little overhead. The convergence time of update messages are improved by 49.7%.

• Journal of Internet Computing and Services
• /
• v.9 no.1
• /
• pp.9-19
• /
• 2008

This paper propose the issue of connecting nested NEMO (Network Nobility) networks to global IPv6 networks, while supporting IPv6 mobility. Specifically, we consider a self-addressing including topology information IPv6-enabled NEMO infrastructure. The proposed self-organization addressing protocol automatically organized mobile routers into free architecture and configuration their global IPv6 addresses. BU(binding update) to MR own HA and internal rouging, hosed on longest prefix matching and soft state routing cache, are specially designed for IPv6-based NEMO. In conclusion, numeric analysis ore conducted to show more efficiency of the proposed routing protocols than other RO (Route Optimization) approaches.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.11 no.4
• /
• pp.9-17
• /
• 2007

Network Mobility basic support protocol (NEMO Basic) extends the operation of Mobile IPv6 to provide uninterrupted Internet connectivity to the communicating nodes of mobile networks. The protocol uses a mobile router (MR) in the mobile network to perform prefix scope binding updates with its home agent (HA) to establish a bi-directional tunnel between the HA and MR. This solution reduces location-update signaling by making network movements transparent to the mobile nodes (MNs) behind the MR. However, delays in data delivery and higher overheads are likely to occur because of sub-optimal routing and multiple encapsulation of data packets. To manage the mobility of the mobile network, it is important to minimize packet overhead, to optimize routing, and to reduce the volume of handoff signals over the nested mobile network. This paper proposes en aggregate router-assisted route optimization (ARARO) scheme for nested mobile networks support which introduces a local anchor router in order to localize handoff and to optimize routing. With ARARO, 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 aggregate router (AGR) via root-MR on behalf of all active MNNs when the mobile network moves. This paper describes the new architecture and mechanisms and provides simulation results which indicate that our proposal reduces transmission delay, handoff latency and signaling overhead. To evaluate the scheme, we present the results of simulation.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.5
• /
• pp.119-131
• /
• 2009

Existing proposals on route optimization for nested Network Mobility(NEMO) have a problem that it is difficult to optimize a route promptly in an environment where a MR moves frequently. Also, they have L3 handoff latency as well as route optimization latency until an optimized route is formed. In this paper, we propose a L3 handoff scheme that supports fast route optimization for nested NEMO without any additional optimization procedure. To achieve this, our proposed scheme is designed to include a procedure that an AR acquires address informations of a MR. After receiving binding update message from the MR, the AR performs the binding update procedure with the MR's HA on behalf of the MR. Packets are delivered to the AR only passing by the MR's HA after a bi-directional tunnel is formed between the AR and the HA. The result of our performance evaluation has shown that the proposed scheme could provide excellent performance compared with the RRH and the ONEMO.

• Proceedings of the Korea Society for Simulation Conference
• /
• 2005.11a
• /
• pp.13-18
• /
• 2005

Routers determine routing path considering network topology and link state information for providing QoS (quality of service) guarantee. Therefore, it is important that routers know link state information to calculate routing path. However, if routers generate link state update messages inordinately, their router performance are reduced due to the process of link state update messages. On the other side, in case that link state information is not updated appropriately, route setup requests can be rejected even though there exist routes. In this paper, we propose an algorithm to improve router performance and evaluate the proposed algorithm performance compare with conventional algorithm by simulations.

• The KIPS Transactions:PartC
• /
• v.17C no.2
• /
• pp.153-158
• /
• 2010

Mobile IPv6 is one of method can keep Mobile node's session. To solve legacy Mobile IPv4's triangular routing problem, in Mobile IPv6, Mobile Node could directly communicate with Correspond node by Binding Update. But, attacker could interfere Return Routability Procedure that is Correspond node check Home address and Care of address reachable. At this result, Attacker is able to hijack Session to correspond node from Mobile node. In This paper, We propose new Binding Update scheme for solving that problem. Our approach is that MN gives association both home token and care of token using onewayness of keyed hash fuction. From security and performance analysis, we can see that proposed binding Update Scheme can achieve stronger security than legacy scheme and at the same time requires minimal computational overhead.

• Proceedings of the Korea Contents Association Conference
• /
• 2004.05a
• /
• pp.351-356
• /
• 2004

The binding update of the Mobile IPv6 which does a route optimization in basic by the node which moves frequently brings about the signaling traffic increase of binding update. It supplements this the MAP(Mobile Anchor Point) for to let, and Hierarchical Mobile IPv6 which considers a macro mobility and a micro rambling regional mobility was proposed. But Mobile IPv6 when transmitting the packet, always does to pass by the mP, the packet intensive actual condition of the MAP to occur it does not guarantee a route optimization. In this study, It accomplishes the course improvement which considers the mobility of mobile node and it interprets the relaxation quality of packet intensive actual condition with the MAP

• Proceedings of the Korea Information Processing Society Conference
• /
• 2008.05a
• /
• pp.1035-1038
• /
• 2008

Network mobility (NEMO) has been studied extensively due to its potential applications in military and public transportation. NEMO Basic Support Protocol (NBSP) [1], the current NEMO standard based on mobile IPv6, can be readily deployed using the existing mobile IPv6 infrastructure. However, for Nested network mobility, multi-level tunnel and too many Binding Update packets results in substantial performance overhead, generally known as route sub-optimality, especially in the bottleneck root mobile router (root-MR) and Access Router. In this paper, we propose a route optimization mechanism for nested network mobility management to reduce the overhead of root-MR. In this system, Mobile Router (MR) has a cache that stores Mobile Network Nodes' (MNN) information, Correspondent Nodes' (CN) information for every MNN，and the attachments information with its subnet MRs. Home Agent performs Binding Update with CNs responsible for MRs. Through this mechanism, the number of tunnel is limited between CN and MR and the overhead of root-MR is reduced obviously.