Hostname: page-component-cb9f654ff-p5m67 Total loading time: 0 Render date: 2025-08-21T16:32:05.853Z Has data issue: false hasContentIssue false
  • English
  • Français

THRESHOLD POLICIES FOR A SINGLE-SERVER QUEUING NETWORK

Published online by Cambridge University Press:  07 February 2001

P. S. Ansell ,
K. D. Glazebrook  and
I. Mitrani
P. S. Ansell
Affiliation:
Department of Statistics, University of Newcastle upon Tyne, Newcastle upon Tyne NE1 7RU, United Kingdom, E-mail: p.s.ansell@newcastle.ac.uk
K. D. Glazebrook
Affiliation:
Department of Statistics, University of Newcastle upon Tyne, Newcastle upon Tyne NE1 7RU, United Kingdom, E-mail: kevin.glazebrook@newcastle.ac.uk
I. Mitrani
Affiliation:
Department of Computing Science, University of Newcastle upon Tyne, Newcastle upon Tyne NE1 7RU, United Kingdom, E-mail: isi.mitrani@newcastle.ac.uk
Get access Rights & Permissions [Opens in a new window]

Abstract

We consider a single-server queuing system with two job classes under service policies of threshold type. The server switches from type 1 to type 2 when either the former queue is empty or the latter reaches size T; it switches from type 2 to type 1 when the former queue size drops below T and the latter is not empty. The joint queue-length distribution is determined for preemptive and nonpreemptive implementations using both analytic techniques and the power series algorithm.

Information

Type
Research Article
Information
Probability in the Engineering and Informational Sciences , Volume 15 , Issue 1 , January 2001 , pp. 15 - 33
Copyright
© 2001 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable