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

DOI10.1016/J.COMNET.2010.08.007MaRDI QIDQ551706zbMATH OpenOpenAlexFDO

Authors Can Zhao, Xiaojun Lin

Publication date 21 July 2011

Published in Computer Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.comnet.2010.08.007

zbMATH Keywords

large deviationsscheduling algorithmswireless networksquality of service

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed algorithms (68W15)

Recommendations

• A Large Deviations Analysis of Scheduling in Wireless Networks
• Large deviations analysis of the generalized processor sharing policy
• Randomized scheduling algorithm for queueing networks
• Distributed link scheduling in wireless networks
• Wireless scheduling with partial channel state information: large deviations and optimality

This page was built for publication: On the queue-overflow probabilities of a class of distributed scheduling algorithms

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