首页> 外文期刊>Networking, IEEE/ACM Transactions on >Defending Against Distance Cheating in Link-Weighted Application-Layer Multicast
【24h】

Defending Against Distance Cheating in Link-Weighted Application-Layer Multicast

机译:防止链路加权的应用层多播中的距离作弊

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

摘要

Application-layer multicast (ALM) has recently emerged as a promising solution for diverse group-oriented applications. Unlike dedicated routers in IP multicast, the autonomous end-hosts are generally unreliable and even selfish. A strategic host might cheat about its private information to affect protocol execution and, in turn, to improve its individual benefit. Specifically, in a link-weighted ALM protocol where the hosts measure the distances from their neighbors and accordingly construct the ALM topology, a selfish end-host can easily intercept the measurement message and exaggerate the distances to other nodes, so as to reduce the probability of being a relay. Such distance cheating, rarely happening in IP multicast, can significantly impact the efficiency and stability of the ALM topology. To defend against this kind of cheating, we present a Vickrey–Clarke–Groves (VCG)-based cheat-proof mechanism in this paper. We demonstrate a practical mapping from the utility, payment, and welfare of a VCG mechanism to the link-weighted ALM context. Based on this, we further discuss practical issues for implementing the cheat-proof mechanism—specifically, a trustworthy distributed algorithm for payment computation. Performance analyses show that the overheads of the computation, storage, and communication of our implementation are controlled at low levels, and extensive simulations further testify the implementation's effectiveness. Although there are other similar studies in this area, the contribution of our cheat-proof mechanism and its implementation primarily lies in two aspects. On one hand, we first explicitly solve the distance cheating problem in link-weighted ALM since its proposal by mapping the VCG mechanism to link-weighted ALM context. On the other hand, our distributed implementation can not only effectively defend against distance cheating, but can also avoid the potential cheating behaviors when selfish ALM nodes fulfill the cheat-n-n-proof mechanism itself.
机译:应用层多播(ALM)最近已出现,成为面向各种面向组的应用程序的有希望的解决方案。与IP多播中的专用路由器不同,自治终端主机通常不可靠甚至自私。战略主机可能会欺骗其私人信息,以影响协议执行,进而提高其个人利益。具体来说,在链路加权的ALM协议中,主机测量到邻居的距离并相应地构建ALM拓扑,自私的终端主机可以轻松拦截测量消息并夸大到其他节点的距离,从而降低了概率成为接力者。这种距离欺骗在IP多播中很少发生,会严重影响ALM拓扑的效率和稳定性。为了防止这种作弊,我们在本文中提出了一种基于Vickrey-Clarke-Groves(VCG)的防作弊机制。我们演示了从VCG机制的效用,支付和福利到链接加权ALM上下文的实用映射。在此基础上,我们进一步讨论了实现防作弊机制的实际问题,特别是用于支付计算的可信赖的分布式算法。性能分析表明,我们的实现的计​​算,存储和通信的开销控制在较低的水平,并且广泛的仿真进一步证明了实现的有效性。尽管在这一领域还有其他类似的研究,但我们的防作弊机制及其实施的贡献主要体现在两个方面。一方面,我们首先通过将VCG机制映射到链接加权的ALM上下文中,明确解决了自链接提议以来的链接加权ALM中的距离作弊问题。另一方面,我们的分布式实现不仅可以有效地防御距离欺诈,而且还可以避免自私的ALM节点满足防n-n-n防伪机制本身时的潜在欺诈行为。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号