Multicast in Large Internets
Multicast services will play a key role
in supporting the networked applications of tomorrow, from
video conferencing to distributed databases.
However, designing a wide-area multicast routing scheme that
makes efficient use of network resources while delivering
good performance to applications is a significant challenge.
A variety of schemes have been proposed; some are in use
today in the Internet.
This project investigates the various tradeoffs in multicast
routing algorithms, and factors that influence their performance
in real, large-scale internetworks.
We have developed an
evaluation framework for studying routing algorithms, and
used it to compare the performance of three popular routing algorithms
(DVMRP, PIM, and CBT) in the context of realistic network and application
models.
The framework features a simulation environment for
measuring routing algorithm performance,
realistic random graph models on which to compare the algorithms,
and a visualization tool for networks and multicast routes.
Publications
- Ken Calvert, Ramesh Madhavan, and Ellen W. Zegura.
A Comparison of Two Practical Multicast Routing Schemes,
College of Computing Technical Report GIT-CC-94/25, February 1994.
- Ken Calvert, Ellen W. Zegura, and M. Jeff Donahoo.
"Core Selection Methods for Multicast Routing.",
ICCCN '95, Las Vegas, Nevada.
- M. Jeff Donahoo and Ellen W. Zegura.
"Core Migration for Dynamic Multicast Routing.",
ICCCN '96, Washington, DC.
- M. Jeff Donahoo, Ken Calvert and Ellen W. Zegura.
"Center Selection and Migration for Wide-area
Multicast Routing." Accepted for publication in
Journal of High Speed Networks.
Students
Last updated 1997/05/26 12:18:08.EWZ