Tunable Multi-Objective Tree Synthesis for Application-Layer Multicast

Karpov, Kirill; Kachan, Dmitry; Kirova, Veronika; Ghermezian, Ali; , Daria

doi:10.25673/122809

Proceedings of International Conference on Applied Innovation in IT · 2025/12/22 · Vol. 13 · Issue 5 · pp. 69 –74

Tunable Multi-Objective Tree Synthesis for Application-Layer Multicast

Kirill Karpov, Dmitry Kachan, Veronika Kirova, Ali Ghermezian, Daria Koshutina and Eduard Siemens

📄 Download PDF DOI: 10.25673/122809

Abstract

Application-layer multicast over wide-area networks must reconcile competing goals: paths should be short while links should offer high capacity and remain stable under variability. This paper presents a method that preserves multi-objective structure and exposes an explicit control of source-to-receiver latency. Edge preferences are derived from round-trip time (RTT) and available bandwidth (AvB) using NSGA-II and a seed tree is obtained by a minimum-spanning construction over the rank matrix. Path length is then constrained by a LAST-style adjustment evaluated in RTT, which guarantees that the distance to every receiver does not exceed a chosen factor α of the RTT shortest path. An equivalent additive budget L is supported for operational use. The approach is implemented with RMDT transport and evaluated on a five-region AWS testbed with active RTT/AvB probing and controlled cross-traffic. The NSGA-II–seeded trees consistently outperform singlemetric baselines, and the latency constraint modifies only those segments that would otherwise incur excessive delay. The result is a monotone, single-parameter knob that lets operators satisfy latency requirements while retaining the performance benefits of multi-objective structure.

Keywords

Application Layer Multicast RMDT NSGA-II Available Bandwidth RTT Minimum Spanning Tree LAST WAN.

References

K. Deb, A. Pratap, S. Agarwal, and T. Meyarivan, “A fast and elitist multiobjective genetic algorithm: NSGA-II,” IEEE Transactions on Evolutionary Computation, vol. 6, no. 2, pp. 182–197, 2002.
S. Khuller, B. Raghavachari, and N. Young, “Balancing minimum spanning trees and shortest-path trees,” Algorithmica, vol. 14, no. 4, pp. 305–321, 1995.
K. Karpov, V. Kirova, N. Mareev, D. Syzov, and E. Siemens, “Data transmission performance enhancement in multi-gigabit wide area networks,” in Advances in Information and Communication Technology and Systems. Cham, Switzerland: Springer, 2021, pp. 161–190.
K. Karpov, D. Kachan, and E. Siemens, “Enhancing application layer multicast using multi-objective optimization techniques,” in Information and Communication Technologies and Sustainable Development. Cham, Switzerland: Springer Nature, 2023, pp. 42–53.
S. Wooders, S. Liu, P. Jain, X. Mo, J. E. Gonzalez, V. Liu, and I. Stoica, “Cloudcast: High-throughput cost-aware overlay multicast in the cloud,” in Proc. 21st USENIX Symp. Networked Systems Design and Implementation (NSDI), 2024, pp. 281–296.
D. Li, Z. Wang, Y. Wei, J. Yao, Y. Tan, Q. Yang, Z. Wang, and X. Cao, “Generation of low-delay and high-stability multicast tree,” Computers, Materials & Continua, vol. 76, no. 1, 2023.
Y. Li, N. Wang, W. Zhang, Q. Liu, and F. Liu, “Discrete artificial fish swarm algorithm-based one-off optimization method for multiple co-existing application layer multicast routing trees,” Electronics, vol. 13, no. 5, 2024.
G. Bijur, M. Ramakrishna, and K. A. Kotegar, “Multicast tree construction algorithm for dynamic traffic on software defined networks,” Scientific Reports, vol. 11, no. 1, Art. no. 23084, 2021.
K. Somasundaram and P. R. Kanna, “Scalable hierarchical balanced clustering-based routing with multipath authentication for secured data transmission in large-scale multicast group communications,” Expert Systems with Applications, vol. 286, Art. no. 128149, 2025.
I. F. Ferreira, M. L. M. Peixoto, and G. B. Figueiredo, “Fairness-oriented multicast routing for distributed interactive applications,” Computer Communications, vol. 219, pp. 229–242, 2024.