A multi-server queueing model with retrial connection arrivals as a model for optimisation of the traffic control

2012 ◽  
Vol 43 (8) ◽  
pp. 1555-1567 ◽  
Author(s):  
CheSoong Kim ◽  
Sergey Dudin
Author(s):  
Weina Wang ◽  
Qiaomin Xie ◽  
Mor Harchol-Balter

Cloud computing today is dominated by multi-server jobs. These are jobs that request multiple servers simultaneously and hold onto all of these servers for the duration of the job. Multi-server jobs add a lot of complexity to the traditional one-server-per-job model: an arrival might not "fit'' into the available servers and might have to queue, blocking later arrivals and leaving servers idle. From a queueing perspective, almost nothing is understood about multi-server job queueing systems; even understanding the exact stability region is a very hard problem. In this paper, we investigate a multi-server job queueing model under scaling regimes where the number of servers in the system grows. Specifically, we consider a system with multiple classes of jobs, where jobs from different classes can request different numbers of servers and have different service time distributions, and jobs are served in first-come-first-served order. The multi-server job model opens up new scaling regimes where both the number of servers that a job needs and the system load scale with the total number of servers. Within these scaling regimes, we derive the first results on stability, queueing probability, and the transient analysis of the number of jobs in the system for each class. In particular we derive sufficient conditions for zero queueing. Our analysis introduces a novel way of extracting information from the Lyapunov drift, which can be applicable to a broader scope of problems in queueing systems.


2007 ◽  
Vol 24 (02) ◽  
pp. 223-243 ◽  
Author(s):  
SRINIVAS R. CHAKRAVARTHY

We consider a multi-server queueing model in which arrivals occur according to a Markovian arrival process (MAP). There is a single-server and additional (backup) servers are added or removed depending on sets of thresholds. The service times are assumed to be exponential and the servers are assumed to be homogeneous. A comparison of this model to the classical MAP/M/c queueing model through an optimization problem yields some interesting results that are useful in practical applications. For example, we notice that positively correlated arrival process appears to benefit with the threshold type queueing model. We also give the minimum delay costs and the associated maximum setup costs so that the threshold type queueing model is to be preferred over the classical MAP/M/c model.


1999 ◽  
Vol 116 (2) ◽  
pp. 249-258 ◽  
Author(s):  
Ivo Adan ◽  
Ton de Kok ◽  
Jacques Resing
Keyword(s):  

2009 ◽  
Vol 26 (01) ◽  
pp. 85-113 ◽  
Author(s):  
SRINIVAS R. CHAKRAVARTHY

We study a MAP/M/c queueing system in which a group of servers take a simultaneous phase type vacation. The queueing model is studied as a QBD process. The steady-state analysis of the model including the waiting time distribution is presented. Interesting numerical results are discussed.


Sign in / Sign up

Export Citation Format

Share Document