Change search
ReferencesLink to record
Permanent link

Direct link
Cache Bandwidth Allocation for P2P File Sharing Systems to Minimize Inter-ISP Traffic
KTH, School of Electrical Engineering (EES), Communication Networks.ORCID iD: 0000-0001-7528-9994
University of Wurzburg.
KTH, School of Electrical Engineering (EES), Communication Networks.ORCID iD: 0000-0002-4876-0223
2014 (English)In: IEEE/ACM Transactions on Networking, ISSN 1063-6692, E-ISSN 1558-2566, no 99Article 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, 2014. no 99
Keyword [en]
Peer-to-peer content distribution, caching, Markov decision process, Inter-ISP traffic management
National Category
Communication Systems
Research subject
Electrical Engineering
URN: urn:nbn:se:kth:diva-155324DOI: 10.1109/TNET.2014.2367021ISI: 000370969300033OAI: diva2:760859
Swedish Research Council, 2010:5812

QC 20141204

Available from: 2014-11-04 Created: 2014-11-04 Last updated: 2016-03-23Bibliographically approved
In thesis
1. Resource Allocation in Operator-owned Content Delivery Systems
Open this publication in new window or tab >>Resource Allocation in Operator-owned Content Delivery Systems
2016 (English)Doctoral thesis, comprehensive summary (Other academic)
Abstract [en]

Live and on-demand video content have become the most important source of network traffic in mobile and fixed networks in recent years. In order to be able to efficiently deliver the increasing amount of video content, 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 proposes and analyses algorithms for 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 formulate the problem of content caching in a mobile backhaul as an integer program and we show that there exists an efficient centralized solution to the problem. Due to the prohibitive space complexity of the centralized algorithm, we propose two distributed approximations based on local information on the content demands. We then consider the problem of managing cache bandwidth so as to minimize the traffic cost of content delivery and we propose various approximations of the optimal stationary policy. We then consider the interaction among content management systems maintained by different network operators. First, we consider the problem of selfish replication on a graph as a model of network operators that use their caches to prefetch popular content, and try to leverage their peering agreements so as to minimize the traffic through their transit providers. We design efficient distributed algorithms that compute a stable content allocation through selfish myopic updates of content allocations at different network operators. We show that, if the cost function is neighbor-specific, network operators need bilateral payments to compute a stable content allocation that is individually rational. We then consider the problem of coordinated caching in a network of autonomous systems engaged in content-level peering. We investigate whether interacting operator-owned caches need explicit coordination in order to reach a stable content allocation efficiently. Beyond the theoretical contributions made to the analysis of player-specific graphical congestion games and their generalizations, the results in thesis provide guidelines for the design of protocols for standalone and for interconnected operator-owned content management systems.

Place, publisher, year, edition, pages
Stockholm: KTH Royal Institute of Technology, 2016. vi, 44 p.
TRITA-EE, ISSN 1653-5146 ; 2015:120
National Category
Communication Systems
Research subject
Electrical Engineering; Electrical Engineering
urn:nbn:se:kth:diva-180060 (URN)978-91-7595-835-4 (ISBN)
Public defence
2016-01-29, F3, Lindstedtsvägen 26, KTH, Stockholm, 10:00 (English)

QC 20160107

Available from: 2016-01-07 Created: 2016-01-07 Last updated: 2016-01-11Bibliographically approved

Open Access in DiVA

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

Other links

Publisher's full textIEEEXplore

Search in DiVA

By author/editor
Pacifici, ValentinoDán, György
By organisation
Communication Networks
In the same journal
IEEE/ACM Transactions on Networking
Communication Systems

Search outside of DiVA

GoogleGoogle Scholar
Total: 110 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: 139 hits
ReferencesLink to record
Permanent link

Direct link