全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...

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

DOI: 10.13190/jbupt.201005.61.guochp, PP. 61-65

Keywords: 博弈论,拍卖理论,带宽分配,路由,策略一致性

Full-Text   Cite this paper   Add to My Lib

Abstract:

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

References

[1]  Maillé P, Tuffin B. Multi-bid auctions for bandwidth allocation in communication networks//IEEE INFOCOM 2004. Hong Kong: , 2004: 7-11.
[2]  Maillé P, Tuffin B. Pricing the Internet with multibid auctions [J]. IEEE/ACM Trans on Networking, 2006, 14(5): 992-1004.
[3]  Jain R, Walrand J. An efficient mechanism for network bandwidth auction //IEEE NOMS Workshops 2008. Salvador da Bahia: , 2008: 227-234.
[4]  Zhu Ji, Wei Yu, Ray Liu K J. A game theoretical framework for dynamic pricing-based routing in self-organized MANETs [J]. IEEE J on Selected Areas in Comm, 2008, 26(7): 1204-1217.
[5]  王玉峰, 王文东, 袁刚, 等. Ad Hoc网络中基于Vickery拍卖的协作激励机制的研究[J]. 北京邮电大学学报, 2005, 28(4): 50-53. Wang Yufeng, Wang Wendong, Yuan Gang, et al. Study on cooperation incentive mechanism based on Vickery auction in Ad Hoc networks[J]. Journal of Beijing University of Posts and Telecommunications, 2005, 28(4):50-53.
[6]  Su Xueyuan, Chan S, Peng Gang. Auction in multi-path multi-hop routing[J]. IEEE Communications Letters, 2009, 13(2): 154-156.
[7]  Wu Fan, Zhong Sheng, Liu Jiqiang. Cost-effective traffic assignment for multipath routing in selfish networks//GLOBECOM 2007. Washington: , 2007: 453-457.
[8]  Boyd S, Vandenberghe L. Convex optimization[M]. Cambridge: Cambridge University Press, 2004: 1074-1079.

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133