A limit result respecting graph structure for a fully connected loss network with alternative routing

DOI10.1214/aoap/1177005876zbMath0733.60118OpenAlexW1986721832MaRDI QIDQ809493

P. J. Hunt, J.-P. Crametz

Publication date: 1991

Published in: The Annals of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1214/aoap/1177005876

zbMATH Keywords

random graphsfunctional law of large numbersloss networksexchangeable linkslink capacitiesrandom graph theory

Mathematics Subject Classification ID

Stochastic network models in operations research (90B15) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30)

Related Items

Fluctuations for a fully connected loss network with alternate routing ⋮ Metastability in loss networks with dynamic alternative routing ⋮ Long-term concentration of measure and cut-off ⋮ Propagation of chaos for a fully connected loss network with alternate routing ⋮ The Effect of Increasing Routing Choice on Resource Pooling ⋮ Least Busy Alternative Routing in Queueing and Loss Networks ⋮ Balanced routing of random calls