{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T01:19:16Z","timestamp":1740100756604,"version":"3.37.3"},"reference-count":30,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,6,10]],"date-time":"2022-06-10T00:00:00Z","timestamp":1654819200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,6,10]],"date-time":"2022-06-10T00:00:00Z","timestamp":1654819200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,6,10]]},"DOI":"10.1109\/iwqos54832.2022.9812880","type":"proceedings-article","created":{"date-parts":[[2022,7,5]],"date-time":"2022-07-05T19:27:44Z","timestamp":1657049264000},"page":"1-10","source":"Crossref","is-referenced-by-count":0,"title":["When Power-of-d-Choices Meets Priority"],"prefix":"10.1109","author":[{"given":"Jianyu","family":"Niu","sequence":"first","affiliation":[{"name":"Southern University of Science and Technology,Research Institute of Trustworthy Autonomous Systems"}]},{"given":"Chunpu","family":"Wang","sequence":"additional","affiliation":[{"name":"University of British Columbia,Unity Technologies"}]},{"given":"Chen","family":"Feng","sequence":"additional","affiliation":[{"name":"University of British Columbia,School of Engineering"}]},{"given":"Hong","family":"Xu","sequence":"additional","affiliation":[{"name":"Chinese University of Hong Kong,Department of Computer Science and Engineering"}]}],"member":"263","reference":[{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2018.2878403"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/2517349.2522716"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/2038916.2038939"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/3323679.3326533"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/1989493.1989516"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2015.2501402"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2018.2869092"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/s11134-012-9311-0"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TCNS.2015.2428331"},{"key":"ref18","article-title":"The power of d choices in scheduling for data centers with heterogeneous servers","author":"moaddeli","year":"2019","journal-title":"arXiv preprint arXiv 1904 09099"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2015.7218487"},{"journal-title":"Data Networks","year":"1992","author":"bertsekas","key":"ref28"},{"year":"2018","key":"ref4","article-title":"NGINX and the ”power of two choices\" load-balancing algorithm"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/3087801.3087810"},{"key":"ref3","first-page":"20","article-title":"Queueing system with selection of the shortest of two queues: An asymptotic approach","volume":"32","author":"vvedenskaya","year":"1996","journal-title":"Problemy Peredachi Informatsii"},{"key":"ref6","first-page":"143","article-title":"DistCache: Provable load balancing for large-scale storage systems with distributed caching","author":"liu","year":"2019","journal-title":"USENIX Conference on File and Storage Technologies (FAST)"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1287\/opre.31.3.456"},{"article-title":"Test driving, power of two random choices load balancing","year":"2019","author":"tarreau","key":"ref5"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2019.2949291"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2019.2945066"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/71.963420"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2018.2858815"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/s11134-012-9305-y"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1023\/A:1019175812444"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/3388831.3388839"},{"key":"ref21","article-title":"Power-of-d-choices with memory: Fluid limit and optimality","volume":"45","author":"jonatha","year":"2018","journal-title":"Mathematics of Operations Research"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/2964791.2901497"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2020.2980061"},{"key":"ref26","first-page":"255","article-title":"The power of two random choices: A survey of techniques and results","author":"michael","year":"2000","journal-title":"Handbook of Randomized Computing"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ICCNC.2017.7876182"}],"event":{"name":"2022 IEEE\/ACM 30th International Symposium on Quality of Service (IWQoS)","start":{"date-parts":[[2022,6,10]]},"location":"Oslo, Norway","end":{"date-parts":[[2022,6,12]]}},"container-title":["2022 IEEE\/ACM 30th International Symposium on Quality of Service (IWQoS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9812862\/9812863\/09812880.pdf?arnumber=9812880","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,5]],"date-time":"2022-08-05T00:44:49Z","timestamp":1659660289000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9812880\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,10]]},"references-count":30,"URL":"https:\/\/doi.org\/10.1109\/iwqos54832.2022.9812880","relation":{},"subject":[],"published":{"date-parts":[[2022,6,10]]}}}