A Single-Server Queue with Recurrent Input and Exponentially Distributed Service Times

Lajos Takács

14 citations0/0 files storedOperations Research

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

Combinatorial methods are given for the determination of the distribution of the queue size, the waiting time, the number of customers served in a busy period and the length of a busy period for a single-server queuing process with recurrent input and exponentially distributed service times.

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

References

1960Transient Behavior of Single-Server Queuing Processes with Recurrent Input and Exponentially Distributed Service Times 1962The Time Dependence of a Single-Server Queue with Poisson Input and General Service Times

Cited by

1980On the transient waiting times for a GI/M/1 priority queue 1995Lattice path counting andM/M/c queueing systems

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.