首页> 外文会议>2012 Third International Conference on Networking and Computing. >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实时流交付来减少AS间流量

获取原文
获取原文并翻译 | 示例

摘要

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 res- lt 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间(自治系统)的通信量和内容传递延迟非常重要,因为较大的通信量会导致ASes的运输成本更高,并且该系统分别处理直播内容。因此,作为试图减小它们的常规对等选择算法,已经提出了最小物理跳(MPH)。在MPH中,为了减少AS间的通信量,新加入的对等方选择具有最小物理跳数的提供方,该物理跳数是提供对等方和新加入的对等方之间的AS的最小数量。此外,为了减少内容传送的延迟,如果有多个这样的候选者,它会选择一个具有最小逻辑跳数的提供对等方,该逻辑对接数是从OSS传递到对等方的原始流服务器(OSS)或对等方的数量。候选人。但是,当加入对等方的数量很大时,MPH会显示较高的AS间流量。当我们使用MPH时,由于MPH的对等体选择策略,为逻辑跳数较大的对等方提供候选的对象往往会在没有OSS的AS中蜂拥而至,而对于逻辑跳数较小的对等体则会在具有OSS的AS中采用。随着加入对等方的数量变大,每个AS中用于提供对等方的候选逻辑跳数增加。结果,在以前的AS中,所有提供对等方的候选逻辑跳数频繁到达上限,而新加入的对等方通常无法在AS中找到其提供对等方,因此必须在不同的AS中选择​​提供对等方ASes。在本文中,我们改进了MPH,以进一步减少跨AS的流量。在称为改进的最小物理跳数(IMPH)的改进算法中,我们尝试通过向多个AS分配具有一个逻辑跳数的对等点来减少数量。作为评估的结果,我们表明,在均匀的对等代分布下,与MPH相比,IMPH最多可将AS间流量减少38%。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号