A Faster Delay-constrained Multicast Routing Algorithm

Since entering the 21st century, computer network technology has developed rapidly and a variety of application of networks have emerged one by one. Broadband data applications, such as distance learning,video conferencing,IPTV,online games, pose a challenge on the carrying capacity of the current networks, multicast communication becomes necessary. At the same time, the distributed multimedia applications for bandwidth,delay,delay jitter and packet loss rate have different requirements, which require the existing network to meet the requirement of QoS when they send these real-time multimedia datum. Therefore, multicast routing algorithm for computer networks, which is based on the multi-constrained QoS, becomes an important field of research and a hot topic. As people have more and more high expectations for QoS, we join more and more limiting conditions during the process of building a multicast tree, which makes the problem become a NP-complete problem. To this kind of problem, we can only design different tactics to seek the approximate optimal solution as soon as possible.Tree construction is a commomly used approach in solving the multicast routing problem with delay constraints. In this thesis, we propose a new delay-constrained multicast routing algorithm, that is NDBD(New Dijkstra Based on DCMA)algorithm. This algorithm is based on DDMC algorithm and uses the indicator function and link choice function. The proposed algorithm efficiently guarantees the performance of multicast tree for the optimization of delay and cost, it uses the New Dijkstra algorithm with advantage of low time complexity and easy operation in real system.