首页> 外文期刊>Computer networks >Viewing experience optimization for peer-to-peer streaming networks with credit-based incentive mechanisms
【24h】

Viewing experience optimization for peer-to-peer streaming networks with credit-based incentive mechanisms

机译:使用基于信用的激励机制查看对等流网络的体验优化

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

摘要

Effective in fighting against "free-riding" and stimulating the cooperation between peers, credit-based incentive mechanisms are widely adopted in today's peer-to-peer (P2P) streaming networks. This work considers a P2P multimedia streaming system that relies on credits for incentivizing peers to upload. The main problem of focus is to derive the optimal strategy for a peer, in terms of allocating its credits across different time slots, to maximize its long-term viewing experience. Especially, the dynamic changing feature of credits is taken into consideration when we formulate the problem, and the optimal credits allocation is shown to be a staircase-like function over time. Then, based on the characteristics of the optimal credits allocation strategy, an effective double-loop iterative algorithm is proposed. For the consideration of practical implementation, three low-complexity credits allocation strategies are proposed. It is shown that each of the strategies has its own feature and is suitable for a specific scenario. Then, as an extension, the proposed credits allocation schemes are reinvestigated for P2P streaming networks that adopt dynamic-pricing credits-based incentive mechanisms. It is shown that the previously obtained credits allocation strategies and algorithms can be easily applied to these systems with minor modifications. (C) 2017 Elsevier B.V. All rights reserved.
机译:基于信用的激励机制有效地对抗“搭便车”并刺激了同行之间的合作,在当今的对等(P2P)流网络中被广泛采用。这项工作考虑了一种P2P多媒体流系统,该系统依赖于信用来激励同级上载。关注的主要问题是在对等点分配不同时间段方面,为对等点导出最佳策略,以最大化其长期观看体验。特别是,在制定问题时要考虑积分的动态变化特征,并且随着时间的流逝,最佳积分分配表现为阶梯状函数。然后,根据最优学分分配策略的特点,提出了一种有效的双环迭代算法。考虑到实际应用,提出了三种低复杂度的信用分配策略。结果表明,每种策略都有其自己的功能,并且适合于特定的情况。然后,作为扩展,对采用基于动态定价基于信用的激励机制的P2P流网络重新研究了提议的信用分配方案。结果表明,先前获得的信用分配策略和算法只需进行少量修改即可轻松应用于这些系统。 (C)2017 Elsevier B.V.保留所有权利。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号