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

Walraevens, Joris; Fiems, Dieter; Bruneel, Herwig

doi:10.1016/j.peva.2008.02.002

Cited by 9 publications

(21 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…6, the mean transient low-priority system contentū (j) 2 is depicted versus the discrete-time parameter j for ρ 1 = 0.2 and ρ T = 0.4, 0.6, 0.8 and 1. We have also shown the exact results (dots on the figure) which are calculated by using the iterative procedure explained in [20]. For low loads, it seems that the approximation is already good for rather low j.…”

Section: A Queue With On-off Sourcesmentioning

confidence: 89%

“…The service times are equal to one slot. The transient behavior of this system is analyzed in [20]. In this subsection, we apply our procedure to the transform functionŪ 2 (z) of {ū (j) 2 , j ≥ 0}, the mean low-priority system content at the beginning of slots.…”

Section: A Queue With On-off Sourcesmentioning

confidence: 99%

“…In this subsection, we apply our procedure to the transform functionŪ 2 (z) of {ū (j) 2 , j ≥ 0}, the mean low-priority system content at the beginning of slots. This transform function is given by (see [20]…”

Section: A Queue With On-off Sourcesmentioning

confidence: 99%

See 2 more Smart Citations

Using Singularity Analysis to Approximate Transient Characteristics in Queueing Systems

Walraevens¹,

Fiems²,

Moeneclaey³

2009

Prob. Eng. Inf. Sci.

Self Cite

View full text Add to dashboard Cite

In this paper, we develop a simple method to approximate the transient behavior of queueing systems. In particular, it is shown how singularity analysis of a known generating function of a transient sequence of some performance measure leads to an approximation of this sequence. To illustrate our approach, several specific transient sequences are investigated in detail. By means of some numerical examples, we validate our approximations and demonstrate the usefulness of the technique.

show abstract

Section: A Queue With On-off Sourcesmentioning

confidence: 89%

Section: A Queue With On-off Sourcesmentioning

confidence: 99%

See 1 more Smart Citation

Using Singularity Analysis to Approximate Transient Characteristics in Queueing Systems

Walraevens¹,

Fiems²,

Moeneclaey³

2009

Prob. Eng. Inf. Sci.

Self Cite

View full text Add to dashboard Cite

show abstract

“…An overview of some basic priority queueing models in continuous time can be found in [1][2][3] and references therein. Discrete-time priority queues with deterministic service times equal to one slot have been studied in [4][5][6][7][8][9][10][11][12][13][14][15][16]. Khamisy and Sidi [4] analyze the system contents of the different classes, for a queue fed by a two-state Markov-modulated arrival process.…”

Section: Introductionmentioning

confidence: 99%

“…Kamoun [11] analyzes a priority queue with service interruptions. Finally, Walraevens et al [14,16] study the transient behavior and the output process resp. of a priority queue.…”

Section: Introductionmentioning

confidence: 99%

Performance Analysis of Priority Queueing Systems in Discrete Time

Walraevens

Fiems

Bruneel

2011

Network Performance Engineering

Self Cite

View full text Add to dashboard Cite

Abstract. The integration of different types of traffic in packet-based networks spawns the need for traffic differentiation. In this tutorial paper, we present some analytical techniques to tackle discrete-time queueing systems with priority scheduling. We investigate both preemptive (resume and repeat) and non-preemptive priority scheduling disciplines. Two classes of traffic are considered, high-priority and low-priority traffic, which both generate variable-length packets. A probability generating functions approach leads to performance measures such as moments of system contents and packet delays of both classes.

show abstract

Effect of global FCFS and relative load distribution in two-class queues with dedicated servers

et al. 2013

Self Cite

View full text Add to dashboard Cite

In this paper, we investigate multi-class multi-server queueing systems with global FCFS policy, i.e., where customers requiring different types of service -provided by distinct servers -are accommodated in one common FCFS queue. In such scenarios, customers of one class (i.e., requiring a given type of service) may be hindered by customers of other classes. The purpose of this paper is twofold: to gain (qualitative and quantitative) insight into the impact of (i) the global FCFS policy and (ii) the relative distribution of the load amongst the customer classes, on the system performance. We therefore develop and analyze an appropriate discrete-time queueing model with general independent arrivals, two (independent) customer classes and two class-specific servers. We study the stability of the system and derive the system-content distribution at random slot boundaries; we also obtain mean values of the system content and the customer delay, both globally and for each class individually. We then extensively compare these results with those obtained for an analogous system without global FCFS policy (i.e., with individual queues for the two servers). We demonstrate that global FCFS, as well as the relative distribution of the load over the two customer classes, may have a major impact on the system performance.

show abstract

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

Cited by 9 publications

References 26 publications

Using Singularity Analysis to Approximate Transient Characteristics in Queueing Systems

Using Singularity Analysis to Approximate Transient Characteristics in Queueing Systems

Performance Analysis of Priority Queueing Systems in Discrete Time

Effect of global FCFS and relative load distribution in two-class queues with dedicated servers

Contact Info

Product

Resources

About