On the queue-overflow probabilities of a class of distributed scheduling algorithms

Can Zhao, Xiaojun Lin. On the queue-overflow probabilities of a class of distributed scheduling algorithms. Computer Networks, 55(1):343-355, 2011. [doi]

@article{ZhaoL11-3,
  title = {On the queue-overflow probabilities of a class of distributed scheduling algorithms},
  author = {Can Zhao and Xiaojun Lin},
  year = {2011},
  doi = {10.1016/j.comnet.2010.08.007},
  url = {http://dx.doi.org/10.1016/j.comnet.2010.08.007},
  researchr = {https://researchr.org/publication/ZhaoL11-3},
  cites = {0},
  citedby = {0},
  journal = {Computer Networks},
  volume = {55},
  number = {1},
  pages = {343-355},
}