Load balance with imperfect information in structured peer-to-peer systems

Hung Chang Hsiao, Hao Liao, Ssu Ta Chen, Kuo Chan Huang

Research output: Contribution to journalArticlepeer-review

36 Citations (Scopus)


With the notion of virtual servers, peers participating in a heterogeneous, structured peer-to-peer (P2P) network may host different numbers of virtual servers, and by migrating virtual servers, peers can balance their loads proportional to their capacities. The existing and decentralized load balance algorithms designed for the heterogeneous, structured P2P networks either explicitly construct auxiliary networks to manipulate global information or implicitly demand the P2P substrates organized in a hierarchical fashion. Without relying on any auxiliary networks and independent of the geometry of the P2P substrates, we present, in this paper, a novel load balancing algorithm that is unique in that each participating peer is based on the partial knowledge of the system to estimate the probability distributions of the capacities of peers and the loads of virtual servers, resulting in imperfect knowledge of the system state. With the imperfect system state, peers can compute their expected loads and reallocate their loads in parallel. Through extensive simulations, we compare our proposal to prior load balancing algorithms.

Original languageEnglish
Article number5473220
Pages (from-to)634-649
Number of pages16
JournalIEEE Transactions on Parallel and Distributed Systems
Issue number4
Publication statusPublished - 2011

All Science Journal Classification (ASJC) codes

  • Signal Processing
  • Hardware and Architecture
  • Computational Theory and Mathematics

Fingerprint Dive into the research topics of 'Load balance with imperfect information in structured peer-to-peer systems'. Together they form a unique fingerprint.

Cite this