skip to main content
research-article
Public Access

Minimizing Queue Length Regret Under Adversarial Network Models

Authors Info & Claims
Published:03 April 2018Publication History
Skip Abstract Section

Abstract

Stochastic models have been dominant in network optimization theory for over two decades, due to their analytical tractability. However, these models fail to capture non-stationary or even adversarial network dynamics which are of increasing importance for modeling the behavior of networks under malicious attacks or characterizing short-term transient behavior. In this paper, we focus on minimizing queue length regret under adversarial network models, which measures the finite-time queue length difference between a causal policy and an "oracle" that knows the future. Two adversarial network models are developed to characterize the adversary's behavior. We provide lower bounds on queue length regret under these adversary models and analyze the performance of two control policies (i.e., the MaxWeight policy and the Tracking Algorithm). We further characterize the stability region under adversarial network models, and show that both the MaxWeight policy and the Tracking Algorithm are throughput-optimal even in adversarial settings.

References

  1. Matthew Andrews, Baruch Awerbuch, Antonio Fernández, Tom Leighton, Zhiyong Liu, and Jon Kleinberg. 2001. Universal-stability results and performance bounds for greedy contention-resolution protocols. Journal of the ACM (JACM) 48, 1 (2001), 39--69. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. 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. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. 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. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. 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. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Allan Borodin, Jon Kleinberg, Prabhakar Raghavan, Madhu Sudan, and David P. Williamson. 2001. Adversarial queuing theory. Journal of the ACM (JACM) 48, 1 (2001), 13--38. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Vicent Cholvi and Juan Echagüe. 2007. Stability of FIFO networks under adversarial models: State of the art. Computer Networks 51, 15 (2007), 4460--4474. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Rene L. Cruz. 1991. A calculus for network delay. I. Network elements in isolation. IEEE Transactions on information theory 37, 1 (1991), 114--131. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Subhashini Krishnasamy, Rajat Sen, Ramesh Johari, and Sanjay Shakkottai. 2016. Regret of Queueing Bandits. In Advances in Neural Information Processing Systems. 1669--1677. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Sungsu Lim, Kyomin Jung, and Matthew Andrews. 2014. Stability of the Max-weight Protocol in Adversarial Wireless Networks. IEEE/ACM Trans. Netw. 22, 6 (Dec. 2014), 1859--1872. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Nick McKeown, Adisak Mekkittikul, Venkat Anantharam, and Jean Walrand. 1999. Achieving 100% throughput in an input-queued switch. IEEE Transactions on Communications 47, 8 (1999), 1260--1267.Google ScholarGoogle ScholarCross RefCross Ref
  11. Michael J. Neely. 2010. Stability and capacity regions or discrete time queueing networks. arXiv preprint arXiv:1003.3396 (2010).Google ScholarGoogle Scholar
  12. Michael J. Neely. 2010. Universal scheduling for networks with arbitrary traffic, channels, and mobility. In Decision and Control (CDC), 2010 49th IEEE Conference on. IEEE, 1822--1829.Google ScholarGoogle ScholarCross RefCross Ref
  13. Michael J. Neely and Hao Yu. 2017. Online Convex Optimization with Time-Varying Constraints. arXiv preprint arXiv:1702.04783 (2017).Google ScholarGoogle Scholar
  14. George S. Paschos and Leandros Tassiulas. 2016. Sustainability of Service Provisioning Systems under Stealth DoS Attacks. IEEE Transactions on Control of Network Systems (2016).Google ScholarGoogle Scholar
  15. Shai Shalev-Shwartz et al. 2012. Online learning and online convex optimization. Foundations and Trends in Machine Learning 4, 2 (2012), 107--194. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. Leandros Tassiulas and Anthony Ephremides. 1992. Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks. IEEE transactions on automatic control 37, 12 (1992), 1936--1948.Google ScholarGoogle Scholar
  17. Yulong Zou, Jia Zhu, Xianbin Wang, and Lajos Hanzo. 2016. A survey on wireless security: Technical challenges, recent advances, and future trends. Proc. IEEE 104, 9 (2016), 1727--1765.Google ScholarGoogle ScholarCross RefCross Ref

Index Terms

  1. Minimizing Queue Length Regret Under Adversarial Network Models

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in

    Full Access

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader
    About Cookies On This Site

    We use cookies to ensure that we give you the best experience on our website.

    Learn more

    Got it!