Skip to main navigation Skip to search Skip to main content

Discovering multiple resource holders in query-incentive networks

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

2 Citations (Scopus)

Abstract

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

Original languageEnglish
Title of host publication2011 IEEE Consumer Communications and Networking Conference, CCNC'2011
Pages1000-1004
Number of pages5
DOIs
Publication statusPublished - 2011
Externally publishedYes
Event2011 IEEE Consumer Communications and Networking Conference, CCNC 2011 - Las Vegas, United States
Duration: 9 Jan 2011 → 12 Jan 2011

Publication series

Name2011 IEEE Consumer Communications and Networking Conference, CCNC'2011

Conference

Conference2011 IEEE Consumer Communications and Networking Conference, CCNC 2011
Country/TerritoryUnited States
CityLas Vegas
Period9/01/11 → 12/01/11

Keywords

  • P2P media streaming
  • game theory
  • query-incentive network
  • resource discovery

Fingerprint

Dive into the research topics of 'Discovering multiple resource holders in query-incentive networks'. Together they form a unique fingerprint.

Cite this