{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,8]],"date-time":"2025-04-08T07:05:13Z","timestamp":1744095913946},"reference-count":26,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,12,4]],"date-time":"2022-12-04T00:00:00Z","timestamp":1670112000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,12,4]],"date-time":"2022-12-04T00:00:00Z","timestamp":1670112000000},"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":[[2022,12,4]]},"DOI":"10.1109\/gcwkshps56602.2022.10008694","type":"proceedings-article","created":{"date-parts":[[2023,1,12]],"date-time":"2023-01-12T21:38:14Z","timestamp":1673559494000},"source":"Crossref","is-referenced-by-count":2,"title":["Heuristic Distribution of Latency-Sensitive Tasks in Multi-Access Edge Computing Systems"],"prefix":"10.1109","author":[{"given":"Guilherme Iecker","family":"Ricardo","sequence":"first","affiliation":[{"name":"Orange Labs, Châtillon,France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amal","family":"Benhamiche","sequence":"additional","affiliation":[{"name":"Orange Labs, Châtillon,France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nancy","family":"Perrot","sequence":"additional","affiliation":[{"name":"Orange Labs, Châtillon,France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yannick","family":"Carlinet","sequence":"additional","affiliation":[{"name":"Orange Labs, Châtillon,France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/OJCOMS.2021.3071496"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-83944-4_4"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/EuCNC\/6GSummit51104.2021.9482611"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2019.04.016"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2017.2705720"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-12-813677-5.00016-X"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2018.2881191"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2018.2876198"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2018.8422632"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ICCCN.2018.8487353"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/SMC.2016.7844600"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2016.2565516"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2020.2980175"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.comcom.2022.05.022"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.disopt.2019.100555"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1997.1545"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623637"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-19759-9_6"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/IWCMC.2017.7986416"},{"key":"ref20","article-title":"Data networks","author":"Bertsekas","year":"2021","journal-title":"Athena Scientific"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2017.05.034"},{"key":"ref22","article-title":"Heuristic distribution of latency-sensitive tasks in multiaccess edge computing systems","volume-title":"Orange Labs, Tech. Rep.","author":"Ricardo","year":"2022"},{"key":"ref23","article-title":"Knapsack problems: algorithms and computer implementations","author":"Martello","year":"1990","journal-title":"John Wiley & Sons, Inc."},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ICICN52636.2021.9674025"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.socnet.2007.11.001"},{"key":"ref26","article-title":"A tight deterministic algorithm for the submodular multiple knapsack problem","author":"Sun","year":"2020","journal-title":"arXiv preprint arXiv:2003.11450"}],"event":{"name":"2022 IEEE Globecom Workshops (GC Wkshps)","location":"Rio de Janeiro, Brazil","start":{"date-parts":[[2022,12,4]]},"end":{"date-parts":[[2022,12,8]]}},"container-title":["2022 IEEE Globecom Workshops (GC Wkshps)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10008390\/10008474\/10008694.pdf?arnumber=10008694","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,9]],"date-time":"2024-02-09T06:31:51Z","timestamp":1707460311000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10008694\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12,4]]},"references-count":26,"URL":"https:\/\/doi.org\/10.1109\/gcwkshps56602.2022.10008694","relation":{},"subject":[],"published":{"date-parts":[[2022,12,4]]}}}