摘要
为了激励自私网络中的中间节点参与业务的转发,实现带宽和路由的联合分配,首先利用拍卖理论分析了自私网络中节点的理性行为,并将带宽与路由联合分配建模为拍卖模型.然后进行机制设计,并对其最优性和策略一致性进行理论分析.最后针对此模型提出了2种带宽与路由联合分配方案,一个较复杂,基于凸优化的分配方案;另一个计算速度较快,基于最小代价路径(LCP)的分配方案.理论分析证明,本文机制解决了节点如何参与合作的问题,仿真结果表明,本文机制能有效促进节点参与合作.
To stimulate the cooperation between the nodes in selfish networks and to make joint assign- ment 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.
出处
《北京邮电大学学报》
EI
CAS
CSCD
北大核心
2010年第5期61-65,共5页
Journal of Beijing University of Posts and Telecommunications
基金
111工程项目(B08038)
综合业务网国家重点实验室专项基金项目(ISN090105)
新世纪优秀人才支持计划项目(NCET-08-0810)
国家自然科学基金项目(60772317)
中央高校基本科研业务费专项项目(72105377)
关键词
博弈论
拍卖理论
带宽分配
路由
策略一致性
game theory
auction theory
bandwidth assignment
routing
strategy-proof
