Hostname: page-component-7bb8b95d7b-dtkg6 Total loading time: 0 Render date: 2024-09-11T18:16:58.772Z Has data issue: false hasContentIssue false
  • English
  • Français

A note on the processor-sharing queue in a quasi-reversible network

Published online by Cambridge University Press:  01 July 2016

Pantelis Tsoucas  and
Jean Walrand
Pantelis Tsoucas*
Affiliation:
University of California, Berkeley
Jean Walrand*
Affiliation:
University of California, Berkeley
*
∗Postal address for both authors: Department of Electrical Engineering and Computer Sciences and the Electronics Research Laboratory, University of California, Berkeley, CA 94720, U.S.A.
∗Postal address for both authors: Department of Electrical Engineering and Computer Sciences and the Electronics Research Laboratory, University of California, Berkeley, CA 94720, U.S.A.
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.

Consider a processor-sharing queue placed in a quasi-reversible network in equilibrium. This note explains why the expected sojourn time of a customer in such a queue is proportional to his service time.

Type
Letters to the Editor
Information
Advances in Applied Probability , Volume 15 , Issue 2 , June 1983 , pp. 468 - 469
Copyright
Copyright © Applied Probability Trust 1983 

References

[1] Kelly, F. P. (1979) Reversibility and Stochastic Networks. Wiley, London.Google Scholar
[2] Mitra, D. (1981) Waiting time distributions from closed queueing network models of shared-processor systems. In Performance 81, ed. Kylstra, S. J.. North-Holland, Amsterdam.Google Scholar