On two node tandem queueing model with time dependent service rates

Author(s):  
K. Srinivasa Rao ◽  
J. Durga Aparajitha
2017 ◽  
Vol 2017 ◽  
pp. 1-10 ◽  
Author(s):  
Ekaterina Evdokimova ◽  
Sabine Wittevrongel ◽  
Dieter Fiems

This paper investigates the performance of a queueing model with multiple finite queues and a single server. Departures from the queues are synchronised or coupled which means that a service completion leads to a departure in every queue and that service is temporarily interrupted whenever any of the queues is empty. We focus on the numerical analysis of this queueing model in a Markovian setting: the arrivals in the different queues constitute Poisson processes and the service times are exponentially distributed. Taking into account the state space explosion problem associated with multidimensional Markov processes, we calculate the terms in the series expansion in the service rate of the stationary distribution of the Markov chain as well as various performance measures when the system is (i) overloaded and (ii) under intermediate load. Our numerical results reveal that, by calculating the series expansions of performance measures around a few service rates, we get accurate estimates of various performance measures once the load is above 40% to 50%.


2016 ◽  
Vol 8 (5) ◽  
pp. 56 ◽  
Author(s):  
Ehmet Kasim

By using the strong continuous semigroup theory of linear operators we prove that the M/G/1 queueing model with working vacation and vacation interruption has a unique positive time dependent solution which satisfies probability conditions. When the both service completion rate in a working vacation period and in a regular busy period are constant, by investigating the spectral properties of an operator corresponding to the model we obtain that the time-dependent solution of the model strongly converges to its steady-state solution.


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


2014 ◽  
Vol 21 (1) ◽  
pp. 84 ◽  
Author(s):  
A.V.S. Suhasini ◽  
K. Srinivasa Rao ◽  
P. Rajasekhara Reddy

Author(s):  
Bernardo D’Auria ◽  
Ivo J.B.F. Adan ◽  
Ren Bekker ◽  
Vidyadhar Kulkarni

Sign in / Sign up

Export Citation Format

Share Document