Change search
ReferencesLink to record
Permanent link

Direct link
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 (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
URN: urn:nbn:se:kth:diva-47473ScopusID: 2-s2.0-80054981267ISBN: 978-0-9836283-0-9OAI: diva2:455465
2011 23rd International Teletraffic Congress, ITC 2011. San Francisco, CA. 6 September 2011 - 9 September 2011
Swedish Research Council
QC 20111115Available from: 2012-02-06 Created: 2011-11-10 Last updated: 2012-02-06Bibliographically approved

Open Access in DiVA

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

Other links

ScopusACM Digital library

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: 207 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

Total: 41 hits
ReferencesLink to record
Permanent link

Direct link