On Wireless Scheduling Algorithms for Minimizing the Queue-Overflow Probability

@article{Venkataramanan2010OnWS,
  title={On Wireless Scheduling Algorithms for Minimizing the Queue-Overflow Probability},
  author={V. J. Venkataramanan and Xiaojun Lin},
  journal={IEEE/ACM Transactions on Networking},
  year={2010},
  volume={18},
  pages={788-801}
}
In this paper, we are interested in wireless scheduling algorithms for the downlink of a single cell that can minimize the queue-overflow probability. Specifically, in a large-deviation setting, we are interested in algorithms that maximize the asymptotic decay rate of the queue-overflow probability, as the queue-overflow threshold approaches infinity. We first derive an upper bound on the decay rate of the queue-overflow probability over all scheduling policies. We then focus on a class of… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 36 CITATIONS, ESTIMATED 29% COVERAGE

125 Citations

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

See our FAQ for additional information.

References

Publications referenced by this paper.
SHOWING 1-6 OF 6 REFERENCES

On Wireless Schedulin g Algorithms for Minimizing the Queue-Overflow Probability,”Technical Report, Purdue University, http://min.ecn.purdue.edu/ ∼linx/papers.html

  • V. J. Venkataramanan, X. Lin
  • 2008
Highly Influential
4 Excerpts

Similar Papers

Loading similar papers…