File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Discovering multiple resource holders in query-incentive networks

TitleDiscovering multiple resource holders in query-incentive networks
Authors
Keywordsgame theory
P2P media streaming
query-incentive network
resource discovery
Issue Date2011
PublisherIEEE.
Citation
The 8th IEEE Consumer Communications and Networking Conference (CCNC 2011), Las Vegas, NV., 9-12 January 2011. In Proceedings of the 8th CCNC, 2011, p. 1000-1004 How to Cite?
AbstractIn this paper, we study the problem of discovering multiple resource holders and how to evaluate a node's satisfaction in query incentive networks. Utilizing an acyclic tree, we show that query propagation has a nature of exponential start, polynomial growth, and eventually becoming a constant. We model the query propagation as an extensive game, obtain nodes' greedy behaviors from Nash equilibrium analysis, and show the impairment of greedy behaviors via a repeated Prisoner's Dilemma. We demonstrate that cooperation enforcement is required to achieve the optimal state of resource discovery. © 2011 IEEE.
DescriptionSession - Content Distribution and Peer-to-Peer Networks
Persistent Identifierhttp://hdl.handle.net/10722/142818
ISBN
References

 

DC FieldValueLanguage
dc.contributor.authorJin, Xen_HK
dc.contributor.authorXu, Ken_HK
dc.contributor.authorLi, VOKen_HK
dc.contributor.authorKwok, YKen_HK
dc.date.accessioned2011-10-28T02:56:06Z-
dc.date.available2011-10-28T02:56:06Z-
dc.date.issued2011en_HK
dc.identifier.citationThe 8th IEEE Consumer Communications and Networking Conference (CCNC 2011), Las Vegas, NV., 9-12 January 2011. In Proceedings of the 8th CCNC, 2011, p. 1000-1004en_HK
dc.identifier.isbn978-1-4244-8790-5-
dc.identifier.urihttp://hdl.handle.net/10722/142818-
dc.descriptionSession - Content Distribution and Peer-to-Peer Networks-
dc.description.abstractIn this paper, we study the problem of discovering multiple resource holders and how to evaluate a node's satisfaction in query incentive networks. Utilizing an acyclic tree, we show that query propagation has a nature of exponential start, polynomial growth, and eventually becoming a constant. We model the query propagation as an extensive game, obtain nodes' greedy behaviors from Nash equilibrium analysis, and show the impairment of greedy behaviors via a repeated Prisoner's Dilemma. We demonstrate that cooperation enforcement is required to achieve the optimal state of resource discovery. © 2011 IEEE.en_HK
dc.languageengen_US
dc.publisherIEEE.-
dc.relation.ispartofProceedings of the IEEE Consumer Communications and Networking Conference, CCNC'2011en_HK
dc.rightsIEEE Consumer Communications and Networking Conference. Copyright © IEEE.-
dc.rightsCreative Commons: Attribution 3.0 Hong Kong License-
dc.rights©2011 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.subjectgame theoryen_HK
dc.subjectP2P media streamingen_HK
dc.subjectquery-incentive networken_HK
dc.subjectresource discoveryen_HK
dc.titleDiscovering multiple resource holders in query-incentive networksen_HK
dc.typeConference_Paperen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=978-1-4244-8790-5&volume=&spage=1000&epage=1004&date=2011&atitle=Discovering+multiple+resource+holders+in+query-incentive+networks-
dc.identifier.emailLi, VOK:vli@eee.hku.hken_HK
dc.identifier.emailKwok, YK:ykwok@eee.hku.hken_HK
dc.identifier.authorityLi, VOK=rp00150en_HK
dc.identifier.authorityKwok, YK=rp00128en_HK
dc.description.naturepublished_or_final_version-
dc.identifier.doi10.1109/CCNC.2011.5766315en_HK
dc.identifier.scopuseid_2-s2.0-79957892322en_HK
dc.identifier.hkuros196909en_US
dc.identifier.hkuros194135-
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-79957892322&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.spage1000en_HK
dc.identifier.epage1004en_HK
dc.description.otherThe 8th IEEE Consumer Communications and Networking Conference (CCNC 2011), Las Vegas, NV., 9-12 January 2011. In Proceedings of the 8th CCNC, 2011, p. 1000-1004-
dc.identifier.scopusauthoridJin, X=40561426600en_HK
dc.identifier.scopusauthoridXu, K=35101233700en_HK
dc.identifier.scopusauthoridLi, VOK=7202621685en_HK
dc.identifier.scopusauthoridKwok, YK=7101857718en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats