File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Article: On game theoretic peer selection for resilient peer-to-peer media streaming

TitleOn game theoretic peer selection for resilient peer-to-peer media streaming
Authors
KeywordsCoalition
Cooperative game
Incentives
P2P media streaming
Structured P2P topology
Unstructured P2P topology
Issue Date2009
PublisherI E E E. The Journal's web site is located at http://www.computer.org/tpds
Citation
Ieee Transactions On Parallel And Distributed Systems, 2009, v. 20 n. 10, p. 1512-1525 How to Cite?
AbstractPeer-to-peer (P2P) media streaming quickly emerges as an important application over the Internet. A plethora of approaches have been suggested and implemented to support P2P media streaming. In our study, we first classified existing approaches and studied their characteristics by looking at three important quantities: number of upstream peers (parents), number of downstream peers (children), and average number of links per peer. In existing approaches, peers are assigned with a fixed number of parents without regard to their contributions, measured by the amount of outgoing bandwidths. Obviously, this is an undesirable arrangement as it leads to highly inefficient use of the P2P links. This observation motivates us to model the peer selection process as a cooperative game among peers. This results in a novel peer selection protocol such that the number of upstream peers of a peer is related to its outgoing bandwidth. Specifically, peers with larger outgoing bandwidth are given more parents, which make them less vulnerable to peer dynamics. Simulation results show that the proposed protocol improves delivery ratio using similar number of links per peer, comparing with existing approaches under a wide range of system parameters. © 2009 IEEE.
Persistent Identifierhttp://hdl.handle.net/10722/124741
ISSN
2015 Impact Factor: 2.661
2015 SCImago Journal Rankings: 1.590
ISI Accession Number ID
References

 

DC FieldValueLanguage
dc.contributor.authorYeung, MKHen_HK
dc.contributor.authorKwok, YKen_HK
dc.date.accessioned2010-10-31T10:51:28Z-
dc.date.available2010-10-31T10:51:28Z-
dc.date.issued2009en_HK
dc.identifier.citationIeee Transactions On Parallel And Distributed Systems, 2009, v. 20 n. 10, p. 1512-1525en_HK
dc.identifier.issn1045-9219en_HK
dc.identifier.urihttp://hdl.handle.net/10722/124741-
dc.description.abstractPeer-to-peer (P2P) media streaming quickly emerges as an important application over the Internet. A plethora of approaches have been suggested and implemented to support P2P media streaming. In our study, we first classified existing approaches and studied their characteristics by looking at three important quantities: number of upstream peers (parents), number of downstream peers (children), and average number of links per peer. In existing approaches, peers are assigned with a fixed number of parents without regard to their contributions, measured by the amount of outgoing bandwidths. Obviously, this is an undesirable arrangement as it leads to highly inefficient use of the P2P links. This observation motivates us to model the peer selection process as a cooperative game among peers. This results in a novel peer selection protocol such that the number of upstream peers of a peer is related to its outgoing bandwidth. Specifically, peers with larger outgoing bandwidth are given more parents, which make them less vulnerable to peer dynamics. Simulation results show that the proposed protocol improves delivery ratio using similar number of links per peer, comparing with existing approaches under a wide range of system parameters. © 2009 IEEE.en_HK
dc.languageengen_HK
dc.publisherI E E E. The Journal's web site is located at http://www.computer.org/tpdsen_HK
dc.relation.ispartofIEEE Transactions on Parallel and Distributed Systemsen_HK
dc.rightsIEEE Transactions on Parallel and Distributed Systems. Copyright © IEEE.-
dc.rightsCreative Commons: Attribution 3.0 Hong Kong License-
dc.rights©2009 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.-
dc.subjectCoalitionen_HK
dc.subjectCooperative gameen_HK
dc.subjectIncentivesen_HK
dc.subjectP2P media streamingen_HK
dc.subjectStructured P2P topologyen_HK
dc.subjectUnstructured P2P topologyen_HK
dc.titleOn game theoretic peer selection for resilient peer-to-peer media streamingen_HK
dc.typeArticleen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=1045-9219&volume=20&issue=10&spage=1512&epage=1525&date=2009&atitle=On+game+theoretic+peer+selection+for+resilient+peer-to-peer+media+streaming-
dc.identifier.emailKwok, YK:ykwok@eee.hku.hken_HK
dc.identifier.authorityKwok, YK=rp00128en_HK
dc.description.naturepublished_or_final_version-
dc.identifier.doi10.1109/TPDS.2008.253en_HK
dc.identifier.scopuseid_2-s2.0-70349111413en_HK
dc.identifier.hkuros175074en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-70349111413&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume20en_HK
dc.identifier.issue10en_HK
dc.identifier.spage1512en_HK
dc.identifier.epage1525en_HK
dc.identifier.isiWOS:000269132000009-
dc.publisher.placeUnited Statesen_HK
dc.identifier.scopusauthoridYeung, MKH=7101861665en_HK
dc.identifier.scopusauthoridKwok, YK=7101857718en_HK
dc.identifier.citeulike5846694-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats