北京邮电大学学报

  • EI核心期刊

北京邮电大学学报 ›› 2010, Vol. 33 ›› Issue (5): 61-65.doi: 10.13190/jbupt.201005.61.guochp

• 论文 • 上一篇    下一篇

自私网络中带宽与路由的联合分配机制

郭超平1,张恒2,张海林1   

  1. 1西安电子科技大学 综合业务网理论及关键技术国家重点实验室 2陕西省商贸学校
  • 收稿日期:2010-01-13 修回日期:2010-04-14 出版日期:2010-08-28 发布日期:2010-06-15
  • 通讯作者: 郭超平 E-mail:guochp1949@yahoo.com.cn

Joint Assignment of Bandwidth and Route in Selfish Networks

  • Received:2010-01-13 Revised:2010-04-14 Online:2010-08-28 Published:2010-06-15

摘要:

为了激励自私网络中的中间节点参与业务的转发,实现带宽和路由的联合分配,首先利用拍卖理论分析了自私网络中节点的理性行为,并将带宽与路由联合分配建模为拍卖模型. 然后进行机制设计,并对其最优性和策略一致性进行理论分析. 最后针对此模型提出了2种带宽与路由联合分配方案,一个较复杂,基于凸优化的分配方案;另一个计算速度较快,基于最小代价路径(LCP)的分配方案. 理论分析证明,本文机制解决了节点如何参与合作的问题,仿真结果表明,本文机制能有效促进节点参与合作.

关键词: 博弈论, 拍卖理论, 带宽分配;路由, 策略一致性

Abstract:

To stimulate the cooperation between the nodes in selfish networks and to make joint assignment of bandwidth and route, the auction theory is used to analyze the rational behavior of the node in selfish networks and to make the bandwidth assignment for multipath multihop routing as the auction model. Two schemes of bandwidth assignment for the multipath multihop routing are proposed. One scheme is based on convex optimization, the other is based on least cost path (LCP). Analysis illustrates that the mechanism is strategyproof. Extensive evaluations show that the mechanism can simulate the cooperation between the players.

Key words: game theory, auction theory, bandwidth assignment, routing, strategyproof

中图分类号: