• Journal of Korean Society of Transportation
• /
• v.33 no.1
• /
• pp.1-13
• /
• 2015

This study aims to develop a mainline metering strategy considering queue imbalance among lanes that can reduce congestion at a toll plaza section by managing queue caused by mainline metering. The suggested strategy considers simultaneously optimizing the number of cars in merging area and managing queue by lane. This study analyzes the effectiveness of the strategy with respect to the average travel time and the occurrence rate of spillback using the PARAMICS. The results show that the suggested strategy has an effect on reducing congestion and improving operation efficiency at toll plaza. In particular, the congestion become more intensified when the length of waiting space is shorter; however, this study shows that the suggested strategy can relieve the congestion in that condition.

• Journal of Korea Multimedia Society
• /
• v.14 no.11
• /
• pp.1409-1419
• /
• 2011

It is well known that estimating the system processing time and cost at the early stage of the software system development is very important, and many Petri net methods of analysing processing time have been published. In another field of computer science, web service has been widely studied as a key of an efficient application software development method. Considering these two phenomena, this paper introduces a Petri net method of analysing the process time of application software consisting of web services. It is not plausible to represent the process time of a web application system as a constant. Therefore, we propose to use "Petri net with queues" to represent a web application system. The main contribution of this paper is to introduce a method of analysing a "Petri net with queues".

• Journal of Korean Society of Transportation
• /
• v.18 no.4
• /
• pp.75-85
• /
• 2000

The Purpose of this study is to analyze wether the composition of training sample have a relation with the Predictive ability and the learning results of ANNs(Artificial Neural Networks) fur predicting one cycle ahead of the queue length(veh.) in a signalized intersection. In this study, ANNs\` training sample is classified into the assumption of two cases. The first is to utilize time-series(Per cycle) data of queue length which would be detected by one detector (loop or video) The second is to use time-space correlated data(such as: a upstream feed-in flow, a link travel time, a approach maximum stationary queue length, a departure volume) which would be detected by a integrative vehicle detection systems (loop detector, video detector, RFIDs) which would be installed between the upstream node(intersection) and downstream node. The major findings from this paper is In Daechi Intersection(GangNamGu, Seoul), in the case of ANNs\` training sample constructed by time-space correlated data between the upstream node(intersection) and downstream node, the pattern recognition ability of an interrupted traffic flow is better.

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

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.41 no.2
• /
• pp.133-141
• /
• 2021

The probe vehicle penetration rate is a required parameter in the estimation of entire volume, density, and queue length from probe vehicle data. The previous studies have proposed estimation methods without point detectors, which are based on probability structures for the locations of probe and non-probe vehicles; however, such methods are poorly suited to the case of multi-lane streets. Therefore, this study aimed to estimate the probe vehicle penetration rate at a multi-lane intersection and introduce a probability distribution of the queue length of each lane. Although a gap between estimates and observations was found, the estimates followed the trend of observations; the estimation could be improved by the correction factor hereafter. This study is expected to be used as a basic study for the estimation of entire volume, density, and queue length at multi-lane intersections without point detectors.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2006.05a
• /
• pp.1093-1100
• /
• 2006

본 연구는 D-정책을 갖는 BMAP/G/1 대기행렬 시스템의 일량(workload) 및 대기시간(waiting time)을 분석한다. 유휴한 서버는 도착하는 고객들의 서비스 시간의 총합이 주어진 임계점 D를 넘어야만 서비스를 시작한다. 고객의 도착과정은 집단마코비안도착과정(BMAP, Batch Markovian Arrival Process)을 따른다. 본 논문에서는 이러한 시스템의 일량 및 대기시간에 대한 LST를 구하고, 이로부터 평균일량 및 평균대기시간을 유도한다. 또한 BMAP/G/1의 특별한 경우인 $M^X/G/1$인 경우와 대기시간의 비교를 행한다.

• Communications for Statistical Applications and Methods
• /
• v.18 no.4
• /
• pp.433-443
• /
• 2011

We consider a compound Poisson risk model in which the premiums may depend on the state of the surplus process. By using the overflow probability of the workload process in the corresponding M/G/1 queueing model, we obtain the probability that the ruin occurs before the surplus reaches a given large value in the risk model. We also examplify the ruin probability in case of exponential claims.

• Journal of the Korea Society for Simulation
• /
• v.16 no.2
• /
• pp.75-81
• /
• 2007

Previous queue inference has been studied with some limits. Larson's inference engine, which is the basis for this paper, also processed with basic assumption that arrival process is poisson process. Our inference method, which relaxes the poisson process assumption, must be a useful tool for looking into unobservable inside of queueing systems, as well as calculating accurate system performance. This paper employs these inference methods and proves the validity. Then we apply this method to system analysis for more complicated models. At first, we suggest methods to system with known number of servers, then expand to unknown number of servers. For validating our inference approach, we run some simulation models and compare true values with our results.

• Journal of Korea Society of Industrial Information Systems
• /
• v.23 no.2
• /
• pp.29-39
• /
• 2018

In this paper, we discuss a discrete-time queueing system with dyadic server control policy that combines workload control and multiple vacations. Customers arrive at the system with Bernoulli arrival process. If there is no customer to serve in the system, an idle single server spends a vacation of discrete random variable V and returns. The server repeats the vacation until the total service time of waiting customers exceeds the predetermined workload threshold D. In this paper, we derived the steady-state workload distribution of a discrete-time queueing system which is operating under a more realistic and flexible server control policy. Mean workload is also derived as a performance measure. The results are basis for the analysis of system performance measures such as queue lengths, waiting time, and sojourn time.

• Journal of Korea Society of Industrial Information Systems
• /
• v.29 no.2
• /
• pp.69-80
• /
• 2024

In this paper, we studied a discrete-time queuing system that operates under a mixed situation of D-policy and T-policy, one of the representative server control policies in queuing theory. A single server serves customers arriving by Bernoulli arrival process on a first-in, first-out basis(FIFO). If there are no customers to serve in the system, the server goes on vacation and returns, until the total service time (i.e., total amount of workload) of waiting customers exceeds predetermined workload threshold D. The operation of the system covered in this study can be used to model the efficient resource utilization of mobile devices using secondary batteries. In addition, it is significant in that the steady state waiting time and system sojourn time of the queuing system under a flexible mixed control policy were derived within a unified framework.