Multicast communication constrained by end-to-end delay and inter-destination delay
variation is known as Delay and Delay Variation Bounded Multicast (DVBM). In this
paper, we propose a dynamic multi-core multicast approach to solve the DVBM problem.
The proposed three-phase algorithm, Multi-core DVBM Trees (MCDVBMT), semi-matches
group members to core nodes. The message is disseminated to group members using trees
rooted at the designated core nodes. MCDVBMT dynamically reorganizes the rooted trees
in response to changes to multicast group members. On average, only 5.2% of the total
requests trigger re-executions and 53.6% of the graphs generated by MCDVBMT suffer
from re-execution before receiving all dynamic requests.
