| Abstract: | An improved heuristic algorithm is developed which can optimize the mu lticast routing under the condition that both delay and bandwidth are constraine d. Performance analysis and computer simulation show that the routing mechanism can successfully solve the QoS problem in the case of many-to-many cast sessio n. The scheme can make the cost of routing tree optimized and the bandwidth and en d-to-end delay guaranteed. Because complexity of algorithm is limited, it is suitable to deal with networks of large size. |
