Multicast Routing Algorithms Based on Levy Flying Particle Swarm Optimization

4Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Aiming at the problems of bandwidth, network delay and cost in IPv6 multicast routing transmission, a particle swarm optimization multicast routing algorithm (LPSO) based on Levy flight mechanism is proposed to find the optimal path in the multicast tree. In the iteration process, the cost, bandwidth, delay and delay jitter of multicast tree are taken as indexes, and penalty function is combined to constrain the algorithm. Compared with existing multicast routing algorithms, this algorithm improves the global search and meets the requirements of QoS in multicast routing.

Cite

CITATION STYLE

APA

Zhi, C., Cui, J., & Zhu, L. (2020). Multicast Routing Algorithms Based on Levy Flying Particle Swarm Optimization. In Journal of Physics: Conference Series (Vol. 1453). Institute of Physics Publishing. https://doi.org/10.1088/1742-6596/1453/1/012005

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free