Hostname: page-component-6bf8c574d5-2jptb Total loading time: 0 Render date: 2025-02-23T11:10:32.535Z 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
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

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.

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