Title: Multicast Routing for Multimedia Communication

Authors: V.P. Kompella, J.C. Pasquale, G.C. Polyzos
Computer Systems Laboratory, Jan. 28, 1993.

Publication status: IEEE/ACM Transactions on Networking

Abstract:

We present heuristics for multicast tree construction for communication
that depends on:
  (i) bounded end-to-end delay along the paths from source to each destination,
and
  (ii) minimum cost of the multicast tree, where edge cost and edge delay
       can be independent metrics.
This problem of computing such a constrained multicast tree is NP-complete.
We show that the heuristics demonstrate good average case behavior in terms
of cost, as determined through simulations on a large number of graphs.