Multicast routing with delay and delay variation constraints for multimedia applications

Abstract

We provide an efficient heuristic algorithm to obtain a multicast network for multimedia applications, 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 O(|E| + nk log (|E|/n) + m2k), where n and |E| are the number of nodes and edges in the network, respectively and k is the number of shortest paths computed and m is the number of destinations. We have shown that our algorithm has significant improvements in term of time-complexity compared with the existing algorithms. Our extensive empirical studies indicate that our heuristic uses significantly less run-time in comparison with the best-known heuristics and yet achieves the tightest delay variation for a given end-to-end delay bound. © Springer-Verlag Berlin Heidelberg 2004.