Academia.eduAcademia.edu

Outline

Title
Abstract
Introduction
Related Surveys
An Overview of DHTS
Discussion of the Causes
Summary
Conclusion
References
All Topics
Computer Science
Distributed Systems

Survey on Load Balancing in Peer-to-Peer Distributed Hash Tables

Profile image of Peter KropfPeter Kropf

2000, IEEE Communications Surveys & Tutorials

https://doi.org/10.1109/SURV.2013.060313.00157
visibility

…

description

20 pages

link

1 file

Abstract

Peer-to-peer systems represent a radical shift from the classical client-server paradigm in which a centralized server processes requests from all clients. In a peer-to-peer (P2P) system, every "peer" can play the role of a client and a server at the same time, hence sharing responsibilities among all parties. As in practice some peers or connecting links may be heavily loaded in comparison to others, load balancing algorithms are necessary to ensure a fair distribution of the load among participating peers. In this survey, we present load management solutions in P2P systems. According to the level at which they operate, we classify the different approaches into three categories: object placement, routing protocol, and underlay. The first two approaches tackle information lookup and retrieval in the overlay network, while the last one addresses traffic imbalance at the level of the underlying network.

Related papers

Effective load-balancing of peer-to-peer systems
Shivkumar Sethuraman

The growing popularity of peer-to-peer (P2P) systems has necessitated the need for managing huge volumes of data efficiently to ensure acceptable user response times. Dynamically changing popularities of data items and skewed user query patterns in P2P systems may cause some of the peers to become bottlenecks, thereby resulting in severe load imbalance and consequently increased user response times. An effective load-balancing mechanism becomes a necessity in such cases. Such load-balancing can be achieved by efficient online data migration/replication. While much work has been done to harness the huge computing resources of P2P systems for high-performance computing and scientific applications, issues concerning load-balancing with a view towards faster access to data for normal users have not received adequate attention. Notably, the sheer size of P2P networks and the inherent dynamism of the environment pose significant challenges to load-balancing. The main contributions of our proposal are three-fold. First, we view a P2P system as comprising clusters of peers and present techniques for both intra-cluster and inter-cluster load-balancing. Second, we analyze the trade-offs between the options of migration and replication and formulate a strategy based on which the system decides at run-time which option to use. Third, we propose an effective strategy aimed towards automatic self-evolving clusters of peers. Our performance evaluation demonstrates that our proposed technique for inter-cluster load-balancing is indeed effective in improving the system performance significantly. To our knowledge, this work is one of the earliest attempts at addressing load-balancing via both online data migration and replication in P2P environments.

View PDFchevron_right
A Dynamic Popularity-Aware Load Balancing Algorithm for Structured P2P Systems
Mohsen Sharifi

Lecture Notes in Computer Science, 2012

Load balancing is one of the main challenges of structured P2P systems that use distributed hash tables (DHT) to map data items (objects) onto the nodes of the system. In a typical P2P system with N nodes, the use of random hash functions for distributing keys among peer nodes can lead to O(log N) imbalance. Most existing load balancing algorithms for structured P2Psystems are not proximity-aware, assume uniform distribution of objects in the system and often ignore node heterogeneity. In this paper we propose a load balancing algorithm that considers node heterogeneity, changes in object popularities, and link latencies between nodes. It also considers the load transfer time as an important factor in calculating the cost of load balancing. We present the algorithm using node movement and replication mechanisms. We also show via simulation how well the algorithm performs under different loads in a typical structured P2P system.

View PDFchevron_right
PERFORMANCE STUDY OF DISTRIBUTED HASH TABLE MECHANISMS ON P2P OVERLAY NETWORK UNDER EXTREME CONDITIONS
Hung Nguyen Chan

2007

The recent emergence of peertopeer (P2P) applications (i.e. Napster, Gnutella, etc) has boosted a large number of researches on peertopeer overlay networks due to their scalability, flexibility and efficiency in using resources, which are ideal for large applications such as data sharing, content distribution, multimedia streaming. An overlay network is a computer network which is built on top of another network. Nodes in the overlay can be thought of as being connected by virtual or logical links, each of which corresponds to a path, perhaps through many physical links, in the underlying network. Together with the fast grow of computing capability of mobile devices; P2P network no longer contains only desktop/laptop computers but also mobile and handheld devices connected through wireless connections such as GPRS, WiFi and WiMax. This imposes new challenges on P2P mechanisms, such as intermittent data connections and high frequency of node join/leave. DHT) is known as the most popular mechanism for the third generation of P2P network, featuring efficient data storage and retrieval. In an effort to implement P2P mechanisms on Telecommunication mobile network, the authors have investigated the performance of several new DHT algorithms such as Kelips, Tapestry and Chord under extreme conditions of mobile computing environments. Using simulation method, performance of Kelips, Tapestry and Chord under high churn rate was deeply analyzed and compared. We also identify their most important parameters to be tuned for optimized performance.

View PDFchevron_right
Heterogeneity and load balance in distributed hash tables
Ion Stoica

Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.

Existing solutions to achieve load balancing in DHTs incur a high overhead either in terms of routing state or in terms of load movement generated by nodes arriving or departing the system. In this paper, we propose a set of general techniques and use them to develop a protocol based on Chord, called Y 0 , that achieves load balancing with minimal overhead under the typical assumption that the load is uniformly distributed in the identifier space. In particular, we prove that Y 0 can achieve near-optimal load balancing, while moving little load to maintain the balance, and increasing the size of the routing tables by at most a constant factor. Using extensive simulations based on real-world and synthetic capacity distributions, we show that Y 0 reduces the load imbalance of Chord from O(log n) to a less than 4 without increasing the number of links that a node needs to maintain. In addition, we study the effect of heterogeneity on both DHTs, demonstrating significantly reduced average route length as node capacities become increasingly heterogeneous. For a real-word distribution of node capacities, the route length in Y 0 is asymptotically less than half the route length in the case of a homogeneous system.

View PDFchevron_right
Distributed Hash Tables in P2P Network: Detection and Prevention of Threats and Vulnerability
Mohammad Naderuzzaman

2013

Currently the peer-to-peer search focuses on efficient hash lookup systems which can be use in building more complex distributed systems. These system works well when their algorithms are executed in right direction but generally they don’t consider how to handle misbehaving nodes. In our paper we considers different sorts of security problems which are inherent in peer-to peer systems based on distributed hash lookup systems. We examine different types of problems that this kind of systems might face, taking examples from existing systems. Here we propose some design principles for detecting as well preventing those problems. Keywords - Distributed hash lookup systems, verifiable system invariants, verifiable key assignment, Server selection in routing.

View PDFchevron_right
Load Balancing in Dynamic Structured P2P Systems
Karthik E

2004

Most P2P systems that provide a DHT abstraction distribute objects randomly among "peer nodes" in a way that results in some nodes having Θ(log N ) times as many objects as the average node. Further imbalance may result due to nonuniform distribution of objects in the identifier space and a high degree of heterogeneity in object loads and node capacities. Additionally, a node's load may vary greatly over time since the system can be expected to experience continuous insertions and deletions of objects, skewed object arrival patterns, and continuous arrival and departure of nodes.

View PDFchevron_right
On index load balancing in scalable P2P media distribution
Giovanni Pau

2006

Abstract Peer-Peer (P2P) technologies have recently been in the limelight for their disruptive power in particular they have emerged as a powerful multimedia content distribution mechanism. However, the widespread deployment of P2P networks are hindered by several issues, especially the ones that influence end-user satisfaction, including reliability. In this paper, we propose a solution for an efficient and user-oriented keyword lookup service on P2P networks.

View PDFchevron_right
A Load Balancing Algorithm Based on Replication and Movement af Data Items for Dynamic Structured P2P Systems
Mohsen Sharifi

International Journal of Peer to Peer Networks, 2014

Load balancing is one of the main challenges of every structured peer-to-peer (P2P) system that uses distributed hash tables to map and distribute data items (objects) onto the nodes of the system. In a typical P2P system with N nodes, the use of random hash functions for distributing keys among peer nodes can lead to O(log N) imbalance. Most existing load balancing algorithms for structured P2P systems are not adaptable to objects' variant loads in different system conditions, assume uniform distribution of objects in the system, and often ignore node heterogeneity. In this paper we propose a load balancing algorithm that considers the above issues by applying node movement and replication mechanisms while load balancing. Given the high overhead of replication, we postpone this mechanism as much as possible, but we use it when necessary. Simulation results show that our algorithm is able to balance the load within 85% of the optimal value.

View PDFchevron_right
BALLS: A structured peer-to-peer system with integrated load balancing
Viet Y Huynh Le

annals of telecommunications - annales des télécommunications, 2006

Load balancing is an important problem of structured peer-to-peer systems. We consider two aspects of load: index management load that specifies the consumption of network bandwidth for routing traffic, and storage load that denotes the usage of computer resources for object (file) accommodation. This paper presents a structured peer-to-peer overlay that supports simultaneously the index management load balancing and storage load balancing. We used experiments to evaluate the effectiveness of the proposed load balancing methods and to validate their advantages.

View PDFchevron_right
Peer-to-Peer Single Hop Distributed Hash Tables
Luiz Monnerat

GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference, 2009

Efficiently locating information in large-scale distributed systems is a challenging problem to which Peer-to-Peer (P2P) Distributed Hash Tables (DHTs) can provide a highly scalable and cost-effective solution. However, there is very little experience on using DHTs in performance sensitive environments such as High Performance Computing (HPC) datacenters, and there is no published experimental comparison among lowlatency DHTs. To fill this gap, we conducted an in-depth performance comparison of three proposed low-latency singlehop DHTs namely 1h-Calot, D1HT, and OneHop. Specifically, we compared experimentally the lookup latency and CPU use of D1HT with those of 1h-Calot by running each of them concurrently with the normal workload production for a subset of 1,800 nodes of a heavy-loaded HPC datacenter. In addition, we carried out an analytical performance comparison among the three single-hop DHTs for system sizes of up to 10 million nodes. The results showed that D1HT consistently had the smallest overhead and in most cases it required one order of magnitude less bandwidth than 1h-Calot and OneHop. Overall, the combination of our experimental and analytical results suggests that D1HT can provide a very effective solution for a broad range of environments, from large-scale HPC datacenters to widely deployed Internet P2P applications such as BitTorrent with up to one million peers. This ability to support such a wide range of environments may allow D1HT to be used as an inexpensive and scalable commodity software substrate for largescale distributed applications 1 .

View PDFchevron_right

References (66)

  1. B. Godfrey, K. Lakshminarayanan, S. Surana, R. Karp, and I. Stoica, "Load balancing in dynamic structured P2P systems," in Proc. IEEE International Conference on Computer Communications (INFOCOM), Hong Kong, 2004.
  2. S. Serbu, S. Bianchi, P. Kropf, and P. Felber, "Dynamic load sharing in peer-to-peer systems: When some peers are more equal than others," IEEE Internet Comput., vol. 11, no. 4, pp. 53-61, 2007.
  3. S. Prabhavat, H. Nishiyama, N. Ansari, and N. Kato, "On load distri- bution over multipath networks," IEEE Commun. Surveys Tuts., vol. 14, no. 3, pp. 662-680, quarter 2012.
  4. R. I. Davis and A. Burns, "A survey of hard real-time scheduling for multiprocessor systems," ACM Comput. Surv., vol. 43, no. 4, pp. 35:1- 35:44, Oct. 2011.
  5. K. Kenthapadi and G. S. Manku, "Decentralized algorithms using both local and random probes for p2p load balancing," in Proc. 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). New York, NY, USA: ACM, 2005, pp. 135-144.
  6. H. Shen and Y. Zhu, "Plover: A proactive low-overhead file replication scheme for structured p2p systems," in IEEE International Conference on Communications (ICC), 2008, pp. 5619-5623.
  7. L. Garcés-Erice, K. W. Ross, E. W. Biersack, P. A. Felber, and G. Urvoy- Keller, "Topology-centric look-up service," in COST264/ACM 5th In- ternational Workshop on Networked Group Communications (NGC).
  8. Springer, 2003, pp. 58-69.
  9. S. Serbu, P. Kropf, and P. Felber, "Improving the dependability of prefix- based routing in dhts," in Proc. International Conference on the move to meaningful internet systems (OTM), ser. Lecture Notes in Computer Science, no. 4803. Springer Berlin / Heidelberg, 2007, pp. 206-225.
  10. H. Yamamoto, D. Maruta, and Y. Oie, "Replication methods for load balancing on distributed storages in P2P networks," IEICE Trans., vol. 89-D, no. 1, pp. 171-180, 2006.
  11. A. Rowstron and P. Druschel, "Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems," in IFIP/ACM International Conference on Distributed Systems Platforms (Middle- ware), ser. Lecture Notes in Computer Science, R. Guerraoui, Ed., no. 2218. Springer Heidelberg, Germany, 2001, pp. 329-350.
  12. S. Ratnasamy, M. Handley, R. Karp, and S. Shenker, "Topologically- aware overlay construction and server selection," in Proc. IEEE Inter- national Conference on Computer Communications (INFOCOM), June 2002.
  13. I. Stoica, R. Morris, D. Karger, M. F. Kaashoek, and H. Balakrishnan, "Chord: A scalable peer-to-peer lookup service for internet applica- tions," in Proc. ACM Special Interest Group on Data Communications (SIGCOMM), 2001, pp. 149-160.
  14. M. Steiner, T. En-Najjary, and E. W. Biersack, "A global view of KAD," in Proc. 7th ACM SIGCOMM conference on Internet measurement, ser. IMC '07. New York, NY, USA: ACM, 2007, pp. 117-122.
  15. P. Maymounkov and D. Mazieres, "Kademlia: A peer-to-peer infor- mation system based on the xor metric," in Proc. 1st International Workshop on Peer-to-Peer Systems, 2002, pp. 53-65.
  16. M. Steiner, W. Effelsberg, and T. En-najjary, "Load reduction in the kad peer-to-peer system," in In Fifth International Workshop on Databases, Information Systems and Peer-to-Peer Computing (DBISP2P, 2007.
  17. D. Carra, M. Steiner, and P. Michiardi, "Adaptive load balancing in KAD," in In Proc. Peer-to-Peer Computing 2011, 2011, pp. 92-101.
  18. S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker, "A scalable content addressable network," in Proc. ACM Special Interest Group on Data Communications (SIGCOMM), 2001, pp. 161-172.
  19. S. Seetharaman, V. Hilt, M. Hofmann, and M. Ammar, "Preemptive strategies to improve routing performance of native and overlay layers," in Proc. IEEE International Conference on Computer Communications (INFOCOM), 2007.
  20. P. B. Godfrey and I. Stoica, "Heterogeneity and load balance in distributed hash tables," in Proc. IEEE International Conference on Computer Communications (INFOCOM), 2005.
  21. D. Karger, E. Lehman, T. Leighton, M. Levine, D. Lewin, and R. Pan- igrahy, "Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the World Wide Web," in Proc. ACM Symposium on Theory of Computing (STOC), 1997, pp. 654-663.
  22. V. King and J. Saia, "Choosing a random peer," in Proc. the twenty- third annual ACM symposium on Principles of distributed computing, ser. PODC '04. New York, NY, USA: ACM, 2004, pp. 125-130.
  23. B. Y. Zhao, L. Huang, J. Stribling, S. C. Rhea, A. D. Joseph, and J. D. Kubiatowicz, "Tapestry: A resilient global-scale overlay for service deployment," IEEE J. Sel. Areas Commun., vol. 22, no. 1, pp. 41-53, 2004.
  24. D. Malkhi, M. Naor, and D. Ratajczak, "Viceroy: A scalable and dynamic emulation of the butterfly," in Proc. 21st ACM Symposium on Principles of Distributed Computing (PODC), 2002, pp. 183-192.
  25. M. F. Kaashoek and D. R. Karger, "Koorde: A simple degree-optimal distributed hash table," in Proc. 2nd International Workshop on Peer- to-Peer Systems, 2003, pp. 323-336.
  26. M. Bienkowski, M. Korzeniowski, and F. M. auf der Heide, "Dynamic load balancing in distributed hash tables," in Proc. 4th International Workshop, IPTPS 2005. Springer-Verlag Berlin / Heidelberg, 2005, pp. 217-225.
  27. A. Rao, K. Lakshminarayanan, S. Surana, R. Karp, and I. Stoica, "Load balancing in structured p2p systems," in Proc. 2nd International Workshop IPTPS 2003. Springer Berlin / Heidelberg, 2003, pp. 68-79.
  28. D. R. Karger and M. Ruhl, "Simple efficient load balancing algorithms for peer-to-peer systems," in Proc. 16th Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). New York, NY, USA: ACM, 2004, pp. 36-43.
  29. J. Ledlie and M. Seltzer, "Distributed, secure load balancing with skew, heterogeneity and churn," in Proc. IEEE International Conference on Computer Communications (INFOCOM), vol. 2. IEEE, 2005, pp. 1419- 1430.
  30. F. Dabek, M. F. Kaashoek, D. Karger, R. Morris, and I. Stoica, "Wide- area cooperative storage with CFS," in Proc. ACM Symposium on Operating Systems Principles (SOSP), 2001, pp. 202-215.
  31. D. Wu, Y. Tian, and K.-W. Ng, "Resilient and efficient load balancing in distributed hash tables," J. Network and Computer Applications, vol. 32, no. 1, pp. 45-60, Jan. 2009.
  32. J. Byers, J. Considine, and M. Mitzenmacher, "Simple load balancing for distributed hash tables," in 2nd International Workshop on Peer-to- Peer Systems (IPTPS '03), 2003, pp. 80-87.
  33. M. Mitzenmacher, A. W. Richa, and R. Sitaraman, "The power of two random choices: A survey of techniques and results," in in Handbook of Randomized Computing. Kluwer, 2000, pp. 255-312.
  34. T.-T. Wu and K. Wang, "An efficient load balancing scheme for resilient search in kad peer to peer networks," in IEEE 9th Malaysia International Conference on Communications. IEEE Computer Society, 2009, pp. 759 -764.
  35. E. Cohen and S. Shenker, "Replication strategies in unstructured peer- to-peer networks," in In Proc. ACM Special Interest Group on Data Communications (SIGCOMM), August 2002.
  36. Q. Lv, P. Cao, E. Cohen, K. Li, and S. Shenker, "Search and replication in unstructured peer-to-peer networks," in Proc. 16th international conference on Supercomputing (ICS). New York, NY, USA: ACM, 2002, pp. 84-95.
  37. Q. Wang, K. Daudjee, and M. T. Özsu, "Popularity-aware prefetch in P2P range caching," in Proc. 8th International Conference on Peer- to-Peer Computing (P2P). Washington, DC, USA: IEEE Computer Society, 2008, pp. 53-62.
  38. S. Bianchi, S. Serbu, P. Felber, and P. Kropf, "Adaptive load balancing for DHT lookups," in Proc. 15th International Conference on Computer Communications and Networks (ICCCN), 2006, pp. 411-418.
  39. A. Rowstron and P. Druschel, "Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility," in 18th ACM Symposium on Operating Systems Principles (SOSP), 2001, pp. 188- 201.
  40. M. Roussopoulos and M. Baker, "Cup: Controlled update propagation in peer-to-peer networks," in Proc. 2003 USENIX Annual Technical Conference, 2003.
  41. C. Wang, L. Xiao, Y. Liu, and P. Zheng, "DiCAS: An efficient distributed caching mechanism for P2P systems," IEEE Trans. Parallel Distrib. Syst. (TPDS), vol. 17, no. 10, pp. 1097-1109, 2006.
  42. H. Shen, "An efficient and adaptive decentralized file replication al- gorithm in p2p file sharing systems (EAD)," in Eighth International Conference on Peer-to-Peer Computing, 2008.
  43. V. Gopalakrishnan, B. Silaghi, B. Bhattacharjee, and P. Keleher, "Adap- tive replication in peer-to-peer systems," in Proc. 24th International Conference on Distributed Computing Systems (ICDCS). IEEE Com- puter Society, 2004, pp. 360-369.
  44. L. Yin and G. Cao, "Dup: Dynamic-tree based update propagation in peer-to-peer networks," in Proc. 21st International Conference on Data Engineering, ser. ICDE '05. Washington, DC, USA: IEEE Computer Society, 2005, pp. 258-259.
  45. V. Ramasubramanian and E. G. Sirer, "Beehive: O(1) lookup perfor- mance for power-law query distributions in peer-to-peer overlays," in Proc. 1st conference on Symposium on Networked Systems Design and Implementation (NSDI). USENIX Association, 2004, pp. 8-8.
  46. Y. Xia, A. Dobra, and S. C. Han, "Multiple-choice random network for server load balancing," in Proc. IEEE International Conference on Computer Communications (INFOCOM), 2007, pp. 1982-1990.
  47. K.-L. Huang, T.-Y. Huang, and J. C. Y. Chou, "Lesslog: A logless file replication algorithm for peer-to-peer distributed systems," 18th IEEE International Parallel and Distributed Processing Symposium (IPDPS), vol. 1, p. 82b, 2004.
  48. S. Serbu, P. Kropf, and P. Felber, "Fault-tolerant p2p networks: How dependable is greedy routing?" in Workshop on Dependable Application Support in Self-Organising Networks (DASSON), 2007.
  49. S. Serbu, S. Bianchi, P. Kropf, and P. Felber, "Dynamic load sharing in peer-to-peer systems: When some peers are more equal than others," in Proc. 2006 Montreal Conference on eTechnologies (MCETECH), 2006, pp. 149-156.
  50. T. Locher, S. Schmid, and R. Wattenhofer, "equus: A provably robust and locality-aware peer-to-peer system," in Proc. 6th IEEE International Conference on Peer-to-Peer Computing (P2P). Washington, DC, USA: IEEE Computer Society, 2006, pp. 3-11.
  51. M. Schlosser, M. Sintek, S. Decker, and W. Nejdl, "Hypercup - hypercubes, ontologies and efficient search on P2P networks," in 1st Workshop on Agents and P2P Computing Springer (AP2PC), vol. 2530. Springer Heidelberg, Germany, 2002, pp. 133-134.
  52. J. I. Alvarez-Hamelin, A. C. Viana, and M. D. Amorim, "DHT-based functionalities using hypercubes," in Proc. World Computer Congress (IFIP WCC), vol. 212, 2006, pp. 157-176.
  53. S. Serbu, P. Felber, and P. Kropf, "Hypeer: Structured overlay with flexible-choice routing," Computer Networks: The International Journal of Computer and Telecommunications, vol. 55, no. 1, pp. 300-313, 2011.
  54. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms, 2nd ed. The MIT Press, 2001.
  55. S. C. Han and Y. Xia, "Network load-aware content distribution in overlay networks," Computer Communications, vol. 32, no. 1, pp. 51- 61, 2009.
  56. M. Castro, P. Druschel, Y. C. Hu, and A. Rowstron, "Topology-aware routing in structured peer-to-peer overlay networks," in International Workshop on Future Directions in Distributed Computing (FuDiCo), June 2002.
  57. Z. Xu, M. Mahalingam, and M. Karlsson, "Turning heterogeneity into an advantage in overlay routing," in Proc. IEEE International Conference on Computer Communications (INFOCOM), vol. 2, march-april 2003, pp. 1499-1509.
  58. T. Asano, D. Ranjan, T. Roos, E. Welzl, and P. Widmayer, "Space- filling curves and their use in the design of geometric data structures," Theoretical Computer Science, vol. 181, pp. 3-15, July 1997.
  59. H. Shen and C.-Z. Xu, "Locality-aware randomized load balancing algorithms for DHT networks," in Proc. 2005 International Conference on Parallel Processing (ICPP). Washington, DC, USA: IEEE Computer Society, 2005, pp. 529-536.
  60. H. Shen, C.-Z. Xu, and G. Chen, "Cycloid: A constant-degree and lookup-efficient p2p overlay network," Performance Evaluation, vol. 63, no. 3, pp. 195 -216, 2006, p2P Computing Systems.
  61. F. Dabek, R. Cox, F. Kaashoek, and R. Morris, "Vivaldi: A decentralized network coordinate system," in Proc. ACM Special Interest Group on Data Communications (SIGCOMM), 2004, pp. 15-26.
  62. T. Kojima, M. Asahara, K. Kono, and A. Hayakawa, "Embedding net- work coordinates into the heart of distributed hash tables," in IEEE 9th International Conference on Peer-to-Peer Computing (P2P). Seattle, WA: IEEE Computer Society, 2009, pp. 155 -158.
  63. V. Aggarwal, O. Akonjang, and A. Feldmann, "Improving user and ISP experience through ISP-aided P2P locality," in Proc. 11th IEEE Global Internet Symposium (GI). IEEE Computer Society, Washington, DC, USA, 2008.
  64. Y. Zhu and Y. Hu, "Efficient, proximity-aware load balancing for structured p2p systems," in Proc. 3rd International Conference on Peer- to-Peer Computing (P2P). Washington, DC, USA: IEEE Computer Society, 2003, p. 220.
  65. N. Efthymiopoulos, A. Christakidis, S. Denazis, and O. Koufopavlou, "Enabling locality in a balanced peer-to-peer overlay," in IEEE Global Telecommunications Conference (GLOBECOM), 2006, pp. 1-5.
  66. C. G. Plaxton, R. Rajaraman, and A. W. Richa, "Accessing nearby copies of replicated objects in a distributed environment," in Proc. the 9th annual ACM symposium on Parallel Algorithms and Architectures (SPAA). New York, NY, USA: ACM, 1997, pp. 311-320.

Related papers

A novel load balancing mechanism for P2P networking
Vasilis Maglaris

Proceedings of the First International Conference on Networks For Grid Applications, 2007

Peer to Peer (P2P) networking is a potential disruptive technology that can be used for the development of scalable, fully decentralized distributed applications. However, to realize its potential, P2P technology should address the needs of a variety of applications, other than file-sharing requiring support for exactmatch queries on the file names. Our work complements and contributes to existing P2P overlays that support multipleattributes and range queries, using the distributed K-Dimensional (K-D) tree structure for organizing shared information among participating peers. This guarantees that the time needed for node join-leave operations and query times are logarithmic with respect to the number of peers. In such systems, an open issue is load balancing of resources among peers, as only load-balanced data structures can guarantee that the complexity for resolving multi-attribute and range queries remains logarithmic (thus scalable) with respect to the number of participating peers. In this paper, we report a novel load balancing algorithm for dynamically keeping the resource load among peers balanced. We prove that the load balancing algorithm is robust and scalable, achieving an O(log 2 N) complexity, where N is the number of peers. We illustrate how our algorithm can be used to build a scalable Grid Information Service supporting multi-attribute and range queries on available services within the shared Grid infrastructure.

View PDFchevron_right
Load balancing in structured P2P systems
Mohamed Gammoudi

Peer-to-Peer Systems …, 2003

Most P2P systems that provide a DHT abstraction distribute objects among "peer nodes" by choosing random identifiers for the objects. This could result in an O(log N) imbalance. Besides, P2P systems can be highly heterogeneous, i.e. they may consist of peers that range from old desktops behind modem lines to powerful servers connected to the Internet through high-bandwidth lines. In this paper, we address the problem of load balancing in such P2P systems.

View PDFchevron_right
Load management in peer-to-peer systems
Sabina Serbu

2010

Keywords: Peer-to-Peer, load balancing, load reduction, information lookup, dissemination, gossiping, routing.

View PDFchevron_right
Performance Management of Peer-to-Peer Distributed Hash Tables
E. Nataf

IFIP International Federation for Information Processing, 2006

P2P networking is a distributed model where entities play both the client and server role. One major problem addressed in this model is the discove~y, searching and routing in a dynamic distributed environment. Among the different envisaged solutions, Distributed Hash Tables (DHT) are very promising. They allow the build of robust content addressable networks. Despite good theoretical performance properties, infrastructures which implement the model need a performance management framework able to monitor them in case of a concrete deployment. In this article we propose a generic performance management information model for DHTs. Our contribution uses a standard management approach based on the Common Information Model (CIM) Metric model.

View PDFchevron_right
Dynamic Load Sharing in Peer-to-Peer Systems: When Some Peers Are More Equal than Others
Peter Kropf

IEEE Internet Computing, 2000

In the past few years, several DHT-based abstractions for peer-to-peer systems have been proposed. The main characteristic is to associate nodes (peers) with keys (objects) and to construct distributed routing structures to support an efficient location. These approaches address the load problem, and load balancing is achieved by moving the keys. However, the problem is still not properly covered. In this paper we present an analysis of structured peer-to-peer systems taking into consideration Zipf-like requests distribution. Based on our analysis, we propose a novel approach for load balancing relying on object popularity. Our approach is based on routing table reorganization in order to balance the lookup traffic load. We have implemented this approach in a Pastry-like system. The obtained results demonstrate a better balance of load, which can lead to improved scalability and performance.

View PDFchevron_right

Related topics

  • Distributed Computing
  • Information Retrieval
  • Routing protocols
  • Electrical and Electronic Engine...

    • Cited by

    Optimizing Resource Discovery Technique in the P2P Grid Systems
    sa edalatpanah

    Wireless Communications and Mobile Computing, 2020

    Distributed discovery service is a main concept in the scalable and dynamic grid environments. In this paper, based on the super-peer technique, we propose a new topology for the grid discovery service. The model is designed in such a way that each super-peer within the cluster has the routing indices (RIs) based on cobweb and uses the hop-count routing index (HRI) to select the best neighbor. Besides, each super-peer includes a cache table, which stores the query and the query results. Furthermore, from the point of view of the response time and the number of submitted messages, we compare the new model with an existing method. An illustrative simulation is also presented to show the efficiency and validation of the new technique.

    View PDFchevron_right
    580 California St., Suite 400
    San Francisco, CA, 94104
    © 2025 Academia. All rights reserved