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

Hung Chang Hsiao, Chih Peng He

研究成果: Article

10 引文 斯高帕斯(Scopus)

摘要

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.

原文English
頁(從 - 到)1099-1110
頁數12
期刊IEEE Transactions on Parallel and Distributed Systems
19
發行號8
DOIs
出版狀態Published - 2008 八月 1

All Science Journal Classification (ASJC) codes

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

指紋 深入研究「A tree-based peer-to-peer network with quality guarantees」主題。共同形成了獨特的指紋。

  • 引用此