{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T14:35:57Z","timestamp":1775745357630,"version":"3.50.1"},"reference-count":32,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100012389","name":"National Institute of Information and Communications Technology (NICT), Japan","doi-asserted-by":"publisher","award":["24101"],"award-info":[{"award-number":["24101"]}],"id":[{"id":"10.13039\/501100012389","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Open J. Commun. Soc."],"published-print":{"date-parts":[[2025]]},"DOI":"10.1109\/ojcoms.2025.3593641","type":"journal-article","created":{"date-parts":[[2025,7,29]],"date-time":"2025-07-29T18:32:35Z","timestamp":1753813955000},"page":"6207-6217","source":"Crossref","is-referenced-by-count":6,"title":["Edge Server Placement and Task Allocation for Maximum Delay Reduction"],"prefix":"10.1109","volume":"6","author":[{"ORCID":"https:\/\/orcid.org\/0009-0001-0418-5132","authenticated-orcid":false,"given":"Koki","family":"Shibata","sequence":"first","affiliation":[{"name":"Electrical Engineering and Computer Science Department, Shibaura Institute of Technology, Tokyo, Japan"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8023-7435","authenticated-orcid":false,"given":"Sumiko","family":"Miyata","sequence":"additional","affiliation":[{"name":"School of Engineering, Institute of Science Tokyo, Tokyo, Japan"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/SURV.2013.062613.00160"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.2965562"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2020.2970550"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2017.2745201"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2020.3020854"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TAI.2021.3105087"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2022.3183647"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/MCOMSTD.001.2000045"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2019.2957804"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2021.3074621"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/OJCOMS.2023.3260165"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/18.212277"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TSC.2019.2920954"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.23919\/JCC.2020.12.002"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2021.3082898"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2022.3205051"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2019.2938944"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2021.3117870"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.2979479"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.3034726"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TCC.2015.2449834"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TCC.2018.2790404"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2021.3117511"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2023.3320578"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2021.3074962"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2021.3100253"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TCC.2017.2786738"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2022.3161950"},{"issue":"13","key":"ref29","doi-asserted-by":"crossref","first-page":"4825","DOI":"10.3390\/s22134825","article-title":"Optimal task allocation algorithm based on queueing theory for future Internet application in mobile edge computing platform","volume":"22","author":"Katayama","year":"2022","journal-title":"Sensors"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1364\/JOCN.10.000736"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOMW.2012.6193506"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2024.3437365"}],"container-title":["IEEE Open Journal of the Communications Society"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/8782661\/10829557\/11099545.pdf?arnumber=11099545","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,18]],"date-time":"2025-08-18T19:49:41Z","timestamp":1755546581000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11099545\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"references-count":32,"URL":"https:\/\/doi.org\/10.1109\/ojcoms.2025.3593641","relation":{},"ISSN":["2644-125X"],"issn-type":[{"value":"2644-125X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]}}}