• Journal of the Korea Society for Simulation
• /
• v.21 no.3
• /
• pp.71-78
• /
• 2012

This research discusses the application of the control variables to achieve a more precise estimation for the target response in queueing network simulation. The efficiency of control variable method in estimating the response depends upon how we choose a set of control variables strongly correlated with the response and how we construct a function of selected control variables. For a class of queuing network simulations, the random variables that drive the simulation are basically the service-time and routing probability random variables. Most of applications of control variable method focus on utilization of the service time random variables for constructing a controlled estimator. This research attempts to suggest a controlled estimator which uses these two kinds of random variables and explore the efficiency of these estimators in estimating the reponses for computer network system. Simulation experiments on this model show the promising results for application of routing probability control variables. We consider the applications of the routing probability control variables to various simulation models and combined control variables using information of service time and routing probability together in constructing a control variable as future researches.

• Journal of the Korea Society for Simulation
• /
• v.20 no.2
• /
• pp.1-10
• /
• 2011

In queueing network analysis, arrival processes are usually modeled as renewal processes by matching mean and variance. The renewal approximation simplifies the analysis and provides reasonably good estimate for the performance measures of the queueing systems under moderate conditions. However, high variability in arrival process or in service process requires more sophisticated approximation procedures for the variability parameter of departure/arrival processes. In this paper, we propose an heuristic approach to refine Whitt's variability function with the k-interval squared coefficient of variation also known as the index of dispersion for intervals(IDI). Regression analysis is used to establish an empirical relationships between the IDI of arrival process and the IDI of departure process of a queueing system.

• Journal of Korean Society of Transportation
• /
• v.19 no.3
• /
• pp.101-113
• /
• 2001

Since late 1970s. one of the principal research areas in transportation problem is dynamic traffic assignment (DTA). Although many models have been developed regarding DTA, yet they have some limits of describing real traffic patterns. This reason comes from the fact that DTA model has the time varying constraints such as state equation, flow propagation constraint, first in first out(FIFO) rule and queuing evolution. Thus, DTA model should be designed to satisfy these constraints as well as dynamic route choice condition, dynamic user equilibrium. In this respect, link-based DTA models have difficulty in satisfying such constraints because they have to satisfy the constraints for each link, while path-based DTA models may easily satisfy them. In this paper we develop a path-based DTA model. The model includes point queue theory to describe the queue evolution and simulation loading method for depicting traffic patterns in more detail. From a numerical test, the model shows promising results.

• Journal of the Korea Society for Simulation
• /
• v.9 no.2
• /
• pp.89-102
• /
• 2000

In this paper, we consider an optimal allocation of constant service efforts in queueing network to maximize the system throughput. For this purpose, using the perturbation analysis, we apply a stochastic optimization algorithm to two types of queueing systems. Our simulation results indicate that the estimates obtained from a stochastic optimization algorithm for a two-tandem queuing network are very accurate, and those for closed loop manufacturing system are a little apart from the known optimal allocation. We find that as simulation time increases for obtaining a new gradient (performance measure with respect to decision variables) by perturbation algorithm, the estimates tend to be more stable. Thus, we consider that it would be more desirable to have more accurate sensitivity of performance measure by enlarging simulation time rather than more searching steps with less accurate sensitivity. We realize that more experiments on various types of systems are needed to identify such a relationship with regards to stopping rule, the size of moving step, and updating period for sensitivity.

• The Journal of Korean Institute of Next Generation Computing
• /
• v.15 no.4
• /
• pp.80-88
• /
• 2019

Software Defined Networking (SDN) is the future network paradigm of decoupling control and data functions. In SDN structure, it is hard to address scalability in case of large-scale networks because single controller managed thousands of switches in a centralized fashion. Most of previous studies have focused on horizontal scalability, where distributed controllers are assigned to network devices. However, they have abstracted the control plane and the application plane into a single controller. The layer of the common SDN architecture is divided into data plane, control plane, and application plane, but the control plane and application plane have been modeled as a single controller although they are logically separated. In this paper, we propose a analytical traffic model considering the both application plane and control plane based on queuing theory. This model can be used to address scalability issues such as controller placement problem without complicated simulations.

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