In this paper, we study the problem of QoS group communication in a heterogeneous network, which consists of multiple MANETs attached to the backbone Internet. We propose a heuristic multicast algorithm called DDVMA (Delay and Delay Variation Multicast Algorithm). DDVMA is designed for solving the DVBMT (Delay- and delay Variation-Bounded Multicast Tree) problem , which has been proved to be NP-complete. It can find a multicast tree satisfying the multicast end-to-end delay constraint and minimizing the multicast delay variation. Two concepts- the proprietary second shortest path and partially proprietary second shortest path are introduced, which can help DDVMA achieve better performance in terms of the multicast delay variation than DDVCA (Delay and Delay Variation Constraint Algorithm)  that is known to be the most efficient so far. Theoretical analysis is given to show the correctness of DDVMA and simulations are performed to demonstrate the performance of DDVMA in terms of the multicast delay variation.
|Title of host publication||Second International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks, Qshine 2005|
|Publication status||Published - 1 Dec 2005|
|Event||2nd International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks, Qshine 2005 - Orlando,FL, United States|
Duration: 22 Aug 2005 → 23 Aug 2005
|Conference||2nd International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks, Qshine 2005|
|Period||22/08/05 → 23/08/05|
ASJC Scopus subject areas