{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,7]],"date-time":"2025-11-07T09:50:46Z","timestamp":1762509046432,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":18,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,10,2]],"date-time":"2023-10-02T00:00:00Z","timestamp":1696204800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,10,6]]},"DOI":"10.1145\/3615587.3615986","type":"proceedings-article","created":{"date-parts":[[2023,9,5]],"date-time":"2023-09-05T14:43:17Z","timestamp":1693924997000},"page":"19-24","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["NDRA"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-8063-1103","authenticated-orcid":false,"given":"Xinghai","family":"Wei","sequence":"first","affiliation":[{"name":"Beijing University of Posts and Telecommunication, China, Beijing"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4456-7987","authenticated-orcid":false,"given":"Jie","family":"Yuan","sequence":"additional","affiliation":[{"name":"Beijing University of Posts and Telecommunication, China, Beijing"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5597-9306","authenticated-orcid":false,"given":"Xiaoyong","family":"Li","sequence":"additional","affiliation":[{"name":"Beijing University of Posts and Telecommunication, China, Beijing"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6559-9745","authenticated-orcid":false,"given":"Dongxiao","family":"Liu","sequence":"additional","affiliation":[{"name":"Beijing University of Posts and Telecommunication, China, Beijing"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,10,2]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2018.2862404"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/mwc.2015.7096297"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.720870"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2017.2782482"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2018.2837161"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/35.809386"},{"key":"e_1_3_2_1_7_1","volume-title":"Traffic engineering with mpls in the internet","author":"Xiao Xipeng","year":"2000","unstructured":"Xipeng Xiao , Alan Hannan , Brook Bailey , and Lionel M Ni . Traffic engineering with mpls in the internet . IEEE network, 14(2): 28--33, 2000 . Xipeng Xiao, Alan Hannan, Brook Bailey, and Lionel M Ni. Traffic engineering with mpls in the internet. IEEE network, 14(2): 28--33, 2000."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2020.07.005"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2017.2749760"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2014.2366762"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2022.3189832"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2015.12.007"},{"key":"e_1_3_2_1_13_1","volume-title":"IEEE International Conference on Computer Communications, 2:  743--749","author":"Liu Gang","year":"2001","unstructured":"Gang Liu and K. G. Ramakrishnan . Aprune: an algorithm for finding k shortest paths subject to multiple constraints . IEEE International Conference on Computer Communications, 2: 743--749 , 2001 . Gang Liu and K. G. Ramakrishnan. Aprune: an algorithm for finding k shortest paths subject to multiple constraints. IEEE International Conference on Computer Communications, 2: 743--749, 2001."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2001.916274"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2014.2382602"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2019.2951593"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2022.07.087"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2015.7218434"}],"event":{"name":"ACM MobiCom '23: The 29th Annual International Conference on Mobile Computing and Networking","sponsor":["SIGMOBILE ACM Special Interest Group on Mobility of Systems, Users, Data and Computing"],"location":"Madrid Spain","acronym":"ACM MobiCom '23"},"container-title":["Proceedings of the 18th Workshop on Mobility in the Evolving Internet Architecture"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3615587.3615986","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3615587.3615986","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:45:47Z","timestamp":1750178747000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3615587.3615986"}},"subtitle":["An Efficient Multi-Objective Optimal Routing Algorithm Using Pareto Domination"],"short-title":[],"issued":{"date-parts":[[2023,10,2]]},"references-count":18,"alternative-id":["10.1145\/3615587.3615986","10.1145\/3615587"],"URL":"https:\/\/doi.org\/10.1145\/3615587.3615986","relation":{},"subject":[],"published":{"date-parts":[[2023,10,2]]},"assertion":[{"value":"2023-10-02","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}