Optimizing Segment Caching for Mobile Peer-to-Peer Interactive Streaming

Jingwei Li, S. Chan
{"title":"Optimizing Segment Caching for Mobile Peer-to-Peer Interactive Streaming","authors":"Jingwei Li, S. Chan","doi":"10.1109/ICC.2010.5502192","DOIUrl":null,"url":null,"abstract":"With the penetration of broadband wireless access network and devices, interactive multimedia streaming to handhelds has become a reality. However, it is still challenging to offer such services to a large number of users in a cost-effective manner. With the increase of battery lifetime, memory capacity and processing capability, and the fact that many mobile devices nowadays are equipped with multiple interfaces (3G, Wi-Fi, bluetooth, etc.), we study wireless peer-to-peer (P2P) streaming for scalable interactive streaming. In the network, videos are divided into segments and collaboratively cached and accessed among mobile devices. The major challenge is then which segment to cache at each mobile to achieve efficient access (in terms of low segment access cost). We first formulate the problem of segment caching to minimize segment access cost. We show that the optimization problem is NP-hard and present OPSEC (Optimized Segment Caching), a distributed algorithm which achieves collaborative and efficient segment caching, given heterogeneous caching capacities of the participating users. Using simulation, we show that OPSEC achieves much lower network access cost as compared with some recent schemes for interactive wireless video streaming.","PeriodicalId":6405,"journal":{"name":"2010 IEEE International Conference on Communications","volume":"46 1","pages":"1-5"},"PeriodicalIF":0.0000,"publicationDate":"2010-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE International Conference on Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICC.2010.5502192","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 11

Abstract

With the penetration of broadband wireless access network and devices, interactive multimedia streaming to handhelds has become a reality. However, it is still challenging to offer such services to a large number of users in a cost-effective manner. With the increase of battery lifetime, memory capacity and processing capability, and the fact that many mobile devices nowadays are equipped with multiple interfaces (3G, Wi-Fi, bluetooth, etc.), we study wireless peer-to-peer (P2P) streaming for scalable interactive streaming. In the network, videos are divided into segments and collaboratively cached and accessed among mobile devices. The major challenge is then which segment to cache at each mobile to achieve efficient access (in terms of low segment access cost). We first formulate the problem of segment caching to minimize segment access cost. We show that the optimization problem is NP-hard and present OPSEC (Optimized Segment Caching), a distributed algorithm which achieves collaborative and efficient segment caching, given heterogeneous caching capacities of the participating users. Using simulation, we show that OPSEC achieves much lower network access cost as compared with some recent schemes for interactive wireless video streaming.
优化移动点对点交互流的段缓存
随着宽带无线接入网络和设备的普及,交互式多媒体流传输到手持设备已经成为现实。然而,以具有成本效益的方式向大量用户提供此类服务仍然具有挑战性。随着电池寿命、内存容量和处理能力的增加,以及现在许多移动设备都配备了多个接口(3G、Wi-Fi、蓝牙等),我们研究无线点对点(P2P)流媒体,以实现可扩展的交互式流媒体。在网络中,视频被分成几个片段,并在移动设备之间协同缓存和访问。主要的挑战是在每个移动设备上缓存哪个段以实现高效访问(就低段访问成本而言)。我们首先提出了段缓存问题,以最小化段访问成本。我们证明了优化问题是np困难的,并提出了OPSEC(优化段缓存)算法,这是一种分布式算法,可以在给定参与用户的异构缓存容量的情况下实现协作和高效的段缓存。仿真结果表明,与目前一些交互式无线视频流方案相比,OPSEC的网络接入成本要低得多。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信