Retrial Queueing Systems: A Computational Approach
The application of auto-repeat facilities in telephone systems, as well as the use of random access prools 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.

Retrial Queueing Systems: A Computational Approach also



• Presents motivating examples in telephone and computer networks.
• Establishes a comparative analysis of the retrial queues versus standard queues with waiting lines and queues with losses.
• Integrates a wide range of techniques applied to the main M/G/1 and M/M/c retrial queues, and variants with general retrial times, finite population and the discrete-time case.
• Surveys basic results of the matrix-analytic formalism and emphasizes the related tools employed in retrial queues.
• Discusses a few selected retrial queues with QBD, GI/M/1 and M/G/1 structures.
• Features an abundance of numerical examples, and updates the existing literature.

The book is intended for an audience ranging from advanced undergraduates to researchers interested not only in queueing theory, but also in applied probability, shastic models of the operations research, and engineering. The prerequisite is a graduate course in shastic processes, and a positive attitude to the algorithmic probability.

1101510620
Retrial Queueing Systems: A Computational Approach
The application of auto-repeat facilities in telephone systems, as well as the use of random access prools 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.

Retrial Queueing Systems: A Computational Approach also



• Presents motivating examples in telephone and computer networks.
• Establishes a comparative analysis of the retrial queues versus standard queues with waiting lines and queues with losses.
• Integrates a wide range of techniques applied to the main M/G/1 and M/M/c retrial queues, and variants with general retrial times, finite population and the discrete-time case.
• Surveys basic results of the matrix-analytic formalism and emphasizes the related tools employed in retrial queues.
• Discusses a few selected retrial queues with QBD, GI/M/1 and M/G/1 structures.
• Features an abundance of numerical examples, and updates the existing literature.

The book is intended for an audience ranging from advanced undergraduates to researchers interested not only in queueing theory, but also in applied probability, shastic models of the operations research, and engineering. The prerequisite is a graduate course in shastic processes, and a positive attitude to the algorithmic probability.

109.99 In Stock
Retrial Queueing Systems: A Computational Approach

Retrial Queueing Systems: A Computational Approach

Retrial Queueing Systems: A Computational Approach

Retrial Queueing Systems: A Computational Approach

Hardcover(2008)

$109.99 
  • SHIP THIS ITEM
    In stock. Ships in 1-2 days.
  • PICK UP IN STORE

    Your local store may have stock of this item.

Related collections and offers


Overview

The application of auto-repeat facilities in telephone systems, as well as the use of random access prools 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.

Retrial Queueing Systems: A Computational Approach also



• Presents motivating examples in telephone and computer networks.
• Establishes a comparative analysis of the retrial queues versus standard queues with waiting lines and queues with losses.
• Integrates a wide range of techniques applied to the main M/G/1 and M/M/c retrial queues, and variants with general retrial times, finite population and the discrete-time case.
• Surveys basic results of the matrix-analytic formalism and emphasizes the related tools employed in retrial queues.
• Discusses a few selected retrial queues with QBD, GI/M/1 and M/G/1 structures.
• Features an abundance of numerical examples, and updates the existing literature.

The book is intended for an audience ranging from advanced undergraduates to researchers interested not only in queueing theory, but also in applied probability, shastic models of the operations research, and engineering. The prerequisite is a graduate course in shastic processes, and a positive attitude to the algorithmic probability.


Product Details

ISBN-13: 9783540787242
Publisher: Springer Berlin Heidelberg
Publication date: 05/23/2008
Edition description: 2008
Pages: 318
Product dimensions: 6.40(w) x 9.30(h) x 1.00(d)

Table of Contents

An Introduction to Retrial Queueing Systems.- and Motivating Examples.- A General Overview.- Computational Analysis of Performance Descriptors.- Limiting Distribution of the System State.- Busy Period.- Waiting Time.- Other Descriptors.- Retrial Queueing Systems Analyzed Through the Matrix-Analytic Formalism.- The Matrix-Analytic Formalism.- Selected Retrial Queues with QBD Structure.- Selected Retrial Queues with GI/M/1 and M/G/1 Structures.
From the B&N Reads Blog

Customer Reviews