Overlay design mechanisms for heterogeneous, large-scale, dynamic P2P systems

被引：12
作者：
Darlagiannis V. [1 ,2 ]
Mauthe A. [1 ]
Steinmetz R. [1 ]
机构：
[1] Darmstadt University of Technology, Multimedia Communications (KOM), Darmstadt
[2] Darmstadt University of Technology, Multimedia Communications (KOM), 64283 Darmstadt
来源：
Journal of Network and Systems Management | 2004年 / 12卷 / 3期
关键词：
Heterogeneity; Load balance; Peer roles; Peer-to-peer systems; Stable clusters;
D O I：
10.1023/B:JONS.0000043686.04679.03
中图分类号：
学科分类号：
摘要：
Large-scale, heterogeneous peer-to-peer (P2P) systems impose a set of diverse requirements. Current solutions do commonly only address a subset of these requirements since there are a number of trade-offs and constraints due to the different dimensions and aims they address. We present a novel approach for designing overlay networks for large-scale, highly dynamic, and heterogeneous P2P systems. A set of mechanisms is proposed to meet the complete set of requirements while keeping the trade-offs and constraints in balance. To handle effectively the large number of peers, they are clustered in manageable groups considering the requirements on their stability. The novelty in this approach is in the identification of the core services and operations of the aforementioned systems. On the basis of the requirements of those services and operations, peers are assigned the most suitable roles. Role relationships are further introduced to enable (and provide) incentives for the peers to adopt the most suitable roles while selecting an efficient overlay structure to preserve efficiency, robustness, and scalability. The proposed set of mechanisms is realized in Omicron, a novel hybrid P2P approach. © 2004 Plenum Publishing Corporation.
引用
收藏
页码：371 / 395
页数：24
相关论文
共 34 条
  • [1] (2003)
  • [2] eDonkey 2000, (2003)
  • [3] Leibowitz N., Ripeanu M., Wierzbicki A., Deconstructing the KaZaa network, 3rd IEEE Workshop on Internet Applications (WIAPP'03), (2003)
  • [4] Stoica I., Morris R., Karger D., Kaashoek M.F., Balakrishnan H., Chord: A scalable peer-to-peer lookup service for internet applications, Proceedings of the 2001 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, pp. 149-160, (2001)
  • [5] Ratnasamy S., Francis P., Handley M., Karp R., Schenker S., A scalable content-addressable network, Proceedings of the 2001 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, pp. 161-172, (2001)
  • [6] Rowstron A., Druschel P., Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems, IFIP/ACM International Conference on Distributed Systems Platforms (Middleware), pp. 329-350, (2001)
  • [7] Zhao B., Duan Y., Huang L., Joseph A., Kubiatowicz J., Brocade: Landmark routing on overlay networks, Proceedings of the 1st International Workshop on Peer-to-peer Systems (IPTPS02), (2002)
  • [8] Traversat B., Arora A., Abdelaziz M., Duigou M., Wood C.H., Hugly J.-C., Pouyoul E., Yeager B., Project JXTA 2.0 Super-peer Virtual Network, (2003)
  • [9] Mischke J., Stiller B., Rich and scalable peer-to-peer search with SHARK, 5th Int'l Workshop on Active Middleware Services (AMS 2003), (2003)
  • [10] Kaashoek F., Karger D.R., Koorde: A simple degree-optimal hash table, Proceedings of the 2nd International Workshop on Peer-to-peer Systems (IPTPS03), (2003)
1234