Mechanism design for dynamic P2P streaming

Guibin Tian, Yang Xu, Yong Liu, Keith Ross

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

In dynamic streaming, a user can dynamically choose from different versions of the same video. In P2P dynamic streaming, there is one P2P swarm for each version, and within a swarm, peers can share video chunks with each other, thereby reducing the server's bandwidth cost. Due to economy of scale, cooperation among peers can also reduce the per-peer content price. In this paper, we use cooperative game theory to dynamically assign each peer to a version. To maximally incentivize peer cooperation, we use mechanism design to develop pricing schemes that reflect content and bandwidth cost savings derived from peer cooperation. With this approach, each peer is assigned to a swarm that is commensurate with its upload contribution and the price it is willing to pay. We also develop and simulate a distributed dynamic P2P streaming algorithm, consisting of chunk scheduling, token-based accounting, and video version switching, to dynamically adjust each peer's video version based on the collaborative behaviors of all peers.

Original languageEnglish (US)
Title of host publication13th IEEE International Conference on Peer-to-Peer Computing, IEEE P2P 2013 - Proceedings
PublisherIEEE Computer Society
ISBN (Print)9781479905218
DOIs
StatePublished - 2013
Event13th IEEE International Conference on Peer-to-Peer Computing, IEEE P2P 2013 - Trento, Italy
Duration: Sep 9 2013Sep 11 2013

Other

Other13th IEEE International Conference on Peer-to-Peer Computing, IEEE P2P 2013
CountryItaly
CityTrento
Period9/9/139/11/13

Fingerprint

Bandwidth
Costs
Game theory
Servers
Scheduling

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

Tian, G., Xu, Y., Liu, Y., & Ross, K. (2013). Mechanism design for dynamic P2P streaming. In 13th IEEE International Conference on Peer-to-Peer Computing, IEEE P2P 2013 - Proceedings [6688702] IEEE Computer Society. https://doi.org/10.1109/P2P.2013.6688702

Mechanism design for dynamic P2P streaming. / Tian, Guibin; Xu, Yang; Liu, Yong; Ross, Keith.

13th IEEE International Conference on Peer-to-Peer Computing, IEEE P2P 2013 - Proceedings. IEEE Computer Society, 2013. 6688702.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Tian, G, Xu, Y, Liu, Y & Ross, K 2013, Mechanism design for dynamic P2P streaming. in 13th IEEE International Conference on Peer-to-Peer Computing, IEEE P2P 2013 - Proceedings., 6688702, IEEE Computer Society, 13th IEEE International Conference on Peer-to-Peer Computing, IEEE P2P 2013, Trento, Italy, 9/9/13. https://doi.org/10.1109/P2P.2013.6688702
Tian G, Xu Y, Liu Y, Ross K. Mechanism design for dynamic P2P streaming. In 13th IEEE International Conference on Peer-to-Peer Computing, IEEE P2P 2013 - Proceedings. IEEE Computer Society. 2013. 6688702 https://doi.org/10.1109/P2P.2013.6688702
Tian, Guibin ; Xu, Yang ; Liu, Yong ; Ross, Keith. / Mechanism design for dynamic P2P streaming. 13th IEEE International Conference on Peer-to-Peer Computing, IEEE P2P 2013 - Proceedings. IEEE Computer Society, 2013.
@inproceedings{56a80a8f0bc14f7b98e593156849f51e,
title = "Mechanism design for dynamic P2P streaming",
abstract = "In dynamic streaming, a user can dynamically choose from different versions of the same video. In P2P dynamic streaming, there is one P2P swarm for each version, and within a swarm, peers can share video chunks with each other, thereby reducing the server's bandwidth cost. Due to economy of scale, cooperation among peers can also reduce the per-peer content price. In this paper, we use cooperative game theory to dynamically assign each peer to a version. To maximally incentivize peer cooperation, we use mechanism design to develop pricing schemes that reflect content and bandwidth cost savings derived from peer cooperation. With this approach, each peer is assigned to a swarm that is commensurate with its upload contribution and the price it is willing to pay. We also develop and simulate a distributed dynamic P2P streaming algorithm, consisting of chunk scheduling, token-based accounting, and video version switching, to dynamically adjust each peer's video version based on the collaborative behaviors of all peers.",
author = "Guibin Tian and Yang Xu and Yong Liu and Keith Ross",
year = "2013",
doi = "10.1109/P2P.2013.6688702",
language = "English (US)",
isbn = "9781479905218",
booktitle = "13th IEEE International Conference on Peer-to-Peer Computing, IEEE P2P 2013 - Proceedings",
publisher = "IEEE Computer Society",

}

TY - GEN

T1 - Mechanism design for dynamic P2P streaming

AU - Tian, Guibin

AU - Xu, Yang

AU - Liu, Yong

AU - Ross, Keith

PY - 2013

Y1 - 2013

N2 - In dynamic streaming, a user can dynamically choose from different versions of the same video. In P2P dynamic streaming, there is one P2P swarm for each version, and within a swarm, peers can share video chunks with each other, thereby reducing the server's bandwidth cost. Due to economy of scale, cooperation among peers can also reduce the per-peer content price. In this paper, we use cooperative game theory to dynamically assign each peer to a version. To maximally incentivize peer cooperation, we use mechanism design to develop pricing schemes that reflect content and bandwidth cost savings derived from peer cooperation. With this approach, each peer is assigned to a swarm that is commensurate with its upload contribution and the price it is willing to pay. We also develop and simulate a distributed dynamic P2P streaming algorithm, consisting of chunk scheduling, token-based accounting, and video version switching, to dynamically adjust each peer's video version based on the collaborative behaviors of all peers.

AB - In dynamic streaming, a user can dynamically choose from different versions of the same video. In P2P dynamic streaming, there is one P2P swarm for each version, and within a swarm, peers can share video chunks with each other, thereby reducing the server's bandwidth cost. Due to economy of scale, cooperation among peers can also reduce the per-peer content price. In this paper, we use cooperative game theory to dynamically assign each peer to a version. To maximally incentivize peer cooperation, we use mechanism design to develop pricing schemes that reflect content and bandwidth cost savings derived from peer cooperation. With this approach, each peer is assigned to a swarm that is commensurate with its upload contribution and the price it is willing to pay. We also develop and simulate a distributed dynamic P2P streaming algorithm, consisting of chunk scheduling, token-based accounting, and video version switching, to dynamically adjust each peer's video version based on the collaborative behaviors of all peers.

UR - http://www.scopus.com/inward/record.url?scp=84893281514&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84893281514&partnerID=8YFLogxK

U2 - 10.1109/P2P.2013.6688702

DO - 10.1109/P2P.2013.6688702

M3 - Conference contribution

AN - SCOPUS:84893281514

SN - 9781479905218

BT - 13th IEEE International Conference on Peer-to-Peer Computing, IEEE P2P 2013 - Proceedings

PB - IEEE Computer Society

ER -