Markov random field models of multicasting in tree networks

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.

[1]  Paul Martin,et al.  POTTS MODELS AND RELATED PROBLEMS IN STATISTICAL MECHANICS , 1991 .

[2]  Frank Kelly,et al.  Stochastic Models of Computer Communication Systems , 1985 .

[3]  A. Manning.  AN INTRODUCTION TO CHAOTIC DYNAMICAL SYSTEMS , 1988 .

[4]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[5]  Hans-Otto Georgii,et al.  Gibbs Measures and Phase Transitions , 1988 .

[6]  Elena Yudovina,et al.  Stochastic networks , 1995, Physics Subject Headings (PhySH).

[7]  Peter Winkler,et al.  Gibbs Measures and Dismantlable Graphs , 2000, J. Comb. Theory, Ser. B.

[8]  Tony Ballardie,et al.  Core based trees , 1993 .

[9]  Keith W. Ross,et al.  Multiservice Loss Models for Broadband Telecommunication Networks , 1997 .

[10]  R. Baxter.  Exactly solved models in statistical mechanics , 1982 .

[11]  J. Berg,et al.  Percolation and the hard-core lattice gas model , 1994 .

[12]  Graham R. Brightwell,et al.  Graph Homomorphisms and Phase Transitions , 1999, J. Comb. Theory, Ser. B.

[13]  Jorma T. Virtamo,et al.  Blocking of Dynamic Multicast Connections , 2001, Telecommun. Syst..

[14]  F. Spitzer.  Markov Random Fields on an Infinite Tree , 1975 .

[15]  Stan Zachary,et al.  Loss networks and Markov random fields , 1999 .

[16]  Dah Ming Chiu,et al.  TRAM: A Tree-based Reliable Multicast Protocol , 1998 .

[17]  M. Bernhard.  Introduction to Chaotic Dynamical Systems , 1992 .

[18]  F. Browder.  Nonlinear functional analysis and its applications , 1986 .

[19]  Stan Zachary,et al.  Bounded, attractive and repulsive Markov specifications on trees and on the one-dimensional lattice , 1985 .

[20]  Stan Zachary,et al.  Markov random fields and Markov chains on trees , 1983 .

[21]  J. Lehoczky,et al.  Insensitivity of blocking probabilities in a circuit-switching network , 1984 .

[22]  S. Zachary,et al.  Loss networks , 2009, 0903.0640.