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
Bandwidth and Storage Allocation for Operator-owned Content Management Systems
KTH, School of Electrical Engineering (EES), Communication Networks.ORCID iD: 0000-0001-7528-9994
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.
Series
TRITA-EE, ISSN 1653-5146 ; 2014:015
Keyword [en]
Content management systems, resource allocation
National Category
Communication Systems
Research subject
Electrical Engineering; Information and Communication Technology
Identifiers
URN: urn:nbn:se:kth:diva-143880ISBN: 978-91-7595-088-4 (print)OAI: oai:DiVA.org:kth-143880DiVA: diva2:709387
Presentation
2014-04-24, Q2, Osquldas väg 10, KTH, Stockholm, 09:00 (English)
Opponent
Supervisors
Note

QC 20140401

Available from: 2014-04-01 Created: 2014-04-01 Last updated: 2016-12-06Bibliographically approved
List of papers
1. Cache Bandwidth Allocation for P2P File Sharing Systems to Minimize Inter-ISP Traffic
Open this publication in new window or tab >>Cache Bandwidth Allocation for P2P File Sharing Systems to Minimize Inter-ISP Traffic
2016 (English)In: IEEE/ACM Transactions on Networking, ISSN 1063-6692, E-ISSN 1558-2566, Vol. 24, no 1, 437-448 p.Article in journal (Refereed) Published
Abstract [en]

Many Internet service providers (ISPs) have deployed peer-to-peer (P2P) caches in their networks in order to decrease costly inter-ISP traffic. A P2P cache stores parts of the most popular contents locally, and if possible serves the requests of local peers to decrease the inter-ISP traffic. Traditionally, P2P cache resource management focuses on managing the storage resource of the cache so as to maximize the inter-ISP traffic savings. In this paper we show that, when there are many overlays competing for the upload bandwidth of a P2P cache, then in order to maximize the inter-ISP traffic savings the cache's upload bandwidth should be actively allocated among the overlays. We formulate the problem of P2P cache bandwidth allocation as a Markov decision process, and propose three approximations to the optimal cache bandwidth allocation policy. We use extensive simulations and experiments to evaluate the performance of the proposed policies, and show that the bandwidth allocation policy that prioritizes swarms with a small ratio of local peers to all peers in the swarm can improve the inter-ISP traffic savings in BitTorrent-like P2P systems by up to 30 to 60 percent.

Place, publisher, year, edition, pages
IEEE conference proceedings, 2016
Keyword
Peer-to-peer content distribution, caching, Markov decision process, Inter-ISP traffic management
National Category
Communication Systems
Research subject
Electrical Engineering
Identifiers
urn:nbn:se:kth:diva-155324 (URN)10.1109/TNET.2014.2367021 (DOI)000370969300033 ()
Funder
Swedish Research Council, 2010:5812
Note

QC 20141204

Available from: 2014-11-04 Created: 2014-11-04 Last updated: 2017-12-05Bibliographically approved
2. Convergence in Player-Specific Graphical Resource Allocation Games
Open this publication in new window or tab >>Convergence in Player-Specific Graphical Resource Allocation Games
2012 (English)In: IEEE Journal on Selected Areas in Communications, ISSN 0733-8716, E-ISSN 1558-0008, Vol. 30, no 11, 2190-2199 p.Article in journal (Refereed) Published
Abstract [en]

As a model of distributed resource allocation in networked systems, we consider resource allocation games played over a influence graph. The influence graph models limited interaction between the players due to, e. g., the network topology: the payoff that an allocated resource yields to a player depends only on the resources allocated by her neighbors on the graph. We prove that pure strategy Nash equilibria (NE) always exist in graphical resource allocation games and we provide a linear time algorithm to compute equilibria. We show that these games do not admit a potential function: if there are closed paths in the influence graph then there can be best reply cycles. Nevertheless, we show that from any initial allocation of a resource allocation game it is possible to reach a NE by playing best replies and we provide a bound on the maximal number of update steps required. Furthermore we give sufficient conditions in terms of the influence graph topology and the utility structure under which best reply cycles do not exist. Finally we propose an efficient distributed algorithm to reach an equilibrium over an arbitrary graph and we illustrate its performance on different random graph topologies.

Keyword
resource allocation, graphical games, player-specific congestion games, best reply dynamics
National Category
Electrical Engineering, Electronic Engineering, Information Engineering
Identifiers
urn:nbn:se:kth:diva-109783 (URN)10.1109/JSAC.2012.121211 (DOI)000311673200011 ()2-s2.0-84870277594 (Scopus ID)
Funder
Swedish Research Council, 2010-5812ICT - The Next Generation
Note

QC 20130109

Available from: 2013-01-08 Created: 2013-01-08 Last updated: 2017-12-06Bibliographically approved
3. Content-peering Dynamics of Autonomous Caches in a Content-centric Network
Open this publication in new window or tab >>Content-peering Dynamics of Autonomous Caches in a Content-centric Network
2013 (English)In: 2013 Proceedings IEEE Infocom, IEEE Computer Society, 2013, 1079-1087 p.Conference paper, Published 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
Series
IEEE Infocom. Proceedings, ISSN 0743-166X
Keyword
Content-centric networks, CCN, Content-peering, Game Theory, Stability and Convergence
National Category
Telecommunications
Research subject
SRA - ICT
Identifiers
urn:nbn:se:kth:diva-118445 (URN)10.1109/INFCOM.2013.6566898 (DOI)000326335201023 ()2-s2.0-84883118245 (Scopus ID)978-146735946-7 (ISBN)
Conference
32nd IEEE Conference on Computer Communications, IEEE INFOCOM 2013; Turin; Italy; 14 April 2013 through 19 April 2013
Note

QC 20130710

Available from: 2013-07-10 Created: 2013-02-18 Last updated: 2014-04-01Bibliographically approved

Open Access in DiVA

Pacific Licentiate(1122 kB)632 downloads
File information
File name FULLTEXT02.pdfFile size 1122 kBChecksum SHA-512
f868ac7344a82b7e5ae08cdf830d79f9c0b76863e1441329a3da774484987bafafdd6c9580c4c0b8e6cf526b57db6ea62ee4a119abd60181201870d2d192d680
Type fulltextMimetype application/pdf

Authority records BETA

Pacifici, Valentino

Search in DiVA

By author/editor
Pacifici, Valentino
By organisation
Communication Networks
Communication Systems

Search outside of DiVA

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