Abstract
Multi-access Edge Computing presents a compelling solution for delivering seamless connectivity to computing services. In this study, we aim to optimize multicast throughput to ensure high-quality experiences for passengers engaged in inter-train interactions within dedicated MEC networks designed for high-speed railways. Considering the unique challenges associated with high-speed railways, we model multicast routing paths as group Steiner trees. Subsequently, we devise a rapid tree construction method by converting the root search into the Generalized Assignment Problem (GAP). This innovative approach skillfully balances accuracy and computational efficiency. We demonstrate that this problem can be effectively reduced to the bounded knapsack problem with setups. In addition, we recognize the presence of precedence constraints between tasks and their respective outcomes. Consequently, we introduce a new variant of the knapsack problem, which we refer to as the Precedence-constrained Bounded Knapsack Problem with Setups. Our approach, termed the GAP- and knapsack-based Group Steiner Tree (GKGST), offers a relative performance guarantee of 1/2. We evaluate the GKGST algorithm against three baseline algorithms, which are adapted and extended from existing literature. Simulation results indicate that our proposed algorithm exhibits considerable potential for enhanced performance.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Babu, S., Parthiban, A.R.K.: DTMR: an adaptive distributed tree-based multicast routing protocol for vehicular networks. Comput. Stand. Interfaces 79, 103551 (2022)
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)
Cohen, R., Katzir, L., Raz, D.: An efficient approximation for the generalized assignment problem. Inf. Process. Lett. 100(4), 162–166 (2006)
Dijkstra, E.W.: A note on two problems in connexion with graphs. In: Edsger Wybe Dijkstra: His Life, Work, and Legacy, pp. 287–290 (2022)
Duin, C., Volgenant, A., Voß, S.: Solving group Steiner problems as Steiner problems. Eur. J. Oper. Res. 154(1), 323–329 (2004)
Gao, M., et al.: Efficient hybrid beamforming with anti-blockage design for high-speed railway communications. IEEE Trans. Veh. Technol. 69(9), 9643–9655 (2020)
Garg, N., Konjevod, G., Ravi, R.: A polylogarithmic approximation algorithm for the group Steiner tree problem. J. Algorithms 37(1), 66–84 (2000)
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)
Kellerer, H., Pferschy, U., Pisinger, D.: Knapsack Problems. Springer, Berlin, Heidelberg (2004)
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–6. IEEE (2020)
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–1354. IEEE (2021)
Li, L., et al.: Resource allocation and computation offloading in a millimeter-wave train-ground network (early access). IEEE Trans. Veh. Technol. 71, 1–16 (2022)
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)
Liu, T., Liao, W.: Multicast routing in multi-radio multi-channel wireless mesh networks. IEEE Trans. Wireless Commun. 9(10), 3031–3039 (2010)
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–407 (2019)
Nutov, Z., Beniaminy, I., Yuster, R.: A (1–1/e)-approximation algorithm for the generalized assignment problem. Oper. Res. Lett. 34(3), 283–288 (2006)
Parsa, M., Zhu, Q., Garcia-Luna-Aceves, J.: An iterative algorithm for delay-constrained minimum-cost multicasting. IEEE/ACM Trans. Networking 6(4), 461–474 (1998)
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–2066 (2020)
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–1149 (2021)
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/
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–9449 (2021)
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–9539 (2021)
Zhang, X., Wang, Y., Geng, G., Yu, J.: Delay-optimized multicast tree packing in software-defined networks. IEEE Trans. Serv. Comput. 16(1), 261–275 (2021)
Acknowledgement
This work was supported in part by the Natural Science Foundation of Anhui Province, China under Grant 2108085MF202, in part by the National Natural Science Foundation of China under Grant 62002097, and in part by the Fundamental Research Funds for the Central Universities of China under Grant PA2023GDGP0044.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2024 ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering
About this paper
Cite this paper
Xu, J., Wei, Z., Yuan, X., Lyu, Z., Feng, L., Han, J. (2024). Delay-Constrained Multicast Throughput Maximization in MEC Networks for High-Speed Railways. In: Gao, H., Wang, X., Voros, N. (eds) Collaborative Computing: Networking, Applications and Worksharing. CollaborateCom 2023. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 563. Springer, Cham. https://doi.org/10.1007/978-3-031-54531-3_17
Download citation
DOI: https://doi.org/10.1007/978-3-031-54531-3_17
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-54530-6
Online ISBN: 978-3-031-54531-3
eBook Packages: Computer ScienceComputer Science (R0)