A queueing model for a storage buffer in which the arrival rate is controlled by a switch with a random delay

1985 ◽  
Vol 5 (4) ◽  
pp. 243-256 ◽  
Author(s):  
Marcel F. Neuts
1975 ◽  
Vol 7 (03) ◽  
pp. 576-592 ◽  
Author(s):  
Bent Natvig

The steady-state input and output processes are considered for a birth-and-death queueing model with N waiting positions (0 ≦ N ≦ ∞), s servers (1 ≦ s ≦ ∞) and an arbitrary queueing discipline. Let an index n indicate that the quantity in question depends on the system state but not on time t. The instantaneous arrival rate is λ, the probability of balking (i.e., not trying to obtain service) being ξ n. The instantaneous departure rate, μn , of customers having joined the system is the sum of the rate of service completions and the rate of defections before service completion. Three cases are considered. We start by ignoring balking customers; in the first case treating a lost customer neither as an input nor as an output, then secondly as both. Finally, balking and lost customers are considered both as inputs and outputs.


2018 ◽  
Vol 13 (1) ◽  
pp. 60-68
Author(s):  
Sushil Ghimire ◽  
Gyan Bahadur Thapa ◽  
Ram Prasad Ghimire

 Providing service immediately after the arrival is rarely been used in practice. But there are some situations for which servers are more than the arrivals and no one has to wait to get served. In this model, arrival rate is


Mathematics ◽  
2019 ◽  
Vol 7 (8) ◽  
pp. 678 ◽  
Author(s):  
Yacov Satin ◽  
Alexander Zeifman ◽  
Anastasia Kryukova

Consideration is given to the nonstationary analogue of M / M / 1 queueing model in which the service happens only in batches of size 2, with the arrival rate λ ( t ) and the service rate μ ( t ) . One proposes a new and simple method for the study of the queue-length process. The main probability characteristics of the queue-length process are computed. A numerical example is provided.


1975 ◽  
Vol 7 (3) ◽  
pp. 576-592 ◽  
Author(s):  
Bent Natvig

The steady-state input and output processes are considered for a birth-and-death queueing model with N waiting positions (0 ≦ N ≦ ∞), s servers (1 ≦ s ≦ ∞) and an arbitrary queueing discipline. Let an index n indicate that the quantity in question depends on the system state but not on time t. The instantaneous arrival rate is λ, the probability of balking (i.e., not trying to obtain service) being ξn. The instantaneous departure rate, μn, of customers having joined the system is the sum of the rate of service completions and the rate of defections before service completion. Three cases are considered. We start by ignoring balking customers; in the first case treating a lost customer neither as an input nor as an output, then secondly as both. Finally, balking and lost customers are considered both as inputs and outputs.


1998 ◽  
Vol 11 (3) ◽  
pp. 319-338
Author(s):  
Kerry W. Fendick ◽  
Ward Whitt

In high-speed communication networks it is common to have requirements of very small cell loss probabilities due to buffer overflow. Losses are measured to verify that the cell loss requirements are being met, but it is not clear how to interpret such measurements. We propose methods for determining whether or not cell loss requirements are being met. A key idea is to look at the stream of losses as successive clusters of losses. Often clusters of losses, rather than individual losses, should be regarded as the important “loss events”. Thus we propose modeling the cell loss process by a batch Poisson stochastic process. Successive clusters of losses are assumed to arrive according to a Poisson process. Within each cluster, cell losses do not occur at a single time, but the distance between losses within a cluster should be negligible compared to the distance between clusters. Thus, for the purpose of estimating the cell loss probability, we ignore the spaces between successive cell losses in a cluster of losses. Asymptotic theory suggests that the counting process of losses initiating clusters often should be approximately a Poisson process even though the cell arrival process is not nearly Poisson. The batch Poisson model is relatively easy to test statistically and fit; e.g., the batch-size distribution and the batch arrival rate can readily be estimated from cell loss data. Since batch (cluster) sizes may be highly variable, it may be useful to focus on the number of batches instead of the number of cells in a measurement interval. We also propose a method for approximately determining the parameters of a special batch Poisson cell loss with geometric batch-size distribution from a queueing model of the buffer content. For this step, we use a reflected Brownian motion (RBM) approximation of a G/D/1/C queueing model. We also use the RBM model to estimate the input burstiness given the cell loss rate. In addition, we use the RBM model to determine whether the presence of losses should significantly affect the estimation of server utilization when both losses and utilizations are estimated from data. Overall, our analysis can serve as a basis for determining required observation intervals in order to reach conclusions with a solid statistical basis. Thus our analysis can help plan simulations as well as computer system measurements.


2012 ◽  
Vol 2 (1) ◽  
pp. 109 ◽  
Author(s):  
T. S. R Murthy ◽  
Sivarama Krishna ◽  
G. V. S Raju
Keyword(s):  

2008 ◽  
Vol 19 (10) ◽  
pp. 2762-2769 ◽  
Author(s):  
Wei-Dong YANG ◽  
Jian-Feng MA ◽  
Ya-Hui LI

Sign in / Sign up

Export Citation Format

Share Document