Performance evaluation of as-friendly peer selection algorithms for P2P live streaming

Y. Fukushima, Kazuya Inada, Y. Tao, Yasuyuki Fujiwara, T. Yokohira
{"title":"Performance evaluation of as-friendly peer selection algorithms for P2P live streaming","authors":"Y. Fukushima, Kazuya Inada, Y. Tao, Yasuyuki Fujiwara, T. Yokohira","doi":"10.1109/APCC.2009.5375467","DOIUrl":null,"url":null,"abstract":"In this paper, we evaluate the performance of peer selection algorithms: MLH (Minimum Logical Hop) and MPH (Minimum Physical Hop) to increase the number of joining peers and to decrease inter-AS traffic volume in P2P live streaming, where we assume that every peer's logical hop count (the number of providing peers between an origin streaming server and the peer) is limited by a predetermined value in order to keep real-time property of live streaming. In MLH, a newly joining peer selects such providing peers that the logical hop count is minimum to increase the number of joining peers. And then if there are several such providing peers, the newly joining peer selects such providing peers that the number (physical hop count) of ASs between the newly joining peer and each of the providing peers is minimum to decrease the inter-AS traffic volume. In MPH, a newly joining peer selects providing peers in the reverse order of MLH. Simulation results show that MLH achieves about from 20% to 60% more maximum joining peers than MPH, and MPH shows smaller inter-AS traffic volume than MLH when the number of joining peers is small while MLH shows smaller inter-AS traffic volume when the number of joining peers is large.","PeriodicalId":217893,"journal":{"name":"2009 15th Asia-Pacific Conference on Communications","volume":"94 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 15th Asia-Pacific Conference on Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/APCC.2009.5375467","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

In this paper, we evaluate the performance of peer selection algorithms: MLH (Minimum Logical Hop) and MPH (Minimum Physical Hop) to increase the number of joining peers and to decrease inter-AS traffic volume in P2P live streaming, where we assume that every peer's logical hop count (the number of providing peers between an origin streaming server and the peer) is limited by a predetermined value in order to keep real-time property of live streaming. In MLH, a newly joining peer selects such providing peers that the logical hop count is minimum to increase the number of joining peers. And then if there are several such providing peers, the newly joining peer selects such providing peers that the number (physical hop count) of ASs between the newly joining peer and each of the providing peers is minimum to decrease the inter-AS traffic volume. In MPH, a newly joining peer selects providing peers in the reverse order of MLH. Simulation results show that MLH achieves about from 20% to 60% more maximum joining peers than MPH, and MPH shows smaller inter-AS traffic volume than MLH when the number of joining peers is small while MLH shows smaller inter-AS traffic volume when the number of joining peers is large.
P2P直播中友好对等选择算法的性能评价
在本文中,我们评估了对等选择算法的性能:MLH(最小逻辑跳)和MPH(最小物理跳),以增加P2P直播中的加入对等体的数量并减少as间的流量,其中我们假设每个对等体的逻辑跳数(源流服务器与对等体之间提供的对等体的数量)受到预定值的限制,以保持直播的实时性。在MLH中,新加入的对等体选择逻辑跳数最少的提供对等体来增加加入对等体的数量。如果有几个这样的提供对等体,则新加入的对等体选择新加入的对等体与每个提供对等体之间的as数量(物理跳数)最小的提供对等体,以减少as间的流量。在MPH中,新加入的对等体以与MLH相反的顺序选择提供的对等体。仿真结果表明,MLH的最大加入对等体比MPH多20% ~ 60%,并且在加入对等体数量较少时,MPH的as间流量比MLH小,而在加入对等体数量较多时,MLH的as间流量比MLH小。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信