{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T16:40:22Z","timestamp":1743093622282,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031545306"},{"type":"electronic","value":"9783031545313"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-54531-3_17","type":"book-chapter","created":{"date-parts":[[2024,2,22]],"date-time":"2024-02-22T07:06:29Z","timestamp":1708585589000},"page":"308-328","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Delay-Constrained Multicast Throughput Maximization in\u00a0MEC Networks for\u00a0High-Speed Railways"],"prefix":"10.1007","author":[{"given":"Junyi","family":"Xu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhenchun","family":"Wei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaohui","family":"Yuan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zengwei","family":"Lyu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lin","family":"Feng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianghong","family":"Han","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,2,23]]},"reference":[{"key":"17_CR1","doi-asserted-by":"publisher","first-page":"103551","DOI":"10.1016\/j.csi.2021.103551","volume":"79","author":"S Babu","year":"2022","unstructured":"Babu, S., Parthiban, A.R.K.: DTMR: an adaptive distributed tree-based multicast routing protocol for vehicular networks. Comput. Stand. Interfaces 79, 103551 (2022)","journal-title":"Comput. Stand. Interfaces"},{"key":"17_CR2","doi-asserted-by":"publisher","first-page":"105693","DOI":"10.1016\/j.cor.2021.105693","volume":"143","author":"V Cacchiani","year":"2022","unstructured":"Cacchiani, V., Iori, M., Locatelli, A., Martello, S.: Knapsack problems-an overview of recent advances. Part II: multiple, multidimensional, and quadratic knapsack problems. Comput. Oper. Res. 143, 105693 (2022)","journal-title":"Comput. Oper. Res."},{"issue":"4","key":"17_CR3","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1016\/j.ipl.2006.06.003","volume":"100","author":"R Cohen","year":"2006","unstructured":"Cohen, R., Katzir, L., Raz, D.: An efficient approximation for the generalized assignment problem. Inf. Process. Lett. 100(4), 162\u2013166 (2006)","journal-title":"Inf. Process. Lett."},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"Dijkstra, E.W.: A note on two problems in connexion with graphs. In: Edsger Wybe Dijkstra: His Life, Work, and Legacy, pp. 287\u2013290 (2022)","DOI":"10.1145\/3544585.3544600"},{"issue":"1","key":"17_CR5","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/S0377-2217(02)00707-5","volume":"154","author":"C Duin","year":"2004","unstructured":"Duin, C., Volgenant, A., Vo\u00df, S.: Solving group Steiner problems as Steiner problems. Eur. J. Oper. Res. 154(1), 323\u2013329 (2004)","journal-title":"Eur. J. Oper. Res."},{"issue":"9","key":"17_CR6","doi-asserted-by":"publisher","first-page":"9643","DOI":"10.1109\/TVT.2020.3000757","volume":"69","author":"M Gao","year":"2020","unstructured":"Gao, M., et al.: Efficient hybrid beamforming with anti-blockage design for high-speed railway communications. IEEE Trans. Veh. Technol. 69(9), 9643\u20139655 (2020)","journal-title":"IEEE Trans. Veh. Technol."},{"issue":"1","key":"17_CR7","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1006\/jagm.2000.1096","volume":"37","author":"N Garg","year":"2000","unstructured":"Garg, N., Konjevod, G., Ravi, R.: A polylogarithmic approximation algorithm for the group Steiner tree problem. J. Algorithms 37(1), 66\u201384 (2000)","journal-title":"J. Algorithms"},{"key":"17_CR8","first-page":"100488","volume":"36","author":"AJ Kadhim","year":"2022","unstructured":"Kadhim, A.J., Seno, S.A.H., Naser, J.I., Hajipour, J.: DMPFS: delay-efficient multicasting based on parked vehicles, fog computing and SDN in vehicular networks. Veh. Commun. 36, 100488 (2022)","journal-title":"Veh. Commun."},{"key":"17_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24777-7","volume-title":"Knapsack Problems","author":"H Kellerer","year":"2004","unstructured":"Kellerer, H., Pferschy, U., Pisinger, D.: Knapsack Problems. Springer, Berlin, Heidelberg (2004)"},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"Keshavamurthy, P., Pateromichelakis, E., Dahlhaus, D., Zhou, C.: Resource scheduling for V2V communications in co-operative automated driving. In: 2020 IEEE Wireless Communications and Networking Conference (WCNC), pp. 1\u20136. IEEE (2020)","DOI":"10.1109\/WCNC45663.2020.9120846"},{"key":"17_CR11","doi-asserted-by":"crossref","unstructured":"Li, H., et al.: Mobility-aware predictive computation offloading and task scheduling for mobile edge computing networks. In: 2021 7th International Conference on Computer and Communications (ICCC), pp. 1349\u20131354. IEEE (2021)","DOI":"10.1109\/ICCC54389.2021.9674671"},{"key":"17_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TVT.2022.3185331","volume":"71","author":"L Li","year":"2022","unstructured":"Li, L., et al.: Resource allocation and computation offloading in a millimeter-wave train-ground network (early access). IEEE Trans. Veh. Technol. 71, 1\u201316 (2022)","journal-title":"IEEE Trans. Veh. Technol."},{"key":"17_CR13","doi-asserted-by":"publisher","first-page":"108646","DOI":"10.1016\/j.automatica.2019.108646","volume":"112","author":"S Li","year":"2020","unstructured":"Li, S., Yang, L., Gao, Z.: Distributed optimal control for multiple high-speed train movement: an alternating direction method of multipliers. Automatica 112, 108646 (2020)","journal-title":"Automatica"},{"issue":"10","key":"17_CR14","doi-asserted-by":"publisher","first-page":"3031","DOI":"10.1109\/TWC.2010.082310.090568","volume":"9","author":"T Liu","year":"2010","unstructured":"Liu, T., Liao, W.: Multicast routing in multi-radio multi-channel wireless mesh networks. IEEE Trans. Wireless Commun. 9(10), 3031\u20133039 (2010)","journal-title":"IEEE Trans. Wireless Commun."},{"issue":"2","key":"17_CR15","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1109\/TPDS.2019.2937524","volume":"31","author":"Y Ma","year":"2019","unstructured":"Ma, Y., Liang, W., Wu, J., Xu, Z.: Throughput maximization of NFV-enabled multicasting in mobile edge cloud networks. IEEE Trans. Parallel Distrib. Syst. 31(2), 393\u2013407 (2019)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"3","key":"17_CR16","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/j.orl.2005.05.006","volume":"34","author":"Z Nutov","year":"2006","unstructured":"Nutov, Z., Beniaminy, I., Yuster, R.: A (1\u20131\/e)-approximation algorithm for the generalized assignment problem. Oper. Res. Lett. 34(3), 283\u2013288 (2006)","journal-title":"Oper. Res. Lett."},{"issue":"4","key":"17_CR17","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1109\/90.720901","volume":"6","author":"M Parsa","year":"1998","unstructured":"Parsa, M., Zhu, Q., Garcia-Luna-Aceves, J.: An iterative algorithm for delay-constrained minimum-cost multicasting. IEEE\/ACM Trans. Networking 6(4), 461\u2013474 (1998)","journal-title":"IEEE\/ACM Trans. Networking"},{"issue":"9","key":"17_CR18","doi-asserted-by":"publisher","first-page":"2050","DOI":"10.1109\/TPDS.2020.2983918","volume":"31","author":"H Ren","year":"2020","unstructured":"Ren, H., et al.: Efficient algorithms for delay-aware NFV-enabled multicasting in mobile edge clouds with resource sharing. IEEE Trans. Parallel Distrib. Syst. 31(9), 2050\u20132066 (2020)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"7","key":"17_CR19","doi-asserted-by":"publisher","first-page":"1137","DOI":"10.14778\/3450980.3450982","volume":"14","author":"Y Sun","year":"2021","unstructured":"Sun, Y., Xiao, X., Cui, B., Halgamuge, S., Lappas, T., Luo, J.: Finding group Steiner trees in graphs with both vertex and edge weights. Proc. VLDB Endowment 14(7), 1137\u20131149 (2021)","journal-title":"Proc. VLDB Endowment"},{"key":"17_CR20","unstructured":"Institute of Technology, G.: Georgia tech internetwork topology models (GT-ITM) is a network topology generate tool (2023). https:\/\/www.cc.gatech.edu\/projects\/gtitm\/"},{"issue":"9","key":"17_CR21","doi-asserted-by":"publisher","first-page":"9437","DOI":"10.1109\/TVT.2021.3099525","volume":"70","author":"J Xiong","year":"2021","unstructured":"Xiong, J., Xie, H., Liu, B., Li, B., Gui, L.: Cooperative caching services on high-speed train by reverse auction. IEEE Trans. Veh. Technol. 70(9), 9437\u20139449 (2021)","journal-title":"IEEE Trans. Veh. Technol."},{"issue":"9","key":"17_CR22","doi-asserted-by":"publisher","first-page":"9525","DOI":"10.1109\/TVT.2021.3101571","volume":"70","author":"J Xu","year":"2021","unstructured":"Xu, J., Wei, Z., Lyu, Z., Shi, L., Han, J.: Throughput maximization of offloading tasks in multi-access edge computing networks for high-speed railways. IEEE Trans. Veh. Technol. 70(9), 9525\u20139539 (2021)","journal-title":"IEEE Trans. Veh. Technol."},{"issue":"1","key":"17_CR23","first-page":"261","volume":"16","author":"X Zhang","year":"2021","unstructured":"Zhang, X., Wang, Y., Geng, G., Yu, J.: Delay-optimized multicast tree packing in software-defined networks. IEEE Trans. Serv. Comput. 16(1), 261\u2013275 (2021)","journal-title":"IEEE Trans. Serv. Comput."}],"container-title":["Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","Collaborative Computing: Networking, Applications and Worksharing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-54531-3_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,22]],"date-time":"2024-02-22T07:18:02Z","timestamp":1708586282000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-54531-3_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031545306","9783031545313"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-54531-3_17","relation":{},"ISSN":["1867-8211","1867-822X"],"issn-type":[{"type":"print","value":"1867-8211"},{"type":"electronic","value":"1867-822X"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"23 February 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CollaborateCom","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Collaborative Computing: Networking, Applications and Worksharing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Corfu","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 October 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 October 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"colcom2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Cony +","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"176","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"72","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"41% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}