Practical load balancing for content requests in peer-to-peer networks

DOI10.1007/S00446-005-0150-7MaRDI QIDQ2375306zbMATH OpenOpenAlexFDO

Authors Mema Roussopoulos, M. Baker

Publication date 13 June 2013

Published in Distributed Computing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/cs/0209023

zbMATH Keywords

content replica selectionload balancingpeer-to-peer networks

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed algorithms (68W15)

Abstract: This paper studies the problem of load-balancing the demand for content in a peer-to-peer network across heterogeneous peer nodes that hold replicas of the content. Previous decentralized load balancing techniques in distributed systems base their decisions on periodic updates containing information about load or available capacity observed at the serving entities. We show that these techniques do not work well in the peer-to-peer context; either they do not address peer node heterogeneity, or they suffer from significant load oscillations. We propose a new decentralized algorithm, Max-Cap, based on the maximum inherent capacities of the replica nodes and show that unlike previous algorithms, it is not tied to the timeliness or frequency of updates. Yet, Max-Cap can handle the heterogeneity of a peer-to-peer environment without suffering from load oscillations.

Recommendations

• Load balancing in peer-to-peer systems using a diffusive approach
• Novel load balancing DHT scheme for the heterogeneous system
• Simple efficient load-balancing algorithms for peer-to-peer systems
• A simpler load-balancing algorithm for range-partitioned data in peer-to-peer systems
• Algorithms and performance of load-balancing with multiple hash functions in massive content distribution

Cites work

• Balanced Allocations
• Balanced binary trees for ID management and load balance in distributed hash tables
• Efficient PRAM simulation on a distributed memory machine
• How useful is old information (extended abstract)?
• scientific article; zbMATH DE number 2080510 (Why is no real title available?)
• scientific article; zbMATH DE number 2080852 (Why is no real title available?)
• scientific article; zbMATH DE number 1931795 (Why is no real title available?)
• scientific article; zbMATH DE number 1931807 (Why is no real title available?)
• On the optimal assignment of customers to parallel servers
• Optimality of the shortest line discipline
• Queueing system with selection of the shortest of two queues: An asymptotic approach
• Simple efficient load-balancing algorithms for peer-to-peer systems

Cited in

(8)

• Algorithms and performance of load-balancing with multiple hash functions in massive content distribution
• ADAPTIVE AND INTELLIGENT REQUEST DISTRIBUTION FOR CONTENT DELIVERY NETWORKS
• Using Epidemic Hoarding to Minimize Load Delays in P2P Distributed Virtual Environments
• A Comparison of Bilateral and Multilateral Exchanges for Peer-Assisted Content Distribution
• Load balancing in peer-to-peer systems using a diffusive approach
• A novel robust on-line protocol for load-balancing in structured peer-to-peer systems
• Growing Half-Balls: Minimizing Storage and Communication Costs in Content Delivery Networks
• SCDN: stable content distribution network based on demands

Describes a project that uses

Uses Software

• Narses
• ns-2
• Chord

This page was built for publication: Practical load balancing for content requests in peer-to-peer networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2375306)