Slow Transitions and Starvation in Dense Random-Access Networks

We consider dense wireless random-access networks, modeled as systems of particles with hardcore interaction. The particles represent the network users that try to become active after an exponential back-off time, and stay active for an exponential transmission time. Due to wireless interference, active users prevent other nearby users from simultaneous activity, which we describe as hardcore interaction on a conflict graph. We show that dense networks with aggressive back-off schemes lead to extremely slow transitions between dominant states, and inevitably cause long mixing times and starvation effects.

[1]  Sem C. Borst,et al.  Delay performance in random-access grid networks , 2013, Perform. Evaluation.

[2]  V. Climenhaga Markov chains and mixing times , 2013 .

[3]  Ezhan Karasan,et al.  Effect of network density and size on the short-term fairness performance of CSMA systems , 2012, EURASIP J. Wirel. Commun. Netw..

[4]  Sem C. Borst,et al.  Mixing properties of CSMA networks on partite graphs , 2012, 6th International ICST Conference on Performance Evaluation Methodologies and Tools.

[5]  Alexandru Isar,et al.  Simulating the WiMAX Physical Layer in Rayleigh Fading Channel , 2012 .

[6]  Sem C. Borst,et al.  Achieving target throughputs in random-access networks , 2011, Perform. Evaluation.

[7]  J. Walrand,et al.  A Distributed CSMA Algorithm for Throughput and Utility Maximization in Wireless Networks , 2010, IEEE/ACM Transactions on Networking.

[8]  Yves Dallery,et al.  Moments of first passage times in general birth–death processes , 2008, Math. Methods Oper. Res..

[9]  Raúl Gouet,et al.  Blocking and Dimer Processes on the Cayley Tree , 2008 .

[10]  Rudolf Grübel,et al.  Rarity and exponentiality: an extension of Keilson's theorem, with applications , 2005, Journal of Applied Probability.

[11]  Yuri M. Suhov,et al.  A Hard-Core Model on a Cayley Tree: An Example of a Loss Network , 2004, Queueing Syst. Theory Appl..

[12]  V. Stefanov,et al.  A note on integrals for birth-death processes. , 2000, Mathematical biosciences.

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

[14]  Olle Häggström Ergodicity of the hard-core model onZ2 with parity-dependent activities , 1997 .

[15]  David Aldous,et al.  Inequalities for rare events in time-reversible Markov chains II , 1993 .

[16]  By DAVID J. ALDOUS,et al.  INEQUALITIES FOR RARE EVENTS IN TIME-REVERSIBLE MARKOV CHAINS I , 1992 .

[17]  A. Sokal,et al.  Bounds on the ² spectrum for Markov chains and Markov processes: a generalization of Cheeger’s inequality , 1988 .

[18]  Basil S. Maglaris,et al.  Throughput Analysis in Multihop CSMA Packet Radio Networks , 1987, IEEE Trans. Commun..

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

[20]  AARON KERSHENBAUM,et al.  An Algorithm for Evaluation of Throughput in Multihop Packet Radio Networks with Complex Topologies , 1987, IEEE J. Sel. Areas Commun..

[21]  D. Aldous Markov chains with almost exponential hitting times , 1982 .

[22]  Anthony Unwin,et al.  Reversibility and Stochastic Networks , 1980 .

[23]  J. Keilson Markov Chain Models--Rarity And Exponentiality , 1979 .

[24]  Julian Keilson Log-concavity and log-convexity in passage time densities of diffusion and birth-death processes , 1971 .

[25]  Julian Keilson,et al.  A Limit Theorem for Passage Times in Ergodic Regenerative Processes , 1966 .

[26]  J. Keilson A review of transient behavior in regular diffusion and birth-death processes. Part II , 1965, Journal of Applied Probability.

[27]  J. Keilson A review of transient behavior in regular diffusion and birth-death processes , 1964, Journal of Applied Probability.

[28]  Samuel Karlin,et al.  COINCIDENT PROPERTIES OF BIRTH AND DEATH PROCESSES , 1959 .

[29]  G. Reuter,et al.  Spectral theory for the differential equations of simple birth and death processes , 1954, Philosophical Transactions of the Royal Society of London. Series A, Mathematical and Physical Sciences.