首页> 外文会议>ICNC 2012 >Inter-AS Traffic Volume Reduction by Localizing Delivery for P2P Live Streaming
【24h】

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

机译:通过本地化P2P直播传输的交付互换减少

获取原文

摘要

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)实时流。在该系统中,重要的是减少(自主系统)交通量和内容传递延迟,因为较大的体积导致较高的ass的运输成本分别处理现场内容。因此,作为尝试降低它们的传统对等选择算法,已经提出了最小物理跳(MPH)。在MPH中,为了减少交通量,新加入的对等体选择具有最小物理跳数的对等体,这是提供对等体和新加入对等体之间的最小数量。此外,为了减少内容传送延迟,如果存在若干这样的候选者,则选择具有最小逻辑跳数的提供对等体,这是从OSS传递给对等体的原点流式服务器(OSS)或对等的数量。候选人。然而,当加入对等体的数量很大时,MPH显示出高的交通量。当我们使用MPH时,候选人提供具有大型逻辑跳数的对等体倾向于在没有OSS的ASE中蜂拥而至,而由于MPH的同行选择策略,在具有OSS的逻辑跳数的人中就会陷入困境。随着加入对等体的数量变大,候选人的逻辑跳数为每次增加的候选者。结果,在前面的ases中,用于提供对等体的所有候选者的逻辑跳数频繁地到达上限,而新加入的对等体不能经常找到其在AS中提供对等体,因此必须选择提供对同行的同行Ases。在本文中,我们改善了MPH,以进一步减少互相交通量。在称为改进的最小物理跳(IMPH)的改进算法中,我们尝试通过分发具有一个逻辑跳数的向对等体分发给许多ases来减少卷。由于评估,我们表明,与MPH在均匀的对等生成分布下,IMPH实现以最多38%将互流量最高减少38%。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号