Abstract
Multicast routing problem is a well know optimization problem for transmitting real-time multimedia applications in telecommunication networks. As the underpinning mathematical model, the constrained minimum Steiner tree problem in graphs is a well-known NP-complete problem. In this paper we investigate a new hybrid GRASP (Greedy Randomized Adaptive Search Procedure) approach where a pilot method is applied to further enhance the search for the Delay-Constrained Least-Cost (DCLC) multicast routing problem. Experimental results demonstrate the efficiency of the hybrid GRASP algorithm and the contributions of the post-processing pilot method to better solutions in most cases. The proposed GRASP approach is a competitive approach in solving the DCLC multicast routing problem.
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.
