点对点流网络中动态缓冲的各种转发描述的服务可用性

Chow-Sing Lin, Jhe-Wei Lin
{"title":"点对点流网络中动态缓冲的各种转发描述的服务可用性","authors":"Chow-Sing Lin, Jhe-Wei Lin","doi":"10.1109/PDCAT.2013.32","DOIUrl":null,"url":null,"abstract":"In P2P systems, because the buffer space of each peer is limited, most of P2P systems employ the cache-and-relay schemes that require each peer to cache the most recent video stream it receives. As long as the initial part of the video stream remains in its buffer, the peer can then relay the cached stream to late-arriving peers in a pipelining fashion and then the loading of a server is reduced. In our previous research work, we proposed a novel caching scheme for peer-to-peer on-demand streaming, called Dynamic Buffering, which relies on the feature of Multiple Description Coding to gradually reduce the number of cached descriptions in a peer once the buffer is full. In this paper we discuss service availability of a peer with dynamic buffering for various numbers of kinds of forwarded descriptions, and provide detailed analyses on how the number of kinds of forwarded descriptions affects average service availability of a peer. In addition, the mathematical formulas of the reduction of average service availability for various numbers of kinds of forwarded descriptions is derived. Our experiment results showed that the reduction of average service availability is only related to the number of kinds of forwarded descriptions.","PeriodicalId":187974,"journal":{"name":"2013 International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"61 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Service Availability for Various Forwarded Descriptions with Dynamic Buffering on Peer-to-Peer Streaming Networks\",\"authors\":\"Chow-Sing Lin, Jhe-Wei Lin\",\"doi\":\"10.1109/PDCAT.2013.32\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In P2P systems, because the buffer space of each peer is limited, most of P2P systems employ the cache-and-relay schemes that require each peer to cache the most recent video stream it receives. As long as the initial part of the video stream remains in its buffer, the peer can then relay the cached stream to late-arriving peers in a pipelining fashion and then the loading of a server is reduced. In our previous research work, we proposed a novel caching scheme for peer-to-peer on-demand streaming, called Dynamic Buffering, which relies on the feature of Multiple Description Coding to gradually reduce the number of cached descriptions in a peer once the buffer is full. In this paper we discuss service availability of a peer with dynamic buffering for various numbers of kinds of forwarded descriptions, and provide detailed analyses on how the number of kinds of forwarded descriptions affects average service availability of a peer. In addition, the mathematical formulas of the reduction of average service availability for various numbers of kinds of forwarded descriptions is derived. Our experiment results showed that the reduction of average service availability is only related to the number of kinds of forwarded descriptions.\",\"PeriodicalId\":187974,\"journal\":{\"name\":\"2013 International Conference on Parallel and Distributed Computing, Applications and Technologies\",\"volume\":\"61 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-12-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 International Conference on Parallel and Distributed Computing, Applications and Technologies\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PDCAT.2013.32\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 International Conference on Parallel and Distributed Computing, Applications and Technologies","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PDCAT.2013.32","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

在P2P系统中,由于每个对等点的缓冲空间有限,大多数P2P系统采用缓存-中继方案,要求每个对等点缓存最近收到的视频流。只要视频流的初始部分仍然在其缓冲区中,对等端就可以以流水线方式将缓存的流中继到晚到达的对等端,然后减少服务器的加载。在我们之前的研究工作中,我们提出了一种新的点对点点播流缓存方案,称为动态缓冲,该方案依靠多描述编码的特性,在缓冲区满后逐渐减少对等端缓存的描述数量。本文讨论了具有动态缓冲的不同数量的转发描述的对等体的服务可用性,并详细分析了转发描述的数量如何影响对等体的平均服务可用性。此外,还推导了不同数量的转发描述的平均服务可用性降低的数学公式。实验结果表明,平均服务可用性的降低只与转发描述的种类数量有关。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Service Availability for Various Forwarded Descriptions with Dynamic Buffering on Peer-to-Peer Streaming Networks
In P2P systems, because the buffer space of each peer is limited, most of P2P systems employ the cache-and-relay schemes that require each peer to cache the most recent video stream it receives. As long as the initial part of the video stream remains in its buffer, the peer can then relay the cached stream to late-arriving peers in a pipelining fashion and then the loading of a server is reduced. In our previous research work, we proposed a novel caching scheme for peer-to-peer on-demand streaming, called Dynamic Buffering, which relies on the feature of Multiple Description Coding to gradually reduce the number of cached descriptions in a peer once the buffer is full. In this paper we discuss service availability of a peer with dynamic buffering for various numbers of kinds of forwarded descriptions, and provide detailed analyses on how the number of kinds of forwarded descriptions affects average service availability of a peer. In addition, the mathematical formulas of the reduction of average service availability for various numbers of kinds of forwarded descriptions is derived. Our experiment results showed that the reduction of average service availability is only related to the number of kinds of forwarded descriptions.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信