Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • 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
Distributed Caching Algorithms for Interconnected Operator CDNs
KTH, School of Electrical Engineering (EES), Communication Networks.ORCID iD: 0000-0001-7528-9994
KTH, School of Electrical Engineering (EES), Communication Networks.
2016 (English)In: IEEE Journal on Selected Areas in Communications, ISSN 0733-8716, E-ISSN 1558-0008, Vol. 35, no 2, 380-391 p.Article in journal (Refereed) Published
Abstract [en]

Fixed and mobile network operators increasingly deploy managed content distribution networks (CDNs) with the objective of reducing the traffic on their transit links and to improve their customers' quality of experience. As network operator managed CDNs (nCDNs) become commonplace, operators will likely provide common interfaces to interconnect their nCDNs for mutual benefit, as they do with peering today. In this paper, we consider the problem of using distributed algorithms for computing a cache allocation for nCDNs. We show that if every network operator aims to minimize its cost and bilateral payments are not allowed, then it may be impossible to compute a cache allocation. For the case when bilateral payments are possible, we propose two distributed algorithms, the aggregate value compensation and the object value compensation algorithms, which differ in terms of the level of parallelism they allow and in terms of the amount of information exchanged between nCDNs. We prove that the algorithms converge, and we propose a scheme to ensure ex-post individual rationality. Simulations performed on a real autonomous system-level network topology and synthetic topologies show that the algorithms have geometric rate of convergence, and scale well with the graphs' density and the nCDN capacity.

Place, publisher, year, edition, pages
IEEE, 2016. Vol. 35, no 2, 380-391 p.
Keyword [en]
Operator managed CDNs, cooperative caching, content allocation, game theory
National Category
Communication Systems Telecommunications Computer Systems
Identifiers
URN: urn:nbn:se:kth:diva-197081DOI: 10.1109/JSAC.2017.2659118ISI: 000400412400012Scopus ID: 2-s2.0-85017319075OAI: oai:DiVA.org:kth-197081DiVA: diva2:1050582
Funder
Swedish Research Council, 621-2014-6035
Note

QCR 20161201

QC 20170530

Available from: 2016-11-29 Created: 2016-11-29 Last updated: 2017-05-30Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Pacifici, ValentinoDán, György
By organisation
Communication Networks
In the same journal
IEEE Journal on Selected Areas in Communications
Communication SystemsTelecommunicationsComputer Systems

Search outside of DiVA

GoogleGoogle Scholar

Altmetric score

Total: 27 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • 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