The combinatorics of birth–death processes and applications to queues

The combinatorics of birth–death processes and applications to queues

0.00 Avg rating0 Votes
Article ID: iaor20002512
Country: United States
Volume: 26
Issue: 3/4
Start Page Number: 255
End Page Number: 267
Publication Date: Nov 1997
Journal: Queueing Systems
Authors: , ,
Keywords: M/M/c queues
Abstract:

In this paper we present a combinatorial technique which allows the derivation of the transition functions of general birth–death processes. This method provides a flexible tool for the transient analysis of Markovian queueing systems with state dependent transition rates, like M/M/c models or systems with balking and reneging.

Reviews

Required fields are marked *. Your email address will not be published.