• Proceedings of the Korea Information Processing Society Conference
• /
• 2010.04a
• /
• pp.641-644
• /
• 2010

Proxy Mobile IPv6에서는 같은 Local Mobility Anchor 내의 다른 Mobile Access Gateway에 있는 Mobile Node 들의 패킷 전송에 있어서 발생하는 삼각 라우팅 문제는 여전히 존재한다. 이 문제점을 해결하기 위해 인터넷 드래프트 Liebsch와 Dutta에서 제안된 두 가지 Route Optimization 기법의 동작과정을 알아보고, 상호 데이터 전송 상황에서 더 나은 성능을 제공하는 Correspondent Route Optimization 기법을 제안한다. 통신을 맺고 있던 Mobile Node가 Local Mobility Anchor 내 다른 Mobile Access Gateway의 범위로 이동할 경우 발생하는 핸드오버 상황에서 Correspondent Route Optimization 기법을 사용하여 signaling cost를 줄이는 방법을 제안한다. 제안한 Route Optimization 기법은 Correspondent Flag를 추가하여 Mobile Access Gateway 간 Corresponding Binding을 완료하여, Route Optimization을 설정한다. 제안한 Correspondent Route Optimization 기법은 기존의 기법보다 상호 데이터 전송 상황에서 Route Optimization에 필요한 메시지 수가 적기 때문에 시그널링 비용이 감소한다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2009.11a
• /
• pp.579-580
• /
• 2009

Proxy Mobile IPv6에서는 같은 Local Mobility Anchor 내의 다른 Mobile Access Gateway에 있는 Mobile Node들의 패킷 전송에 있어서 발생하는 삼각 라우팅 문제는 여전히 존재한다. 이 문제점을 해결하기 위해 인터넷 드래프트 Liebsch와 Dutta에서 제안된 두 가지 Route Optimization 기법의 동작 과정을 알아보고, 상호 데이터 전송 상황에서 더 나은 성능을 제공하는 Correspondent Route Optimization 기법을 제안한다. 제안한 Route Optimization 기법은 Correspondent Flag를 추가하여 Mobile Access Gateway 간 Corresponding Binding을 완료하여, Route Optimization을 설정한다. 제안한 Correspondent Route Optimization 기법은 기존의 기법보다 상호 데이터 전송 상황에서 Route Optimization에 필요한 메시지 수가 적기 때문에 시그널링 비용이 감소하였다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2009.04a
• /
• pp.1218-1221
• /
• 2009

최근 Internet Engineering Task Force에서 표준화가 된 Proxy Mobile IPv6는 기존의 이동성 보장 프로토콜인 Mobile IPv6가 가지는 많은 문제점을 보완했다. 하지만, Proxy Mobile IPv6에서 같은 Local Mobility Anchor 내에 있고, 다른 Mobile Access Gateway에 있는 Mobile Node 사이의 패킷 전송에 있어서 발생하는 삼각 라우팅 문제는 여전히 존재한다. 이 문제점을 해결하기 위해 최근 Liebsch의 드래프트와 A.Dutta의 드래프트에서 제안된 두 가지의 Route Optimization 기법의 동작 과정을 알아보고, 상호 데이터 전송 상황에서 더 나은 성능을 제공하는 새로운 Route Optimization 기법을 제안한다. 제안한 Route Optimization 기법은 Corresponding Information을 이용하여 Mobile Access Gateway 간 Corresponding Binding을 완료하여, Route Optimization을 설정한다. 제안한 Correspondent Information을 이용한 Route Optimization 기법은 기존의 기법보다 상호 데이터 전송 상황에서 Route Optimization에 필요한 메시지 수가 적기 때문에 시그널링 비용이 감소하였다.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.6 no.3
• /
• pp.59-68
• /
• 2010

In the paper, we proposed the Using Correspondent Information for Route Optimization on PMIPv6 over Inter-MAG. Proxy Mobile IPv6 has the problem that a mobile node sends data packets through inefficient routing paths when communicating other mobile node. Route optimization schemes are proposed to solve the triangle routing problem that creates the shortest routing path by leaving the inefficient routing paths. We proposed Correspondent Information Route Optimization scheme to reduce signaling cost as compared with other route optimization scheme. We can reduce signaling cost of route optimization through the Correspondent Information message on basic PMIPv6 and hand-off environment.

• Journal of Communications and Networks
• /
• v.14 no.1
• /
• pp.91-103
• /
• 2012

Network mobility (NEMO) based on mobile IP version 6 has been proposed for networks that move as a whole. Route optimization is one of the most important topics in the field of NEMO. The current NEMO basic support protocol defines only the basic working mode for NEMO, and the route optimization problem is not mentioned. Some optimization schemes have been proposed in recent years, but they have limitations. A new NEMO route optimization scheme-involving a combination of the optimized route cache protocol (ORC) and reverse routing header (RRH) and the use of a quota mechanism for optimized sessions (OwR)-is proposed. This scheme focuses on balanced performance in different aspects. It combines the ORC and RRH schemes, and some improvements are made in the session selection mechanism to avoid blindness during route optimization. Simulation results for OwR show great similarity with those for ORC and RRH. Generally speaking, the OwR's performance is at least as good as that of the RRH, and besides, the OwR scheme is capable of setting up optimal routing for a certain number of sessions, so the performance can be improved and the cost of optimal routing in nested NEMO can be decreased.

• Journal of Information Processing Systems
• /
• v.19 no.1
• /
• pp.46-54
• /
• 2023

To improve the railway transportation capacity and maximize the benefits of railway transportation, a method for layout optimization of railway transportation route based on deep convolution neural network is proposed in this study. Considering the transportation cost of railway transportation and other factors, the layout model of railway transportation route is constructed. Based on improved ant colony algorithm, the layout model of railway transportation route was optimized, and multiple candidate railway transportation routes were output. Taking into account external information such as regional information, weather conditions and actual information of railway transportation routes, optimization of the candidate railway transportation routes obtained by the improved ant colony algorithm was performed based on deep convolution neural network, and the optimal railway transportation routes were output, and finally layout optimization of railway transportation routes was realized. The experimental results show that the proposed method can obtain the optimal railway transportation route, the shortest transportation length, and the least transportation time, maximizing the interests of railway transportation enterprises.

• International Journal of Computer Science & Network Security
• /
• v.21 no.4
• /
• pp.33-40
• /
• 2021

The traveling salesman problem (TSP) is one of the well-known and extensively studied NPC problems in combinatorial optimization. To solve it effectively and efficiently, various optimization algorithms have been developed by scientists and researchers. However, most optimization algorithms are designed based on the concept of improving route in the iterative improvement process so that the optimal solution can be finally found. In contrast, there have been relatively few algorithms to find the optimal solution using route construction mechanism. In this paper, we propose a route construction optimization algorithm to solve the symmetric TSP with the help of ratio value. The proposed algorithm starts with a set of sub-routes consisting of three cities, and then each good sub-route is enhanced step by step on both ends until feasible routes are formed. Before each subsequent expansion, a ratio value is adopted such that the good routes are retained. The experiments are conducted on a collection of benchmark symmetric TSP datasets to evaluate the algorithm. The experimental results demonstrate that the proposed algorithm produces the best-known optimal results in some cases, and performs better than some other route construction optimization algorithms in many symmetric TSP datasets.

• Journal of the Korea Society of Computer and Information
• /
• v.13 no.5
• /
• pp.203-210
• /
• 2008

Because BSP(Basic Support Protocol) of NEMO(Network Mobility) has important limitation of not providing route optimization, several route optimization schemes have been proposed. By analyzing and improving the limitations of the existing schemes. we Propose an advanced integrated route optimization scheme for the communication through both the internal and external routing of nested NEMO. Our proposal includes a secure route optimization protocol which connects TLMR directly to an external node CN without passing through any HAs. and allows TLMR to control the internal path without passing through the internet. Thus, our scheme can strengthen the security as well as improve the path and delay of NEMO communication.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2008.05a
• /
• pp.65-68
• /
• 2008

The Mobile IP provides the mobility of Mobile Node, but does not provide the mobility of network. For support the mobility of network, the IETF has proposed NEMO(Network Mobility). Route Optimization is a serious problem in mobile network, so several solutions for route optimization in nested mobile network have been suggested by the IETF NEMO WG. This paper proposes scheme about Route Optimization in nested mobile network.

• 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.