2003Unpublished venueRequires access

Algorithmic Analysis of Queueing Models

Henk Tijms

Open publisher page 0 citations

Abstract

This chapter contains sections titled: Introduction Basic Concepts The M/G/1 Queue The MX/G/1 Queue M/G/1 Queues with Bounded Waiting Times The GI/G/1 Queue Multi-server Queues with Poisson Input The GI/G/c Queue Finite-capacity Queues Exercises Bibliographic Notes References

About this research paper

What this paper is about

This chapter contains sections titled: Introduction Basic Concepts The M/G/1 Queue The MX/G/1 Queue M/G/1 Queues with Bounded Waiting Times The GI/G/1 Queue Multi-server Queues with Poisson Input The GI/G/c Queue Finite-capacity Queues Exercises Bibliographic Notes References

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

This chapter contains sections titled: Introduction Basic Concepts The M/G/1 Queue The MX/G/1 Queue M/G/1 Queues with Bounded Waiting Times The GI/G/1 Queue Multi-server Queues with Poisson Input The GI/G/c Queue Finite-capacity Queues Exercises Bibliographic Notes References

Key concepts: Burke's theorem, Queue, Bulk queue, Fork–join queue, Queueing theory, Computer science, Bounded function, Queue management system

Related papers

Back to paper searchBrowse research topicsOriginal source
Algorithmic Analysis of Queueing Models — Research Paper | ScholarLens