期刊文献+

Novel load balancing DHT scheme for the heterogeneous system

Novel load balancing DHT scheme for the heterogeneous system
下载PDF
导出
摘要 The capacities of the nodes in the peer-to-peer system are strongly heterogeneous, hence one can benefit from distributing the load, based on the capacity of the nodes. At first a model is discussed to evaluate the load balancing of the heterogeneous system, and then a novel load balancing scheme is proposed based on the concept of logical servers and the randomized binary tree, and theoretical guarantees are given. Finally, the feasibility of the scheme using extensive simulations is proven. The capacities of the nodes in the peer-to-peer system are strongly heterogeneous, hence one can benefit from distributing the load, based on the capacity of the nodes. At first a model is discussed to evaluate the load balancing of the heterogeneous system, and then a novel load balancing scheme is proposed based on the concept of logical servers and the randomized binary tree, and theoretical guarantees are given. Finally, the feasibility of the scheme using extensive simulations is proven.
出处 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2008年第4期835-842,共8页 系统工程与电子技术(英文版)
基金 the Electronic Development Foundation of Information Industry Ministry China (2002546).
关键词 distributed hash table HETEROGENEITY randomized binary tree load balancing distributed hash table, heterogeneity, randomized binary tree, load balancing
  • 相关文献

参考文献15

  • 1Dabek F, Kaashoek M F, Karger D, et al. Wide-area cooperative storage with CFS. Proc. of 18th ACM Symposium on Operating System Principles, 2000:202 215.
  • 2Kubiatowicz J, Bindel D, Chen Y, et al. Oceanstore: an architecture for global-scale persistent storage. Proc. of the Ninth International Conference on Architecture Support for Programming Languages and Operating Systems ASPLOS, 2000: 190- 201.
  • 3Huebsch R, Hellerstein J M, Lanham N, et al. Querying the Internet with PIER. Proe. of the 29th International Conference on Very Large Databases, 2003.
  • 4Walfish M, Balakrishnan H, Shenker S. Untangling the web from DNS. Proc. of First Symposium on Networked Systems Design and Implementation, 2004:225- 238.
  • 5King V, Saia J. Choosing a random peer. Proc. of 23rd ACM Symposium on Principles of Distributed Computing Proceedings, 2004: 125-130.
  • 6Kaashoek F, Karger D, Koorde A. simple degree-optimal hash table. Proc. of 2nd International Workshop on Peer- to-Peer Systems, 2003:98 107.
  • 7Karger D, Ruhl M. Simple efficient load balancing algorithms for peer-to-peer systems. Proe. of 16th ACM Symposium on Parallelism in Algorithms and Architectures, 2004: 36-43.
  • 8Kenthapadi K, Manku G S. Decentralized algorithms using both local and random probes for P2P load balancing. Proc. of ACM Symposium on Parallelism in Algorithms and Architectures, 2005: 135-144.
  • 9Manku G S. Balanced binary trees for ID management and load balance in distributed hash tables. Proc. of 23rd ACM Symposium on Principles of Distributed Computing. 2004: 197-205.
  • 10Naor M, Wieder U. Novel architectures for P2P applications: The continuous-discrete approach. Proc. of 15th ACM Symposium on Parallelism in Algorithms and Architectures, 2003: 50-59.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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