• Journal of Korean Society of Transportation
• /
• v.31 no.4
• /
• pp.3-17
• /
• 2013

The purpose of this study is to develop a traffic assignment model where the variable of signal intersection delay is taken into account in assigning traffic in large-scale network settings. Indeed, despite the fact that the majority of the increase in travel time or cost involving congested urban network or interrupted flow are accounted for by stop delays or congested delays at signal intersections, the existing traffic assignment models did not reflect this. The traffic assignment model considering intersection delays presented in this study was built based on the existing traffic assignment models, which were added to by the analysis technique for the computation of intersection delay provided in Korea Highway Capacity Manual. We can conclude that a multiple variety of simulation tests prove that this model can be applied to real network settings. Accordingly, this model shows the possibility of utilizing a model considering intersection delay for traffic policy decisions through analysis of effects of changes in traffic facilities on large urban areas.

• Journal of KIISE:Databases
• /
• v.28 no.4
• /
• pp.677-687
• /
• 2001

The critical path has been widely applied to many areas of computer engineering especially a directed acyclic graph. Its concept can also be useful in the context of a workflow. The workflow critical path is defined as a path which has the longest average execution time from the start activity to the end activity of workflow. Because there can be several concurrently executed workflow instances for a specific workflow a new method to determine the critical path should be developed. In this paper we specify our workflow queuing network model from which we can easily analyze many workflow characteristics. Based on this workflow model. we propose a method to identify the critical path In addition, we show come workflow areas which can utilze the critical path.

• Journal of Korean Society of Transportation
• /
• v.32 no.6
• /
• pp.567-578
• /
• 2014

The study suggested a method to improve analysis accuracy such that the interactive effects of transportation changes between outside and inside of sub-areas were sequentially considered in the analysis by linking a macroscopic network analysis and a microscopic traffic simulation. A dynamic O/D estimation method was developed for practical implement of sub-area microscopic simulation analysis by using the results of macroscopic network analysis, the results of selected link analysis at the cordon line of the sub-area, departure time data of household travel survey, timely observed traffic volume data at the cordon. This estimated dynamic O/D for the sub-area made it possible to analyze traffic phenomena in details. Various detailed phenomena such as traffic queues, delay at intersection, and conflicts between vehicles, which is impossible to be grasped through a macroscopic analysis, can be analyzed with the dynamic microscopic traffic analysis. Through implementing an empirical study and validation, the study provided a reference result about accuracy of a microscopic traffic simulation of a sub-area to help its application for real transportation policy analysis.

• Journal of Korean Society of Transportation
• /
• v.20 no.5
• /
• pp.113-130
• /
• 2002

In this paper, we developed DNL(Dynamic Network Loading) model based on Moving cell theory to analyze the dynamic characteristics of traffic flow in congested network. In this paper vehicles entered into link at same interval would construct one cell, and the cells moved according to Cell following rule. In the past researches relating to DNL model a continuous single link is separated into two sections such as running section and queuing section to describe physical queue so that various dynamic states generated in real link are only simplified by running and queuing state. However, the approach has some difficulties in simulating various dynamic flow characteristics. To overcome these problems, we present Moving cell theory which is developed by combining Car following theory and Lagrangian method mainly using for the analysis of air pollutants dispersion. In Moving cell theory platoons are represented by cells and each cell is processed by Cell following theory. This type of simulation model is firstly presented by Cremer et al(1999). However they did not develop merging and diverging model because their model was applied to basic freeway section. Moreover they set the number of vehicles which can be included in one cell in one interval so this formulation cant apply to signalized intersection in urban network. To solve these difficulties we develop new approach using Moving cell theory and simulate traffic flow dynamics continuously by movement and state transition of the cells. The developed model are played on simple network including merging and diverging section and it shows improved abilities to describe flow dynamics comparing past DNL models.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.10
• /
• pp.2627-2640
• /
• 1998

In this paper, we analyze the performance of the virtual cell system[1] for the transmission of IP datagrams in mobile computer communications. A virtual cell consistsof a group of physical cells shose base stationsl are implemented b recote bridges and interconnected via high speed datagram packet switched networks. Host mobility is supported at the data link layer using the distributed hierachical location information of mobile hosts. Given mobility and communication ptems among physical cells, the problem of deploying virtual cells is equivalent to the optimization cost for the entire system where interclster communication is more expesive than intracluster communication[2]. Once an iptimal partitionof disjoint clusters is obtained, we deploy the virtual cell system according to the topology of the optimal partition such that each virtual cell correspods to a cluser. To analyze the performance of the virtual cell system, we adopt a BCMP open multipel class queueing network model. In addition to mobility and communication patterns, among physical cells, the topology of the virtual cell system is used to determine service transition probabilities of the queueing network model. With various system parameters, we conduct interesting sensitivity analyses to determine network design tradeoffs. The first application of the proposed model is to determine an adequate network bandwidth for base station networking such that the networks would not become an bottleneck. We also evaluate the network vlilization and system response time due to various types of messages. For instance, when the mobile hosts begin moving fast, the migration rate will be increased. This results of the performance analysis provide a good evidence in demonsratc the sysem effciency under different assumptions of mobility and communication patterns.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.8
• /
• pp.2484-2496
• /
• 2000

High speed switches have been developing to interconnect a large number of nodes. It is important to analyze the switch performance under various conditions to satisfy the requirements. Queueing analysis, in general, has the intrinsic problem of large state space dimension and complex computation. In fact, The petri net is a graphical and mathematical model. It is suitable for various applications, in particular, manufacturing systems. It can deal with parallelism, concurrence, deadlock avoidance, and asynchronism. Currently it has been applied to the performance of computer networks and protocol verifications. This paper presents a framework for modeling and analyzing ATM switch using stochastic activity networks (SANs). In this paper, we provide the ATM switch model using SANs to extend easily and an approximate analysis method to apply A TM switch models, which significantly reduce the complexity of the model solution. Cell arrival process in output-buffered Queueing A TM switch with finite buffer is modeled as Markov Modulated Poisson Process (MMPP), which is able to accurately represent real traffic and capture the characteristics of bursty traffic. We analyze the performance of the switch in terms of cell-loss ratio (CLR), mean Queue length and mean delay time. We show that the SAN model is very useful in A TM switch model in that the gates have the capability of implementing of scheduling algorithm.

• Journal of the Society of Naval Architects of Korea
• /
• v.61 no.4
• /
• pp.267-277
• /
• 2024

The Sortie Generation Rate (SGR) is a critical performance indicator for carrier-based aircraft and is a key factor for the carrier design process. This study aims to analyze the factors that affect SGR and establish a representative Sortie Generation Process (SGP) along with simulation results to calculate SGR for a naval ship equipped to carry aircraft. Detailed SGR factors are identified from the perspectives of the aircraft, aviation personnel, and aircraft carrier during the flight preparation stage, and the SGP is established accordingly. As a representative, Korean Navy's CVX basic design is chosen for detailed analysis. The physical dimension and spots for the deck design with time and probabilistic data of SGP are considered to develop a queueing network model for SGR calculation. To consider the specific probabilistic features, the model was solved with discrete event simulation tools(SimPy and AnyLogic) where the results show great agreement. Such findings on SGR factors and calculation are expected to be incorporated in the future development of SGR calculation algorithms and also present guidelines for proper design of aircraft carrier based on concrete operation concept.