{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T01:27:33Z","timestamp":1775179653622,"version":"3.50.1"},"reference-count":44,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T00:00:00Z","timestamp":1569888000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T00:00:00Z","timestamp":1569888000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T00:00:00Z","timestamp":1569888000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61972448"],"award-info":[{"award-number":["61972448"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U1836204"],"award-info":[{"award-number":["U1836204"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61872414"],"award-info":[{"award-number":["61872414"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61401169"],"award-info":[{"award-number":["61401169"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Shenzhen Knowledge Innovation Program","award":["JCYJ20170307172447622"],"award-info":[{"award-number":["JCYJ20170307172447622"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE\/ACM Trans. Networking"],"published-print":{"date-parts":[[2019,10]]},"DOI":"10.1109\/tnet.2019.2930464","type":"journal-article","created":{"date-parts":[[2019,8,16]],"date-time":"2019-08-16T19:38:47Z","timestamp":1565984327000},"page":"1815-1829","source":"Crossref","is-referenced-by-count":21,"title":["Toward Optimal Adaptive Online Shortest Path Routing With Acceleration Under Jamming Attack"],"prefix":"10.1109","volume":"27","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8629-4622","authenticated-orcid":false,"given":"Pan","family":"Zhou","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0515-1647","authenticated-orcid":false,"given":"Jie","family":"Xu","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2153-9075","authenticated-orcid":false,"given":"Wei","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Yuchong","family":"Hu","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1755-0183","authenticated-orcid":false,"given":"Dapeng Oliver","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Shouling","family":"Ji","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780199535255.001.0001"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2014.54"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/SAHCN.2016.7733015"},{"key":"ref32","first-page":"535","article-title":"Tight regret bounds for stochastic combinatorial semi-bandits","author":"kveton","year":"2015","journal-title":"Proc AISTATS"},{"key":"ref31","first-page":"116","article-title":"An algorithm with nearly optimal pseudo-regret for both stochastic and adversarial bandits","author":"auer","year":"2016","journal-title":"Proc COLT"},{"key":"ref30","first-page":"42","article-title":"The best of both worlds: Stochastic and adversarial bandits","author":"bubeck","year":"2012","journal-title":"Proc COLT"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2013.0598"},{"key":"ref36","first-page":"280","article-title":"Prediction with limited advice and multiarmed bandits with paid observations","author":"seldin","year":"2014","journal-title":"Proc ICML"},{"key":"ref35","article-title":"The combination of the label efficient and the multi-armed bandit problem in adversarial setting","author":"ottucsak","year":"2006"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.847729"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2005.1497929"},{"key":"ref40","first-page":"1453","article-title":"Online learning under delayed feedback","author":"joulani","year":"2013","journal-title":"Proc ICML"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2012.69"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2017.2728659"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2015.2511071"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2016.2535906"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1023\/A:1013689704352"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1214\/13-AOS1119"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1093\/biomet\/25.3-4.285"},{"key":"ref18","first-page":"1","article-title":"Online bandit learning against an adaptive adversary: From regret to policy regret","author":"arora","year":"2012","journal-title":"Proc ICML"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1561\/2200000024"},{"key":"ref28","author":"tanenbaum","year":"2003","journal-title":"Computer Networks"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2011.2181864"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1995.492488"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2010.5757647"},{"key":"ref6","author":"barto","year":"1998","journal-title":"Reinforcement Learning An Introduction"},{"key":"ref29","first-page":"1287","article-title":"One practical algorithm for both stochastic and adversarial bandits","author":"seldin","year":"2014","journal-title":"Proc ICML"},{"key":"ref5","first-page":"232","article-title":"Adaptive shortest-path routing under unknown and stochastically varying link states","author":"liu","year":"2012","journal-title":"Proc WiOpt"},{"key":"ref8","first-page":"2369","article-title":"The on-line shortest path problem under partial monitoring","volume":"8","author":"gy\u00f6rgy","year":"2007","journal-title":"J Mach Learn Res"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2017.2747409"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2013.6567023"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007367"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2011.2159844"},{"key":"ref20","first-page":"1","article-title":"Minimax policies for adversarial and stochastic bandits","author":"audibert","year":"2009","journal-title":"Proc COLT"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539701398375"},{"key":"ref21","first-page":"98","article-title":"PAC-Bayes-Bernstein inequality for martingales and its application to multiarmed bandits","volume":"2","author":"seldin","year":"2012","journal-title":"Proc JMLR Workshop Conf"},{"key":"ref42","first-page":"355","article-title":"Stochastic Linear Optimization under Bandit Feedback","author":"dani","year":"2008","journal-title":"Proc COLT"},{"key":"ref24","first-page":"100","article-title":"Finite-time regret bounds for the multiarmed bandit problem","author":"cesa-bianchi","year":"1998","journal-title":"Proc ICML"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/ITA.2012.6181775"},{"key":"ref23","article-title":"Incomplete information and internal regret in prediction of individual sequences","author":"stoltz","year":"2005"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2019.2930464"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2012.01.001"},{"key":"ref43","first-page":"58","article-title":"Optimal distributed online prediction using mini-batches","author":"dekel","year":"2012","journal-title":"Proc ICML"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/0196-8858(85)90002-8"}],"container-title":["IEEE\/ACM Transactions on Networking"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/90\/8869948\/08804384.pdf?arnumber=8804384","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T21:14:53Z","timestamp":1657746893000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8804384\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,10]]},"references-count":44,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tnet.2019.2930464","relation":{},"ISSN":["1063-6692","1558-2566"],"issn-type":[{"value":"1063-6692","type":"print"},{"value":"1558-2566","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,10]]}}}