Genetic algorithm-based network coding resources optimization in multimedia network

Zhijian Qu, Xiaohong Liu, Jia Fu
{"title":"Genetic algorithm-based network coding resources optimization in multimedia network","authors":"Zhijian Qu, Xiaohong Liu, Jia Fu","doi":"10.1109/ICSAI.2012.6223333","DOIUrl":null,"url":null,"abstract":"This paper concentrates on the problem of minimizing network coding resources with end-to-end delay and delay variation constraints in multimedia network. Network coding resources optimization problem has proved to be NP-hard, and the introduction of delay constraints makes it more complicated to be solved, since essentially the single problem of constructing such delay constrained tree without combining coding resources optimization, is NP-complete. In the process of tackling this problem, the basic model of the multiple-choice knapsack problem (MCKP) is used as an optimized entity for the proposed genetic algorithm (GA) called routing-based encoding GA (REGA). Then numeric results over three network scenarios demonstrate the effectiveness of the presented algorithm, which shows some potential and helpful capacity on topology designing with higher QoS level in practical multimedia network.","PeriodicalId":164945,"journal":{"name":"2012 International Conference on Systems and Informatics (ICSAI2012)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 International Conference on Systems and Informatics (ICSAI2012)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICSAI.2012.6223333","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

This paper concentrates on the problem of minimizing network coding resources with end-to-end delay and delay variation constraints in multimedia network. Network coding resources optimization problem has proved to be NP-hard, and the introduction of delay constraints makes it more complicated to be solved, since essentially the single problem of constructing such delay constrained tree without combining coding resources optimization, is NP-complete. In the process of tackling this problem, the basic model of the multiple-choice knapsack problem (MCKP) is used as an optimized entity for the proposed genetic algorithm (GA) called routing-based encoding GA (REGA). Then numeric results over three network scenarios demonstrate the effectiveness of the presented algorithm, which shows some potential and helpful capacity on topology designing with higher QoS level in practical multimedia network.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于遗传算法的多媒体网络编码资源优化
本文研究了多媒体网络中具有端到端时延和时延变化约束的网络编码资源最小化问题。网络编码资源优化问题已被证明是np困难问题,延迟约束的引入使其求解变得更加复杂,因为本质上构造这种延迟约束树而不结合编码资源优化的单一问题是np完全的。在解决这一问题的过程中,将多选题背包问题(MCKP)的基本模型作为优化实体,提出了基于路由编码的遗传算法(REGA)。在三种网络场景下的数值结果验证了该算法的有效性,对实际多媒体网络中具有更高QoS水平的拓扑设计具有一定的潜力和帮助。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
About feedback vaccination rules for a true-mass action-type SEIR epidemic model Enhanced accuracy of position based on Multi-mode location system Formal verification of signature monitoring mechanisms using model checking How to cope with the evolution of classic software during the test generation based on CPN Soil moisture quantitative study of the Nanhui tidal flat in the Yangtze River Estuary by using ENVISAT ASAR data
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1