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.
In communication networks, the multi-constraint multicast communication is an important way to improve the efficiency of network operation and quality of service. Some heuristic algorithms are applied in solving multicast routing problem under multiple constraints, such as simulated annealing, genetic algorithm, ant colony algorithm and particle swarm optimization algorithm. However, these algorithms...
Computing the multi-constrained least-cost multicast routing tree is an NP-complete problem. In order to solve the quality of service (QoS) constrained routing effectively and efficiently, the scheme of routing based on differential evolution (DE) is proposed. The individuals of the multicast tree which adopt path coding according to the characters of real coding of DE are optimized by mutation and...
The advent of various real-time multimedia applications in high-speed networks creates a need for quality of service (QoS) based multicast routing. Two important QoS constraints are the bandwidth constraint and the end-to-end delay constraint. The QoS based multicast routing problem is a known NP-complete problem that depends on (1) bounded end-to-end delay and link bandwidth along the paths from...
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.