{"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完全覆盖网络中带宽延迟约束的最小生成树问题。我们提出了一种新的遗传算法来解决这个问题,并将其与最先进的方法进行了比较。仿真结果证明了该算法的有效性和高效性。