is an Associate Professor of Computer Science and Engineering at the University of California, San Diego, where he co-directs the UCSD Computer Systems Laboratory. He is also a Senior Fellow at the San Diego Supercomputer Center. He was a recipient of the (1992)

by He
Venue:in 1991, the TRW Faculty Development Award in 1991, and the UCSD Best Teacher in CSE Award in
Add To MetaCart
Results 1 - 1 of 1

Multicast Routing for Multimedia Communication

by Vachaspathi P. Kompella, Joseph C. Pasquale, George C. Polyzos - IEEE/ACM TRANSACTIONS ON NETWORKING , 1993
"... 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 ..."
Abstract - Cited by 171 (9 self) - Add to MetaCart
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.