Transient analysis and ANFIS computing of unreliable single server queueing model with multiple stage service and functioning vacation

Author(s):  
Anjali Ahuja ◽  
Anamika Jain ◽  
Madhu Jain
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%.


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.


Author(s):  
Charan Jeet Singh ◽  
Madhu Jain ◽  
Binay Kumar
Keyword(s):  

1994 ◽  
Vol 31 (A) ◽  
pp. 115-129 ◽  
Author(s):  
W. Böhm ◽  
S. G. Mohanty

In this contribution we consider an M/M/1 queueing model with general server vacations. Transient and steady state analysis are carried out in discrete time by combinatorial methods. Using weak convergence of discrete-parameter Markov chains we also obtain formulas for the corresponding continuous-time queueing model. As a special case we discuss briefly a queueing system with a T-policy operating.


2021 ◽  
pp. 2150001
Author(s):  
Kai Yao

In the queueing theory, the interarrival times between customers and the service times for customers are usually regarded as random variables. This paper considers human uncertainty in a queueing system, and proposes an uncertain queueing model in which the interarrival times and the service times are regarded as uncertain variables. The busyness index is derived analytically which indicates the service efficiency of a queueing system. Besides, the uncertainty distribution of the busy period is obtained.


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.


1971 ◽  
Vol 8 (1) ◽  
pp. 95-109 ◽  
Author(s):  
Sreekantan S. Nair

Avi-Itzhak, Maxwell and Miller (1965) studied a queueing model with a single server serving two service units with alternating priority. Their model explored the possibility of having the alternating priority model treated in this paper with a single server serving alternately between two service units in tandem.Here we study the distribution of busy period, virtual waiting time and queue length and their limiting behavior.


1975 ◽  
Vol 12 (04) ◽  
pp. 763-778 ◽  
Author(s):  
O. J. Boxma

In this paper a problem arising in queueing and dam theory is studied. We shall consider a G/G*/1 queueing model, i.e., a G/G/1 queueing model of which the service process is a separable centered process with stationary independent increments. This is a generalisation of the well-known G/G/1 model with constant service rate. Several results concerning the amount of work done by the server, the busy cycles etc., are derived, mainly using the well-known method of Pollaczek. Emphasis is laid on the similarities and dissimilarities between the results of the ‘classical’ G/G/1 model and the G/G*/1 model.


Sign in / Sign up

Export Citation Format

Share Document