Markov random field models of multicasting in tree networks

Advances in Applied Probability

Volumn 34, Issue 1, 2002, Pages 58-84

  Ramanan, Kavita ^a   Sengupta, Anirvan ^a   Ziedins, Ilze ^a   Mitra, Partha ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

Bethe lattice; Blocking probabilities; Broadcasting; Cayley trees; Erlang fixed point approximations; Hard core models; Loss networks; Multicasting; Phase transitions; Reduced load approximations; Spin models; Statistical mechanics; Symmetry breaking; Unicasting

Indexed keywords

APPROXIMATION THEORY; BROADCASTING; MATHEMATICAL MODELS; MULTICASTING; PHASE TRANSITIONS; PROBABILITY; STATISTICAL MECHANICS; TELECOMMUNICATION NETWORKS; TREES (MATHEMATICS);

MARKOV RANDOM FIELD MODELS; SPIN MODELS;

MARKOV PROCESSES;

EID: 0036509110     PISSN: 00018678     EISSN: None     Source Type: Journal    
DOI: 10.1239/aap/1019160950     Document Type: Article

References (23)

1. Core based trees
2. Graph homomorphisms and phase transitions
3. Gibbs measures and dismantlable graphs
4. Insensitivity of blocking probabilities in a circuit-switched network
5. Bistability in communication networks
6. Blocking of dynamic multicast connections
7. Stochastic models of computer communication systems
8. Loss networks
9. Potts models and related problems in statistical mechanics
10. Reliable multicast transport protocol (RMTP)
11. Markov random fields on an infinite tree
12. Percolation and the hard-core lattice gas model
13. Countable state space Markov random fields and Markov chains on trees
14. Bounded, attractive and repulsive Markov specifications on trees and on the one-dimensional lattice
15. Loss networks and Markov random fields