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 algorithms for content placement in hierarchical cache networks
KTH, School of Electrical Engineering (EES), Network and Systems engineering.
KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.ORCID iD: 0000-0001-7528-9994
2017 (English)In: Computer Networks, ISSN 1389-1286, E-ISSN 1872-7069, Vol. 125, p. 160-171Article in journal (Refereed) Published
Abstract [en]

The growing popularity of mobile multimedia content and the increase of wireless access bitrates are straining backhaul capacity in mobile networks. A cost-effective solution to reduce the strain, enabled by emerging all-IP 4G and 5G mobile backhaul architectures, could be in-network caching of popular content during times of peak demand. Motivated by the potential benefits of caching in mobile backhaul networks, in this paper we formulate the problem of content placement in a hierarchical cache network as a binary integer programming problem. We provide a polynomial time solution when the link costs are induced by a potential and we propose a 2-approximation algorithm for the general case. The 2-approximation requires full information about the network topology and the link costs, as well as about the content demands at the different caches, we thus propose two distributed algorithms that are based on limited information on the content demands. We show that the distributed algorithms terminate in a finite number of steps, and we provide analytical results on their approximation ratios. We use simulations to evaluate the proposed algorithms in terms of the achieved approximation ratio and computational complexity on hierarchical cache network topologies as a model of mobile backhaul networks.

Place, publisher, year, edition, pages
ELSEVIER SCIENCE BV , 2017. Vol. 125, p. 160-171
Keywords [en]
Content caching, Distributed placement, Hierarchical cache network, Mobile backhaul, Approximation ratio, Heuristics
National Category
Communication Systems
Identifiers
URN: urn:nbn:se:kth:diva-217039DOI: 10.1016/j.comnet.2017.05.029ISI: 000412608400014Scopus ID: 2-s2.0-85020063105OAI: oai:DiVA.org:kth-217039DiVA, id: diva2:1154164
Note

QC 20171101

Available from: 2017-11-01 Created: 2017-11-01 Last updated: 2017-11-01Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records BETA

Pacifici, Valentino

Search in DiVA

By author/editor
Josilo, SladanaPacifici, Valentino
By organisation
Network and Systems engineeringACCESS Linnaeus Centre
In the same journal
Computer Networks
Communication Systems

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 51 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