Research On Multicast Routing Algorithms

With fast development of network technologies, increase of network bandwidth and processing power makes the network provide more multimedia applications, and also makes the multicast communication that supports "one-to-many", or "many-to-many" become a necessary mode of multimedia services. A fundamental issue in multicast communication is how to determine an efficient multicast routing, and finding simple, effective and robust multicast routing algorithms is unsolved problem in network fields.In Chapter Four, unconstrained multicast routing algorithms are discussed amongwhich one of a MST algorithm-Prim algorithm is improved. As a result, the newalgorithm can solve the delay problem. At last, the algorithm is analyzed.In this paper, the basic concepts about multicast, routing, and multicast routing algorithm are discussed. The implement of multicast routing and the multicast tree are detailedly described. Then multicast routing protocols and multicast routing algorithms are discussed sysmatically. Furthermore, simulation methods, softwares of random network and multicast routing algorithm are compared. Based on the former discussion, unconstrained multicast routing algorithm and delay-constrained multicast routing algorithm are discussed thoroughly.In Chapter Five, multicast routing based on delay constraint is described. A concept of integrate optimization of multicast routing is put forward, in which both network cost and delay are optimized in a certain degree.Optimzation of the network cost can reduce network resources consumed by communication while optimization of the delay can reduce the delay from source to receivers. Based on KPP algorithm, an edge selection function is also put forward, which can accomplish integrated optimization of multicast routing. An parameter is set in the algorithm, which can adjust optimization level between optimization of network cost and optimization of network delay. This algorithm has low time complexity, and can also be implemented easily. The algorithm's application in distributed environment is put forward too.