Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Selfish Content Replication on Graphs
KTH, School of Electrical Engineering (EES), Communication Networks.ORCID iD: 0000-0001-7528-9994
KTH, School of Electrical Engineering (EES), Communication Networks.ORCID iD: 0000-0002-4876-0223
2011 (English)In: ITC '11 Proceedings of the 23rd International Teletraffic Congress, ITCP , 2011, 119-126 p.Conference paper, Published paper (Refereed)
Abstract [en]

Replication games are a model of the problem of content placement in computer and communication systems, when the participating nodes make their decisions such as to maximize their individual utilities. In this paper we consider replication games played over arbitrary social graphs; the social graph models limited interaction between the players due to, e.g., the network topology. We show that in replication games there is an equilibrium object placement for arbitrary social graphs. Nevertheless, if all nodes follow a myopic strategy to update their object placements then they might cycle arbitrarily long before reaching an equilibrium if the social graph is non-complete. We give sufficient conditions under which such cycles do not exist, and propose an efficient distributed algorithm to reach an equilibrium over a non-complete social graph.

Place, publisher, year, edition, pages
ITCP , 2011. 119-126 p.
National Category
Engineering and Technology
Research subject
SRA - ICT
Identifiers
URN: urn:nbn:se:kth:diva-47473Scopus ID: 2-s2.0-80054981267ISBN: 978-0-9836283-0-9 (print)OAI: oai:DiVA.org:kth-47473DiVA: diva2:455465
Conference
2011 23rd International Teletraffic Congress, ITC 2011. San Francisco, CA. 6 September 2011 - 9 September 2011
Funder
Swedish Research Council
Note
QC 20111115Available from: 2012-02-06 Created: 2011-11-10 Last updated: 2012-02-06Bibliographically approved

Open Access in DiVA

fulltext(415 kB)247 downloads
File information
File name FULLTEXT01.pdfFile size 415 kBChecksum SHA-512
b2878066b6783a7fbc6b9d26b269eeaab83b4ccc2597d302c1c76d65348979942818b1731527132425ea2e4baca5dc5f0cb153426463ab511c3da868c0a31b1c
Type fulltextMimetype application/pdf

Other links

ScopusACM Digital library

Authority records BETA

Pacifici, ValentinoDán, György

Search in DiVA

By author/editor
Pacifici, ValentinoDán, György
By organisation
Communication Networks
Engineering and Technology

Search outside of DiVA

GoogleGoogle Scholar
Total: 247 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

isbn
urn-nbn

Altmetric score

isbn
urn-nbn
Total: 55 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf