Analysis of the discrete-time SMP/D/1/s finite buffer queue with applications in ATM

Unknown author

15 citations0/0 files storedIEEE Conference on Computer Communications (INFOCOM)

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 Network Traffic and Congestion Control Age of Information Optimization

Abstract

An exact analysis of the discrete-time single-server SMP/D/1/s queue with an arbitrary semi-Markov input process and a buffer size s is presented. The SSMP/D/1/s queue and the DMAP/D/1/s queue re covered in this model. The analysis yields easy expressions for the queue length density at arrivals (loss probability) and the waiting time density. This queuing system is suitable for modeling correlated input streams of asynchronous transfer mode (ATM) networks involving batches. Calculations show the influence of correlation on both loss probability and waiting time.>

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

References

1991New results on the single server queue with a batch markovian arrival process 1990A single-server queue with server vacations and a class of non-renewal arrival processes 1992Statistical multiplexing of VBR sources: A matrix-analytic approach 1990On the Geo/D/1 and Geo/D/1/n queues 2003Analysis of a discrete-time G/sup (X)//D/1-S queueing system with applications in packet-switching 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.