Distributed Random Access Algorithm: Scheduling and Congestion Control

DOI10.1109/TIT.2010.2081490MaRDI QIDQ5281174zbMATH OpenOpenAlexFDO

Authors Libin Jiang, Devavrat Shah, Jinwoo Shin, Jean Walrand

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

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) Queues and service in operations research (90B22) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Dynamic Distributed Scheduling in Random Access Networks
• Randomized scheduling algorithm for queueing networks
• A distributed DiffServ supporting scheduling algorithm
• Distributed algorithms for scheduling on line and tree networks
• Decentralized throughput scheduling
• Distributed Scheduling in Multiple Access With Bursty Arrivals Under a Maximum Delay Constraint
• scientific article; zbMATH DE number 3990833
• Distributed algorithms in synchronous broadcasting networks

Cited in

(16)

• A new distributed approximation algorithm for the maximum weight independent set problem
• Crossover times in bipartite networks with activity constraints and time-varying switching rates
• Transition time asymptotics of queue-based activation protocols in random-access networks
• Temporal starvation in multi-channel CSMA networks: an analytical framework
• Randomized scheduling algorithm for queueing networks
• Queue-based random-access algorithms: fluid limits and stability issues
• Dynamic Distributed Scheduling in 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
• Learning efficient Nash equilibria in distributed systems
• Delay performance in random-access networks
• Lingering issues in distributed scheduling
• Adding edge dynamics to bipartite random-access networks
• Distributed link scheduling in wireless networks
• Queues with random back-offs

This page was built for publication: Distributed Random Access Algorithm: Scheduling and Congestion Control

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