Linking priority queues and tree-like processes

Benny Van Houdt

doi:10.1016/j.aeue.2005.11.009

Linking priority queues and tree-like processes

2006-02-01

1

PRE

AI

DOI：10.1016/j.aeue.2005.11.009

Original

Original request for help

Save

Abstract

En 中文

This paper links the analysis of a general class of priority queues with three service classes with tree-like processes. This is realized by demonstrating that the operation of a 3-class priority queue can be mimicked by means of an alternate system that is composed of a single stack and queue. Some insights on how to reduce the evolution of this alternate system to a tree-like process are provided, allowing an efficient solution of the priority system through matrix analytic methods. (c) 2005 Elsevier GmbH. All rights reserved.

Keywords:

priority queues

tree-like processes

matrix analytic methods

Linking priority queues and tree-like processes

Abstract

Journal

Organization