DocumentCode
1885481
Title
Recursive computation of steady-state probabilities in priority queues
Author
Cidon, Israel ; Sidi, Moshe
Author_Institution
IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA
fYear
1989
fDate
23-27 Apr 1989
Firstpage
47
Abstract
Recursive formulas are derived for computing the state probabilities in priority queuing systems (preemptive and nonpreemptive). The derivation is based only on the general structure of the generating function involved, and thus is similar and more general than previous methods. Also discussed are the applications of the method to other queuing systems
Keywords
performance evaluation; queueing theory; nonpreemptive; performance evaluation; preemptive; priority queues; recursive computation; steady-state probabilities; Distributed computing; Probability distribution; Random variables; Steady-state;
fLanguage
English
Publisher
ieee
Conference_Titel
INFOCOM '89. Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies. Technology: Emerging or Converging, IEEE
Conference_Location
Ottawa, Ont.
Print_ISBN
0-8186-1920-1
Type
conf
DOI
10.1109/INFCOM.1989.101432
Filename
101432
Link To Document