The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
The problem of computing the bandwidth-delay-constrained least-cost QoS multicast routing is a NP-complete problem. A novel shuffled frog leaping (SFL) algorithm is proposed to deal with the Qos multicast routing problem effectively and efficiently in this paper. The experimental results show that the proposed algorithm can find optimal solution quickly and has a good scalability.
Multicast routing problem arises in many multimedia communication applications, computing the band-width-delay constrained least cost multicast routing tree is an NP-complete problem. In this paper, a novel multicast routing algorithm based on the particle swarm optimization (PSO) algorithm is proposed. The experimental results show that this algorithm has better performance and efficiency.
Multicast routing arises in many multimedia communication applications such as videos conference, remote education, CSCW and so on. In order to resolve Qos multicast routing effectively and efficiently, this paper mainly studied the bandwidth-delay-constrained least-cost multicast routing problem, and present a parallel ant colony algorithm (PACA) to solve the problem. The simulation results show...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.