scholarly journals Computational Performance of a Single Server State Dependent Queue

2019 ◽  
Vol 8 (10) ◽  
pp. 697-700
Keyword(s):  
Performance Measures ◽  
Service Rate ◽  
Single Server ◽  
Queuing Model ◽  
Computational Performance ◽  
State Dependent ◽  
Matrix Geometric Method ◽  
Perform Sensitivity Analysis ◽  
Customer Type ◽  
Heavy Tailed

In this article we consider a single server state dependent queuing system with the service rate varying according to types of customers like normal, tagged and heavy tailed. We develop a state dependent queuing model in which the service rate depends on customer type arrive to the system with quasi-birth-death environment structure and using matrix geometric method we develop the system performance measures. Also, we use these performance measures by utilizing the maximum potential of server and perform sensitivity analysis with numerical illustrations.

scholarly journals Performance Measures of State Dependent MMPP/M/1 Queue

2018 ◽  
Vol 7 (4.10) ◽  
pp. 942 ◽  
Author(s):  
R. Sakthi ◽  
V. Vidhya ◽  
K. Mahaboob Hassain Sherieff ◽  
. .
Keyword(s):  
Performance Measures ◽  
Research Work ◽  
Arrival Process ◽  
Service Rate ◽  
Single Server ◽  
State Dependent ◽  
Markov Modulated ◽  
Service State ◽  
Modulated Process ◽  
Stationary Probability Vector

In this research work we are concerned with single unit server queue  queue with Markov Modulated process in Poisson fashion and the service time follow exponential distribution. The system is framed as a state dependent with the arrival process as Markov Modulated input and service is rendered by a single server with variation in service rate based on the intensity of service state of the system. The rate matrix that is essential to compute the stationary probability vector is obtained and various performance measures are computed using matrix method.

scholarly journals A Taylor Series Approach for Service-Coupled Queueing Systems with Intermediate Load

2017 ◽  
Vol 2017 ◽  
pp. 1-10 ◽  
Author(s):  
Ekaterina Evdokimova ◽  
Sabine Wittevrongel ◽  
Dieter Fiems
Keyword(s):  
Performance Measures ◽  
Queueing Systems ◽  
Poisson Processes ◽  
Series Expansions ◽  
Service Rate ◽  
Single Server ◽  
Queueing Model ◽  
State Space Explosion ◽  
Finite Queues ◽  
Service Rates

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%.

Multi-threshold control by a single-server queuing model with a service rate depending on the amount of harvested energy

2018 ◽  
Vol 127-128 ◽  
pp. 1-20 ◽  
Author(s):  
Chesoong Kim ◽  
Sergei Dudin ◽  
Alexander Dudin ◽  
Konstantin Samouylov
Keyword(s):  
Service Rate ◽  
Single Server ◽  
Queuing Model ◽  
Threshold Control

On stability of state-dependent queues and acyclic queueing networks

1989 ◽  
Vol 21 (3) ◽  
pp. 681-701 ◽  
Author(s):  
Nicholas Bambos ◽  
Jean Walrand
Keyword(s):  
Queueing Networks ◽  
Sufficient Conditions ◽  
Service Rate ◽  
Single Server ◽  
General Function ◽  
State Dependent ◽  
The Stability ◽  
Necessary And Sufficient ◽  
Periodic Inputs ◽  
Networks Of Queues

We consider a single server first-come-first-served queue with a stationary and ergodic input. The service rate is a general function of the workload in the queue. We provide the necessary and sufficient conditions for the stability of the system and the asymptotic convergence of the workload process to a finite stationary process at large times. Then, we consider acyclic networks of queues in which the service rate of any queue is a function of the workloads of this and of all the preceding queues. The stability problem is again studied. The results are then extended to analogous systems with periodic inputs.

On stability of state-dependent queues and acyclic queueing networks

1989 ◽  
Vol 21 (03) ◽  
pp. 681-701 ◽  
Author(s):  
Nicholas Bambos ◽  
Jean Walrand
Keyword(s):  
Queueing Networks ◽  
Sufficient Conditions ◽  
Service Rate ◽  
Single Server ◽  
General Function ◽  
State Dependent ◽  
The Stability ◽  
Necessary And Sufficient ◽  
Periodic Inputs ◽  
Networks Of Queues

We consider a single server first-come-first-served queue with a stationary and ergodic input. The service rate is a general function of the workload in the queue. We provide the necessary and sufficient conditions for the stability of the system and the asymptotic convergence of the workload process to a finite stationary process at large times. Then, we consider acyclic networks of queues in which the service rate of any queue is a function of the workloads of this and of all the preceding queues. The stability problem is again studied. The results are then extended to analogous systems with periodic inputs.

scholarly journals Optimal Control Policy for a Two-Phase M/M/1 Unreliable Gated Queue under N-Policy with a Fuzzy Environment

2021 ◽  
Vol 26 (4) ◽  
pp. 357-364
Author(s):  
Hanumantha Rao Sama ◽  
Vasanta Kumar Vemuri ◽  
Venkata Siva Nageswara Hari Prasad Boppana
Keyword(s):  
Nonlinear Programming ◽  
Performance Measures ◽  
Fuzzy Numbers ◽  
Upper And Lower Bounds ◽  
Service Rate ◽  
Extension Principle ◽  
Single Server ◽  
Two Phase ◽  
Expected Cost ◽  
Fuzzy Environment

The two-phase service models analyzed by several authors considered only the probabilistic nature of the queue parameters with fixed cost elements. But the queue parameters and cost elements will be in general are of both possibilistic and probabilistic in nature. Analyzing the performance of the queueing systems with fuzzy environment facilitates to investigate for the possibilistic interval estimates to the performance measures of a queueing system rather than point estimates. In this work, it is proposed to construct membership function of the fuzzy cost function to obtain confidence estimates for some performance measures of a controllable two-phase service single server Markovian gated queue with server startups and breakdowns under N-policy in which the queue parameters viz. arrival rate, startup rate, batch service rate, individual service rate, repair rate and cost elements are all defined as fuzzy numbers. Based on Zadeh’s extension principle and the α-cuts, a set of parametric nonlinear programming problems are developed to find the upper and lower bounds of the minimum total expected cost per unit time at the possibility level α. As the analytical solutions of the nonlinear programming problems developed for the proposed model are tedious, considering the system parameters and cost elements as trapezoidal fuzzy numbers, numerical results for the lower and upper bounds of the optimal threshold N* and the minimum total expected cost per unit time are computed using the nonlinear programming solver available in MATLAB.

scholarly journals Analysis of Fuzzy Non-preemptive Priority Queuing Model with Unequal Service Rate

2021 ◽  
Vol 12 (5) ◽  
pp. 1457-1460
Author(s):  
K. Selvakumari, Et. al.
Keyword(s):  
Performance Measures ◽  
Fuzzy Number ◽  
Fuzzy Numbers ◽  
Arrival Rate ◽  
Triangular Fuzzy Number ◽  
Priority Queues ◽  
Service Rate ◽  
Preemptive Priority ◽  
Queuing Model ◽  
Service Rates

This article provides an effective method to analyze the performance measures of non-preemptive fuzzy priority queues with unequal service rates. Here the arrival rate and the service rate are in fuzzy numbers. Using a new ranking method, the fuzzy values are reduced to the crisp values. For that cause, both the Triangular Fuzzy Number (TFN) and Trapezoidal Fuzzy Number (TpFN) are chosen to establish the proposal's effectiveness. An illustration is given to find the efficiency of the performance measures of the fuzzy queuing model.

scholarly journals An Interpretation of Non-Preemptive Priority Fuzzy Queuing Model with Asymmetrical Service Rates

2021 ◽  
pp. 791-797
Author(s):  
Usha Prameela Karupothu ◽  
Richard Wurmbrand ◽  
R P S Jayakar
Keyword(s):  
Performance Measures ◽  
Fuzzy Numbers ◽  
Arrival Rate ◽  
Service Rate ◽  
Preemptive Priority ◽  
Queuing Model ◽  
Numerical Examples ◽  
Cut Method ◽  
Service Rates ◽  
Ranking Technique

This  paper presents Non-Preemptive  priority fuzzy queuing model with asymmetrical service rates. Arrival rate and  service rate are taken to be hexagonal, heptagonal, and octagonal fuzzy numbers. Here an interpretation  is given to determine the performance measures by applying a new  ranking technique through which the fuzzy values are reduced to the crisp values. This ranking technique has the benefit of being precise and relevant compared to other methods such as alpha-cut method and LR method. The main intention is to evaluate the fuzziness before the performance measures are processed by utilizing the regular queueing hypothesis. Three numerical examples are exhibited to show the validity implementation of the methodology.

scholarly journals A Two-Stage Model Queueing with No Waiting Line between Channels

2013 ◽  
Vol 2013 ◽  
pp. 1-5 ◽  
Author(s):  
Vedat Sağlam ◽  
Müjgan Zobu
Keyword(s):  
Performance Measures ◽  
Loss Probability ◽  
Service Discipline ◽  
Single Server ◽  
Exact Results ◽  
Stage Model ◽  
Input Stream ◽  
Queuing Model ◽  
Simulation Results ◽  
Waiting Line

We consider a new queuing model with sequential two stations (stages), single server at each station, where no queue is allowed at station 2 and with no restriction at station 1. There is a FCFS service discipline in which the input stream is Poisson having rate . The service time of any customer at server () is exponential with parameter . The state probabilities and loss probability of this model are given. The performance measures are obtained and optimized, and, additionally, the model is simulated. The simulation results, exact results, and optimal results of the performance measures are numerically computed for different parameters.

Sign in / Sign up

Export Citation Format

Share Document