• Journal of Communications and Networks
• /
• 제13권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%.

• 한국항행학회논문지
• /
• 제27권5호
• /
• pp.561-567
• /
• 2023

본 연구에서는 유인기 회랑에 적용되는 충돌 위험 모델을 활용하여 UAM (Urban Air Mobility) 회랑의 충돌 위험을 분석하였다. K-UAM 로드맵과 운용개념서에 따르면 UAM은 기존 유인기 운항과 유사하게 지정된 항로를 비행하는 형태를 가지며 출발지와 도착지를 왕복하는 두 가지의 노선으로 운행될 것으로 예상된다. 국내 유인기 노선 중 김포공항-제주공항 간 유인기 운행이 이와 유사하며 두 개의 노선 간 횡 방향 분리간격을 가진 평행항로 형태를 띤다. 본 연구에서는 이와 유사한 형태의 UAM 회랑에 대해 유인기 평행 항로 충돌 위험 분석에 활용되는 충돌 위험 모델을 활용하여 횡 방향 분리간격에 따른 UAM 회랑의 충돌 위험을 분석하였다. 이를 바탕으로 최종적으로 K-UAM 실증 노선을 고려하여 한강 폭 내에 몇 개의 평행 항로가 설치될 수 있는지 분석하였다.

• 산업경영시스템학회지
• /
• 제27권1호
• /
• pp.64-73
• /
• 2004

This paper addresses a problem of machining determination of input quantity in a multi-stage flexible flow system with non-identical parallel machines considers a subcontracting, machining restraint, and machine yield. We develop a nonlinear programing with the objective of minimizing the sum of in-house processing cost and subcontracting cost. To solve this model, we introduce a single-processor parallel genetic algorithm(SPGA) to improve a weak point for the declined robustness of simple algorithm(SGA). The efficiency of the SPGA is examined in comparison with the SGA for the same problem. In of examination the SPGA is to provide the excellent solution than the solution of the SGA.

• 한국항만학회지
• /
• 제11권2호
• /
• pp.173-189
• /
• 1997

Whether over taking or parallel sailing of two or more vessels is allowable on marine traffic route or not, the traffic congestion due to traffic volume has to be evaluated separately. In Gaduk-sudo, overtaking or parallel sailing is so allowable that the Bumper Model is introduced to evaluated the traffic congestion. But the channels within the habour limit such as the route of Ulsan New Port are so prohibited overtaking or parallel sailing that the traffic congestion has to be evaluated by using theoretical traffic capacity or by traffic simulation. In this paper, the congestion of Southern New Port and Mipo Port was evaluated the congestion by using theoretical traffic capacity and the other area of Ulsan Port by traffic simulation. The incresed traffic volumes on Ulsan Channels according to Ulsan New Port Development in 2011 were evaluated to have no effect with the traffic congestion.

• International Journal of Computer Science & Network Security
• /
• 제24권1호
• /
• pp.45-51
• /
• 2024

The subject of navigation has drawn a large interest in the last few years. The navigation within a city is to find the path between two points, source location and destination location. In many cities, solving the routing problem is very essential as to find the route between different locations (starting location (source) and an ending location (destination)) in a fast and efficient way. This paper considers streets with diagonal streets. Such streets pose a problem in determining the directions of the route to be followed. The paper presents a solution for the path planning using the reconfigurable mesh (R-Mesh). R-Mesh is a parallel platform that has very fast solutions to many problems and can be deployed in moving vehicles and moving robots. This paper presents a solution that is very fast in computing the routes.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권2호
• /
• pp.700-713
• /
• 2015

It is critical to design energy-efficient routing protocols for battery-limited mobile ad hoc networks, especially in which the energy-consuming MIMO techniques are employed. However, there are several challenges in such a design: first, it is difficult to characterize the energy consumption of a MIMO-based link; second, without a careful design, the broadcasted RREP packets, which are used in most energy-efficient routing protocols, could flood over the networks, and the destination node cannot decide when to reply the communication request; third, due to node mobility and persistent channel degradation, the selected route paths would break down frequently and hence the protocol overhead is increased further. To address these issues, in this paper, a novel Greedy Energy-Efficient Routing (GEER) protocol is proposed: (a) a generalized energy consumption model for the MIMO-based link, considering the trade-off between multiplexing and diversity gains, is derived to minimize link energy consumption and obtain the optimal transmit model; (b) a simple greedy route discovery algorithm and a novel adaptive reply strategy are adopted to speed up path setup with a reduced establishment overhead; (c) a lightweight route maintenance mechanism is introduced to adaptively rebuild the broken links. Extensive simulation results show that, in comparison with the conventional solutions, the proposed GEER protocol can significantly reduce the energy consumption by up to 68.74%.

• 스마트미디어저널
• /
• 제9권1호
• /
• pp.45-50
• /
• 2020

딥 러닝의 발전에 따라 추천시스템에서 딥 러닝 기반의 인공신경망을 활용한 연구가 활발히 진행되고 있다. 특히, RNN(Recurrent Neural Network)기반의 추천시스템은 데이터의 순차적 특성을 고려하기 때문에 추천시스템에서 좋은 성과를 보여주고 있다. 본 연구는 RNN기반의 알고리즘인 GRU(Gated Recurrent Unit)와 세션 기반 병렬 미니배치(Session Parallel mini-batch)기법을 활용한 여행경로 추천 시스템을 제안한다. 본 연구는 top1과 bpr(Bayesian personalized ranking) 오차함수의 앙상블을 통해 추천 성과를 향상시켰다. 또한, 데이터 내에 순차적인 특성을 고려한 RNN기반 추천 시스템은 여행경로에 내재된 여행지의 의미가 반영된 추천이 이루어진다는 것을 확인되었다.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1998년도 하계학술대회 논문집 E
• /
• pp.1647-1649
• /
• 1998

This paper describes the power frequency voltage and its countermeasure when a 765 kV transmission line is directly connected to a 345 kV line and operated at 345 kV voltage. The summary of this result is as follows : The western route of 765 kV transmission line doesn't need any countermeasure to reduce the power frequency voltage at the receiving end. The eastern route of 765 kV transmission needs 100 Mvar(3 phase) capacity of shunt reactor at the receiving end to reduce the power frequency voltage. The use of shunt reactors in the 765 kV transmission lines has unexpected problems, one of which is induction of high voltages on a de-energized circuit of two parallel lines. This paper examined the problem of resonance on two parallel transmission circuits in one routes.

• 대한산업공학회지
• /
• 제25권4호
• /
• pp.490-499
• /
• 1999

Vehicle routing problem(VRP) is known to be NP-hard problem, and good heuristic algorithm needs to be developed. To develop a heuristic algorithm for the VRP, this study suggests a parallel genetic algorithm(PGA), which determines each vehicle route in order to minimize the transportation costs. The PGA developed in this study uses two dimensional array chromosomes, which rows represent each vehicle route. The PGA uses new genetic operators. New mutation operator is composed of internal and external operators. internal mutation swaps customer locations within a vehicle routing, and external mutation swaps customer locations between vehicles. Ten problems were solved using this algorithm and showed good results in a relatively short time.

• 조명전기설비학회논문지
• /
• 제20권9호
• /
• pp.45-53
• /
• 2006

This paper proposes a method for an effective intelligent route decision for automatic moving robots(AMR) using a 2D spatial map of a stereo camera system. In this method, information about depth and disparity map are detected in the inputting images of a parallel stereo camera. The distance between the automatic moving robot and the obstacle is detected, and a 2D spatial map is obtained from the location coordinates. Then the relative distances between the obstacle and other objects are deduced. The robot move automatically by effective and intelligent route decision using the obtained 2D spatial map. From experiments on robot driving with 240 frames of stereo images, it was found that the error ratio of the calculated distance to the measured distance between objects was very low, 1.52[%] on average.