Stable distributed P2P protocols based on random peer sampling

Barlas Oguz, Venkat Anantharam, Ilkka Norros

Research output: Contribution to journalArticleScientificpeer-review

5 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

Fingerprint

Sampling
Lyapunov functions

Keywords

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

Cite this

Oguz, Barlas ; Anantharam, Venkat ; Norros, Ilkka. / Stable distributed P2P protocols based on random peer sampling. In: IEEE/ACM Transactions on Networking. 2015 ; Vol. 23, No. 5. pp. 1444-1456.
@article{3e671f9d423842cd9327695bd905e2c9,
title = "Stable distributed P2P protocols based on random peer sampling",
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.",
keywords = "incentive mechanism, Lyapunov, Markov, missing piece, peer-to-peer, rare chunk, stability",
author = "Barlas Oguz and Venkat Anantharam and Ilkka Norros",
year = "2015",
doi = "10.1109/TNET.2014.2331352",
language = "English",
volume = "23",
pages = "1444--1456",
journal = "IEEE/ACM Transactions on Networking",
issn = "1063-6692",
publisher = "Institute of Electrical and Electronic Engineers IEEE",
number = "5",

}

Stable distributed P2P protocols based on random peer sampling. / Oguz, Barlas; Anantharam, Venkat; Norros, Ilkka.

In: IEEE/ACM Transactions on Networking, Vol. 23, No. 5, 2015, p. 1444-1456.

Research output: Contribution to journalArticleScientificpeer-review

TY - JOUR

T1 - Stable distributed P2P protocols based on random peer sampling

AU - Oguz, Barlas

AU - Anantharam, Venkat

AU - Norros, Ilkka

PY - 2015

Y1 - 2015

N2 - 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.

AB - 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.

KW - incentive mechanism

KW - Lyapunov

KW - Markov

KW - missing piece

KW - peer-to-peer

KW - rare chunk

KW - stability

U2 - 10.1109/TNET.2014.2331352

DO - 10.1109/TNET.2014.2331352

M3 - Article

VL - 23

SP - 1444

EP - 1456

JO - IEEE/ACM Transactions on Networking

JF - IEEE/ACM Transactions on Networking

SN - 1063-6692

IS - 5

ER -