Tandem queueing networks with neighbor blocking and back‐offs

We introduce a novel class of tandem queueing networks which arise in modeling the congestion behavior of wireless multi‐hop networks with distributed medium access control. These models provide valuable insight in how the network performance in terms of throughput depends on the back‐off mechanism that governs the competition among neighboring nodes for access to the medium. The models fall at the interface between classical queueing networks and interacting particle systems, and give rise to high‐dimensional stochastic processes that challenge existing methodologies. We present various open problems and conjectures, which are supported by partial results for special cases and limit regimes as well as simulation experiments.