{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,23]],"date-time":"2025-12-23T06:30:19Z","timestamp":1766471419801,"version":"3.48.0"},"reference-count":33,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T00:00:00Z","timestamp":1764547200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T00:00:00Z","timestamp":1764547200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T00:00:00Z","timestamp":1764547200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"France 2030 Program, managed by French National Research Agency","award":["ANR-23-PECL-0003"],"award-info":[{"award-number":["ANR-23-PECL-0003"]}]},{"name":"France 2030 Program, managed by French National Research Agency","award":["ANR-22-PEFT-0002"],"award-info":[{"award-number":["ANR-22-PEFT-0002"]}]},{"name":"European Network of Excellence A network of excellence for distributed, trustworthy, efficient and scalable AI at the Edge3IA","award":["101120726"],"award-info":[{"award-number":["101120726"]}]},{"name":"SmartNet and LearnNet:"},{"name":"French Government National Research Agency (ANR) through the 3IA Cote d\u2019Azur Investments","award":["ANR-23-IACL-0001"],"award-info":[{"award-number":["ANR-23-IACL-0001"]}]},{"name":"the Interdisciplinary Institute for Artificial Intelligence","award":["ANR-15-IDEX-01"],"award-info":[{"award-number":["ANR-15-IDEX-01"]}]},{"name":"EUR DS4H","award":["ANR-17-EURE-004"],"award-info":[{"award-number":["ANR-17-EURE-004"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Netw."],"published-print":{"date-parts":[[2025,12]]},"DOI":"10.1109\/ton.2025.3578455","type":"journal-article","created":{"date-parts":[[2025,6,23]],"date-time":"2025-06-23T13:26:25Z","timestamp":1750685185000},"page":"2839-2853","source":"Crossref","is-referenced-by-count":0,"title":["Data Center Scheduling With Network Tasks"],"prefix":"10.1109","volume":"33","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3727-051X","authenticated-orcid":false,"given":"F.","family":"Giroire","sequence":"first","affiliation":[{"name":"CNRS, I3S, Inria, Université Côte d’Azur, Sophia Antipolis, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6370-5735","authenticated-orcid":false,"given":"N.","family":"Huin","sequence":"additional","affiliation":[{"name":"IMT Atlantique, IRISA UMR CNRS 6074, Rennes, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Tomassilli","sequence":"additional","affiliation":[{"name":"CNRS, I3S, Inria, Université Côte d’Azur, Sophia Antipolis, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"P\u00e9rennes","sequence":"additional","affiliation":[{"name":"CNRS, I3S, Inria, Université Côte d’Azur, Sophia Antipolis, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","first-page":"2278","article-title":"When network matters: Data center scheduling with network tasks","volume-title":"Proc. IEEE Conf. Comput. Commun.","author":"Giroire"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/1327452.1327492"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/1272998.1273005"},{"key":"ref4","first-page":"113","article-title":"CIEL: A universal execution engine for distributed data-flow computing","volume-title":"Proc. 8th ACM\/USENIX Symp. Networked Syst. Design Implement.","author":"Murray"},{"key":"ref5","first-page":"2","article-title":"Resilient distributed datasets: A fault-tolerant abstraction for in-memory cluster computing","volume-title":"Proc. 9th USENIX Conf. Networked Syst. Design Implement.","author":"Zaharia"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/1594977.1592576"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/1402946.1402968"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/2018436.2018448"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/2619239.2626315"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/2740070.2626322"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2011.25"},{"issue":"9","key":"ref12","first-page":"24","article-title":"On micro-services architecture","volume":"2","author":"Namiot","year":"2014","journal-title":"Int. J. Open Inf. Technol."},{"key":"ref13","first-page":"1","article-title":"Google cluster-usage traces: Format+ schema","author":"Reiss","year":"2011"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/2390231.2390237"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2016.2525767"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/s10766-013-0281-6"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2012.6195473"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/2785956.2787488"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-0303-9_25"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1966.tb01709.x"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1137\/0219021"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(87)90042-4"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2016.05.009"},{"key":"ref24","first-page":"1","article-title":"ShuffleWatcher: Shuffle-aware scheduling in multi-tenant MapReduce clusters","volume-title":"Proc. USENIX Annu. Tech. Conf.","author":"Ahmad"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/167088.167266"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/2814576.2814808"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.14778\/2536206.2536213"},{"key":"ref28","first-page":"90","volume-title":"Computers and Intractability: A Guide To the Theory of NP-completeness","author":"Michael","year":"1979"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539796308217"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827593255135"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973068.102"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1970.tb01770.x"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/ICPPW.2012.57"}],"container-title":["IEEE Transactions on Networking"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/10723154\/11311125\/11048391.pdf?arnumber=11048391","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,23]],"date-time":"2025-12-23T06:27:13Z","timestamp":1766471233000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11048391\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12]]},"references-count":33,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/ton.2025.3578455","relation":{},"ISSN":["2998-4157"],"issn-type":[{"type":"electronic","value":"2998-4157"}],"subject":[],"published":{"date-parts":[[2025,12]]}}}