Stochastic Models of Computer Communication Systems

Frank P. Kelly

355 citations0/0 files storedJournal of the Royal Statistical Society Series B (Statistical Methodology)

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 Wireless Networks and Protocols

Abstract

SUMMARY This paper describes some examples of the stochastic models found useful in the design and analysis of advanced computer and communication systems. Our major theme might be termed the control of contention. As illustrations of this theme we discuss concurrency control procedures for databases, dynamic channel assignment for cellular radio, and random access schemes for the control of a broadcast channel. We emphasize asymptotic properties of product-form distributions and we present some new results on the stability of acknowledgement based random access schemes.

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

References

1986Blocking probabilities in large circuit-switched networks 2010Analysis and Synthesis of Computer Systems 1982Hitting-time and occupation-time bounds implied by drift analysis with applications

Cited by

1990Optimal Control and Trunk Reservation in Loss Networks 1995An algorithm to compute blocking probabilities in multi-rate multi-class multi-resource loss models 2000Allocation of interdependent resources for maximal throughput 2019Economies-of-Scale in Many-Server Queueing Systems: Tutorial and Partial Review of the QED Halfin--Whitt Heavy-Traffic Regime 1989Limit theorems for loss networks with diverse routing 2002Markov random field models of multicasting in tree networks 1999Loss networks and Markov random fields 2009Network adiabatic theorem

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.