Computing Loss Probabilities in Discrete-Time Queues

Frank N. Gouweleeuw · Henk C. Tijms

17 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

Discrete-time queueing systems are frequently encountered in telecommunication networks. These systems usually involve finite buffers. The purpose of this paper is to present a generally applicable method to compute the loss probability in discrete-time finite-buffer queues by using only the state probabilities in the corresponding infinite-buffer queue.

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

References

1993Discrete-Time Models for Communication Systems Including ATM 1991Switched bath Bernoulli process (SBBP) and the discrete-time SBBP/G/1 queue with application to statistical multiplexer performance 1990Analysis of a discrete-time single-server queue with bursty inputs for traffic control in ATM networks 1992Queueing theory for telecommunications 1995Stochastic Models: An Algorithmic Approach.1989Blocking Probability for M/G/1 Vacation Systems with Occupancy Level Dependent Schedules

Cited by

2012A two-class discrete-time queueing model with two dedicated servers and global FCFS service discipline

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.