Abstract Multi-access Edge Computing presents a compelling solution for delivering
seamless connectivity to computing services. In this study, we aim to optimize multicast …

The rapid expansion of high-speed railways (HSRs) and the growing demand for diverse
data services during long journeys require efficient computing services. Mobile Edge …

Along with the rapid increase of new applications involving multiple participants, such as
metaverse, multicast traffic engineering (TE) has recently attracted significant attention. The …

Multicast communications mean providing transmission of common messages from one
source to all destinations. The multicast end-to-end delay problem explores an upper bound …

Constrained minimum Steiner tree (CMST) problem is a key issue in multicast routing with
quality of service (QoS) support. Bounded shortest path algorithm (BSMA) has been …

Constrained minimum Steiner tree (CMST) problem is a key issue in multicast routing with
quality of service (QoS) support. Many heuristics have been developed to solve this NP …

Abstract Shortest Path Tree (SPT) is the most widely used type of tree for multicast
provisioning due to its simplicity and low per-destination cost. An SPT minimizes the …

The quality of the multicast routing service (QoS) is an NP multi-objective optimization
problem. It is one of the main issues of transmission in communication networks that consist …

Networks deployed in contested environments typically have limited resources and face
many security threads including information leakage. Multicast traffic engineering with …

The bounded shortest multicast algorithm (BSMA) is presented for constructing minimum-
cost multicast trees with delay constraints. The BSMA can handle asymmetric link …