Hostname: page-component-cd9895bd7-dk4vv Total loading time: 0 Render date: 2024-12-28T05:25:53.764Z Has data issue: false hasContentIssue false
  • English
  • Français

Overload performance comparisons of several processor queueing disciplines

Published online by Cambridge University Press:  01 July 2016

B. T. Dishi  and
H. Heffes
B. T. Dishi
Affiliation:
Bell Laboratories, Holmdel
H. Heffes
Affiliation:
Bell Laboratories, Holmdel
Get access Rights & Permissions [Opens in a new window]

Extract

We analyze and compare the performance, under overload, of a class of queueing and service disciplines for an M/M/l queue. The disciplines we study are (i) FIFO with finite buffer (M/M/1/N), (ii) FIFO with push out (M/M/1/N-PO), (iii) LIFO with push out, (iv) FIFO with time out (M/M1-TO) and (v) LIFO with time out. For each of these disciplines we obtain the performance measures such as the throughput, the moments and the distribution of the waiting time of the customers who get served and numerically compare the disciplines with respect to these measures.

Type
Applied Probability in Biology and Engineering. An ORSA/TIMS Special Interest Meeting
Information
Advances in Applied Probability , Volume 16 , Issue 1 , March 1984 , pp. 10
Copyright
Copyright © Applied Probability Trust 1984 

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.)