• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Parallel and Distributed Systems, IEEE Transactions on >A Faithful Distributed Mechanism for Sharing the Cost of Multicast Transmissions
【24h】

A Faithful Distributed Mechanism for Sharing the Cost of Multicast Transmissions

机译：一种可靠的分布式机制，用于分担组播传输的成本

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

The problem of sharing the cost of multicast transmissions was studied in the past, and two mechanisms, marginal cost (MC) and Shapley value (SH), were proposed to solve it. Although both of them are strategy proof mechanisms, the distributed protocols implementing them are susceptible to manipulation by autonomous nodes. We propose a distributed Shapley value mechanism in which the participating nodes do not have incentives to deviate from the mechanism specifications. We show that the proposed mechanism is a faithful implementation of the Shapley value mechanism. We experimentally investigate the performance of the existing and the proposed cost-sharing mechanisms by implementing and deploying them on PlanetLab. We compare the execution time of MC and SH mechanisms for the tamper-proof and autonomous node models. We also study the convergence and scalability of the mechanisms by varying the number of nodes and the number of users per node. We show that the MC mechanisms generate a smaller revenue compared to the SH mechanisms, and thus, they are not attractive to the content provider. We also show that increasing the number of users per node is beneficial for the systems implementing the SH mechanisms from both computational and economic perspectives.
机译：过去研究了多播传输的成本共享问题，并提出了两种机制来解决它：边际成本（MC）和Shapley值（SH）。尽管它们都是策略证明机制，但是实现它们的分布式协议很容易受到自治节点的操纵。我们提出了一种分布式Shapley值机制，其中参与节点没有动机来偏离机制规范。我们表明，提出的机制是Shapley价值机制的忠实实现。我们通过在PlanetLab上实施和部署这些方法，实验性地研究了现有和建议的费用分摊机制的性能。我们比较了防篡改和自治节点模型的MC和SH机制的执行时间。我们还通过更改节点数和每个节点的用户数来研究机制的收敛性和可伸缩性。我们显示，与SH机制相比，MC机制产生的收入较小，因此它们对内容提供商没有吸引力。我们还表明，从计算和经济角度来看，增加每个节点的用户数量对于实施SH机制的系统是有益的。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号