Optimal Control for Networks with Unobservable MaliciousNodes
暂无分享,去创建一个
[1] Hsien-Te Cheng,et al. Algorithms for partially observable markov decision processes , 1989 .
[2] Qingkai Liang,et al. Optimal Network Control with Adversarial Uncontrollable Nodes , 2019, MobiHoc.
[3] Sébastien Bubeck,et al. Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems , 2012, Found. Trends Mach. Learn..
[4] E. Modiano,et al. Fairness and Optimal Stochastic Control for Heterogeneous Networks , 2005, IEEE/ACM Transactions on Networking.
[5] Nicolò Cesa-Bianchi,et al. Gambling in a rigged casino: The adversarial multi-armed bandit problem , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.
[6] Aikaterini Mitrokotsa,et al. DDoS attacks and defense mechanisms: classification and state-of-the-art , 2004, Comput. Networks.
[7] Alessandro Orso,et al. A Classification of SQL Injection Attacks and Countermeasures , 2006, ISSSE.
[8] Peter L. Bartlett,et al. Infinite-Horizon Policy-Gradient Estimation , 2001, J. Artif. Intell. Res..
[9] Peter Reiher,et al. A taxonomy of DDoS attack and DDoS defense mechanisms , 2004, CCRV.
[10] Qingkai Liang,et al. Minimizing Queue Length Regret Under Adversarial Network Models , 2018, Proc. ACM Meas. Anal. Comput. Syst..
[11] Baruch Awerbuch,et al. Universal-stability results and performance bounds for greedy contention-resolution protocols , 2001, JACM.
[12] David Watson,et al. Topology aware overlay networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..
[13] Qingkai Liang,et al. Optimal Network Control in Partially-Controllable Networks , 2019, IEEE INFOCOM 2019 - IEEE Conference on Computer Communications.
[14] LiangQingkai,et al. Minimizing Queue Length Regret Under Adversarial Network Models , 2018 .
[15] Eytan Modiano,et al. Throughput optimal routing in overlay networks , 2014, 2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton).
[16] M. Andrews,et al. Scheduling over nonstationary wireless channels with finite rate sets , 2004, IEEE INFOCOM 2004.
[17] Edward J. Sondik,et al. The Optimal Control of Partially Observable Markov Processes over the Infinite Horizon: Discounted Costs , 1978, Oper. Res..
[18] Panayiotis Tsaparas,et al. Stability in adversarial queueing theory , 1997 .
[19] Eytan Modiano,et al. A Distributed Algorithm for Throughput Optimal Routing in Overlay Networks , 2016, 2019 IFIP Networking Conference (IFIP Networking).
[20] Lei Ying,et al. On Throughput Optimality With Delayed Network-State Information , 2008, IEEE Transactions on Information Theory.
[21] Leslie Pack Kaelbling,et al. Planning and Acting in Partially Observable Stochastic Domains , 1998, Artif. Intell..
[22] Kyomin Jung,et al. Stability of the Max-Weight protocol in adversarial wireless networks , 2012, 2012 Proceedings IEEE INFOCOM.
[23] Michael L. Littman,et al. Incremental Pruning: A Simple, Fast, Exact Method for Partially Observable Markov Decision Processes , 1997, UAI.
[24] Prasant Mohapatra,et al. QRON: QoS-aware routing in overlay networks , 2004, IEEE Journal on Selected Areas in Communications.
[25] Leandros Tassiulas,et al. Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks , 1992 .
[26] Eytan Modiano,et al. An Overlay Architecture for Throughput Optimal Multipath Routing , 2017, IEEE/ACM Transactions on Networking.
[27] Anurag Kumar,et al. Optimal control of arrivals to queues with delayed queue length information , 1995 .
[28] Lisa Zhang,et al. Scheduling over a time-varying user-dependent channel with applications to high-speed wireless data , 2005, JACM.
[29] Allan Borodin,et al. Adversarial queueing theory , 1996, STOC '96.