| Abstract: | In this paper we propose a QoS‐based routing algorithm for dynamic multicasting. The complexity of the problem can be reduced to a simple shortest path problem by applying a Weighted Fair Queuing (WFQ) service discipline. Using a modified Bellman–Ford algorithm, the proposed routing builds a multicast tree, where a node is added to the existing multicast tree without re‐routing and satisfying QoS constraints. With user defined life‐time of connection this heuristic algorthm builds multicast tree which is near optimum over the whole duration of session. Simulation results show that tree costs are nearly as good as other dynamic multicast routings that does not consider QoS. Copyright © 2003 John Wiley & Sons, Ltd. |
