Performance Analysis for a Two-Class Priority Queueing Model with General Decrementing Service

Tsuyoshi KATAYAMA

Performance Analysis for a Two-Class Priority Queueing Model with General Decrementing Service

Tsuyoshi KATAYAMA

Full Text Views

0

Cite this

Summary :

This paper investigates a two-class priority queue with decrementing service of a parameter (k₁=, k₂=k,1k) which operates as follows: Starting once a class-1 message service, a single server serves all messages in queue 1 until it becomes empty. After service completion in queue 1, the server switches over to queue 2 and continues serving messages in queue 2 until either queue 2 becomes empty, or the number of messages decreases to k less than that found upon the server's arrival at queue 2, whichever occurs first. It is assumed that arrival streams are Poissonian, message service times are generally distributed, and switch-over times are zero. We derive queue-length generating functions and LSTs of message waiting time distributions.

Publication: IEICE TRANSACTIONS on Communications Vol.E75-B No.12 pp.1301-1307

Publication Date: 1992/12/25

Publicized

Online ISSN

DOI

Type of Manuscript: Special Section PAPER (Special Issue on Teletraffic)

Category

Cite this

Copy

Tsuyoshi KATAYAMA, "Performance Analysis for a Two-Class Priority Queueing Model with General Decrementing Service" in IEICE TRANSACTIONS on Communications, vol. E75-B, no. 12, pp. 1301-1307, December 1992, doi: .
Abstract: This paper investigates a two-class priority queue with decrementing service of a parameter (k₁=, k₂=k,1k) which operates as follows: Starting once a class-1 message service, a single server serves all messages in queue 1 until it becomes empty. After service completion in queue 1, the server switches over to queue 2 and continues serving messages in queue 2 until either queue 2 becomes empty, or the number of messages decreases to k less than that found upon the server's arrival at queue 2, whichever occurs first. It is assumed that arrival streams are Poissonian, message service times are generally distributed, and switch-over times are zero. We derive queue-length generating functions and LSTs of message waiting time distributions.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e75-b_12_1301/_p

Copy

@ARTICLE{e75-b_12_1301,
author={Tsuyoshi KATAYAMA, },
journal={IEICE TRANSACTIONS on Communications},
title={Performance Analysis for a Two-Class Priority Queueing Model with General Decrementing Service},
year={1992},
volume={E75-B},
number={12},
pages={1301-1307},
abstract={This paper investigates a two-class priority queue with decrementing service of a parameter (k₁=, k₂=k,1k) which operates as follows: Starting once a class-1 message service, a single server serves all messages in queue 1 until it becomes empty. After service completion in queue 1, the server switches over to queue 2 and continues serving messages in queue 2 until either queue 2 becomes empty, or the number of messages decreases to k less than that found upon the server's arrival at queue 2, whichever occurs first. It is assumed that arrival streams are Poissonian, message service times are generally distributed, and switch-over times are zero. We derive queue-length generating functions and LSTs of message waiting time distributions.},
keywords={},
doi={},
ISSN={},
month={December},}

Copy

TY - JOUR
TI - Performance Analysis for a Two-Class Priority Queueing Model with General Decrementing Service
T2 - IEICE TRANSACTIONS on Communications
SP - 1301
EP - 1307
AU - Tsuyoshi KATAYAMA
PY - 1992
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E75-B
IS - 12
JA - IEICE TRANSACTIONS on Communications
Y1 - December 1992
AB - This paper investigates a two-class priority queue with decrementing service of a parameter (k₁=, k₂=k,1k) which operates as follows: Starting once a class-1 message service, a single server serves all messages in queue 1 until it becomes empty. After service completion in queue 1, the server switches over to queue 2 and continues serving messages in queue 2 until either queue 2 becomes empty, or the number of messages decreases to k less than that found upon the server's arrival at queue 2, whichever occurs first. It is assumed that arrival streams are Poissonian, message service times are generally distributed, and switch-over times are zero. We derive queue-length generating functions and LSTs of message waiting time distributions.
ER -