{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T09:38:20Z","timestamp":1777541900804,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":26,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,7,2]],"date-time":"2019-07-02T00:00:00Z","timestamp":1562025600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"DARPA I2O and Raytheon BBN Technologies","award":["HROO l l-l 5-C-0097"],"award-info":[{"award-number":["HROO l l-l 5-C-0097"]}]},{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CNS-1524317"],"award-info":[{"award-number":["CNS-1524317"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,7,2]]},"DOI":"10.1145\/3323679.3326508","type":"proceedings-article","created":{"date-parts":[[2019,6,4]],"date-time":"2019-06-04T16:07:11Z","timestamp":1559664431000},"page":"101-110","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Optimal Network Control with Adversarial Uncontrollable Nodes"],"prefix":"10.1145","author":[{"given":"Qingkai","family":"Liang","sequence":"first","affiliation":[{"name":"LIDS, MIT"}]},{"given":"Eytan","family":"Modiano","sequence":"additional","affiliation":[{"name":"LIDS, MIT"}]}],"member":"320","published-online":{"date-parts":[[2019,7,2]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250813"},{"key":"e_1_3_2_1_2_1","volume-title":"The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings. 293--302","author":"Andrews M.","unstructured":"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 . 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."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2006.882835"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/363647.363659"},{"key":"e_1_3_2_1_5_1","volume-title":"An online convex optimization approach to dynamic network resource allocation. arXiv preprint arXiv: 1701.03974","author":"Chen Tianyi","year":"2017","unstructured":"Tianyi Chen , Qing Ling , and Georgios B Giannakis . 2017. An online convex optimization approach to dynamic network resource allocation. arXiv preprint arXiv: 1701.03974 ( 2017 ). Tianyi Chen, Qing Ling, and Georgios B Giannakis. 2017. An online convex optimization approach to dynamic network resource allocation. arXiv preprint arXiv: 1701.03974 (2017)."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2007.07.001"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.61109"},{"key":"e_1_3_2_1_8_1","volume-title":"Adaptive algorithms for online convex optimization with long-term constraints. arXiv preprint arXiv:1512.07422","author":"Jenatton Rodolphe","year":"2015","unstructured":"Rodolphe Jenatton , Jim Huang , and C\u00e9dric Archambeau . 2015. Adaptive algorithms for online convex optimization with long-term constraints. arXiv preprint arXiv:1512.07422 ( 2015 ). Rodolphe Jenatton, Jim Huang, and C\u00e9dric Archambeau. 2015. Adaptive algorithms for online convex optimization with long-term constraints. arXiv preprint arXiv:1512.07422 (2015)."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2017.2703867"},{"key":"e_1_3_2_1_10_1","volume-title":"Minimizing Queue Length Regret Under Adversarial Network Models. ACM SIGMETRICS","author":"Liang Qingkai","year":"2018","unstructured":"Qingkai Liang and Eytan Modiano . 2018. Minimizing Queue Length Regret Under Adversarial Network Models. ACM SIGMETRICS ( 2018 ). Qingkai Liang and Eytan Modiano. 2018. Minimizing Queue Length Regret Under Adversarial Network Models. ACM SIGMETRICS (2018)."},{"key":"e_1_3_2_1_11_1","volume-title":"Network Utility Maximization in Adversarial Environments","author":"Liang Qingkai","year":"2018","unstructured":"Qingkai Liang and Eytan Modiano . 2018. Network Utility Maximization in Adversarial Environments . IEEE INFOCOM ( 2018 ). Qingkai Liang and Eytan Modiano. 2018. Network Utility Maximization in Adversarial Environments. IEEE INFOCOM (2018)."},{"key":"e_1_3_2_1_12_1","volume-title":"Technical Report:. https:\/\/www.dropbox.com\/s\/x952j5vgny6hbou\/uncontrollable-adversarial-tech-report.pdf?dl=0.","author":"Liang Qingkai","year":"2019","unstructured":"Qingkai Liang and Eytan Modiano . 2019. Technical Report:. https:\/\/www.dropbox.com\/s\/x952j5vgny6hbou\/uncontrollable-adversarial-tech-report.pdf?dl=0. ( 2019 ). Qingkai Liang and Eytan Modiano. 2019. Technical Report:. https:\/\/www.dropbox.com\/s\/x952j5vgny6hbou\/uncontrollable-adversarial-tech-report.pdf?dl=0. (2019)."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2013.2288372"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0305004100027638"},{"key":"e_1_3_2_1_15_1","first-page":"2503","article-title":"Trading regret for efficiency: online convex optimization with long term constraints","author":"Mahdavi Mehrdad","year":"2012","unstructured":"Mehrdad Mahdavi , Rong Jin , and Tianbao Yang . 2012 . Trading regret for efficiency: online convex optimization with long term constraints . Journal of Machine Learning Research 13 , Sep (2012), 2503 -- 2528 . Mehrdad Mahdavi, Rong Jin, and Tianbao Yang. 2012. Trading regret for efficiency: online convex optimization with long term constraints. Journal of Machine Learning Research 13, Sep (2012), 2503--2528.","journal-title":"Journal of Machine Learning Research 13"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/1941130"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2010.5717885"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2007.900405"},{"key":"e_1_3_2_1_19_1","volume-title":"Online Convex Optimization with Time-Varying Constraints. arXiv preprint arXiv: 1702.04783","author":"Neely Michael J","year":"2017","unstructured":"Michael J Neely and Hao Yu. 2017. Online Convex Optimization with Time-Varying Constraints. arXiv preprint arXiv: 1702.04783 ( 2017 ). Michael J Neely and Hao Yu. 2017. Online Convex Optimization with Time-Varying Constraints. arXiv preprint arXiv: 1702.04783 (2017)."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2014.7028483"},{"key":"e_1_3_2_1_21_1","volume-title":"Sustainability of Service Provisioning Systems under Stealth DoS Attacks","author":"Paschos George S","year":"2016","unstructured":"George S Paschos and Leandros Tassiulas . 2016. Sustainability of Service Provisioning Systems under Stealth DoS Attacks . IEEE Transactions on Control of Network Systems ( 2016 ). George S Paschos and Leandros Tassiulas. 2016. Sustainability of Service Provisioning Systems under Stealth DoS Attacks. IEEE Transactions on Control of Network Systems (2016)."},{"key":"e_1_3_2_1_22_1","volume-title":"A Distributed Algorithm for Throughput Optimal Routing in Overlay Networks. arXiv preprint arXiv:1612.05537","author":"Rai Anurag","year":"2016","unstructured":"Anurag Rai , Rahul Singh , and Eytan Modiano . 2016. A Distributed Algorithm for Throughput Optimal Routing in Overlay Networks. arXiv preprint arXiv:1612.05537 ( 2016 ). Anurag Rai, Rahul Singh, and Eytan Modiano. 2016. A Distributed Algorithm for Throughput Optimal Routing in Overlay Networks. arXiv preprint arXiv:1612.05537 (2016)."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1002\/9781118909690.ch16","article-title":"Overlay networks: An akamai perspective","volume":"51","author":"Sitaraman Ramesh K","year":"2014","unstructured":"Ramesh K Sitaraman , Mangesh Kasbekar , Woody Lichtenstein , and Manish Jain . 2014 . Overlay networks: An akamai perspective . Advanced Content Delivery, Streaming, and Cloud Services 51 , 4 (2014), 305 -- 328 . Ramesh K Sitaraman, Mangesh Kasbekar, Woody Lichtenstein, and Manish Jain. 2014. Overlay networks: An akamai perspective. Advanced Content Delivery, Streaming, and Cloud Services 51, 4 (2014), 305--328.","journal-title":"Advanced Content Delivery, Streaming, and Cloud Services"},{"key":"e_1_3_2_1_24_1","volume-title":"Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks","author":"Tassiulas Leandros","year":"1992","unstructured":"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. 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."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2013.11.008"},{"key":"e_1_3_2_1_26_1","unstructured":"Hao Yu Michael Neely and Xiaohan Wei. 2017. Online Convex Optimization with Stochastic Constraints. In Advances in Neural Information Processing Systems. 1427--1437. Hao Yu Michael Neely and Xiaohan Wei. 2017. Online Convex Optimization with Stochastic Constraints. In Advances in Neural Information Processing Systems. 1427--1437."}],"event":{"name":"Mobihoc '19: The Twentieth ACM International Symposium on Mobile Ad Hoc Networking and Computing","location":"Catania Italy","acronym":"Mobihoc '19","sponsor":["SIGMOBILE ACM Special Interest Group on Mobility of Systems, Users, Data and Computing"]},"container-title":["Proceedings of the Twentieth ACM International Symposium on Mobile Ad Hoc Networking and Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3323679.3326508","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3323679.3326508","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3323679.3326508","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:25:40Z","timestamp":1750206340000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3323679.3326508"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7,2]]},"references-count":26,"alternative-id":["10.1145\/3323679.3326508","10.1145\/3323679"],"URL":"https:\/\/doi.org\/10.1145\/3323679.3326508","relation":{},"subject":[],"published":{"date-parts":[[2019,7,2]]},"assertion":[{"value":"2019-07-02","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}