Inter-AS Traffic Volume Reduction by Localizing Delivery for P2P Live Streaming

Kazuki Kobayashi, Y. Fukushima, T. Yokohira
{"title":"Inter-AS Traffic Volume Reduction by Localizing Delivery for P2P Live Streaming","authors":"Kazuki Kobayashi, Y. Fukushima, T. Yokohira","doi":"10.1109/ICNC.2012.31","DOIUrl":null,"url":null,"abstract":"In recent years, there is a big demand for live streaming service over the Internet. As one of the service model, peer-to-peer (P2P) live streaming has been utilized. In the system, it is important to decrease inter-AS (Autonomous System) traffic volume and content delivery delay because the larger volume leads to higher transit cost of ASes and this system treats the live contents, respectively. Therefore, as a conventional peer selection algorithm that tries to decrease them, Minimum Physical Hop (MPH) has been proposed. In MPH, to decrease inter-AS traffic volume, a newly joining peer selects a providing peer with the minimum physical hop count, which is the minimum number of ASes between the providing peer and the newly joining peer. Furthermore, to decrease content delivery delay, if there are several such candidates, it selects a providing peer with the minimum logical hop count, which is the number of Origin Streaming Servers (OSS) or peers passed from an OSS to the peer, from the candidates. However, MPH shows high inter-AS traffic volume when the number of joining peers is large. When we use MPH, candidates for providing peer with large logical hop count tend to swarm in ASes without an OSS while those with small logical hop count do in ASes with an OSS because of the peer selection policy of MPH. As the number of joining peers becomes large, the logical hop counts of the candidates for providing peer in every AS increase. As a result, in the former ASes, the logical hop counts of all the candidates for providing peer reach the upper bound frequently, and the newly joining peer cannot often find its providing peer in the AS, and consequently have to select providing peers in different ASes. In this paper, we improve MPH in order to further decrease the inter-AS traffic volume. In the improved algorithm called Improved Minimum Physical Hop (IMPH), we try to decrease the volume by distributing providing peers with one logical hop count to many ASes. As a result of the evaluation, we show that IMPH achieves to reduce the inter-AS traffic volume by at a maximum of 38% compared to MPH under uniform peer generation distributions.","PeriodicalId":442973,"journal":{"name":"2012 Third International Conference on Networking and Computing","volume":"533 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 Third International Conference on Networking and Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICNC.2012.31","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In recent years, there is a big demand for live streaming service over the Internet. As one of the service model, peer-to-peer (P2P) live streaming has been utilized. In the system, it is important to decrease inter-AS (Autonomous System) traffic volume and content delivery delay because the larger volume leads to higher transit cost of ASes and this system treats the live contents, respectively. Therefore, as a conventional peer selection algorithm that tries to decrease them, Minimum Physical Hop (MPH) has been proposed. In MPH, to decrease inter-AS traffic volume, a newly joining peer selects a providing peer with the minimum physical hop count, which is the minimum number of ASes between the providing peer and the newly joining peer. Furthermore, to decrease content delivery delay, if there are several such candidates, it selects a providing peer with the minimum logical hop count, which is the number of Origin Streaming Servers (OSS) or peers passed from an OSS to the peer, from the candidates. However, MPH shows high inter-AS traffic volume when the number of joining peers is large. When we use MPH, candidates for providing peer with large logical hop count tend to swarm in ASes without an OSS while those with small logical hop count do in ASes with an OSS because of the peer selection policy of MPH. As the number of joining peers becomes large, the logical hop counts of the candidates for providing peer in every AS increase. As a result, in the former ASes, the logical hop counts of all the candidates for providing peer reach the upper bound frequently, and the newly joining peer cannot often find its providing peer in the AS, and consequently have to select providing peers in different ASes. In this paper, we improve MPH in order to further decrease the inter-AS traffic volume. In the improved algorithm called Improved Minimum Physical Hop (IMPH), we try to decrease the volume by distributing providing peers with one logical hop count to many ASes. As a result of the evaluation, we show that IMPH achieves to reduce the inter-AS traffic volume by at a maximum of 38% compared to MPH under uniform peer generation distributions.
通过P2P直播的本地化传输减少as间的流量
近年来,人们对互联网直播服务的需求很大。P2P (peer-to-peer)直播作为一种服务模式已经被广泛应用。在系统中,减少自治系统间的流量和内容分发延迟是很重要的,因为流量越大,自治系统之间的传输成本就会越高,本系统对实时内容的处理也会相应增加。因此,人们提出了最小物理跳数(Minimum Physical Hop, MPH)作为一种传统的对等选择算法。在MPH中,为了减少as间的流量,新加入的对等体选择物理跳数最小的提供对等体,即提供对等体与新加入的对等体之间的最小as数。此外,为了减少内容交付延迟,如果有几个这样的候选者,它将从候选者中选择具有最小逻辑跳数的提供对等体,这是Origin Streaming Servers (OSS)或从OSS传递到对等体的对等体的数量。但是,当加入对等体数量较大时,MPH显示出较高的as间流量。当我们使用MPH时,由于MPH的对等体选择策略,提供逻辑跳数大的对等体的候选体倾向于群集在没有OSS的as中,而提供逻辑跳数小的对等体倾向于群集在有OSS的as中。随着加入对等体数量的增加,每个自治系统中提供对等体的候选逻辑跳数也会增加。因此,在前一种As中,所有提供对等体候选节点的逻辑跳数经常达到上界,新加入的对等体往往无法在As中找到它的提供对等体,不得不在不同的As中选择提供对等体。在本文中,我们提高MPH以进一步减少as间的交通量。在称为改进最小物理跳数(IMPH)的改进算法中,我们试图通过将提供一个逻辑跳数的对等体分配给许多ase来减少体积。结果表明,在均匀对等体生成分布下,与MPH相比,IMPH实现了最多减少38%的As间交通量。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信