Forwarding state scalability-aware multicast routing

Multicast routing protocols today still scale poorly to a large number of concurrent multicast sessions in terms of forwarding states. Unlike previous approaches which concentrated on reducing forwarding states after constructing multicast trees, our approach is to make the underlying routing algorithms aware of the scalability requirement. This scalability-aware approach can be applied to many existing multicast state reduction methods, such as aggregated multicast (AM) and dynamic tunnel multicast (DTM). We have formulated both AM-aware and DTM-aware routing problems as multicriteria optimization problems, and proposed algorithms to solve them.