Stable distributed P2P protocols based on random peer sampling

Barlas Oguz, Venkat Anantharam, Ilkka Norros

Research output: Contribution to journalArticleScientificpeer-review

8 Citations (Scopus)

Abstract

Peer-to-peer protocols that rely on fully random peer and chunk selection have recently been shown to suffer from instability. The culprit is referred to as the missing piece syndrome, whereby a single chunk is driven to near extinction, leading to an accumulation of peers having almost complete files, but waiting for the missing chunk. We investigate three distributed random peer sampling protocols that tackle this issue, and present proofs of their stability using Lyapunov function techniques. The first two protocols are based on the sampling of multiple peers and a rare chunk selection rule. The last protocol incorporates an incentive mechanism to prevent free riding. It is shown that this incentive mechanism interacts well with the rare chunk selection protocol and stability is maintained. Besides being stable for all arrival rates of peers, all three protocols are scalable in that the mean upload rate of each peer is bounded uniformly independent of the arrival rate.
Original languageEnglish
Pages (from-to)1444-1456
JournalIEEE/ACM Transactions on Networking
Volume23
Issue number5
DOIs
Publication statusPublished - 2015
MoE publication typeA1 Journal article-refereed

Keywords

  • incentive mechanism
  • Lyapunov
  • Markov
  • missing piece
  • peer-to-peer
  • rare chunk
  • stability

Fingerprint Dive into the research topics of 'Stable distributed P2P protocols based on random peer sampling'. Together they form a unique fingerprint.

Cite this