• Journal of applied mathematics & informatics
• /
• v.38 no.3_4
• /
• pp.351-373
• /
• 2020

There is an extensive literature on retrial queueing models. While a majority of the literature on retrial queueing models focuses on the retrial times to be exponentially distributed (so as to keep the state space to be of a reasonable size), a few papers deal with nonexponential retrial times but with some additional restrictions such as constant retrial rate, only the customer at the head of the retrial queue will attempt to capture a free server, 2-state phase type distribution, and finite retrial orbit. Generally, the retrial queueing models are analyzed as level-dependent queues and hence one has to use some type of a truncation method in performing the analysis of the model. In this paper we study a retrial queueing model with threshold-type policy for orbiting customers in the context of nonexponential retrial times. Using matrix-analytic methods we analyze the model and compare with the classical retrial queueing model through a few illustrative numerical examples. We also compare numerically our threshold retrial queueing model with a previously published retrial queueing model that uses a truncation method.

• International Journal of Highway Engineering
• /
• v.9 no.4
• /
• pp.21-32
• /
• 2007

The linear traffic model(Vertical queueing model) that is adopted widely in traffic flow estimation assumes that all vehicles have the identical motion before joining a queue at the stop-line. Thus, a queue is supposed to form vertically not horizontally. Due to the simplicity of this model, the departure time of the leading vehicle is assumed to coincide with the start of effective green time. Thus, the delay estimates given by the Vertical queueing model is not always realistic. This paper explores a microscopic traffic model(a Kinematic Car-following model at Signalised intersections: a KCS traffic model) based on the one dimensional Kinematic equations in physics. A comparative evaluation in delay and sensitivity of delay difference between the KCS traffic model and the previously known Vertical queueing model is presented. The results show that the delay estimate in the Vertical queueing model is always greater than or equal to the KCS traffic model; however, the sensitivity of delay in the KCS traffic model is greater than the Vertical queueing model.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.24 no.4
• /
• pp.111-122
• /
• 1999

In this paper, we consider a queueing network model. where the population constraint within each subnetwork is controlled by a semaphore queue. The total number of customers that may be present in the subnetwork can not exceed a given value. Each node has a constant service time and the arrival process to the queueing network is an arbitrary distribution. A major characteristics of this model is that the lower layer flow is halted by the state of higher layer. We present some properties that the inter-change of nodes does not make any difference to customer's waiting time in the queueing network under a certain condition. The queueing network can be transformed into a simplified queueing network. A dramatic simplification of the queueing network is shown. It is interesting to see how the simplification developed for sliding window flow control, can be applied to multi-layered queueing network.

• Journal of Korean Library and Information Science Society
• /
• v.13
• /
• pp.131-166
• /
• 1986

This study is designed to review the methods of duplicate copies decision making in the academic library. In this thesis, I surveyed queueing & markov model, statistical model, and simulation model. The contents of the study can be summarized as follows: 1) Queueing and markov model is used for one of duplicate copies decision-making methods. This model was suggested by Leimkuler, Morse, and Chen, etc. Leimkuler proposed growth model, storage model, and availability model through using system analysis method. Queueing theory is a n.0, pplied to Leimkuler's availability model. Morse ad Chen a n.0, pplied queueing and markov model to their theory. They used queueing theory for measuring satisfaction level and Markov model for predicting user demand. 2) Another model of duplicate copies decision-making methods is statistical model. This model is suggested by Grant and Sohn, Jung Pyo. Grant suggested a model with a formula to satisfy the user demand more than 95%, Sohn, Jung Pyo suggested a model with two formulars: one for duplicate copies decision-making by using standard deviation and the other for duplicate copies predicting by using coefficient of variation. 3) Simulation model is used for one of duplicate copies decision-making methods. This model is suggested by Buckland and Arms. Buckland considered both loan period and duplicate copies simultaneously in his simulation model. Arms suggested computer-simulation model as one of duplicate copies decision-making methods. These methods can help improve the efficiency of collection development and solve some problems (space, staff, budget, etc, ) of Korean academic libraries today.

• Journal of the Korea Society for Simulation
• /
• v.7 no.2
• /
• pp.63-78
• /
• 1998

The hierarchical cell structure consists of the macrocell and microcells to increase the system capacity and to achieve broad coverage. The hierarchical cell structure provides services for users in different mobility. In this paper, an analytical queueing model in mobile networks is proposed for the performance evaluation of the hierarchical cell structure. The model for networks with the multiple levels can simplify multi-dimensional ones into one-dimensional queueing model. The computational advantage will be growing as the layers are constructed in multiple levels. The computer simulation is provided for validating the proposed analytical model.

• Journal of applied mathematics & informatics
• /
• v.15 no.1_2
• /
• pp.405-414
• /
• 2004

This paper considers overload control in telecommunication networks. Markov-modulated Bernoulli process ( MMBP ) has been extensively used to model bursty traffics with time-correlation. Thus, we investigate the transient behavior of the queueing system MMBP/D/l/K queue with two thresholds. The model is analyzed recursively by using the generating function method. We obtain the transient queue length distribution and waiting time distribution at an arbitrary time. The transient behavior of the queueing system helps observing the temporary system behavior.

• Communications for Statistical Applications and Methods
• /
• v.9 no.3
• /
• pp.649-663
• /
• 2002

We consider an unlimited fluid queueing model which has Fractional Brownian motion(FBM) as an input and a single server of constant service rate. By using the result of Duffield and O'Connell(6), we investigate the asymptotic tail-distribution of the stationary work-load. When there are multiple homogeneous FBM inputs, the workload distribution is similar to that of the queue with one FBM input; whereas for the heterogeneous sources the asymptotic work-load distributions is dominated by the source with the largest Hurst parameter.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2006.11a
• /
• pp.403-406
• /
• 2006

This paper provides an M/G/1 queueing model for the operations management problem at the toll plaza. This queueing process is incorporated with two non-linear integer programming models - the user cost minimization model during the peak times and the operating cost minimization model during the off-peak hours.

• ETRI Journal
• /
• v.39 no.4
• /
• pp.558-569
• /
• 2017

In this study, a non-preemptive M/G/1 queueing model of a spectrum handoff scheme for cognitive wireless networks is proposed. Because spectrum handoff gives secondary users an opportunity to carry on their transmissions, it is crucially important to determine the actions of primary users. In our queueing model, prioritized data traffic is utilized to meet the requirements of the secondary users. These users' packets are categorized into three different priority classes: urgent, real-time, and non-real time. Urgent data packets have the highest priority, while non-real time data packets have the lowest priority. Riverbed (OPNET) Modeler simulation software was used to simulate both reactive and proactive decision spectrum handoff schemes. The simulation results were consistent with the analytical results obtained under different load and traffic conditions. This study also revealed that the cumulative number of handoffs can be drastically decreased by exploiting priority classes and utilizing a decent spectrum handoff strategy, such as a reactive or proactive decision-based strategy.

• Journal of Korean Institute of Industrial Engineers
• /
• v.21 no.3
• /
• pp.345-356
• /
• 1995

The aim of this paper is to analyze the batch service queueing model M/M(a, b ; ${\mu}_k/1$) under general bulk service rule with mean service rate ${\mu}_k$ for a batch of k units, where $a{\leq}k{\leq}b$. This queueing model consists of the two-dimensional state space so that it is characterized by two-dimensional state Markov process. The steady-state solution and performane measure of this process are derived by using Matrix Geometric method. Meanwhile, a new approach is suggested to calculate the two-dimensional traffic density R which is used to obtain the steady-state solution. In addition, to determine the optimal service initiation threshold a, a decision model of this queueing system is developed evaluating cost of service per batch and cost of waiting per customer. In a job order production system, the decision-making procedure presented in this paper can be applicable to determining when production should be started.