Multicast routing with delay and delay variation constraints for collaborative applications on overlay networks

An efficient heuristic is provided 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. Extensive empirical studies show that the heuristic uses considerably less runtime in comparison with the best-known heuristic while achieving the tightest delay variation for a given end-to-end delay bound.