Minimizing Queue Length Regret Under Adversarial Network Models-Reference-Cited by-同舟云学术

Minimizing Queue Length Regret Under Adversarial Network Models

Published:2019-01-17 Issue:1 Volume:46 Page:31-32
ISSN:0163-5999
Container-title:ACM SIGMETRICS Performance Evaluation Review
language:en
Short-container-title:SIGMETRICS Perform. Eval. Rev.

Author:

Liang Qingkai¹,Modiano Eytan¹

Affiliation:

1. Massachusetts Institute of Technology, Cambridge, MA, USA

Funder

National Science Foundation

DARPA I2O and Raytheon BBN Technologies

Publisher

Association for Computing Machinery (ACM)

Subject

Computer Networks and Communications,Hardware and Architecture,Software

Reference8 articles.

1. Matthew Andrews, Kyomin Jung, and Alexander Stolyar. 2007. Stability of the Max-weight Routing and Scheduling Protocol in Dynamic Networks and at Critical Loads. In Proceedings of the Thirty-ninth Annual ACM Symposium on Theory of Computing (STOC '07). ACM, 145--154.

2. M. Andrews and L. Zhang. 2002. Scheduling over a time-varying user-dependent channel with applications to high speed wireless data. In The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings. 293--302. https: //doi.org/10.1109/SFCS.2002.1181952

3. M. Andrews and L. Zhang. 2006. Scheduling Over Nonstationary Wireless Channels With Finite Rate Sets. IEEE/ACM Transactions on Networking 14, 5 (Oct 2006), 1067--1077. https://doi.org/10.1109/TNET.2006.882835

4. Qingkai Liang and Eytan Modiano. 2018. Minimizing Queue Length Regret Under Adversarial Network Models. Proceedings of the ACM on Measurement and Analysis of Computing Systems 2, 1 (2018), 11.

5. Sungsu Lim, Kyomin Jung, and Matthew Andrews. 2014. Stability of the Maxweight Protocol in Adversarial Wireless Networks. IEEE/ACM Trans. Netw. 22, 6 (Dec. 2014), 1859--1872.

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. When Lyapunov Drift Based Queue Scheduling Meets Adversarial Bandit Learning;IEEE/ACM Transactions on Networking;2024-08