Distributed Random Access Algorithm: Scheduling and Congestion Control
DOI10.1109/TIT.2010.2081490zbMATH Open1366.90079OpenAlexW2120078542MaRDI QIDQ5281174FDOQ5281174
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
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
Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Queues and service in operations research (90B22) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cited In (16)
- Randomized scheduling algorithm for queueing networks
- Crossover times in bipartite networks with activity constraints and time-varying switching rates
- Queue-based random-access algorithms: fluid limits and stability issues
- Learning efficient Nash equilibria in distributed systems
- Dynamic Distributed Scheduling in Random Access Networks
- Delay performance in random-access networks
- Lingering issues in distributed scheduling
- Transition time asymptotics of queue-based activation protocols in random-access networks
- Queues with random back-offs
- Towards a queueing-based framework for in-network function computation
- Distributed link scheduling in wireless networks
- Adding edge dynamics to bipartite random-access networks
- Performance of CSMA in multi-channel wireless networks
- Stability and delay of distributed scheduling algorithms for networks of conflicting queues
- A new distributed approximation algorithm for the maximum weight independent set problem
- Temporal starvation in multi-channel CSMA networks: an analytical framework
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)
