Game-theoretic scalable peer-to-peer media streaming

Peer-to-peer media streaming framework has been widely considered as a promising platform for delivering high quality multimedia content on the global scale. A fundamental requirement is that each peer needs to contribute outgoing bandwidth to deliver media packets to its neighbors. Although most ex...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Yeung, M.K.H., Yu-Kwong Kwok
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 11
container_issue
container_start_page 1
container_title
container_volume
creator Yeung, M.K.H.
Yu-Kwong Kwok
description Peer-to-peer media streaming framework has been widely considered as a promising platform for delivering high quality multimedia content on the global scale. A fundamental requirement is that each peer needs to contribute outgoing bandwidth to deliver media packets to its neighbors. Although most existing protocols mandate such contribution, misbehaving peers may still deliberately limit their outgoing bandwidth to conserve their own resources. This would inevitably lead to performance degradation of other well-behaving peers. It is crucial to have an effective incentive mechanism such that peers are encouraged to contribute. In this paper, we formulate two strategic games to model the interactions between server and its immediate peers and between neighboring peers, respectively. We have devised the equilibrium strategies which relate a peer's streaming performance to its contribution. Simulation results show that the proposed game-theoretical incentive mechanism protects well-behaving peers from being exploited by misbehaving counterparts.
doi_str_mv 10.1109/IPDPS.2008.4536231
format Conference Proceeding
fullrecord <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_4536231</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>4536231</ieee_id><sourcerecordid>4536231</sourcerecordid><originalsourceid>FETCH-LOGICAL-i90t-e8e1cf218e44e9605ed487d71406efed229b1578b5ebf3366005f293a324c0c3</originalsourceid><addsrcrecordid>eNpFj8FOwzAQRI0AiVL6A3DJDzjs2msnPqICpVIlKpV75SQbMEpoZfvC3xNEJebyNIcZzQhxi1Aigrtfbx-3u1IB1CUZbZXGM3GNpIjQOnLn_0bDhZih0SAVVOZKLFL6hElTTJGeCVr5kWX-4EPkHNoitX7wzcDFkTnKfJC_LEbugi9SjuzH8PV-Iy57PyRenDgXu-ent-WL3Lyu1suHjQwOsuSase0V1kzEzoLhjuqqq5DAcs-dUq5BU9WN4abX2loA0yun_bSshVbPxd1fa2Dm_TGG0cfv_emv_gGvDkZo</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Game-theoretic scalable peer-to-peer media streaming</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Yeung, M.K.H. ; Yu-Kwong Kwok</creator><creatorcontrib>Yeung, M.K.H. ; Yu-Kwong Kwok</creatorcontrib><description>Peer-to-peer media streaming framework has been widely considered as a promising platform for delivering high quality multimedia content on the global scale. A fundamental requirement is that each peer needs to contribute outgoing bandwidth to deliver media packets to its neighbors. Although most existing protocols mandate such contribution, misbehaving peers may still deliberately limit their outgoing bandwidth to conserve their own resources. This would inevitably lead to performance degradation of other well-behaving peers. It is crucial to have an effective incentive mechanism such that peers are encouraged to contribute. In this paper, we formulate two strategic games to model the interactions between server and its immediate peers and between neighboring peers, respectively. We have devised the equilibrium strategies which relate a peer's streaming performance to its contribution. Simulation results show that the proposed game-theoretical incentive mechanism protects well-behaving peers from being exploited by misbehaving counterparts.</description><identifier>ISSN: 1530-2075</identifier><identifier>ISBN: 1424416930</identifier><identifier>ISBN: 9781424416936</identifier><identifier>EISBN: 1424416949</identifier><identifier>EISBN: 9781424416943</identifier><identifier>DOI: 10.1109/IPDPS.2008.4536231</identifier><language>eng</language><publisher>IEEE</publisher><subject>Bandwidth ; Degradation ; Game theory ; incentive mechanisms ; Incentive schemes ; Nash equilibrium strategies ; Network servers ; Peer to peer computing ; peer-to-peer streaming ; Protocols ; repeated games ; Scalability ; Streaming media ; unstructured networks ; Web server</subject><ispartof>2008 IEEE International Symposium on Parallel and Distributed Processing, 2008, p.1-11</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/4536231$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2058,27925,54920</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/4536231$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Yeung, M.K.H.</creatorcontrib><creatorcontrib>Yu-Kwong Kwok</creatorcontrib><title>Game-theoretic scalable peer-to-peer media streaming</title><title>2008 IEEE International Symposium on Parallel and Distributed Processing</title><addtitle>IPDPS</addtitle><description>Peer-to-peer media streaming framework has been widely considered as a promising platform for delivering high quality multimedia content on the global scale. A fundamental requirement is that each peer needs to contribute outgoing bandwidth to deliver media packets to its neighbors. Although most existing protocols mandate such contribution, misbehaving peers may still deliberately limit their outgoing bandwidth to conserve their own resources. This would inevitably lead to performance degradation of other well-behaving peers. It is crucial to have an effective incentive mechanism such that peers are encouraged to contribute. In this paper, we formulate two strategic games to model the interactions between server and its immediate peers and between neighboring peers, respectively. We have devised the equilibrium strategies which relate a peer's streaming performance to its contribution. Simulation results show that the proposed game-theoretical incentive mechanism protects well-behaving peers from being exploited by misbehaving counterparts.</description><subject>Bandwidth</subject><subject>Degradation</subject><subject>Game theory</subject><subject>incentive mechanisms</subject><subject>Incentive schemes</subject><subject>Nash equilibrium strategies</subject><subject>Network servers</subject><subject>Peer to peer computing</subject><subject>peer-to-peer streaming</subject><subject>Protocols</subject><subject>repeated games</subject><subject>Scalability</subject><subject>Streaming media</subject><subject>unstructured networks</subject><subject>Web server</subject><issn>1530-2075</issn><isbn>1424416930</isbn><isbn>9781424416936</isbn><isbn>1424416949</isbn><isbn>9781424416943</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2008</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNpFj8FOwzAQRI0AiVL6A3DJDzjs2msnPqICpVIlKpV75SQbMEpoZfvC3xNEJebyNIcZzQhxi1Aigrtfbx-3u1IB1CUZbZXGM3GNpIjQOnLn_0bDhZih0SAVVOZKLFL6hElTTJGeCVr5kWX-4EPkHNoitX7wzcDFkTnKfJC_LEbugi9SjuzH8PV-Iy57PyRenDgXu-ent-WL3Lyu1suHjQwOsuSase0V1kzEzoLhjuqqq5DAcs-dUq5BU9WN4abX2loA0yun_bSshVbPxd1fa2Dm_TGG0cfv_emv_gGvDkZo</recordid><startdate>200804</startdate><enddate>200804</enddate><creator>Yeung, M.K.H.</creator><creator>Yu-Kwong Kwok</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>200804</creationdate><title>Game-theoretic scalable peer-to-peer media streaming</title><author>Yeung, M.K.H. ; Yu-Kwong Kwok</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i90t-e8e1cf218e44e9605ed487d71406efed229b1578b5ebf3366005f293a324c0c3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2008</creationdate><topic>Bandwidth</topic><topic>Degradation</topic><topic>Game theory</topic><topic>incentive mechanisms</topic><topic>Incentive schemes</topic><topic>Nash equilibrium strategies</topic><topic>Network servers</topic><topic>Peer to peer computing</topic><topic>peer-to-peer streaming</topic><topic>Protocols</topic><topic>repeated games</topic><topic>Scalability</topic><topic>Streaming media</topic><topic>unstructured networks</topic><topic>Web server</topic><toplevel>online_resources</toplevel><creatorcontrib>Yeung, M.K.H.</creatorcontrib><creatorcontrib>Yu-Kwong Kwok</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Xplore (Online service)</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Yeung, M.K.H.</au><au>Yu-Kwong Kwok</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Game-theoretic scalable peer-to-peer media streaming</atitle><btitle>2008 IEEE International Symposium on Parallel and Distributed Processing</btitle><stitle>IPDPS</stitle><date>2008-04</date><risdate>2008</risdate><spage>1</spage><epage>11</epage><pages>1-11</pages><issn>1530-2075</issn><isbn>1424416930</isbn><isbn>9781424416936</isbn><eisbn>1424416949</eisbn><eisbn>9781424416943</eisbn><abstract>Peer-to-peer media streaming framework has been widely considered as a promising platform for delivering high quality multimedia content on the global scale. A fundamental requirement is that each peer needs to contribute outgoing bandwidth to deliver media packets to its neighbors. Although most existing protocols mandate such contribution, misbehaving peers may still deliberately limit their outgoing bandwidth to conserve their own resources. This would inevitably lead to performance degradation of other well-behaving peers. It is crucial to have an effective incentive mechanism such that peers are encouraged to contribute. In this paper, we formulate two strategic games to model the interactions between server and its immediate peers and between neighboring peers, respectively. We have devised the equilibrium strategies which relate a peer's streaming performance to its contribution. Simulation results show that the proposed game-theoretical incentive mechanism protects well-behaving peers from being exploited by misbehaving counterparts.</abstract><pub>IEEE</pub><doi>10.1109/IPDPS.2008.4536231</doi><tpages>11</tpages></addata></record>
fulltext fulltext_linktorsrc
identifier ISSN: 1530-2075
ispartof 2008 IEEE International Symposium on Parallel and Distributed Processing, 2008, p.1-11
issn 1530-2075
language eng
recordid cdi_ieee_primary_4536231
source IEEE Electronic Library (IEL) Conference Proceedings
subjects Bandwidth
Degradation
Game theory
incentive mechanisms
Incentive schemes
Nash equilibrium strategies
Network servers
Peer to peer computing
peer-to-peer streaming
Protocols
repeated games
Scalability
Streaming media
unstructured networks
Web server
title Game-theoretic scalable peer-to-peer media streaming
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-28T06%3A17%3A58IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Game-theoretic%20scalable%20peer-to-peer%20media%20streaming&rft.btitle=2008%20IEEE%20International%20Symposium%20on%20Parallel%20and%20Distributed%20Processing&rft.au=Yeung,%20M.K.H.&rft.date=2008-04&rft.spage=1&rft.epage=11&rft.pages=1-11&rft.issn=1530-2075&rft.isbn=1424416930&rft.isbn_list=9781424416936&rft_id=info:doi/10.1109/IPDPS.2008.4536231&rft_dat=%3Cieee_6IE%3E4536231%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&rft.eisbn=1424416949&rft.eisbn_list=9781424416943&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=4536231&rfr_iscdi=true