Efficient multicast routing with delay constraints

✍ Scribed by Gang Feng; Tak-Shing Peter Yum

• Publisher: John Wiley and Sons
• Year: 1999
• Tongue: English
• Weight: 333 KB
• Volume: 12
• Category: Article
• ISSN: 1074-5351
• DOI: 10.1002/(sici)1099-1131(199905/06)12:3<181::aid-dac394>3.0.co;2-y

✦ Synopsis

To support real-time multimedia applications in BISDN networks, QoS guaranteed multicast routing is essential. Traditional multicast routing algorithms used for solving the Steiner tree problem cannot be used in this scenario, because QoS constraints on links are not considered. In this paper, we present two e$cient source-based multicast routing algorithms in directed networks. The objective of the routing algorithms is to minimize the multicast tree cost while maintaining a bound on delay. Simulation results show that these two heuristics can greatly improve the multicast tree cost measure in comparison with the shortest path routing schemes. Their performance is close to that of the known CST algorithm proposed by Kompell et al. in Reference 1, but requiring a much shorter computation time.