Change search
ReferencesLink to record
Permanent link

Direct link
Content-peering Dynamics of Autonomous Caches in a Content-centric Network
KTH, School of Electrical Engineering (EES), Communication Networks. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.ORCID iD: 0000-0001-7528-9994
KTH, School of Electrical Engineering (EES), Communication Networks. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.ORCID iD: 0000-0002-4876-0223
2013 (English)In: 2013 Proceedings IEEE Infocom, IEEE Computer Society, 2013, 1079-1087 p.Conference paper (Refereed)
Abstract [en]

Autonomous systems are likely to play a similar role in a content-centric Internet as they do today. Thus, the content-centric Internet will be a network of cache networks, each of them optimized for local performance. In this paper we consider ASs that maintain peering agreements with each other for mutual benefit, and engage in content-level peering in order to leverage each others' cache contents. We propose a game theoretical model of the interaction and the coordination between the caches managed by peering ASs. We address the questions of whether stable and efficient content-level peering can be implemented without explicit coordination between the neighboring ASs or alternatively, whether the interaction needs to rely on explicit announcements of content reachability in order for the system to be stable. We show that without coordination content-peering can lead to stable but inefficient cache configurations. For the case of coordination we show that in order to efficiently reach a stable cache configuration, the ASs need to follow an ex-ante irrational algorithm, which is, however, ex-post rational. We validate our analytical results using simulations on the measured peering topology of more than 600 ASs.

Place, publisher, year, edition, pages
IEEE Computer Society, 2013. 1079-1087 p.
, IEEE Infocom. Proceedings, ISSN 0743-166X
Keyword [en]
Content-centric networks, CCN, Content-peering, Game Theory, Stability and Convergence
National Category
Research subject
URN: urn:nbn:se:kth:diva-118445DOI: 10.1109/INFCOM.2013.6566898ISI: 000326335201023ScopusID: 2-s2.0-84883118245ISBN: 978-146735946-7OAI: diva2:606201
32nd IEEE Conference on Computer Communications, IEEE INFOCOM 2013; Turin; Italy; 14 April 2013 through 19 April 2013

QC 20130710

Available from: 2013-07-10 Created: 2013-02-18 Last updated: 2014-04-01Bibliographically approved
In thesis
1. Bandwidth and Storage Allocation for Operator-owned Content Management Systems
Open this publication in new window or tab >>Bandwidth and Storage Allocation for Operator-owned Content Management Systems
2014 (English)Licentiate thesis, comprehensive summary (Other academic)
Abstract [en]

The demand for Internet-based visual content delivery has increased significantly in recent years, triggered mainly by the widespread use of Internet enabled smartphones and portable devices, and by the availability of super HD content.As a consequence, live and on-demand video content has become the most important source of network traffic in mobile and fixed networks alike.In order to be able to efficiently deliver the increasing amount of video traffic, network operators have started to deploy caches and operator-owned CDNs. These solutions do not only reduce the amount of transit traffic of the operators but they may also improve the customers' quality of experience, through bringing the video content closer to customers. Nevertheless, their efficiency is determined by the algorithms and protocols used to allocate resources, both in terms of storage and bandwidth. The work in this thesis addresses the allocation of these two resources for operator-owned content management systems.

In the first part of the thesis we consider a cache maintained by a single network operator. We investigate how caching at a network operator affects the content distribution system as a whole, and consequently, the efficiency of content delivery. We propose a model of the decision process undertaken by a network operator that aims at optimizing the efficiency of a cache by actively managing its bandwidth. We design different algorithms that aim at approximating the optimal cache bandwidth allocation and we evaluate them through extensive simulations and experiments. We show that active cache bandwidth allocation can significantly increase traffic savings.

We then consider the potential interaction among caches maintained by different network operators.We consider the problem of selfish replication on a graph as a modelof network operators that individually deploy replication systems, and try to leverage their peering agreements so as to minimize the traffic through their transit providers. We use game-theoretical tools to investigate the existence of stable and efficient allocations of content at the network operators. We show that selfish myopic updates of content allocations at different network operators lead the system to a stable state, and that the convergence speed depends on the underlying network topology. In addition, we show that interacting operator-owned caches can reach a stable content allocation without coordination, but coordination leads to more cost efficient content allocations.

Place, publisher, year, edition, pages
Stockholm: KTH Royal Institute of Technology, 2014. vi, 33 p.
TRITA-EE, ISSN 1653-5146 ; 2014:015
Content management systems, resource allocation
National Category
Communication Systems
Research subject
Electrical Engineering; Information and Communication Technology
urn:nbn:se:kth:diva-143880 (URN)978-91-7595-088-4 (ISBN)
2014-04-24, Q2, Osquldas väg 10, KTH, Stockholm, 09:00 (English)

QC 20140401

Available from: 2014-04-01 Created: 2014-04-01 Last updated: 2014-04-01Bibliographically approved

Open Access in DiVA

Pacifici-Dan-CCN-INFOCOM2013(313 kB)328 downloads
File information
File name FULLTEXT01.pdfFile size 313 kBChecksum SHA-512
Type fulltextMimetype application/pdf

Other links

Publisher's full textScopusINFOCOM 2013

Search in DiVA

By author/editor
Pacifici, ValentinoDán, György
By organisation
Communication NetworksACCESS Linnaeus Centre

Search outside of DiVA

GoogleGoogle Scholar
Total: 328 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

Altmetric score

Total: 71 hits
ReferencesLink to record
Permanent link

Direct link