A new delay constrained multicast routing algorithm

Multicast service with Quality of Service(QoS) guarantees is critical to real-time internet applications such as tele-education and tele-conferencing. The QoS-aware multicast routing protocols have to find a sourced-based tree with the end to end QoS bounds and the minimal network resource consuming. The Delay Constrained Steiner Tree problem(DCST) is one of the key issues. In this paper, we present a new algorithm for CST. The core of our algorithm called Reverse-Adjusting Course (RAP) is proposed to adjust the paths violating the delay constraint at the same time keep the modification to the spanning tree as little as possible. The simulation shows that our algorithm is efficient for actual networks.