Abstract
In this paper, we made a detail analysis for the ESAMPH algorithm, and proposed ESAMPH_D algorithm according to the insufficient of ESAMPH algorithm. The ESAMPH_D algorithm does not consider those paths that do not satisfy the delay constraint, so we can ensure that all paths be taken into account will meet the limit of delay constraint, then we find the least costly path in order to build a minimum cost multicast tree. Simulation results show that the algorithm is better than ESAMPH algorithm in performance.
Highlights
Multicasting is a technique of communication that allows transmit information to multiple destination hosts at the same time
From global point of view, optimize network resources can be seen as optimize a multicast routing tree’s total cost, finding a minimum cost multicast routing tree can be formalized as Steiner tree problem
The literature [7] proposed a algorithm named ESAMPH, this algorithm is based on the basic idea of MPH algorithm to construct a multicast tree, compared with other similar algorithms, it takes full advantage of the shared edges to reduce the cost of the spanning tree, it can get a better balance among consideration, delay and computational complexity, it has a better comprehensive performance
Summary
Multicasting is a technique of communication that allows transmit information to multiple destination hosts at the same time. Good multicast routing algorithms are often able to minimize network cost in a short time and meet certain QoS constraints so that we can make use of network resources efficiently. The calculation of CDKS algorithm proposed by literature [6] is much lower than the previous two algorithms, the cost of the spanning tree is too high. The literature [7] proposed a algorithm named ESAMPH, this algorithm is based on the basic idea of MPH algorithm to construct a multicast tree, compared with other similar algorithms, it takes full advantage of the shared edges to reduce the cost of the spanning tree, it can get a better balance among consideration, delay and computational complexity, it has a better comprehensive performance. ZHAO of CDKS algorithm on compute time, based on the algorithm of ESAMPH, proposed an improved multicast routing algorithm, named ESAMPH_D
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
