scholarly journals Delay and overflow of discrete-time priority queue with burst arrivals and partial buffer sharing

1998 ◽  
pp. 59-74
Author(s):  
Hideaki Yamashita
Keyword(s):  
Discrete Time ◽  
Priority Queue ◽  
Buffer Sharing

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

Discrete time priority queue with self generated interruption

2020 ◽  
Author(s):  
M. P. Anilkumar ◽  
K. P. Jose
Keyword(s):  
Discrete Time ◽  
Priority Queue

The stationary tail asymptotics in the GI/G/1-type queue with countably many background states

2004 ◽  
Vol 36 (4) ◽  
pp. 1231-1251 ◽  
Author(s):  
Masakiyo Miyazawa ◽  
Yiqiang Q. Zhao
Keyword(s):  
State Space ◽  
Discrete Time ◽  
Priority Queue ◽  
Decay Rates ◽  
Single Server ◽  
Renewal Theorem ◽  
Tail Probabilities ◽  
Markov Renewal Equation ◽  
Geometric Decay ◽  
Background State

We consider the asymptotic behaviour of the stationary tail probabilities in the discrete-time GI/G/1-type queue with countable background state space. These probabilities are presented in matrix form with respect to the background state space, and shown to be the solution of a Markov renewal equation. Using this fact, we consider their decay rates. Applying the Markov renewal theorem, it is shown that certain reasonable conditions lead to the geometric decay of the tail probabilities as the level goes to infinity. We exemplify this result using a discrete-time priority queue with a single server and two types of customer.

scholarly journals A preemptive discrete-time priority buffer system with partial buffer sharing

2010 ◽  
Vol 34 (8) ◽  
pp. 2148-2165 ◽  
Author(s):  
F. Jolai ◽  
S.M. Asadzadeh ◽  
M.R. Taghizadeh
Keyword(s):  
Discrete Time ◽  
Buffer System ◽  
Buffer Sharing

scholarly journals A Discrete-Time Priority Queue with Train Arrivals

2007 ◽  
Vol 23 (3) ◽  
pp. 489-512 ◽  
Author(s):  
Joris Walraevens ◽  
Sabine Wittevrongel ◽  
Herwig Bruneel
Keyword(s):  
Discrete Time ◽  
Priority Queue

The stationary tail asymptotics in the GI/G/1-type queue with countably many background states

2004 ◽  
Vol 36 (04) ◽  
pp. 1231-1251 ◽  
Author(s):  
Masakiyo Miyazawa ◽  
Yiqiang Q. Zhao
Keyword(s):  
State Space ◽  
Discrete Time ◽  
Priority Queue ◽  
Decay Rates ◽  
Single Server ◽  
Renewal Theorem ◽  
Tail Probabilities ◽  
Markov Renewal Equation ◽  
Geometric Decay ◽  
Background State

We consider the asymptotic behaviour of the stationary tail probabilities in the discrete-time GI/G/1-type queue with countable background state space. These probabilities are presented in matrix form with respect to the background state space, and shown to be the solution of a Markov renewal equation. Using this fact, we consider their decay rates. Applying the Markov renewal theorem, it is shown that certain reasonable conditions lead to the geometric decay of the tail probabilities as the level goes to infinity. We exemplify this result using a discrete-time priority queue with a single server and two types of customer.

A discrete-time priority queue with two-class customers and bulk services

1992 ◽  
Vol 10 (3) ◽  
pp. 185-211 ◽  
Author(s):  
Jin-Fu Chang ◽  
Ywh-Pyng Harn
Keyword(s):  
Discrete Time ◽  
Priority Queue

scholarly journals A Discrete-Time HOL Priority Queue with Multiple Traffic Classes

2005 ◽  
pp. 620-627 ◽  
Author(s):  
Joris Walraevens ◽  
Bart Steyaert ◽  
Marc Moeneclaey ◽  
Herwig Bruneel
Keyword(s):  
Discrete Time ◽  
Priority Queue
Sign in / Sign up

Export Citation Format

Share Document