Randomized Scheduling Algorithm for Queueing Networks

@article{Shah2009RandomizedSA,
  title={Randomized Scheduling Algorithm for Queueing Networks},
  author={Devavrat Shah and Jinwoo Shin},
  journal={CoRR},
  year={2009},
  volume={abs/0908.3670}
}
The MIT Faculty has made this article openly available. Please share how this access benefits you. Your story matters. There has recently been considerable interests in design of low-complexity, myopic, distributed and stable scheduling policies for constrained queueing network models that arise in the context of emerging communication networks. Here, we consider two representative models. One, a model for the collection of wireless nodes communicating through a shared medium, that represents… CONTINUE READING
Highly Cited
This paper has 89 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 60 extracted citations

From Glauber dynamics to Metropolis algorithm: Smaller delay in optimal CSMA

2012 IEEE International Symposium on Information Theory Proceedings • 2012
View 4 Excerpts
Highly Influenced

A High-Order Markov-Chain-Based Scheduling Algorithm for Low Delay in CSMA Networks

IEEE/ACM Transactions on Networking • 2014
View 4 Excerpts
Highly Influenced

A Decentralized Medium Access Protocol for Real-Time Wireless Ad Hoc Networks With Unreliable Transmissions

2018 IEEE 38th International Conference on Distributed Computing Systems (ICDCS) • 2018
View 1 Excerpt

Scheduler Accelerator for TDMA Data Centers

2018 26th Euromicro International Conference on Parallel, Distributed and Network-based Processing (PDP) • 2018

90 Citations

051015'10'12'14'16'18
Citations per Year
Semantic Scholar estimates that this publication has 90 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 31 references

A lower bound for the smallest eigenvalue of the laplacian

J. Cheeger
Problems in analysis • 1969
View 4 Excerpts
Highly Influenced

Loss networks

F. P. Kelly
The annals of applied probability, 1(3):319–378 • 1991
View 3 Excerpts
Highly Influenced

The teleology of scheduling algorithms for switched networks under light load, critical load, and overload

D. Shah, D. J. Wischik
2007
View 2 Excerpts

Mathematical aspects of mixing times in markov chains

R. Montenegro, P. Tetali
Found. Trends Theor. Comput. Sci., 1(3):237–354 • 2006
View 1 Excerpt

Optimal Scheduling Algorithms for Input-Queued Switches

Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications • 2006
View 3 Excerpts

Similar Papers

Loading similar papers…