Bandwidth-Delay-Constrained Least-Cost Multimedia Broadcasting Based on Heuristic Genetic Algorithm on Overlay Networks

Ting Lu, Shan Chang, Wenjing Guo
{"title":"Bandwidth-Delay-Constrained Least-Cost Multimedia Broadcasting Based on Heuristic Genetic Algorithm on Overlay Networks","authors":"Ting Lu, Shan Chang, Wenjing Guo","doi":"10.1109/MSN.2016.059","DOIUrl":null,"url":null,"abstract":"Since the heterogeneous Internet Service Provider (ISP) router policies prevent the quality-of-service (QoS) multimedia applications which require IP layer multicasting from being widely deployed on the Internet, the mechanism of implementing such applications by application layer broadcasting through organizing the multicast group in a peer-to-peer overlay network is proposed. In this paper, we study the bandwidth-delay-constrained minimum spanning tree problem in an overlay network, which is NP-complete. We propose a novel genetic algorithm for resolving this problem and compare it with a state-of-the-art method. Simulation results demonstrate that the proposed algorithm is effective and efficient.","PeriodicalId":135328,"journal":{"name":"2016 12th International Conference on Mobile Ad-Hoc and Sensor Networks (MSN)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 12th International Conference on Mobile Ad-Hoc and Sensor Networks (MSN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MSN.2016.059","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Since the heterogeneous Internet Service Provider (ISP) router policies prevent the quality-of-service (QoS) multimedia applications which require IP layer multicasting from being widely deployed on the Internet, the mechanism of implementing such applications by application layer broadcasting through organizing the multicast group in a peer-to-peer overlay network is proposed. In this paper, we study the bandwidth-delay-constrained minimum spanning tree problem in an overlay network, which is NP-complete. We propose a novel genetic algorithm for resolving this problem and compare it with a state-of-the-art method. Simulation results demonstrate that the proposed algorithm is effective and efficient.
基于启发式遗传算法的覆盖网络带宽延迟约束最小代价多媒体广播
针对异构ISP (Internet Service Provider)路由器策略导致需要IP层组播的QoS多媒体应用无法在Internet上广泛部署的问题,提出了在点对点覆盖网络中组织组播组,通过应用层广播实现这些应用的机制。本文研究了np完全覆盖网络中带宽延迟约束的最小生成树问题。我们提出了一种新的遗传算法来解决这个问题,并将其与最先进的方法进行了比较。仿真结果证明了该算法的有效性和高效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信