Space-filling curves and their use in the design of geometric data structures
Theoretical Computer Science - Special issue: Latin American theoretical informatics
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
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Wide-area cooperative storage with CFS
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
Can Heterogeneity Make Gnutella Scalable?
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
Building Topology-Aware Overlays Using Global Soft-State
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Locality-Aware and Churn-Resilient Load-Balancing Algorithms in Structured Peer-to-Peer Networks
IEEE Transactions on Parallel and Distributed Systems
Load-balancing performance of consistent hashing: asymptotic analysis of random node join
IEEE/ACM Transactions on Networking (TON)
Mapping with Space Filling Surfaces
IEEE Transactions on Parallel and Distributed Systems
Hash-based proximity clustering for efficient load balancing in heterogeneous DHT networks
Journal of Parallel and Distributed Computing
Load-driven neighbourhood reconfiguration of Gnutella overlay
Computer Communications
Resilient and efficient load balancing in distributed hash tables
Journal of Network and Computer Applications
Load and Proximity Aware Request-Redirection for Dynamic Load Distribution in Peering CDNs
OTM '08 Proceedings of the OTM 2008 Confederated International Conferences, CoopIS, DOA, GADA, IS, and ODBASE 2008. Part I on On the Move to Meaningful Internet Systems:
A new scalable distributed authentication for P2P network and its performance evaluation
WSEAS Transactions on Computers
Exchangeable, application-independent load balancing for P2P simulation frameworks
Proceedings of the 2nd International Conference on Simulation Tools and Techniques
Journal of Network and Computer Applications
Extending Pastry by an Alphanumerical Overlay
CCGRID '09 Proceedings of the 2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid
Distribution fairness in Internet-scale networks
ACM Transactions on Internet Technology (TOIT)
A Space-Based Generic Pattern for Self-Initiative Load Balancing Agents
ESAW '09 Proceedings of the 10th International Workshop on Engineering Societies in the Agents World X
A fair load balancing algorithm for hypercube-based DHT networks
APWeb/WAIM'07 Proceedings of the joint 9th Asia-Pacific web and 8th international conference on web-age information management conference on Advances in data and web management
On triple dissemination, forward-chaining, and load balancing in DHT based RDF stores
DBISP2P'05/06 Proceedings of the 2005/2006 international conference on Databases, information systems, and peer-to-peer computing
SFDHT: a DHT designed for server farm
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
A survey of DHT security techniques
ACM Computing Surveys (CSUR)
A case for content distribution in peer-to-peer networks
AMT'10 Proceedings of the 6th international conference on Active media technology
Randomized load balancing strategies with churn resilience in peer-to-peer networks
Journal of Network and Computer Applications
Hash-based proximity clustering for load balancing in heterogeneous DHT networks
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Usurp: distributed NAT traversal for overlay networks
Proceedings of the 11th IFIP WG 6.1 international conference on Distributed applications and interoperable systems
Using diffusive load balancing to improve performance of peer-to-peer systems for hosting services
AIMS'11 Proceedings of the 5th international conference on Autonomous infrastructure, management, and security: managing the dynamics of networks and services
Load Balancing Query Processing in Metric-Space Similarity Search
CCGRID '12 Proceedings of the 2012 12th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (ccgrid 2012)
Simple dynamic load balancing mechanism for structured P2P network and its evaluation
International Journal of Grid and Utility Computing
Replica-aided load balancing in overlay networks
Journal of Network and Computer Applications
Autonomic load balancing mechanisms in the P2P desktop grid
Proceedings of the 2013 ACM Cloud and Autonomic Computing Conference
Web search results caching service for structured P2P networks
Future Generation Computer Systems
Hi-index | 0.00 |
Many solutions have been proposed to tackle the load balancing issue in DHT-based P2P systems. However, all these solutions either ignore the heterogeneity nature of the system, or reassign loads among nodes without considering proximity relationships, or both. In this paper, we present an efficient, proximity-aware load balancing scheme by using the concept of virtual servers. To the best of our knowledge, this is the first work to use proximity information in load balancing. In particular, our main contributions are: 1) Relying on a self-organized, fully distributed k{\hbox{-}}{\rm{ary}} tree structure constructed on top of a DHT, load balance is achieved by aligning those two skews in load distribution and node capacity inherent in P2P systems驴that is, have higher capacity nodes carry more loads; 2) proximity information is used to guide virtual server reassignments such that virtual servers are reassigned and transferred between physically close heavily loaded nodes and lightly loaded nodes, thereby minimizing the load movement cost and allowing load balancing to perform efficiently; and 3) our simulations show that our proximity-aware load balancing scheme reduces the load movement cost by 11-65 percent for all the combinations of two representative network topologies, two node capacity profiles, and two load distributions of virtual servers. Moreover, we achieve virtual server reassignments in O(\log{N}) time.