An Optimal Server Selection Algorithm for P2P IPTV over Fiber to the Node (FTTN) Networks

S. Han, Ye Xia
{"title":"An Optimal Server Selection Algorithm for P2P IPTV over Fiber to the Node (FTTN) Networks","authors":"S. Han, Ye Xia","doi":"10.1109/ICC.2010.5502007","DOIUrl":null,"url":null,"abstract":"In this paper, we investigate the issue of server selection for P2P IPTV system on fiber to the node networks. To achieve high performance and resilience to failures, a peer can make connections with multiple peers simultaneously and receive different portions of the data in parallel. Prior work mostly focuses on user-centric performance objectives, such as reducing the round-trip time or the completion time of individual download, but tend to ignore the congestion caused by the concurrent connections or the network load balance. The latter performance concerns are important for the network operators who provide and manage IPTV services. In this paper, we consider two performance metrics, the worst-case link stress (WLS) and the degree of interference (DOI), and present a server selection scheme that generates the optimal server set with respect to the WLS criterion. Through experiments on PlanetLab, we show that the proposed scheme has the advantages over the random scheme and the closest scheme in the following aspects. First, it minimizes the level of congestion at the bottleneck link. Second, it consumes less network resources in terms of the total bandwidth usage. Third, the network load is well balanced.","PeriodicalId":6405,"journal":{"name":"2010 IEEE International Conference on Communications","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2010-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE International Conference on Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICC.2010.5502007","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In this paper, we investigate the issue of server selection for P2P IPTV system on fiber to the node networks. To achieve high performance and resilience to failures, a peer can make connections with multiple peers simultaneously and receive different portions of the data in parallel. Prior work mostly focuses on user-centric performance objectives, such as reducing the round-trip time or the completion time of individual download, but tend to ignore the congestion caused by the concurrent connections or the network load balance. The latter performance concerns are important for the network operators who provide and manage IPTV services. In this paper, we consider two performance metrics, the worst-case link stress (WLS) and the degree of interference (DOI), and present a server selection scheme that generates the optimal server set with respect to the WLS criterion. Through experiments on PlanetLab, we show that the proposed scheme has the advantages over the random scheme and the closest scheme in the following aspects. First, it minimizes the level of congestion at the bottleneck link. Second, it consumes less network resources in terms of the total bandwidth usage. Third, the network load is well balanced.
基于光纤到节点(FTTN)网络的P2P IPTV最优服务器选择算法
本文研究了光纤到节点网络中P2P IPTV系统的服务器选择问题。为了实现高性能和故障恢复能力,一个对等点可以同时与多个对等点建立连接,并并行接收不同部分的数据。先前的工作主要集中在以用户为中心的性能目标上,例如减少往返时间或单个下载的完成时间,而往往忽略了并发连接或网络负载平衡造成的拥塞。后一种性能问题对于提供和管理IPTV业务的网络运营商来说非常重要。在本文中,我们考虑了两个性能指标,即最坏链路应力(WLS)和干扰程度(DOI),并提出了一种服务器选择方案,该方案根据WLS标准生成最优服务器集。通过PlanetLab上的实验,我们证明了该方案在以下几个方面优于随机方案和最接近方案。首先,它将瓶颈链路上的拥塞程度降至最低。其次,在总带宽使用方面,它消耗较少的网络资源。三是网络负载均衡。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信