Correction to our paper: Delay analysis of discrete-time priority queue with structure inputs, Queueing Systems 8 (1991) 149?164

1993 ◽  
Vol 13 (4) ◽  
pp. 449-450 ◽  
Author(s):  
Yoshitaka Takahashi ◽  
On Hashida
Keyword(s):  
Discrete Time ◽  
Queueing Systems ◽  
Priority Queue ◽  
Delay Analysis

Delay analysis of discrete-time priority queue with structured inputs

1991 ◽  
Vol 8 (1) ◽  
pp. 149-163 ◽  
Author(s):  
Yoshitaka Takahashi ◽  
On Hashida
Keyword(s):  
Discrete Time ◽  
Priority Queue ◽  
Delay Analysis

scholarly journals From Exhaustive Vacation Queues to Preemptive Priority Queues with General Interarrival Times

2018 ◽  
Vol 28 (4) ◽  
pp. 695-704
Author(s):  
Dieter Fiems ◽  
Stijn De Vuyst
Keyword(s):  
Discrete Time ◽  
Queueing System ◽  
Queueing Systems ◽  
Probability Generating Function ◽  
Priority Queue ◽  
Preemptive Priority ◽  
Numerical Examples ◽  
Preemptive Resume ◽  
Completion Times ◽  
Priority Queueing

Abstract We consider the discrete-time G/GI/1 queueing system with multiple exhaustive vacations. By a transform approach, we obtain an expression for the probability generating function of the waiting time of customers in such a system. We then show that the results can be used to assess the performance of G/GI/1 queueing systems with server breakdowns as well as that of the low-priority queue of a preemptive MX+G/GI/1 priority queueing system. By calculating service completion times of low-priority customers, various preemptive breakdown/priority disciplines can be studied, including preemptive resume and preemptive repeat, as well as their combinations. We illustrate our approach with some numerical examples.

Discrete Time Queueing Systems

1994 ◽  
pp. 275-325
Author(s):  
Mark W. Garrett ◽  
San-Qi Li
Keyword(s):  
Discrete Time ◽  
Queueing Systems

scholarly journals Time-dependent performance analysis of a discrete-time priority queue

2008 ◽  
Vol 65 (9) ◽  
pp. 641-652 ◽  
Author(s):  
Joris Walraevens ◽  
Dieter Fiems ◽  
Herwig Bruneel
Keyword(s):  
Performance Analysis ◽  
Discrete Time ◽  
Priority Queue ◽  
Time Dependent

The Computation of Average Optimal Policies in Denumerable State Markov Decision Chains

1997 ◽  
Vol 29 (01) ◽  
pp. 114-137
Author(s):  
Linn I. Sennott
Keyword(s):  
Discrete Time ◽  
Average Cost ◽  
Queueing Systems ◽  
State Spaces ◽  
Original Process ◽  
Optimal Policies ◽  
Finite State ◽  
Markov Decision ◽  
Optimal Average ◽  
Infinite State

This paper studies the expected average cost control problem for discrete-time Markov decision processes with denumerably infinite state spaces. A sequence of finite state space truncations is defined such that the average costs and average optimal policies in the sequence converge to the optimal average cost and an optimal policy in the original process. The theory is illustrated with several examples from the control of discrete-time queueing systems. Numerical results are discussed.

Sign in / Sign up

Export Citation Format

Share Document