ALGORITHMIC METHODS FOR SINGLE SERVER SYSTEMS WITH REPEATED ATTEMPTS

A.G. de Kok

41 citations0/0 files storedStatistica Neerlandica

No readable copy stored yet — this record is metadata only.

No open-access location is known for this record yet.

Literature note Cite in a project Citation map

Advanced Queuing Theory Analysis Probability and Statistical Research Probability and Risk Models

Abstract

Abstract In many practical situations customers applying for service and finding the server busy will not join a queue, but make a new attempt to enter service after some time. In this paper we study single server systems with repeated attempts both for infinite‐source input and finite‐source input where the service times are general and the reattempt times are exponential. Numerically stable recursion schemes are derived by which the time‐average and customer‐average steady‐state probabilities can be effectively computed.

Paper brief

Loading…

Cite this work

Citation unavailable for this work.

BibTeX RIS CSL-JSON

No public copy is stored for this record, so only the metadata is cited.

Citations in this library

Citation map →

Stored only when both papers are in the corpus — 41 citations exist upstream.

References

1982Poisson Arrivals See Time Averages 1979New results in the theory of repeated orders queueing systems

Cited by

1986Single-line repeated orders queueing systems1 1999On a single server queue with negative arrivals and request repeated 1997The quasi-random input queueing system with repeated attempts as a model for a collision-avoidance star local area network 2014NUMBER OF RETRIALS IN A FINITE SOURCE RETRIAL QUEUE WITH UNRELIABLE SERVER 2007Tail Asymptotics for the Queue Size Distribution in an M/G/1 Retrial Queue 1999A multiserver retrial queue with a finite number of sources of primary calls 2002Analysis of a single-server retrial queue with quasi-random input and nonpreemptive priority 1995Matrix analytical methods for M/PH/1 Retrial queues

Explore the map →

Papers that cite the same references — the relational fallback while embeddings are still backfilling.

Imported from OpenAlex (CC0) — nothing here is generated.