scholarly journals Analyzing a degenerate buffer with general inter-arrival and service times in discrete time

2007 ◽  
Vol 56 (3-4) ◽  
pp. 203-212 ◽  
Author(s):  
W. Rogiest ◽  
K. Laevens ◽  
J. Walraevens ◽  
H. Bruneel
Keyword(s):  
2017 ◽  
Vol 109 ◽  
pp. 34-51 ◽  
Author(s):  
Herwig Bruneel ◽  
Willem Mélange ◽  
Joris Walraevens ◽  
Stijn De Vuyst ◽  
Dieter Claeys

A discrete time queueing model is considered to estimate of the number of customers in the system. The arrivals, which are in groups of size X, inter-arrivals times and service times are distributed independent. The inter-arrivals fallows geometric distribution with parameter p and service times follows general distribution with parameter µ, we have derive the various transient state solution along with their moments and numerical illustrations in this paper.


2014 ◽  
Vol 31 (01) ◽  
pp. 1450003 ◽  
Author(s):  
SHAN GAO ◽  
ZAIMING LIU ◽  
QIWEN DU

In this paper, we study a discrete-time finite buffer batch arrival queue with multiple geometric working vacations and vacation interruption: the server serves the customers at the lower rate rather than completely stopping during the vacation period and can come back to the normal working level once there are customers after a service completion during the vacation period, i.e., a vacation interruption happens. The service times during a service period, service times during a vacation period and vacation times are geometrically distributed. The queue is analyzed using the supplementary variable and the imbedded Markov-chain techniques. We obtain steady-state system length distributions at pre-arrival, arbitrary and outside observer's observation epochs. We also present probability generation function (p.g.f.) of actual waiting-time distribution in the system and some performance measures.


2004 ◽  
Vol 31 (1) ◽  
pp. 81-99 ◽  
Author(s):  
Peixia Gao ◽  
Sabine Wittevrongel ◽  
Herwig Bruneel

1972 ◽  
Vol 9 (1) ◽  
pp. 178-184 ◽  
Author(s):  
Marcel F. Neuts ◽  
Shun-Zer Chen

The queue with an infinite number of servers with a semi-Markovian arrival process and with negative exponential service times is studied. The queue length process and the type of the last customer to join the queue before time t are studied jointly, both in continuous and in discrete time. Limiting stationary probabilities are also obtained.


Sign in / Sign up

Export Citation Format

Share Document