Markov random field models of multicasting in tree networks
- 1 March 2002
- journal article
- Published by Cambridge University Press (CUP) in Advances in Applied Probability
- Vol. 34 (1) , 58-84
- https://doi.org/10.1239/aap/1019160950
Abstract
In this paper, we analyse a model of a regular tree loss network that supports two types of calls: unicast calls that require unit capacity on a single link, and multicast calls that require unit capacity on every link emanating from a node. We study the behaviour of the distribution of calls in the core of a large network that has uniform unicast and multicast arrival rates. At sufficiently high multicast call arrival rates the network exhibits a ‘phase transition’, leading to unfairness due to spatial variation in the multicast blocking probabilities. We study the dependence of the phase transition on unicast arrival rates, the coordination number of the network, and the parity of the capacity of edges in the network. Numerical results suggest that the nature of phase transitions is qualitatively different when there are odd and even capacities on the links. These phenomena are seen to persist even with the introduction of nonuniform arrival rates and multihop multicast calls into the network. Finally, we also show the inadequacy of approximations such as the Erlang fixed-point approximations when multicasting is present.Keywords
This publication has 15 references indexed in Scilit:
- Blocking of Dynamic Multicast ConnectionsTelecommunication Systems, 2001
- Gibbs Measures and Dismantlable GraphsJournal of Combinatorial Theory, Series B, 2000
- Loss networks and Markov random fieldsJournal of Applied Probability, 1999
- Reliable multicast transport protocol (RMTP)IEEE Journal on Selected Areas in Communications, 1997
- Loss NetworksThe Annals of Applied Probability, 1991
- Gibbs Measures and Phase TransitionsPublished by Walter de Gruyter GmbH ,1988
- Bounded, attractive and repulsive Markov specifications on trees and on the one-dimensional latticeStochastic Processes and their Applications, 1985
- Insensitivity of blocking probabilities in a circuit-switching networkJournal of Applied Probability, 1984
- Countable State Space Markov Random Fields and Markov Chains on TreesThe Annals of Probability, 1983
- Markov Random Fields on an Infinite TreeThe Annals of Probability, 1975