Workgreen2006

Insensitive queueing models for communication networks

32 citations0/0 files storedInternational ICST Conference on Performance Evaluation Methodologies and Tools (VALUETOOLS)

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

A rich class of communication networks can be represented as queueing networks with state-dependent arrival rates and service rates. We provide necessary and sufficient conditions for such queueing networks to be insensitive in the sense that the steady-state distribution depends on the service time distribution at each queue through the mean only. This insensitivity property is key to the development of simple engineering rules that do not require the knowledge of fine traffic statistics.

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

References

1975Open, Closed, and Mixed Networks of Queues with Different Classes of Customers 1957Networks of Waiting Lines 1981Blocking in a Shared Resource Environment 1991Product-form queueing networks with negative and positive customers 1999Introduction to Stochastic Networks 2002Insensitivity in processor-sharing networks 1991Product forms for queueing networks with state-dependent multiple job transitions 1965Analysis of Mixtures of Wide- and Narrow-Band Traffic

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.