Multicast Routing Algorithms With Constraints In Networks

With the development of communication, Multicasting technology is becoming akey requirement of computer networks supporting multimedia application. Multicastconsists of concurrently sending the same information from a source to a subset of allpossible destinations in computer network. Tree construction is a commonly usedapproach in solving the multicast routing problem with constraints. This paper centerson the algorithms to construct low cost multicast routing trees with QoS (Quality ofService) requirements. Now, researches on multicast routing algorithm mainly focus on multicastingalgorithm without constraints and delay-constrained multicast routing. In this thesis,firstly, the existing heuristic algorithms for Steiner tree problem are summarized;Secondly, a research and analysis is made on the multicast trees that satisfy QoSrequirement and a fast routing algorithm for delay-constrained low-cost multicast ispresented. Through simulation, we find that the proposed algorithm is simple and canget the low-cost tee in polynomial time. At last, the multicast routing and wavelengthassignment in WDM optical networks is studied; a routing and wavelength assignmentin WDM all-optical networks is presented. This algorithm bases on the wavelengthgraph that Chlamtac presents and deals with routing and wavelength assignment as aunified process, constructs a minimal cost multicasting tree satisfying delay boundconstraint. Moreover, the algorithm avoids high complexity common to mostdelay-constrained heuristics.