MIT Libraries logoDSpace@MIT

MIT
View Item 
  • DSpace@MIT Home
  • MIT Open Access Articles
  • MIT Open Access Articles
  • View Item
  • DSpace@MIT Home
  • MIT Open Access Articles
  • MIT Open Access Articles
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Minimizing Queue Length Regret Under Adversarial Network Models

Author(s)
Liang, Qingkai; Modiano, Eytan H
Thumbnail
DownloadAccepted version (706.2Kb)
Terms of use
Creative Commons Attribution-Noncommercial-Share Alike http://creativecommons.org/licenses/by-nc-sa/4.0/
Metadata
Show full item record
Abstract
Stochastic models have been dominant in network optimization theory for over two decades, due totheir analytical tractability. However, these models fail to capture non-stationary or even adversarialnetwork dynamics which are of increasing importance for modeling the behavior of networksunder malicious attacks or characterizing short-term transient behavior. In this paper, we focuson 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. Twoadversarial network models are developed to characterize the adversary’s behavior. We provide lowerbounds on queue length regret under these adversary models and analyze the performance of twocontrol policies (i.e., the MaxWeight policy and the Tracking Algorithm). We further characterizethe stability region under adversarial network models, and show that both the MaxWeight policyand the Tracking Algorithm are throughput-optimal even in adversarial settings.
Date issued
2018-03
URI
https://hdl.handle.net/1721.1/126332
Department
Massachusetts Institute of Technology. Laboratory for Information and Decision Systems; Massachusetts Institute of Technology. Department of Aeronautics and Astronautics
Journal
Proceedings of the ACM on measurement and analysis of computing systems
Publisher
Association for Computing Machinery (ACM)
Citation
Liang, Qingkai and Eytan Modiano. “Minimizing Queue Length Regret Under Adversarial Network Models.” Proceedings of the ACM on measurement and analysis of computing systems, vol. 2, no. 1, 2018, Article 11 © 2018 The Author(s)
Version: Author's final manuscript
ISSN
2476-1249

Collections
  • MIT Open Access Articles

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

Login

Statistics

OA StatisticsStatistics by CountryStatistics by Department
MIT Libraries
PrivacyPermissionsAccessibilityContact us
MIT
Content created by the MIT Libraries, CC BY-NC unless otherwise noted. Notify us about copyright concerns.