Loss networks and Markov random fields

Stan Zachary · Ilze Ziediņš

31 citations0/0 files storedJournal of 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 Stochastic processes and statistical mechanics

Abstract

This paper examines the connection between loss networks without controls and Markov random field theory. The approach taken yields insight into the structure and computation of network equilibrium distributions, and into the nature of spatial dependence in networks. In addition, it provides further insight into some commonly used approximations, enables the development of more refined approximations, and permits the derivation of some asymptotically exact results.

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

References

1973Computational algorithms for closed queueing networks with exponential servers 1991Loss Networks 1986Blocking probabilities in large circuit-switched networks 1985Stochastic Models of Computer Communication Systems 1996Stochastic Networks Theory and Applications 1985Blocking When Service Is Required From Several Facilities Simultaneously 1984Insensitivity of blocking probabilities in a circuit-switching network 1995An algorithm to compute blocking probabilities in multi-rate multi-class multi-resource loss models

Cited by

2014Collaboration and Multitasking in Networks: Architectures, Bottlenecks, and Capacity

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.