Abstract

Multicast routing is establishing a tree which is rooted from the source node and contains all the multicast destinations. A delay bounded routing tree is a tree in which the accumulated delay from the source node to any destination along the tree does not exceed a pre-specified bound. This paper presents a distributed routing protocol which constructs delay bounded routing trees for real-time multicast connections. A constructed routing tree has a near optimal network cost under the delay bound constraint. The proposed algorithm is fully distributed, efficient in terms of the number of messages required, and flexible in multicast membership changes. A large number of simulations have been done to show the network cost of the routing trees generated by our method is better than the other major existing algorithms.

Author Keywords: Multicast routing; Delay bounded routing; Distributed routing; Real-time communication

Article Outline

1. Introduction

2. System model and problem specification

2.1. Real-time multicast routing

2.2. Related work

3. Our protocol of multicast tree construction

3.1. Assumptions and basic idea

3.2. The protocol details

3.3. Cost analysis

3.4. Dynamic multicast membership changes

4. Simulations

5. Conclusions

References

Vitae