Abstract
In order to optimize cost and decrease time complexity,the delay-constrained Steiner tree problem was discussed. The implementation of Minimum Path Heuristic (MPH) algorithm was analyzed firstly,then a delay-constrained multicast routing algorithm based on shared edges named ESAMPH was presented. ESAMPH preferentially selected the nodes through which more shortest path was contained when constructing a multicast routing tree,therefore,the next node to the multicast tree may be also the shortest path through these nodes to reduce the cost of multicast tree. Simulation results show that ESAMPH balances cost,delay and computing time and has better overall performance.
Sign-in/Register to access full text options 
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.
