A tree-based peer-to-peer network with quality guarantees

Hung Chang Hsiao, Chih Peng He

Research output: Contribution to journalArticlepeer-review

10 Citations (Scopus)

Abstract

Peer-to-peer (P2P) networks often demand scalability, low communication latency among nodes, and low system-wide overhead. For scalability, a node maintains partial states of a P2P network and connects to a few nodes. For fast communication, a P2P network intends to reduce the communication latency between any two nodes as much as possible. With regard to a low system-wide overhead, a P2P network minimizes its traffic in maintaining its performance efficiency and functional correctness. In this paper, we present a novel tree-based P2P network with low communication delay and low system-wide overhead. The merits of our tree-based network include: $(i)$ a tree-shaped P2P network which guarantees that the degree of a node is constant in probability regardless of the system size. The network diameter in our tree-based network increases logarithmically with an increase of the system size. Specially, given a physical network with a power-law latency expansion property, we show that the diameter of our tree network is constant. $(ii)$ Our proposal has the provable performance guarantees. We evaluate our proposal by rigorous performance analysis, and validate by extensive simulations.

Original languageEnglish
Pages (from-to)1099-1110
Number of pages12
JournalIEEE Transactions on Parallel and Distributed Systems
Volume19
Issue number8
DOIs
Publication statusPublished - 2008 Aug

All Science Journal Classification (ASJC) codes

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

Fingerprint Dive into the research topics of 'A tree-based peer-to-peer network with quality guarantees'. Together they form a unique fingerprint.

Cite this