Distributed Random Access Algorithm: Scheduling and Congestion Control

DOI10.1109/TIT.2010.2081490zbMath1366.90079OpenAlexW2120078542MaRDI QIDQ5281174

Devavrat Shah, Jinwoo Shin, Jean Walrand, Libin Jiang

Publication date: 27 July 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.2010.2081490

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Queues and service in operations research (90B22) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items

Adding edge dynamics to bipartite random-access networks ⋮ Towards a queueing-based framework for in-network function computation ⋮ Performance of CSMA in multi-channel wireless networks ⋮ Stability and delay of distributed scheduling algorithms for networks of conflicting queues ⋮ Randomized scheduling algorithm for queueing networks ⋮ Learning efficient Nash equilibria in distributed systems ⋮ Delay performance in random-access networks ⋮ Lingering issues in distributed scheduling ⋮ Transition time asymptotics of queue-based activation protocols in random-access networks ⋮ A new distributed approximation algorithm for the maximum weight independent set problem ⋮ Queue-Based Random-Access Algorithms: Fluid Limits and Stability Issues ⋮ Queues with random back-offs ⋮ Temporal starvation in multi-channel CSMA networks: an analytical framework ⋮ Distributed link scheduling in wireless networks ⋮ Crossover times in bipartite networks with activity constraints and time-varying switching rates