.png){kind=icon}
.png){kind=icon}
Return
A modified HOL priority scheduling discipline: Performance analysis
.png){kind=icon}
OA
AI
DOI：10.1016/j.ejor.2006.05.004.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, we introduce and analyze a modified HOL (head-of-the-line) priority scheduling discipline. The modification is incorporated to cope with the so-called starvation problem of regular HOL priority queues. We consider a discrete-time single-server queueing system with two priority queues of infinite capacity and with the introduced priority scheme. We show that the use of probability generating functions is suitable for analyzing the system contents and the packet delay. Some performance measures (such as means and variances) of these stochastic quantities will be derived. Furthermore, approximate expressions of the tail probabilities are obtained from the probability generating functions, by means of the dominant-singularity method. These expressions, together with their characteristics, constitute one of the main contributions of this paper. Finally, the impact and significance of the m-HOL (modified HOL) priority scheduling on these performance measures is illustrated by some numerical examples. (c) 2006 Elsevier B.V. All rights reserved.
Keywords:
queueing
discrete-time
dynamic priority scheduling
performance analysis
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W
Organization
No organization information available