• Proceedings of the KIEE Conference
• /
• 2005.10b
• /
• pp.469-471
• /
• 2005

Paper searches Neighbor Discovery Protocol's IPv6 address AutoConfiguration function that is IPv6's point technology. Also, I study plan to apply Router Advertisement function to Router. Router is formed whole system by Routing Process Card that do manager and Line Card that take charge of Packet Forwarding. Present plan that embody Router Advertisement function to Line Card.

• Journal of the Society of Naval Architects of Korea
• /
• v.52 no.2
• /
• pp.110-118
• /
• 2015

Weather routing method is one of the best practices of SEEMP (Ship Energy Efficiency Management Plan) for fuel-efficient operation of ship. KR is carrying out a basic research for development of the weather routing algorithm and making a monitoring system by FOC (Fuel Oil Consumption) analysis compared to the reference, which is the great circle route. The added resistances applied global sea/weather data can be calculated using ship data, and the results can be corrected to ship motions. The global sea/weather data such as significant wave height, ocean current and wind data can be used to calculate the added resistances. The reference route in a usual navigation is the great circle route, which is the shortest distance route. The global sea/weather data can be divided into grids, and the nearest grid data from a ship's position can be used to apply a ocean going vessel's sea conditions. Powell method is used as an optimized routing technique to minimize FOC considered sea/weather conditions, and FOC result can be compared with the great circle route result.

• Journal of KIISE:Information Networking
• /
• v.30 no.1
• /
• pp.126-133
• /
• 2003

The existing active routing Protocols assume that the active network topology is static or pre-configured. However a dynamic mechanism to route an active Packet according to the network condition is required due to the dynamic characteristic of the active network. As active routing protocols, SLRP and TCOM500 PLAN project have been proposed, but since both of them are based on the assumption of the static topology we can not say that they are dynamic routing protocols in their entirety. Therefore, in this paper, we propose a new active network routing protocol, called AOSPF (Active Open Shortest Path First), which is compatible with the existing IP routing protocol. AOSPF is an extension of OSPF by adding a new LSA (Link State Advertisement) to allow the active network routing. The newly introduced LSA is used to specify whether the corresponding router is an active router or not. and one bit in the OPTION field of an LSA packet is used as the active router indication bit. This way of extending OSPF is similar to the scheme used in the extension of OSPF for multicast, i.e., MOSPF. In this paper, we will present the operation of AOSPF and the way how an active packet is forwarded based on the active network topology information constructed by AOSPF.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.67 no.9
• /
• pp.1216-1223
• /
• 2018

As field of application of AMI, AMR uses the power line as the primary means of communication. PLC has a big merit without installation of the new network for communication in a field using the power line which is the existing equipment. However, there is a serious obstacle in commercialization for the instability by noise and communication environment. Therefore, the technical method for maintaining the communication state which overcome such demerit and was stabilized is required essentially. PLC routing technology is applied with the alternative plan now. The routing technology currently managed by field includes many problems by applying the algorithm of an elementary level. PLC routing path search problem can be modeled with the problem of searching for optimal solution as similar to such as optimal routing problem and TSP(Travelling salesman problem). In this paper, in order to search for a PLC routing path efficiently and to choose the optimal path, GA(Genetic Algorithm) was applied. Although PLC was similar in optimal solution search as compared with typical GA, it also has a difference point by the characteristic of communication, and presented the new methodology over this. Moreover, the validity of application technology was verified by showing the experimental result to which GA is applied and analyzing as compared with the existing algorithm.

• Journal of the Korea Society of Computer and Information
• /
• v.26 no.9
• /
• pp.143-153
• /
• 2021

In this paper, we propose "flexible routing with flex" to provide fast delivery by using the flexible routing for the delivery vehicle and crowd-shipper named flex. To this end, we have introduced an algorithm that can build the delivery plan for delivery vehicles and flexes. The introduced algorithm uses the 2-opt algorithm to construct routes with low complexity and acceptable quality, and the revised saving algorithm to assign customer orders to the flex. The algorithm allows the vehicle and the flex to function complement each other without separating the delivery vehicle from the flex. The experiments consider the 3 different instances named Random, Mixed, Cluster, and show that "the flexible routing with flex" has a better result than "vehicle only". The sensitivity analysis of the flex cost and time penalty shows "the flexible routing with flex" can provide better service not only to the customers who are serviced by flex but also to the customers who are serviced by the delivery vehicle.

• Journal of the Korean Society for Railway
• /
• v.7 no.4
• /
• pp.326-331
• /
• 2004

A routing is the path that an actual trainset follows as it moves from one train to another train in a timetable. The number of routings is equivalent to the number of trainsets required to cover the timetable. The primary factors of rolling stock requirement plan include evaluating the minimum number of routings. This can be formulated as a set partitioning problem and solved using enumeration method or column generation method. In this paper we presents an enumeration algorithm which is useful to implement the enumeration method for the rolling stock requirement plan.

• Journal of the Korea Society of Computer and Information
• /
• v.15 no.2
• /
• pp.147-154
• /
• 2010

This paper suggests new route plan cost calculation and cost-effective route plan algorithm and architecture for the new city traffic information system when it is operated nationwide. New algorithm and architecture estimates cost with traffic speeds which is supported for all different lanes, stratifies logical layer which process different levels' traffic information with diverse traffic patterns and provides different traffic information in the few levels. Also suggested new algorithm supports drivers' customized traffic information through both-way communications and plans routes effectively based on the distance between drivers' start position and destination and different levels which start and end position located. It proposes additional research items and requirement for integration between different cities' traffic information system which the national police agency invested and led.

• Magazine of the Korean Society of Agricultural Engineers
• /
• v.45 no.6
• /
• pp.109-118
• /
• 2003

As a fundamental research to establish a safety operation plan for irrigation dams, this study presents hydrologic analysis conducted in Sungju Dam watershed based on various rainfall data. Especially those reservoirs without flood control feature are widely exposed to the risk of flooding, a safe and optimized operation program need to be improved against arbitrary flooding. In this study, reservoir routing program was developed and simulated for reservoir runoff estimation using WMS hydrology model. The model simulated the variations of reservoir elevation under the condition of open or closed emergency gate. In case of closed emergency gate, water surface elevation was given as 193.15 m, and this value exceeds the dam crest height by 1.65 m. When the emergency gate is open, the increment of water surface elevation is given as 192.01 m, and this value exceeds dam crest height by 0.57 m. As an alternative plan, dam height increase can be considered for flood control under the PMP (Probable Maximum Precipitation) condition. Since the dam size is relatively small compare to the watershed area, sound protection can be expected from the latter option rather than emergency gate installation.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2010.07a
• /
• pp.47-50
• /
• 2010

본 논문은 현재 경찰청 및 각 지자체의 주도하에 수도권을 중심으로 새롭게 보급되고 있는 도시 교통 정보 시스템 (UTIS)과 국토해양부 및 한국 도로 공사 등을 중심으로 한 DSRC 기반의 교통 정보 시스템을 모두 활용하는 시스템 및 효율적인 경로탐색 알고리즘을 제안한다. 도시 교통 정보 시스템은 무선랜과 같은 프로토콜을 이용해서, 기존 단방향 방식인 TPEG의 주요 도로 위주의 제한된 교통 정보 단점을 극복하고 많은 지선를 포함한 교통 정보를 제공하고 있다. 그러나 대부분의 운전자들이 단지 도심 내에서만 운전하는 것이 아니고 고속도로 등을 통해서 장거리 운전도 하기 때문에 고속도로 상의 DSRC 기반의 서비스도 동일 단말에서 지원해야 하나의 단말에서 다양한 서비스를 지원받을 수 있다. 따라서 본 논문의 두 개의 다른 통신 모듈의 통합된 단말 시스템을 제안하고 기존에 제안된 UTIS 기반의 분산 경로 탐색 방식을 DSRC 기반의 고속도로 교통 정보를 활용해서 새로운 경로탐색 알고리즘을 제안한다. 또한 향후 추가적으로 이루어질 연구와 현재 다른 주체들의 주도로 이루어지는 서비스를 제도적으로 보완할 수 있는 방안도 제시한다.

• Journal of Korean Society of Transportation
• /
• v.22 no.5
• /
• pp.89-97
• /
• 2004

The Korea Air Force(KAF) has operated freight flights based on the prefixed time and route schedule, which is adjusted once in a month. The major purpose of the operation of freight flights in the KAF is to distribute necessary supplies from the home air base to other air bases. The secondary purpose is to train the young pilots to get more experiences in navigation. Each freight flight starts from and returned to the home air base everyday except holidays, while it visits several other air bases to accomplish its missions. The study aims to forecast freight demand at each base by using time series analysis, and then it tried to optimize the cost of operating flights by solving vehicle routing problem. For more specifically, first, several constraints in operating cargos were defined by reviewing the Korea Air Force manuals and regulation. With such constraints, an integer programming problem was formulated for this specific routing problem allowing several visits in a tour with limitation of maximum number of visits. Then, an algorithm to solve the routing problem was developed. Second, the time series analysis method was applied to find out the freight demand at each air base from the mother air base in the next month. With the forecasted demands and the developed solution algorithm, the oprimum routes are calculated for each flight. Finally, the study compared the solved routing system by the developed algorithm with the existing routing system of the Korea Air Force. Through this comparison, the study proved that the proposed method can provide more (economically) efficient routing system than the existing system in terms of computing and monetary cost. In summary, the study suggested objective criteria for air routing plan in the KAF. It also developed the methods which could forecast properly the freight demands at each bases by using time series analysis and which could find the optimum routing which minimizes number of cargo needed. Finally, the study showed the economical savings with the optimized routing system by using real case example.