Retrial queueing systems: a computational approach

The application of auto-repeat facilities in telephone systems, as well as the use of random access protocols in computer networks, have led to growing interest in retrial queueing models. Since much of the theory of retrial queues is complex from an analytical viewpoint, with this book the authors give a comprehensive and updated text focusing on approximate techniques and algorithmic methods for solving the analytically intractable models. The book is intended for an audience ranging from advanced undergraduates to researchers interestednot only in queueing theory, but also in applied probability, stochastic models of the operations research, and engineering. Motivating examples and updates of existing literature are provided. Comprehensive coverage of techniques for the computational analysis of Retrial Queues, thereby providing a modern treatment for the study of an important branch of the Queueing Theory INDICE: Part I: An Introduction to Retrial Queueing Systems.- Introductionand Motivating Examples.- A GeneralOverview.- Part II: Computational Analysisof Performance Descriptors.- Limiting Distribution of the System State.- BusyPeriod.- Waiting Time.- Other Descriptors.- Part III: Retrial Queueing Systems Analyzed Through the Matrix-Analytic Formalism.- The Matrix-Analytic Formalism.- Selected Retrial Queues with QBD Structure.- Selected Retrial Queues withGI/M/1 and M/G/1 Structures.- References.- Index.

• ISBN: 978-3-540-78724-2
• Editorial: Springer
• Encuadernacion: Cartoné
• Páginas: 330
• Fecha Publicación: 01/06/2008
• Nº Volúmenes: 1
• Idioma: Inglés