• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>International Conference on Algorithmic Applications in Management(AAIM 2005); 20050622-25; Xian(CN) >Design DiffServ Multicast with Selfish Agents
【24h】

Design DiffServ Multicast with Selfish Agents

机译：使用自私代理设计DiffServ组播

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

摘要

Differentiated service (DiffServ) is a mechanism to provide the Quality of Service (QoS) with a certain performance guarantee. In this paper, we study how to design DiffServ multicast when the participants (i.e., relay links) are selfish. We assume that each link e_i is associated with a cost coefficient a_i such that the cost of e_i to provide a multicast service with bandwidth demand x is a_i · x. We first show that a previous approximation algorithm does not directly induce a truthful mechanism. We then give a new polynomial time 8-approximation algorithm to construct a DiffServ multicast tree. Based on this tree, we design a truthful mechanism for DiffServ multicast, i.e., we give a polynomial-time computable payment scheme to compensate all chosen relay links such that each link e_i maximizes its profit when it reports its privately cost coefficient a_i truthfully.
机译：区分服务（DiffServ）是一种为服务质量（QoS）提供一定性能保证的机制。在本文中，我们研究了当参与者（即中继链路）自私时如何设计DiffServ组播。我们假设每个链路e_i与成本系数a_i相关联，以使e_i提供具有带宽需求x的多播服务的成本为a_i·x。我们首先表明，先前的近似算法不会直接诱发真实机制。然后，我们给出一种新的多项式时间8逼近算法来构造DiffServ多播树。基于此树，我们为DiffServ多播设计了一种真实的机制，即，我们给出了多项式时间可计算的支付方案来补偿所有选择的中继链路，以使每个链路e_i在如实报告其私有成本系数a_i时都能最大化其利润。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号