Fluid limits for Queue-based CSMA with polynomial rates, homogenization and reflection

Publication date 12 November 2020

Interacting random processes; statistical mechanics type models; percolation theory (60K35) Queueing theory (aspects of probability theory) (60K25)

Abstract: We study in this paper a variation of the acclaimed CSMA random access protocol. We will focus on the case where back-off rates at each node is polynomial in the size of the queue. Under a condition relating the exponent in the polynomial rates and the geometry of the interference graph, we prove convergence of the scaled process to a deterministic fluid limit up to the time a queue reaches

0

on the fluid scale . We outline the difficulties arising at that time and solve them in the case of a complete interference graph. This paper relies on a new method to obtain a fully coupled stochastic averaging principle and can hopefully lead to more result in heavy load situations.

This page was built for publication: Fluid limits for Queue-based CSMA with polynomial rates, homogenization and reflection

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6353597)