{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T17:04:33Z","timestamp":1754154273723,"version":"3.41.2"},"reference-count":18,"publisher":"IEEE","license":[{"start":{"date-parts":[[2024,12,13]],"date-time":"2024-12-13T00:00:00Z","timestamp":1734048000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,12,13]],"date-time":"2024-12-13T00:00:00Z","timestamp":1734048000000},"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","id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024,12,13]]},"DOI":"10.1109\/hpcc64274.2024.00126","type":"proceedings-article","created":{"date-parts":[[2025,7,23]],"date-time":"2025-07-23T18:33:48Z","timestamp":1753295628000},"page":"928-935","source":"Crossref","is-referenced-by-count":0,"title":["Cost-Efficient Traffic Allocation in Content Delivery Networks: a Linear Programming Approach"],"prefix":"10.1109","author":[{"given":"Xingze","family":"Wu","sequence":"first","affiliation":[{"name":"Shandong University,School of Computer Science and Technology,Qingdao,China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rongxiang","family":"Huo","sequence":"additional","affiliation":[{"name":"Beijing Bayi School,Beijing,China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haofei","family":"Yin","sequence":"additional","affiliation":[{"name":"Shandong University,School of Computer Science and Technology,Qingdao,China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yifei","family":"Zou","sequence":"additional","affiliation":[{"name":"Shandong University,School of Computer Science and Technology,Qingdao,China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yihong","family":"Ling","sequence":"additional","affiliation":[{"name":"Baishan Cloud Technology Co.,Guizhou,China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guangzheng","family":"Lin","sequence":"additional","affiliation":[{"name":"Baishan Cloud Technology Co.,Guizhou,China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ruomei","family":"Liu","sequence":"additional","affiliation":[{"name":"Baishan Cloud Technology Co.,Guizhou,China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jian","family":"Tong","sequence":"additional","affiliation":[{"name":"Baishan Cloud Technology Co.,Guizhou,China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dongxiao","family":"Yu","sequence":"additional","affiliation":[{"name":"Shandong University,School of Computer Science and Technology,Qingdao,China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.hcc.2024.100225"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/3380613"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/35.860868"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/1544012.1544024"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/1403027.1403040"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/1403027.1403031"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/1232919.1232926"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/S1389-1286(01)00188-8"},{"key":"ref9","article-title":"Transit tactic-gaming the 95th percentile","volume-title":"Drpeering. net white paper","author":"Norton","year":"2014"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/1030194.1015478"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/2018436.2018446"},{"article-title":"Optimal response to burstable billing under demand uncertainty","year":"2016","author":"Zhan","key":"ref12"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/2637364.2592037"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TSC.2018.2841868"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.hcc.2024.100254"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/IWQoS54832.2022.9812878"},{"key":"ref17","first-page":"33","article-title":"Optimizing cost and performance in online service provider networks","author":"Zhang","year":"2010","journal-title":"NSDI"},{"article-title":"Pulp : A linear programming toolkit for python","year":"2011","author":"Mitchell","key":"ref18"}],"event":{"name":"2024 IEEE International Conference on High Performance Computing and Communications (HPCC)","start":{"date-parts":[[2024,12,13]]},"location":"Wuhan, China","end":{"date-parts":[[2024,12,15]]}},"container-title":["2024 IEEE International Conference on High Performance Computing and Communications (HPCC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11083115\/11083125\/11083297.pdf?arnumber=11083297","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,24]],"date-time":"2025-07-24T04:50:01Z","timestamp":1753332601000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11083297\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,13]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/hpcc64274.2024.00126","relation":{},"subject":[],"published":{"date-parts":[[2024,12,13]]}}}