Results 1 
1 of
1
Multicast Routing for Multimedia Communication
 IEEE/ACM TRANSACTIONS ON NETWORKING
, 1993
"... We present heuristics for multicast tree construction for communication that depends on: i) bounded endtoend 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 ..."
Abstract

Cited by 212 (9 self)
 Add to MetaCart
We present heuristics for multicast tree construction for communication that depends on: i) bounded endtoend 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 NPcomplete. We show that the heuristics demonstrate good average case behavior in terms of cost, as determined through simulations on a large number of graphs.