An efficient distributed multicast routing protocol with delay and delay variation constraints
T. Siva Prasad, R. C. Hansdah · 2002
Multicast routing consists of a tree which is rooted at the source node and contains all the multicast destinations. We study the problem of constructing a multicast tree that satisfies end-to-end delay along the paths from the source to each destination and bounded variations among the delays along these paths. The proposed protocol is distributed in nature, efficient in terms of complexity, and flexible in dealing with dynamic multicast membership changes. The routing tree so constructed has near optimal network cost.