
Gifting Made Simple
Give the Gift of ChoiceClick below to purchase a Bramalea City Centre eGift Card that can be used at participating retailers at Bramalea City Centre.Purchase HereHome
Stochastic Processes in Queueing Theory
Coles
Loading Inventory...
Stochastic Processes in Queueing Theory in Brampton, ON
By None
Current price: $71.50

Coles
Stochastic Processes in Queueing Theory in Brampton, ON
By None
Current price: $71.50
Loading Inventory...
Size: Paperback
*Product information and pricing may vary - to confirm current pricing, availability, shipping, and return information please contact Coles. In the event of a pricing discrepancy, the retailer's price will apply.
The object of queueing theory (or the theory of mass service) is the investigation of stochastic processes of a special form which are called queueing (or service) processes in this book. Two approaches to the definition of these processes are possible depending on the direction of investigation. In accordance with this fact, the exposition of the subject can be broken up into two self-contained parts. The first of these forms the content of this monograph. . The definition of the queueing processes (systems) to be used here is dose to the traditional one and is connected with the introduction of so-called governing random sequences. We will introduce algorithms which describe the governing of a system with the aid of such sequences. Such a definition inevitably becomes rather qualitative since under these conditions a completely formal construction of a stochastic process uniquely describing the evolution of the system would require introduction of a complicated phase space not to mention the difficulties of giving the distribution of such a process on this phase space.
The object of queueing theory (or the theory of mass service) is the investigation of stochastic processes of a special form which are called queueing (or service) processes in this book. Two approaches to the definition of these processes are possible depending on the direction of investigation. In accordance with this fact, the exposition of the subject can be broken up into two self-contained parts. The first of these forms the content of this monograph. . The definition of the queueing processes (systems) to be used here is dose to the traditional one and is connected with the introduction of so-called governing random sequences. We will introduce algorithms which describe the governing of a system with the aid of such sequences. Such a definition inevitably becomes rather qualitative since under these conditions a completely formal construction of a stochastic process uniquely describing the evolution of the system would require introduction of a complicated phase space not to mention the difficulties of giving the distribution of such a process on this phase space.





















