{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,31]],"date-time":"2026-01-31T13:48:20Z","timestamp":1769867300497,"version":"3.49.0"},"reference-count":94,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"National Key Research and Development Program of China","award":["2023YFB2904600"],"award-info":[{"award-number":["2023YFB2904600"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Netw. Sci. Eng."],"published-print":{"date-parts":[[2026]]},"DOI":"10.1109\/tnse.2026.3654163","type":"journal-article","created":{"date-parts":[[2026,1,14]],"date-time":"2026-01-14T20:40:58Z","timestamp":1768423258000},"page":"5978-5991","source":"Crossref","is-referenced-by-count":0,"title":["Location Matters: LLM-Guided Joint Optimization of In-Network Aggregation Placement and Routing for DML Workloads"],"prefix":"10.1109","volume":"13","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1028-8178","authenticated-orcid":false,"given":"Long","family":"Luo","sequence":"first","affiliation":[{"name":"University of Electronic Science and Technology of China, Chengdu, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yanan","family":"Huang","sequence":"additional","affiliation":[{"name":"University of Electronic Science and Technology of China, Chengdu, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xixi","family":"Chen","sequence":"additional","affiliation":[{"name":"University of Electronic Science and Technology of China, Chengdu, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yongsheng","family":"Zhao","sequence":"additional","affiliation":[{"name":"University of Electronic Science and Technology of China, Chengdu, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5219-1780","authenticated-orcid":false,"given":"Hongfang","family":"Yu","sequence":"additional","affiliation":[{"name":"University of Electronic Science and Technology of China, Chengdu, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6872-8821","authenticated-orcid":false,"given":"Schahram","family":"Dustdar","sequence":"additional","affiliation":[{"name":"Distributed Systems Group, TU Wien, Vienna, Austria"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2025.3570202"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2024.3414628"},{"key":"ref3","first-page":"1","article-title":"Efficient large-scale language model training on GPU clusters using megatron-LM","volume-title":"Proc. Int. Conf. High Perform. Comput. Netw., Storage Anal.","author":"Narayanan","year":"2021"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TSC.2023.3304312"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/3651890.3672233"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2025.3567535"},{"key":"ref7","first-page":"1","article-title":"Which cluster meets my deadline: A budget-aware scheduler for distributed training jobs in heterogeneous environments","volume-title":"Proc. IEEE Int. Conf. Commun.","author":"Yuchen","year":"2025"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/3648358"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM55648.2025.11044657"},{"key":"ref10","first-page":"537","article-title":"$\\lbrace$ZEN$\\rbrace$: Empowering distributed training with sparsity-driven data synchronization","volume-title":"Proc. 19th USENIX Symp. Operating Syst. Des. Implementation (OSDI 25)","author":"Wang","year":"2025"},{"key":"ref11","first-page":"785","article-title":"Scaling distributed machine learning with in-network aggregation","volume-title":"Proc. Symp. Netw. Syst. Des. Implementation","author":"Sapio","year":"2021"},{"key":"ref12","first-page":"741","article-title":"ATP: In-network aggregation for multi-tenant learning","volume-title":"Proc. Symp. Netw. Syst. Des. Implementation","author":"Lao","year":"2021"},{"key":"ref13","article-title":"Communication-efficient large-scale distributed deep learning: A comprehensive survey","author":"Liang","year":"2024"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TSC.2024.3506480"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2024.3459021"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2024.3412429"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.comcom.2022.11.004"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TON.2025.3578180"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2024.3423380"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/MNET.2024.3368138"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/3699514"},{"key":"ref22","first-page":"233","article-title":"Accelerating distributed graph learning by using collaborative $\\lbrace$In-Network$\\rbrace$ multicast and aggregation","volume-title":"Proc. USENIX Annu. Tech. Conf. (USENIX ATC 25)","author":"Li","year":"2025"},{"key":"ref23","article-title":"Barefoot tofino","year":"2025"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2023.3244794"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2024.3387948"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/3589334.3645394"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ICCCN58024.2023.10230140"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ICNP59255.2023.10355636"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2025.3525604"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2025.111407"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/3582016.3582037"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM53939.2023.10228956"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/ICNP59255.2023.10355574"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/ICNP59255.2023.10355574"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2024.3523420"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2024.3441039"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TSC.2023.3309318"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/3735358.3737817"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/3624354.3630090"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2025.3595747"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2024.3414853"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1145\/3617232.3624863"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM48880.2022.9796980"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/ICC45041.2023.10279253"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/IWQoS57198.2023.10188783"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/TON.2025.3535707"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/ICCT62411.2024.10946583"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/IWQoS61813.2024.10682850"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1145\/3152434.3152461"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/COMHPC.2016.006"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-50743-5_3"},{"key":"ref52","first-page":"829","article-title":"In-network aggregation for shared machine learning clusters","volume":"3","author":"Gebara","year":"2021","journal-title":"MLSys"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM55648.2025.11044680"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1145\/3552326.3587436"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/TON.2025.3526228"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/MNET.2024.3511662"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2025.3584698"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1109\/TCCN.2025.3612760"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2025.3568248"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2025.3528955"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-96-3538-2_13"},{"key":"ref62","article-title":"Large language model agent for hyper-parameter optimization","author":"Liu","year":"2024"},{"key":"ref63","first-page":"1","article-title":"Large language models as optimizers","volume-title":"Proc. 12th Int. Conf. Learn. Representations","author":"Yang","year":"2023"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2024.129272"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2024.101741"},{"key":"ref66","first-page":"68589","article-title":"Using imperfect surrogates for downstream inference: Design-based supervised learning for social science applications of large language models","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"36","author":"Egami","year":"2023"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2024.findings-acl.627"},{"key":"ref68","article-title":"Capturing formulation design of battery electrolytes with chemical large language model","volume-title":"Proc. AI Accelerated Mater. Des.-NeurIPS 2023 Workshop","author":"Soares","year":"2023"},{"key":"ref69","article-title":"A sober look at llms for material discovery: Are they actually good for Bayesian optimization over molecules?","author":"Kristiadi","year":"2024"},{"key":"ref70","article-title":"Large language model-enhanced algorithm selection: Towards comprehensive algorithm representation","author":"Wu","year":"2023"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.1109\/iwcmc61514.2024.10592370"},{"key":"ref72","doi-asserted-by":"publisher","DOI":"10.1007\/s12145-024-01463-8"},{"key":"ref73","first-page":"32201","article-title":"Evolution of heuristics: Towards efficient automatic algorithm design using large language model","volume-title":"Proc. 41st Int. Conf. Mach. Learn.","author":"Liu","year":"2024"},{"key":"ref74","doi-asserted-by":"publisher","DOI":"10.1007\/s10710-024-09494-2"},{"key":"ref75","doi-asserted-by":"publisher","DOI":"10.1038\/s41586-023-06924-6"},{"key":"ref76","article-title":"Eureka: Human-level reward design via coding large language models","author":"Ma","year":"2023"},{"key":"ref77","doi-asserted-by":"publisher","DOI":"10.1145\/3638530.3664181"},{"key":"ref78","doi-asserted-by":"publisher","DOI":"10.1109\/SMC53992.2023.10394233"},{"key":"ref79","article-title":"Funbo: Discovering acquisition functions for bayesian optimization with funsearch","author":"Aglietti","year":"2024"},{"key":"ref80","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v39i25.34922"},{"key":"ref81","first-page":"43571","article-title":"Reevo: Large language models as hyper-heuristics with reflective evolution","volume":"37","author":"Ye","year":"2024","journal-title":"in Proc. Adv. Neural Inf. Process. Syst."},{"key":"ref82","doi-asserted-by":"publisher","DOI":"10.1007\/s10586-024-04654-6"},{"key":"ref83","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2024.3497793"},{"key":"ref84","doi-asserted-by":"publisher","DOI":"10.1109\/CEC60901.2024.10611913"},{"key":"ref85","article-title":"Algorithm evolution using large language model","author":"Liu","year":"2023"},{"key":"ref86","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v39i25.34898"},{"key":"ref87","doi-asserted-by":"publisher","DOI":"10.1145\/3711896.3736923"},{"key":"ref88","article-title":"Generalizable heuristic generation through large language models with meta-optimization","author":"Shi","year":"2025"},{"key":"ref89","article-title":"LLMs can schedule","author":"Abgaryan","year":"2024"},{"key":"ref90","doi-asserted-by":"publisher","DOI":"10.1109\/tfuzz.2025.3650586"},{"key":"ref91","article-title":"Heuragenix: Leveraging llms for solving complex combinatorial optimization challenges","author":"Yang","year":"2025"},{"key":"ref92","article-title":"Ai-copilot for business optimisation: A framework and a case study in production scheduling","author":"Amarasinghe","year":"2023"},{"key":"ref93","doi-asserted-by":"publisher","DOI":"10.52202\/079017-4150"},{"key":"ref94","article-title":"Llm4ad: A platform for algorithm design with large language model","author":"Liu","year":"2024"}],"container-title":["IEEE Transactions on Network Science and Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/6488902\/11264281\/11352983.pdf?arnumber=11352983","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,30]],"date-time":"2026-01-30T21:04:44Z","timestamp":1769807084000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11352983\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"references-count":94,"URL":"https:\/\/doi.org\/10.1109\/tnse.2026.3654163","relation":{},"ISSN":["2327-4697","2334-329X"],"issn-type":[{"value":"2327-4697","type":"electronic"},{"value":"2334-329X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]}}}