Stochastic Processes in Queueing Theory

Alexandr Borovkov

ISBN 10: 1461298687 / ISBN 13: 9781461298687

Edité par Springer New York, Springer New York, 2011

A propos de cet article

Druck auf Anfrage Neuware - Printed after ordering - 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.

N° de réf. du vendeur 9781461298687

Détails bibliographiques

• Titre: Stochastic Processes in Queueing Theory
• Éditeur: Springer New York, Springer New York
• Date de parution: 2011
• Langue: anglais
• ISBN à 10 chiffres: 1461298687
• ISBN à 13 chiffres: 9781461298687
• Reliure: Taschenbuch
• État de l'article: Neu

A propos de ce titre

Synopsis

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.