Practical Load Balancing for Content Requests in Peer-to-Peer Networks
Mema Roussopoulos, Mary Baker
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.
Create a lesson
Related papers
RUN-O-RAN: An O-RAN-Native Architecture Enabling Cooperative Uplink Localization
Viola Bernazzoli, Alberto Ceresoli, Ilario Filippini
NS3Learn: Transferring 5G NR Mode-2 Reception Realism from ns-3 to the Veins/SUMO Stack for Connected-Vehicle Safety Assessment
Rasheed Bello, Arthur Mukwaya, Gurcan Comert et al.
Value-Based Massive Access through Goal-Oriented Irregular Repetition Slotted ALOHA
Pietro Talli, Andrea Munari, Federico Mason et al.
STR-Agent: An LLM-Driven Agent for QoS-Aware Routing in LEO Satellite Networks
Bowen Lu, Mugen Peng, Yaohua Sun et al.
PyStream: Enhancing Video Streaming Evaluation
Samuel Radler, Leon Prüller, Emanuele Artioli et al.
Taming the Agentic RAN: Stability-Guaranteed Arbitration of Autonomous AI Agents in O-RAN
Seyed Bagher Hashemi Natanzi, Bo Tang