Profiting the idleness in single server system with orbit-queue

Author(s):  
Amar Aissani ◽  
Tuan Phung-Duc
Keyword(s):  
1993 ◽  
Vol 16 (6) ◽  
pp. 817-824 ◽  
Author(s):  
Ding‐Tsair Chang ◽  
Ue‐Pyng Wen ◽  
James T. Lin
Keyword(s):  

1988 ◽  
Vol 25 (02) ◽  
pp. 391-403 ◽  
Author(s):  
Karl Sigman

A tandem queue with a FIFO multiserver system at each stage, i.i.d. service times and a renewal process of external arrivals is shown to be regenerative by modeling it as a Harris-ergodic Markov chain. In addition, some explicit regeneration points are found. This generalizes the results of Nummelin (1981) in which a single server system is at each stage and the result of Charlot et al. (1978) in which the FIFO GI/GI/c queue is modeled as a Harris chain. In preparing for our result, we study the random assignment queue and use it to give a new proof of Harris ergodicity of the FIFO queue.


2008 ◽  
Vol 22 (3) ◽  
pp. 355-371 ◽  
Author(s):  
Liqiang Liu ◽  
Vidyadhar G. Kulkarni

We consider the virtual queuing time (vqt, also known as work-in-system, or virtual-delay) process in an M/G/s queue with impatient customers. We focus on the vqt-based balking model and relate it to reneging behavior of impatient customers in terms of the steady-state distribution of the vqt process. We construct a single-server system, analyze its operating characteristics, and use them to approximate the multiserver system. We give both analytical results and numerical examples. We conduct simulation to assess the accuracy of the approximation.


2010 ◽  
Vol 67 (1) ◽  
pp. 63-90 ◽  
Author(s):  
Douglas G. Down ◽  
Ger Koole ◽  
Mark E. Lewis

2014 ◽  
Vol 543-547 ◽  
pp. 3013-3016
Author(s):  
Ya Wei Yang ◽  
Hong Wei Ding ◽  
Jia Guo ◽  
Yong Wang ◽  
Qian Lin Liu

In this paper, the authors employ the multi-queue single-server system for information packets to calculate the theoretical value and computer simulation in the Bi-directional cable TV network. 3-queues single server polling system is used for example in the paper. And the simulation results show that the theoretical analysis and computer simulation are consistent.


1978 ◽  
Vol 15 (01) ◽  
pp. 162-170 ◽  
Author(s):  
J. Keilson

For a single-server system having several Poisson streams of customers with exponentially distributed service times, busy period densities, waiting time densities, and idle state probabilities are completely monotone. The exponential spectra for such densities are of importance for understanding the transient behavior of such systems. Algorithms are given for the computation of such spectra. Applications to heavy traffic situations and priority systems are also discussed.


1985 ◽  
Vol 17 (2) ◽  
pp. 408-423 ◽  
Author(s):  
Jewgeni Dshalalow

In this paper we study a multi-channel queueing model of type with N waiting places and a non-recurrent input flow dependent on queue length at the time of each arrival. The queue length is treated as a basic process. We first determine explicitly the limit distribution of the embedded Markov chain. Then, by introducing an auxiliary Markov process, we find a simple relationship between the limiting distribution of the Markov chain and the limiting distribution of the original process with continuous time parameter. Here we simultaneously combine two methods: solving the corresponding Kolmogorov system of the differential equations, and using an approach based on the theory of semi-regenerative processes. Among various applications of multi-channel queues with state-dependent input stream, we consider a closed single-server system with reserve replacement and state-dependent service, which turns out to be dual (in a certain sense) in relation to our model; an optimization problem is also solved, and an interpretation by means of tandem systems is discussed.


Sign in / Sign up

Export Citation Format

Share Document