The Impact of Caching on BitTorrent-Like Peer-to-Peer Systems

Lehrieder, Frank; Dán, György; Hoßfeld, Tobias; Oechsner, Simon; Singeorzan, Vlad

doi:10.1109/p2p.2010.5569994

Cited by 17 publications

(18 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Our work relies on the analytical models of the system dynamics of BitTorrent-like systems in [13], [25]- [29]. These works used a Markovian model of the system dynamics of BitTorrent-like systems to model the service capacity and the scalability [25], [26], to evaluate the impact of peer upload rate allocation between two classes of peers [27], to assist the dimensioning of server assisted hybrid P2P content distribution [29], and to evaluate the impact of caches on the swarm dynamics and on the amount of inter-ISP traffic for a single overlay [13].…”

Section: Related Workmentioning

confidence: 99%

“…These works used a Markovian model of the system dynamics of BitTorrent-like systems to model the service capacity and the scalability [25], [26], to evaluate the impact of peer upload rate allocation between two classes of peers [27], to assist the dimensioning of server assisted hybrid P2P content distribution [29], and to evaluate the impact of caches on the swarm dynamics and on the amount of inter-ISP traffic for a single overlay [13]. Our work differs significantly from these works, as we consider multiple overlays and use the fluid model of the system dynamics to get insight into the characteristics of an optimal P2P cache bandwidth allocation policy.…”

Section: Related Workmentioning

confidence: 99%

“…In the case of web proxy caching bandwidth management is not necessary, because the incoming inter-ISP traffic saving equals the amount of data served from the cache. In the case of a P2P cache the inter-ISP traffic saving is, however, not only determined by how much data the cache serves but also by the swarm to which the data are served [13], [14]. As an example, consider two swarms, A and B, spread over two ISPs, 1 and 2.…”

Section: Introductionmentioning

confidence: 99%

“…First, we provide a mathematical formulation of the cache bandwidth allocation problem, and show the existence of a stationary optimal policy. Second, we use the proposed mathematical model and insights from [13], [14] to derive three allocation policies to approximate the optimal policy. Third, through simulations and through experiments on Planet-lab we show that by actively allocating the upload bandwidth between different overlays the inter-ISP traffic savings due to P2P caches can be improved significantly.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Cache Bandwidth Allocation for P2P File-Sharing Systems to Minimize Inter-ISP Traffic

Pacifici

Lehrieder

Dán

2016

IEEE/ACM Trans. Networking

View full text Add to dashboard Cite

Abstract-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.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Cache Bandwidth Allocation for P2P File-Sharing Systems to Minimize Inter-ISP Traffic

Pacifici

Lehrieder

Dán

2016

IEEE/ACM Trans. Networking

View full text Add to dashboard Cite

show abstract

“…In [17] and [18] these models were extended to analyze the impact of server and cache upload bandwidth on the system dynamics, respectively. In contrast to these works, our focus is on the server upload bandwidth needed in peer-to-peer file sharing systems with service guarantees.…”

Section: Related Workmentioning

confidence: 99%

Tradeoffs in cloud and peer-assisted content delivery systems

Carlsson

Dán

Eager

et al. 2012

2012 IEEE 12th International Conference on Peer-to-Peer Computing (P2P)

View full text Add to dashboard Cite

Abstract-With the proliferation of cloud services, cloud-based systems can become a cost-effective means of on-demand content delivery. In order to make best use of the available cloud bandwidth and storage resources, content distributors need to have a good understanding of the tradeoffs between various system design choices. In this work we consider a peer-assisted content delivery system that aims to provide guaranteed average download rate to its customers. We show that bandwidth demand peaks for contents with moderate popularity, and identify these contents as candidates for cloud-based service. We then consider dynamic content bundling (inflation) and cross-swarm seeding, which were recently proposed to improve download performance, and evaluate their impact on the optimal choice of cloud service use. We find that much of the benefits from peer seeding can be achieved with careful torrent inflation, and that hybrid policies that combine bundling and peer seeding often reduce the delivery costs by 20% relative to only using seeding. Furthermore, all these peer-assisted policies reduce the number of files that would need to be pushed to the cloud. Finally, we show that careful system design is needed if locality is an important criterion when choosing cloud-based service provisioning.

show abstract

Assessment of Economic Management of Overlay Traffic: Methodology and Results

Papafili

Stamoulis

Stankiewicz

et al. 2011

The Future Internet

View full text Add to dashboard Cite

Abstract. Overlay applications generate huge amounts of traffic in the Internet, which determines a problem for Internet Service Providers, since it results in high charges for inter-domain traffic. Traditional traffic management techniques cannot deal successfully with overlay traffic. An incentive-based approach that employs economic concepts and mechanisms is required in order to deal with the overlay traffic in a way that is mutually beneficial for all stakeholders of the Future Internet. This "TripleWin" situation is the target of Economic Traffic Management (ETM). A wide variety of techniques are employed by ETM for optimizing overlay traffic management considering performance requirements of overlay and underlay networks together with cost implications for ISPs. However, the assessment of ETM requires an innovative methodology. In this article this methodology is described and major results are presented as obtained accordingly from the evaluation of different ETM mechanisms.

show abstract

The Impact of Caching on BitTorrent-Like Peer-to-Peer Systems

Cited by 17 publications

References 20 publications

Cache Bandwidth Allocation for P2P File-Sharing Systems to Minimize Inter-ISP Traffic

Cache Bandwidth Allocation for P2P File-Sharing Systems to Minimize Inter-ISP Traffic

Tradeoffs in cloud and peer-assisted content delivery systems

Assessment of Economic Management of Overlay Traffic: Methodology and Results

Contact Info

Product

Resources

About