The Community for Technology Leaders
Green Image
<p><b>Abstract</b>—Computer supported collaborative applications on overlay networks are gaining popularity among users who are geographically dispersed. Examples of these kinds of applications include video-conferencing, distributed database replication, and online games. This type of application requires a multicasting subnetwork, using which messages should arrive at the destinations within a specified delay bound. These applications also require that destinations receive the message from the source at approximately the same time. The problem of finding a multicasting subnetwork with delay and delay-variation bound has been proved to be an NP Complete problem in the literature and heuristics have been proposed for this problem. In this paper, we provide an efficient heuristic to obtain a multicast subnetwork on an overlay network, given a source and a set of destinations that is within a specified maximum delay and a specified maximum variation in the delays from a source to the destinations. The time-complexity of our algorithm is <tmath>O(|E| + nk \log(|E|/n) + m^{2}k)</tmath>, where <tmath>n</tmath> and <tmath>|E|</tmath> are the number of nodes and edges in the network, respectively, <tmath>k</tmath> is the number of shortest paths determined, and <tmath>m</tmath> is the number of destinations. We have shown that our algorithm is significantly better in terms of time-complexity than existing algorithms for the same problem. Our extensive empirical studies indicate that our heuristic uses significantly less runtime in comparison with the best-known heuristics while achieving the tightest delay variation for a given end-to-end delay bound.</p>
Multicasting protocols, overlay networks, shortest path.

C. N. Sekharan, S. Radhakrishnan and S. M. Banik, "Multicast Routing with Delay and Delay Variation Constraints for Collaborative Applications on Overlay Networks," in IEEE Transactions on Parallel & Distributed Systems, vol. 18, no. , pp. 421-431, 2007.
96 ms
(Ver 3.3 (11022016))