In dynamic multicasting, destination nodes can join and leave the group during communication session. Rerouting is complex as cell-ordering at ATM switches has to be preserved. We propose a heuristic centralized routing algorithm, which optimizes the total cost of the Steiner tree over the whole session period. We further proposed an algorithm, for constructing QoS constrained multicast route. While joining the existing multicast tree, our algorithm will try to find a lowest cost path, if there exist one, that satisfy various QoS requirements.
展开▼
