An modified PBIL for network coding resource minimization in dynamic network environment

Huanlai Xing, Fuhong Song, Zhaoyuan Wang, Tianrui Li, Yan Yang
{"title":"An modified PBIL for network coding resource minimization in dynamic network environment","authors":"Huanlai Xing, Fuhong Song, Zhaoyuan Wang, Tianrui Li, Yan Yang","doi":"10.1109/COMPCOMM.2016.7924881","DOIUrl":null,"url":null,"abstract":"In network coding, intermediate nodes are allowed to mathematically recombine packets received from different incoming links, which helps increase network throughput and accommodate more traffic flows with limited network resources. Coding operations (i.e. packet recombination), however, could cause significant computational cost and thus introduce heavy burden to the network if they are performed wherever possible. It is hence important to always keep the amount of coding operations minimized in a dynamic network environment. This paper proposes a modified population based incremental learning (PBIL) for solving the above problem, where an environmental adaptation scheme is devised to guide the search tracing the ever-changing optima within the fitness landscape in a dynamic network environment. Experimental results show that the proposed PBIL gains better performance than several state-of-the-art evolutionary algorithms regarding the solution quality.","PeriodicalId":210833,"journal":{"name":"2016 2nd IEEE International Conference on Computer and Communications (ICCC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 2nd IEEE International Conference on Computer and Communications (ICCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/COMPCOMM.2016.7924881","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

In network coding, intermediate nodes are allowed to mathematically recombine packets received from different incoming links, which helps increase network throughput and accommodate more traffic flows with limited network resources. Coding operations (i.e. packet recombination), however, could cause significant computational cost and thus introduce heavy burden to the network if they are performed wherever possible. It is hence important to always keep the amount of coding operations minimized in a dynamic network environment. This paper proposes a modified population based incremental learning (PBIL) for solving the above problem, where an environmental adaptation scheme is devised to guide the search tracing the ever-changing optima within the fitness landscape in a dynamic network environment. Experimental results show that the proposed PBIL gains better performance than several state-of-the-art evolutionary algorithms regarding the solution quality.
一种用于动态网络环境下网络编码资源最小化的改进PBIL
在网络编码中,允许中间节点从数学上重新组合来自不同传入链路的数据包,这有助于提高网络吞吐量,并在有限的网络资源下容纳更多的流量。然而,编码操作(即数据包重组)可能会导致大量的计算成本,从而给网络带来沉重的负担。因此,在动态网络环境中始终保持编码操作的数量最小化是很重要的。本文提出了一种改进的基于种群的增量学习(PBIL)方法来解决上述问题,该方法设计了一种环境适应方案,指导搜索在动态网络环境中跟踪适应度景观中不断变化的最优解。实验结果表明,该算法在求解质量方面优于几种先进的进化算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信