大规模多媒体流的最佳链接与实现

Te-Chou Su, Shih-Yu Huang, Chen-Lung Chan, Jia-Shung Wang
{"title":"大规模多媒体流的最佳链接与实现","authors":"Te-Chou Su, Shih-Yu Huang, Chen-Lung Chan, Jia-Shung Wang","doi":"10.1109/ICME.2002.1035799","DOIUrl":null,"url":null,"abstract":"Chaining is a promising technique in alleviating the network and the server load by serving numbers of clients in a single server stream. In this scheme, each client temporarily stores the ongoing media stream in the client buffer and forwards it to another client with adequate buffering delay to meet the next client playback time. Therefore, the clients request the same video program can be chained together if the client buffer is large enough to bridge clients' playback time. However, existing chaining schemes do not efficiently exploit the client buffer space. In this paper, we present an optimal chaining algorithm to fully utilize the client buffer space and hence minimize the required server streams. Our performance comparison demonstrates that the optimal chaining scheme significantly reduces the server load over the existing chaining schemes. More importantly, the proposed scheme can integrate the streaming proxy into the video chain, which makes the video chain more reliable and flexible in real systems. This paper also presents the prototype implementation of the optimal chaining based video-on-demand system.","PeriodicalId":90694,"journal":{"name":"Proceedings. IEEE International Conference on Multimedia and Expo","volume":"20 1","pages":"385-388 vol.1"},"PeriodicalIF":0.0000,"publicationDate":"2002-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":"{\"title\":\"Optimal chaining and implementation for large scale multimedia streaming\",\"authors\":\"Te-Chou Su, Shih-Yu Huang, Chen-Lung Chan, Jia-Shung Wang\",\"doi\":\"10.1109/ICME.2002.1035799\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Chaining is a promising technique in alleviating the network and the server load by serving numbers of clients in a single server stream. In this scheme, each client temporarily stores the ongoing media stream in the client buffer and forwards it to another client with adequate buffering delay to meet the next client playback time. Therefore, the clients request the same video program can be chained together if the client buffer is large enough to bridge clients' playback time. However, existing chaining schemes do not efficiently exploit the client buffer space. In this paper, we present an optimal chaining algorithm to fully utilize the client buffer space and hence minimize the required server streams. Our performance comparison demonstrates that the optimal chaining scheme significantly reduces the server load over the existing chaining schemes. More importantly, the proposed scheme can integrate the streaming proxy into the video chain, which makes the video chain more reliable and flexible in real systems. This paper also presents the prototype implementation of the optimal chaining based video-on-demand system.\",\"PeriodicalId\":90694,\"journal\":{\"name\":\"Proceedings. IEEE International Conference on Multimedia and Expo\",\"volume\":\"20 1\",\"pages\":\"385-388 vol.1\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2002-11-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"12\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings. IEEE International Conference on Multimedia and Expo\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICME.2002.1035799\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. IEEE International Conference on Multimedia and Expo","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICME.2002.1035799","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 12

摘要

链接是一种很有前途的技术,它通过在单个服务器流中服务多个客户端来减轻网络和服务器负载。在该方案中,每个客户端暂时将正在进行的媒体流存储在客户端缓冲区中,并将其转发给另一个客户端,并具有足够的缓冲延迟,以满足下一个客户端播放时间。因此,如果客户端缓冲区足够大,可以桥接客户端的播放时间,则可以将请求相同视频节目的客户端链接在一起。然而,现有的链接方案不能有效地利用客户端缓冲区空间。在本文中,我们提出了一个最优的链算法,以充分利用客户端缓冲区空间,从而最小化所需的服务器流。我们的性能比较表明,与现有的链接方案相比,最优的链接方案显著降低了服务器负载。更重要的是,该方案可以将流代理集成到视频链中,使视频链在实际系统中更加可靠和灵活。本文还给出了基于最优链的视频点播系统的原型实现。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Optimal chaining and implementation for large scale multimedia streaming
Chaining is a promising technique in alleviating the network and the server load by serving numbers of clients in a single server stream. In this scheme, each client temporarily stores the ongoing media stream in the client buffer and forwards it to another client with adequate buffering delay to meet the next client playback time. Therefore, the clients request the same video program can be chained together if the client buffer is large enough to bridge clients' playback time. However, existing chaining schemes do not efficiently exploit the client buffer space. In this paper, we present an optimal chaining algorithm to fully utilize the client buffer space and hence minimize the required server streams. Our performance comparison demonstrates that the optimal chaining scheme significantly reduces the server load over the existing chaining schemes. More importantly, the proposed scheme can integrate the streaming proxy into the video chain, which makes the video chain more reliable and flexible in real systems. This paper also presents the prototype implementation of the optimal chaining based video-on-demand system.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信