{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T21:03:22Z","timestamp":1774991002046,"version":"3.50.1"},"reference-count":12,"publisher":"IEEE","license":[{"start":{"date-parts":[[2016,7,1]],"date-time":"2016-07-01T00:00:00Z","timestamp":1467331200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2016,7,1]],"date-time":"2016-07-01T00:00:00Z","timestamp":1467331200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016,7]]},"DOI":"10.1109\/isit.2016.7541536","type":"proceedings-article","created":{"date-parts":[[2016,8,15]],"date-time":"2016-08-15T18:52:57Z","timestamp":1471287177000},"page":"1436-1440","source":"Crossref","is-referenced-by-count":2,"title":["Routing with blinkers: Online throughput maximization without queue length information"],"prefix":"10.1109","author":[{"given":"Georgios S.","family":"Paschos","sequence":"first","affiliation":[{"name":"Mathematical and Algorithmic Sciences Lab, Huawei Technologies Ltd, Paris, France"}]},{"given":"Mathieu","family":"Leconte","sequence":"additional","affiliation":[{"name":"Mathematical and Algorithmic Sciences Lab, Huawei Technologies Ltd, Paris, France"}]},{"given":"Apostolos","family":"Destounis","sequence":"additional","affiliation":[{"name":"Mathematical and Algorithmic Sciences Lab, Huawei Technologies Ltd, Paris, France"}]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TNSM.2015.2397345"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2012.6195815"},{"key":"ref10","author":"bertsekas","year":"1987","journal-title":"Data Networks"},{"key":"ref6","article-title":"Dynamic overload balancing in multi-server systems","author":"li","year":"2014","journal-title":"IFIP Networking"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1561\/1300000001"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/9.182479"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/2632951.2632957"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2015.7218487"},{"key":"ref7","article-title":"The power of two choices in randomized load balancing","author":"mitzenmacher","year":"1995"},{"key":"ref2","article-title":"Achieving 100input-queued switch","author":"mckeown","year":"0","journal-title":"INFOCOM 1996"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1998.665071"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/1402958.1402967"}],"event":{"name":"2016 IEEE International Symposium on Information Theory (ISIT)","location":"Barcelona, Spain","start":{"date-parts":[[2016,7,10]]},"end":{"date-parts":[[2016,7,15]]}},"container-title":["2016 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7532279\/7541040\/07541536.pdf?arnumber=7541536","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T19:52:48Z","timestamp":1774986768000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/7541536\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7]]},"references-count":12,"URL":"https:\/\/doi.org\/10.1109\/isit.2016.7541536","relation":{},"subject":[],"published":{"date-parts":[[2016,7]]}}}