Channel-Aware Peer Selection in Multi-View Peer-to-Peer Multimedia Streaming

Miao Wang, Lisong Xu, B. Ramamurthy
{"title":"Channel-Aware Peer Selection in Multi-View Peer-to-Peer Multimedia Streaming","authors":"Miao Wang, Lisong Xu, B. Ramamurthy","doi":"10.1109/ICCCN.2008.ECP.137","DOIUrl":null,"url":null,"abstract":"Motivated by the success of the Picture in Picture feature of the traditional TV, several commercial Peer-to-Peer MultiMedia Streaming (P2PMMS) applications now support the multi-view feature, with which a user can simultaneously watch multiple channels on its screen. This paper considers the peer selection problem in multi-view P2PMMS. This problem has been well studied in the traditional single-view P2PMMS; however, it becomes more complicated in multi-view P2PMMS, mainly due to the fact that a peer watching multiple channels joins multiple corresponding overlays. In this paper, we propose a novel peer selection algorithm, called Channel-Aware Peer Selection (CAPS), where a peer selects its neighboring peers based on the channel subscription of the system, in order to efficiently utilize the bandwidth of all peers in the system, especially those peers watching multiple channels. The results of a large-scale simulation with 10,000 peers and 4 channels shows that CAPS can significantly improve the system performance over the straightforward Random Peer Selection (RPS), which is widely used in single-view P2PMMS networks.","PeriodicalId":314071,"journal":{"name":"2008 Proceedings of 17th International Conference on Computer Communications and Networks","volume":"235 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 Proceedings of 17th International Conference on Computer Communications and Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCCN.2008.ECP.137","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10

Abstract

Motivated by the success of the Picture in Picture feature of the traditional TV, several commercial Peer-to-Peer MultiMedia Streaming (P2PMMS) applications now support the multi-view feature, with which a user can simultaneously watch multiple channels on its screen. This paper considers the peer selection problem in multi-view P2PMMS. This problem has been well studied in the traditional single-view P2PMMS; however, it becomes more complicated in multi-view P2PMMS, mainly due to the fact that a peer watching multiple channels joins multiple corresponding overlays. In this paper, we propose a novel peer selection algorithm, called Channel-Aware Peer Selection (CAPS), where a peer selects its neighboring peers based on the channel subscription of the system, in order to efficiently utilize the bandwidth of all peers in the system, especially those peers watching multiple channels. The results of a large-scale simulation with 10,000 peers and 4 channels shows that CAPS can significantly improve the system performance over the straightforward Random Peer Selection (RPS), which is widely used in single-view P2PMMS networks.
多视图点对点多媒体流中的通道感知对等选择
受传统电视“画中画”(Picture in Picture)功能成功的推动,一些商业点对点多媒体流(P2PMMS)应用程序现在支持多视图功能,用户可以同时在其屏幕上观看多个频道。研究了多视图P2PMMS中的对等体选择问题。这个问题在传统的单视图P2PMMS中得到了很好的研究;然而,在多视图P2PMMS中,这变得更加复杂,这主要是由于一个对等体观看多个通道连接多个相应的覆盖。本文提出了一种新的对等体选择算法——信道感知对等体选择(CAPS),该算法基于系统的信道订阅来选择相邻的对等体,以有效地利用系统中所有对等体的带宽,特别是那些观看多个信道的对等体。1万个节点和4个通道的大规模仿真结果表明,CAPS比直接的随机节点选择(RPS)可以显著提高系统性能,RPS在单视图P2PMMS网络中广泛使用。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信