SOLVING MULTICAST ROUTING PROBLEM USING PARTICLE SWARM OPTIMIZATION

S. Behera, Prasanta Kumar Raut
{"title":"SOLVING MULTICAST ROUTING PROBLEM USING PARTICLE SWARM OPTIMIZATION","authors":"S. Behera, Prasanta Kumar Raut","doi":"10.29121/ijoest.v6.i3.2022.330","DOIUrl":null,"url":null,"abstract":"In a given network there exist many paths from source to destination, among all selected paths finding the optimal shortest path is a challenging task. In this research paper, we proposed a new concept of particle swarm optimization technique, called swarm intelligence, to solve the multicast routing problem to find out the optimal route associated with a network, here we also used triangular fuzzy number tools to encode particles in PSO (particle swarm optimization), first it breaks the network into small spaces and from the small space it computes the optimal path.","PeriodicalId":331301,"journal":{"name":"International Journal of Engineering Science Technologies","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Engineering Science Technologies","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.29121/ijoest.v6.i3.2022.330","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In a given network there exist many paths from source to destination, among all selected paths finding the optimal shortest path is a challenging task. In this research paper, we proposed a new concept of particle swarm optimization technique, called swarm intelligence, to solve the multicast routing problem to find out the optimal route associated with a network, here we also used triangular fuzzy number tools to encode particles in PSO (particle swarm optimization), first it breaks the network into small spaces and from the small space it computes the optimal path.
用粒子群算法求解组播路由问题
在给定的网络中,从源到目的存在许多路径,在所有路径中寻找最优最短路径是一个具有挑战性的任务。在本文中,我们提出了一个新的粒子群优化技术概念,即群智能,来解决组播路由问题,从而找到与网络相关的最优路由,这里我们也使用三角模糊数工具对粒子群优化中的粒子进行编码,首先将网络分解成小空间,然后从小空间中计算出最优路径。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信