期刊文献+

带宽自适应的P2P网络路由协议 被引量:14

A Self-Adaptive Peer-to-Peer Routing Protocol
下载PDF
导出
摘要 提出一种普适于各种系统环境和网络规模的结构化P2P网络协议SmartBoa.与已有的结构化P2P路由协议(如Pastry,Chord等)相比,SmartBoa结点并不维护同样大小的路由表,而是各结点根据自身的带宽能力决定其路由表的大小(最强的结点可能记录全部结点的指针,最弱的结点可能只记录其中不足1%的一小部分),算法保证路由表大小正比于维护开销,充分利用所有结点的可用带宽,使路由效率达到最优;另一方面,SmartBoa并不因为系统规模的增大而增加对结点带宽的要求,因此与全连通的one-hop overlay相比,SmartBoa可以获得更好的可扩展性;再者,SmartBoa结点根据系统环境的变化动态地调节自身级别,并且可以通过逐渐调高级别的慢启动方式来克服one-hop overlay的启动时间过长的缺陷.总之,SmartBoa是一种可以运行于任何环境,不受限于系统规模的大小、结点能力的强弱、强弱结点的比例、结点出入的频率,并通过动态调节保证路由效率的P2P路由协议,适用于各种广域分布式系统. This paper presents a novel peer-to-peer structure overlay network SmartBoa. Compared to previous protocols, SmartBoa nodes have routing tables with different sizes, which are determined by the local nodes individually. It is ensured that the bandwidth cost of a node is proportional to its routing table size. Therefore, from the view of the whole system, all the allowable bandwidth are fully utilized to improve the routing efficiency. SmartBoa does not increase the capacity requirement for nodes when the system expands, so it can achieve higher scalability than the one-hop protocol. Furthermore, SmartBoa nodes can adjust its level at runtime, and thereby can warm up gradually when starting. This avoids the long-time initiation which is an important problem in one-hop overlay. In a word, SmartBoa is a general structure overlay network that can be deployed in any environments, not matter what the system size is, how dynamic the nodes are, and what the node-capacity distribution is like.
出处 《软件学报》 EI CSCD 北大核心 2005年第5期991-999,共9页 Journal of Software
基金 国家自然科学基金 国家高技术研究发展计划(863) 国家重点基础研究发展规划(973)~~
关键词 P2P系统 结构化覆盖网 路由协议 异构性 分布式系统 peer-to-peer system structured overlay network routing protocol heterogeneous distributed system
  • 相关文献

参考文献10

  • 1Zhao B, Kubiatowicz J, Joseph A. Tapestry: An infrastructure for fault-tolerant wide-area location and routing. Technical Report UCB/CSD-01-1141, Berkeley: Computer Science Division, 2001.
  • 2Rowstron A, Druschel P. Pastry: Scalable, distributed object location and routing for largescale peer-to-peer systems. In: Proc. of the Int'l Conf. on Distributed Systems Platforms 2001. http://research.microsoft.com/~antr/Pastry/
  • 3Ratnasamy S, Francis P, Handley M, Karp R, Shenker S. A scalable content-addressable network. In: Proc. of the SIGCOMM 2001.2001. http://www.acm.org/sigs/sigcomm/sigcomm2001 /
  • 4Cox R, Muthitacharoen A, Morris R. Serving DNS using chord. In: Proc. of the 1st Int'l Workshop on Peer-to-Peer Systems. 2002.http://www.cs.rice.edu/Conferences/IPTPS02/
  • 5Jain S, Mahajan R, Wetherall D. A study of the performance potential of DHT-based overlays. In: Proc. of the 4th USENIX Symp.on Internet Technologies and Systems. 2003. http://www.usenix.org/events/usits03/
  • 6Gupta A, Liskov B, Rodrigues R. One hop lookups for peer-to-peer overlays. In: Proc. of the 9th Workshop on Hot Topics in Operating Systems. 2003. http://www.usenix.org/events/hotos03/
  • 7Xu J. On the fundamental tradeoffs between routing table size and network diameter in peer-to-peer networks. In: Proc .of the 22nd Annual Joint Conf. of the IEEE Computer and Communications Societies 2003. http://www.ieee-infocom.org/2003/
  • 8Gummadi K, Gummadi R, Gribble S, Ratnasamy S, Shenker S, Stoica I. The impact of DHT routing geometry on resilience and proximity. In: Proc. of the SIGCOMM 2003. 2003. http://www.acm.org/sigs/sigcomm/sigcomm2003/
  • 9Loguinov D, Kumar A, Rai V, Ganesh S. Graph-Theoretic analysis of structured peer-to-peer systems-routing distances and fault resilience. In: Proc. of the SIGCOMM 2003. 2003. http://www.acm.org/sigs/sigcomm/sigcomm2003/
  • 10Gupta I, Birman K, Linga P, Demers A, van Renesse R. Kelips: Building an efficient and stable P2P DHT through increased memory and background overhead In: Proc. of the 2nd Int'l Workshop on Peer-to-Peer Systems. 2003. http://iptps03.cs.berkeley.edu/

同被引文献101

引证文献14

二级引证文献12

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部