Ergodicity of one-dimensional resource sharing systems.

DOI10.1016/S0304-4149(01)00138-7zbMath1058.60083OpenAlexW2004888312MaRDI QIDQ1766051

Gerardo Sanz, F. Javier López, Enrique Daniel Andjel

Publication date: 25 February 2005

Published in: Stochastic Processes and their Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-4149(01)00138-7

zbMATH Keywords

relative entropyergodicitycouplingloss networksresource sharing systems

Mathematics Subject Classification ID

Stochastic network models in operations research (90B15) Interacting random processes; statistical mechanics type models; percolation theory (60K35)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• One-dimensional circuit-switched networks
• The philosophers' process: An ergodic reversible nearest particle system
• Resource allocation under limited sharing
• Uniform and \(L^ 2\) convergence in one dimensional stochastic Ising models
• Loss networks
• Contact interactions on a lattice
• Performance analysis of constrained resource sharing system
• Fluctuations for a fully connected loss network with alternate routing
• Large loss networks
• A coupling of infinite particle systems
• Free energy in a Markovian model of a lattice spin system
• Invariance in resource-sharing systems
• Stability of a Queueing System with Concurrent Service and Locking
• The Fair Resource Allocation Problem with Submodular Constraints
• One-dimensional loss networks and conditioned M/G/∞ queues

This page was built for publication: Ergodicity of one-dimensional resource sharing systems.