Streaming over subscription overlay networks

Ying Cai, Jianming Zhou
{"title":"Streaming over subscription overlay networks","authors":"Ying Cai, Jianming Zhou","doi":"10.1109/ICCCN.2005.1523943","DOIUrl":null,"url":null,"abstract":"A subscription overlay network (SON) consists of a stream source server and a number of subscribing nodes that pay monthly fee to watch the program. While the video program is continuous and endless, a subscriber typically watches the program only in some time interval. Thus, a SON may have a large number of subscribing nodes, but at any one time, only a small percentage of them may be playing (i.e., receiving some program) while many others are just idling. In this paper, we consider how these idling nodes can be leveraged for constructing highly efficient overlay multicast, where clients can join and leave dynamically. Unlike regular playing nodes, an idling node should be included in a multicast tree only when doing so can improve the system performance (e.g., reducing network traffic). We address this challenge and propose a novel overlay multicast technique that is able to find and incorporate appropriate idling nodes for data forwarding. We evaluate the performance of the proposed technique through simulation, and the results confirm its performance advantages.","PeriodicalId":379037,"journal":{"name":"Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.","volume":"161 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCCN.2005.1523943","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

A subscription overlay network (SON) consists of a stream source server and a number of subscribing nodes that pay monthly fee to watch the program. While the video program is continuous and endless, a subscriber typically watches the program only in some time interval. Thus, a SON may have a large number of subscribing nodes, but at any one time, only a small percentage of them may be playing (i.e., receiving some program) while many others are just idling. In this paper, we consider how these idling nodes can be leveraged for constructing highly efficient overlay multicast, where clients can join and leave dynamically. Unlike regular playing nodes, an idling node should be included in a multicast tree only when doing so can improve the system performance (e.g., reducing network traffic). We address this challenge and propose a novel overlay multicast technique that is able to find and incorporate appropriate idling nodes for data forwarding. We evaluate the performance of the proposed technique through simulation, and the results confirm its performance advantages.
通过订阅覆盖网络进行流媒体
订阅覆盖网络(SON)由一个流源服务器和一些按月付费观看节目的订阅节点组成。虽然视频节目是连续的,无止尽的,但订阅者通常只在一段时间间隔内观看节目。因此,一个SON可能有大量的订阅节点,但在任何时候,只有一小部分可能正在播放(即,接收某些程序),而许多其他节点只是空闲。在本文中,我们考虑如何利用这些空闲节点来构建高效的覆盖组播,其中客户端可以动态加入和离开。与常规播放节点不同,只有当空闲节点可以提高系统性能(例如,减少网络流量)时,才应该将其包含在多播树中。针对这一挑战,我们提出了一种新的覆盖组播技术,该技术能够找到并合并适当的空闲节点进行数据转发。通过仿真对该技术的性能进行了评价,结果证实了该技术的性能优势。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信