• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.26 no.5D
• /
• pp.723-730
• /
• 2006

Recently, The flexible moving block system in train operation has been introduced to the worldwide rail transportation markets. This paper is a comparative study of the conventional fixed block systems effects and the flexible moving block system on train operating time saving. Based on the literature review, the new algorithm is developed. It is to calculate the optimum headway time of the train. The proposed algorithm can overcome some of the existing algorithm problems, such as the limits of the data and unaware of the rail characteristic. The total travel time saving effect has been analyzed by applying the skip stop scheduling system to the each block system. The results of this study indicated that the total travel time is approximately 40% decreased and the schedule velocity is approximately 24% improved when the moving block system is applied. The results of this study could be used as a theoretical basis for the selection of rail signal system in Seoul's subway number 2 line.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.15 no.6
• /
• pp.3851-3857
• /
• 2014

Shippers' requests of freight trains vary with time, but generating an additional schedule of freight trains is not easy due to many considerations, such as the line capacity, operation rules, and conflicts with existing trains. On the other hand, an additional freight train schedule has been continuously requested and manually processed by domestic train operation companies using empirical method, which is time consuming. This paper proposes a model to determine the additional freight train schedule that assesses the feasibility of the added freight trains, and generates as many additional schedules as possible, while minimizing the delay of the existing schedules. The problem is presented using time-space network, modeled as multi-commodity flow problem, and solved using the column generation method. Three levels of experiment were conducted to show validity of the proposed model in the computation time.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.12B
• /
• pp.1017-1027
• /
• 2006

Recently, Internet service providers are offering triple play service which combines voice and video services with the existing high speed Internet service under the common network infrastructure of IP protocol, so that they can create more benefit from operating a single network architecture. In line with this movement in the convergence of network and services, in this work we propose a bandwidth dimensioning method for the subscriber network of the IP network at flow level. To that purpose, let us propose a series of bandwidth dimensioning methods: bandwidth for best effort service only, bandwidth dimensioning for premium services, and bandwidth dimensioning schemes for the premium Internet services as well as the best effort service which comprise the TPS. Our link dimensioning method is based on the flow level that incorporates the flow blocking probability as a measure of grade of services(GoS), and investigates the characteristics of the proposed methods via extensive numerical experiments. After that, let us carry out a simulation experiment concerning the delay and loss performance of the packet scheduling for the premium services (QoS) using the bandwidth designed by our proposed method, via which the packet level quality of service (QoS) for the proposed link dimensioning method can be observed.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.49 no.2
• /
• pp.63-70
• /
• 2012

The collision-free flight planning method based on the extended collision map is proposed for cooperation of multiple unmanned aerial vehicles (UAVs) in a common 3-dimensional workspace. First, a UAV is modeled as a sphere, taking its 3-D motions such as rolling into consideration. We assume that after entering the common workspace, the UAVs move along their straight paths until they depart from the workspace, and that the priorities of the UAVs are determined in advance. According to the assumptions, the collision detection problem between two spheres in $R^3$ can be reduced into the collision detection problem between a circle and a line in $R^2$. For convenience' sake and safety, the collision regions are approximated by collision boxes. Using the collision boxes, the entrance times of the UAVs are scheduled for collision avoidance among the UAVs. By this way, all UAVs can move in the common workspace without collisions with one another. For verifying the effectiveness of the proposed flight planning method, the simulation with 12 UAVs is carried out.

• The Journal of Bigdata
• /
• v.5 no.1
• /
• pp.181-188
• /
• 2020

As the size of the airport terminal grows in line with the rapid growth of aviation passengers, the advanced baggage handling system that combines various data technologies has become an essential element in order to handle the baggage carried by passengers swiftly and accurately. Therefore, this study introduces the method of analyzing the baggage handling capacity of domestic airports through the latest data analysis methodology from the process point of view to advance the operation of the airport BHS and the main points based on event log data. By presenting an accurate load prediction method, it can lead to advanced BHS operation strategies in the future, such as the preemptive arrangement of resources and optimization of flight-carrousel scheduling. The data used in the analysis utilized the APIs that can be obtained by searching for "Korea Airports Corporation" in the public data portal. As a result of applying the method to the domestic airport BHS simulation model, it was possible to confirm a high level of predictive performance.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.8
• /
• pp.1508-1516
• /
• 2017

Multipath TCP (MPTCP) is a transport layer protocol that supports multipath transmission. If a bufferbloat occurs in one of the subflows of MPTCP, HoL blocking occurs at the receiver due to the difference in packet arrival time among paths. In MPTCP, HoL blocking degrades not only the performance of the path where bufferbloat occurs, but also the performance of other paths. In this paper, we propose a bandwidth measurement based scheduler to solve this problem. Bandwidth measurement based scheduler is designed to measure the bandwidth of each subflow and to perform packet scheduling based on it. In order to verify the proposed scheduler, we implemented the proposed scheduler in the Linux kernel and constructed a testbed in which bufferbloat occurs. Experimental results show that the proposed scheduler has better performance than the legacy MPTCP in bufferbloat environment.

• The Journal of Bigdata
• /
• v.7 no.1
• /
• pp.75-87
• /
• 2022

This study investigates a dynamic flexible flow shop scheduling problem under uncertain rework operations for an automobile pipe production line. We propose a weighted dispatching rule (WDR) based on the multiple dispatching rules to minimize the weighted sum of average flowtime and tardiness. The set of weights in WDR should be carefully determined because it significantly affects the performance measures. We build a discrete-event simulation model and propose a genetic algorithm to optimize the set of weights considering complex and variant operations. The simulation experiments demonstrate that WDR outperforms the baseline dispatching rules in average flowtime and tardiness.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.11
• /
• pp.1318-1332
• /
• 1999

본 논문에서는 입출력 응용을 위해 collective I/O 기법을 기반으로 한 실행시간 시스템의 설계, 구현 그리고 그 성능평가를 기술한다. 여기서는 모든 프로세서가 동시에 I/O 요구에 따라 스케쥴링하며 I/O를 수행하는 collective I/O 방안과 프로세서들이 여러 그룹으로 묶이어, 다음 그룹이 데이터를 재배열하는 통신을 수행하는 동안 오직 한 그룹만이 동시에 I/O를 수행하는 pipelined collective I/O 등의 두 가지 설계방안을 살펴본다. Pipelined collective I/O의 전체 과정은 I/O 노드 충돌을 동적으로 줄이기 위해 파이프라인된다. 이상의 설계 부분에서는 동적으로 충돌 관리를 위한 지원을 제공한다. 본 논문에서는 다른 노드의 메모리 영역에 이미 존재하는 데이터를 재 사용하여 I/O 비용을 줄이기 위해 collective I/O 방안에서의 소프트웨어 캐슁 방안과 두 가지 모형에서의 chunking과 온라인 압축방안을 기술한다. 그리고 이상에서 기술한 방안들이 입출력을 위해 높은 성능을 보임을 기술하는데, 이 성능결과는 Intel Paragon과 ASCI/Red teraflops 기계 상에서 실험한 것이다. 그 결과 응용 레벨에서의 bandwidth는 peak point가 55%까지 측정되었다.Abstract In this paper we present the design, implementation and evaluation of a runtime system based on collective I/O techniques for irregular applications. We present two designs, namely, "Collective I/O" and "Pipelined Collective I/O". In the first scheme, all processors participate in the I/O simultaneously, making scheduling of I/O requests simpler but creating a possibility of contention at the I/O nodes. In the second approach, processors are grouped into several groups, so that only one group performs I/O simultaneously, while the next group performs communication to rearrange data, and this entire process is pipelined to reduce I/O node contention dynamically. In other words, the design provides support for dynamic contention management. Then we present a software caching method using collective I/O to reduce I/O cost by reusing data already present in the memory of other nodes. Finally, chunking and on-line compression mechanisms are included in both models. We demonstrate that we can obtain significantly high-performance for I/O above what has been possible so far. The performance results are presented on an Intel Paragon and on the ASCI/Red teraflops machine. Application level I/O bandwidth up to 55% of the peak is observed.he peak is observed.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.12A
• /
• pp.1922-1931
• /
• 1999

A multicast traffic’s feature is the function of providing a point to multipoints cell transmission, which is emerging from the main function of ATM switch. However, when a conventional point-to-point switch executes a multicast function, the excess load is occurred because unicast cell as well as multicast cell passed the copy network. Additionally, due to the excess load, multicast cells collide with other cells in a switch. Thus a deadlock that losses cells raises, extremely diminishes the performance of switch. An input queued switch also has a defect of the HOL (Head of Line) blocking that less lessens the performance of the switch. In the proposed multicast switch, we use shared memory switch to reduce HOL blocking and deadlock. In order to decrease switch’s complexity and cell's processing time, to improve a throughput, we utilize the method that routes a cell on a separated paths by traffic pattern and the scheduling algorithm that processes a maximum 2N cell at once in the control part. Besides, when cells is congested at an output port, a cell loss probability increases. Thus we use the Output Memory (OM) to reduce the cell loss probability. And we make use of the method that stores the assigned memory (UM, MM) with a cell by a traffic pattern and clears the cell of the Output memory after a fixed saving time to improve the memory utilization rate. The performance of the proposed switch is executed and compared with the conventional policy under the burst traffic condition through both the analysis based on Markov chain and simulation.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.21 no.8
• /
• pp.67-74
• /
• 2020

One of the missions of active-duty units in charge of managing reserve forces is providing combat supplies to reserve forces to exercise their combat capabilities quickly when declaring a mobilization order. Rear area active-duty units must support large local reserve forces. On the other hand, military units have difficulties due to a lack of forces and the storage of large quantities of firearms and ammunition. For this reason, local reserve forces should move to an integrated storing place and receive their firearms and ammunition. The existing distribution plan (existing plan) is a first-in-first-out plan that can produce inconsistent distribution orders. The inconsistent distribution orders can increase the complete distribution time, which will affect the combat power of local reserve forces. Therefore, firearms and ammunition should be distributed quickly. Accordingly, this paper proposes the priority selection of firearms and ammunition for local reserve forces with a minimum complete distribution time using Dynamic Programming. To verify the proposed model, the existing plan was compared with the proposed model using real data, and the result showed that the proposed model outperformed the existing plan.