Insensitivity with age-dependent routing

Michael P. Rumsewicz · W. Henderson

14 citations0/0 files storedAdvances in Applied Probability

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 Age of Information Optimization

Abstract

The theory of insensitivity is extended to include processes where some of the routing probabilities of the process are made dependent upon the length of time the generally distributed variables have been alive. Examples of such systems are given, including networks of queues with age-dependent routing.

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

1975Open, Closed, and Mixed Networks of Queues with Different Classes of Customers 1973Computational algorithms for closed queueing networks with exponential servers 1976Networks of queues 1975Networks of queues with customers of different types 1977Product Form and Local Balance in Queueing Networks 1983A Characterization of Product-Form Queuing Networks 1980The G/M/r machine interference model 1980Insensitivity and Steady-state Probabilities in Product Form for Queueing Networks.

Cited by

1989Insensitivity of processes with interruptions

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.