A Finite Source Retrial Queue: Number of Retrials

Velika I. Dragieva

20 citations0/0 files storedCommunication in Statistics- Theory and Methods

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 Risk Models Age of Information Optimization

Abstract

We consider a single-server queuing system with a finite number of sources, where customers are not allowed to queue; instead of that, they make repeated attempts, or retrials, in order to enter service after some time. This queuing system and its variants are widely used to model disk memory systems, star-like local area networks, and other communication systems. The article extends previous works on this topic and deals with the number of retrials, produced by a tagged customer, until he finds the server available. An algorithm for determination of all moments of this number is obtained, and the results of numerical experiments are presented.

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 — 20 citations exist upstream.

References

1997Retrial Queues 2008Retrial Queueing Systems 2008Retrial Queueing Systems: A Computational Approach 1968A Service System with Unfilled Requests Repeated 1998A finite source retrial queue 2005Homogeneous finite-source retrial queues with server subject to breakdowns and repairs 1995A single-server retrial queue with server vacations and a finite number of input sources 1984ALGORITHMIC METHODS FOR SINGLE SERVER SYSTEMS WITH REPEATED ATTEMPTS

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.