Analysis of a discrete-time queueing system with time-limited service

1994 ◽  
Vol 18 (1-2) ◽  
pp. 183-197 ◽  
Author(s):  
Hideaki Takagi ◽  
Kin K. Leung
Keyword(s):  
Discrete Time ◽  
Queueing System ◽  
Limited Service

Transient analysis of M/M/1 queues in discrete time by general server vacations

1994 ◽  
Vol 31 (A) ◽  
pp. 115-129 ◽  
Author(s):  
W. Böhm ◽  
S. G. Mohanty
Keyword(s):  
Discrete Time ◽  
Continuous Time ◽  
Transient Analysis ◽  
Queueing System ◽  
Queueing Model ◽  
Discrete Parameter ◽  
Server Vacations ◽  
Special Case ◽  
Combinatorial Methods ◽  
Transient And Steady State

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.

A discrete-time queueing system with optional LCFS discipline

2012 ◽  
Vol 202 (1) ◽  
pp. 3-17 ◽  
Author(s):  
I. Atencia ◽  
A. V. Pechinkin
Keyword(s):  
Discrete Time ◽  
Queueing System

scholarly journals Sojourn Times in A Queueing System with Breakdowns and General Retrial Times

Mathematics ◽  
2021 ◽  
Vol 9 (22) ◽  
pp. 2882
Author(s):  
Ivan Atencia ◽  
José Luis Galán-García
Keyword(s):  
Steady State ◽  
Discrete Time ◽  
Queueing System ◽  
Retrial Queue ◽  
Stochastic Decomposition ◽  
Discrete Time System ◽  
Main Research ◽  
Extensive Analysis ◽  
Complete Study ◽  
Number Of Customers

This paper centers on a discrete-time retrial queue where the server experiences breakdowns and repairs when arriving customers may opt to follow a discipline of a last-come, first-served (LCFS)-type or to join the orbit. We focused on the extensive analysis of the system, and we obtained the stationary distributions of the number of customers in the orbit and in the system by applying the generation function (GF). We provide the stochastic decomposition law and the application bounds for the proximity between the steady-state distributions for the queueing system under consideration and its corresponding standard system. We developed recursive formulae aimed at the calculation of the steady-state of the orbit and the system. We proved that our discrete-time system approximates M/G/1 with breakdowns and repairs. We analyzed the busy period of an auxiliary system, the objective of which was to study the customer’s delay. The stationary distribution of a customer’s sojourn in the orbit and in the system was the object of a thorough and complete study. Finally, we provide numerical examples that outline the effect of the parameters on several performance characteristics and a conclusions section resuming the main research contributions of the paper.

scholarly journals M/G/1 vacation model with limited service discipline and hybrid switching-on policy

1997 ◽  
Vol 3 (3) ◽  
pp. 243-253
Author(s):  
Alexander V. Babitsky
Keyword(s):  
Generating Function ◽  
Busy Period ◽  
Optimization Problem ◽  
Queueing System ◽  
Service Discipline ◽  
Multiple Vacations ◽  
Queueing Process ◽  
Vacation Model ◽  
Hybrid Switching ◽  
Limited Service

The author studies an M/G/1 queueing system with multiple vacations. The server is turned off in accordance with the K-limited discipline, and is turned on in accordance with the T-N-hybrid policy. This is to say that the server will begin a vacation from the system if either the queue is empty orKcustomers were served during a busy period. The server idles until it finds at leastNwaiting units upon return from a vacation.Formulas for the distribution generating function and some characteristics of the queueing process are derived. An optimization problem is discussed.

THE ALLOCATION OF CUSTOMERS IN A DISCRETE-TIME MULTI-SERVER QUEUEING SYSTEM

2010 ◽  
Vol 27 (06) ◽  
pp. 649-667 ◽  
Author(s):  
WEI SUN ◽  
NAISHUO TIAN ◽  
SHIYONG LI
Keyword(s):  
Performance Measures ◽  
Discrete Time ◽  
Queueing System ◽  
Arrival Rate ◽  
Allocation Problem ◽  
Optimal Outcome ◽  
The Subject ◽  
Multi Server ◽  
Theoretical Results

This paper, analyzes the allocation problem of customers in a discrete-time multi-server queueing system and considers two criteria for routing customers' selections: equilibrium and social optimization. As far as we know, there is no literature concerning the discrete-time multi-server models on the subject of equilibrium behaviors of customers and servers. Comparing the results of customers' distribution at the servers under the two criteria, we show that the servers used in equilibrium are no more than those used in the socially optimal outcome, that is, the individual's decision deviates from the socially preferred one. Furthermore, we also clearly show the mutative trend of several important performance measures for various values of arrival rate numerically to verify the theoretical results.

Analysis of a Discrete-Time Geo/G/1 Queue in a Multi-Phase Service Environment with Disasters

2018 ◽  
Vol 6 (4) ◽  
pp. 349-365
Author(s):  
Tao Jiang
Keyword(s):  
Generating Function ◽  
Discrete Time ◽  
Queueing System ◽  
Supplementary Variable ◽  
Variable Technique ◽  
Service Environment ◽  
Stationary Queue Length ◽  
Expected Length ◽  
Multi Phase ◽  
The Relationship

Abstract This paper considers a discrete-time Geo/G/1 queue in a multi-phase service environment, where the system is subject to disastrous breakdowns, causing all present customers to leave the system simultaneously. At a failure epoch, the server abandons the service and the system undergoes a repair period. After the system is repaired, it jumps to operative phase i with probability qi, i = 1, 2 ⋯, n. Using the supplementary variable technique, we obtain the distribution for the stationary queue length at the arbitrary epoch, which are then used for the computation of other performance measures. In addition, we derive the expected length of a cycle time, the generating function of the sojourn time of an arbitrary customer, and the generating function of the server’s working time in a cycle. We also give the relationship between the discrete-time queueing system to its continuous-time counterpart. Finally, some examples and numerical results are presented.

Optimal Thresholds of an Infinite Buffer Discrete-Time Two-Server System with Triadic Policy

2011 ◽  
Vol 2 (4) ◽  
pp. 75-88
Author(s):  
Veena Goswami ◽  
G. B. Mund
Keyword(s):  
Discrete Time ◽  
Queueing System ◽  
Minimum Cost ◽  
Service Rate ◽  
Closed Form Solutions ◽  
Optimal Thresholds ◽  
Optimal Service ◽  
Number Of Customers ◽  
System Operating ◽  
Server System

This paper analyzes a discrete-time infinite-buffer Geo/Geo/2 queue, in which the number of servers can be adjusted depending on the number of customers in the system one at a time at arrival or at service completion epoch. Analytical closed-form solutions of the infinite-buffer Geo/Geo/2 queueing system operating under the triadic (0, Q N, M) policy are derived. The total expected cost function is developed to obtain the optimal operating (0, Q N, M) policy and the optimal service rate at minimum cost using direct search method. Some performance measures and sensitivity analysis have been presented.

Sign in / Sign up

Export Citation Format

Share Document