DVBMN-l: delay variation bounded multicast network with multiple paths

Distributed Multi-party/Multi-stream systems require a multicast subnetwork capable of satisfying QoS constraints such as delay and delay variation bound so that the messages reach each destination node at almost the same time within a certain specified time limit. In addition, certain multi-stream systems also demand that different streams for each different destination node should reach with minimum delay variation. So, we propose the problem of minimizing both inter-destination and intra-destination delay variation along with the maximum delay bound and present efficient heuristic solution that achieves the tightest possible combined bound. This problem is NP-complete as shown in the literature. Computer simulation results approve that our heuristic is efficient with a low running time and the tightest combined delay variation.