Cache replacement policies for P2P file sharing protocols

Wierzbicki, Adam; Leibowitz, Nathaniel; Ripeanu, Matei; Wozniak, R.

doi:10.1002/ett.1011

Cited by 26 publications

(10 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For the het.,2:2+1:10 scenario for example, the savings increase by 71 percent for the incoming inter-ISP traffic and 172 percent for the outgoing traffic. Considering that P2P cache eviction policies were reported to achieve within 10 to 20 percent of the hit rate of the optimal off-line eviction policy [10], [11], i.e., very close to the cacheability of P2P content, the 30 to 70 percent decrease of the incoming inter- ISP traffic achieved through cache bandwidth allocation is more than the potential decrease in cache miss rate that could be achieved through improved cache eviction policies.…”

Section: B Stationary Arrival Processmentioning

confidence: 98%

“…Most works focused on the achievable cache hit ratios [17], [18], and on the efficiency of various cache eviction policies [10], [11]. Our work is orthogonal to the works on cache eviction policies, as we assume the existence of a cache eviction policy, and we consider the impact of allocating the cache's upload bandwidth between competing overlays on the amount of inter-ISP traffic generated by the overlays.…”

Section: Related Workmentioning

confidence: 99%

“…P2P caches, similar to web proxy caches, decrease the amount of inter-ISP traffic by storing the most popular contents in the ISP's own network, so that they do not have to be downloaded from peers in other ISPs' networks. According to measurement studies 30 to 80 percent of P2P traffic is cacheable [10], [11]. Nevertheless, the actual efficiency of a cache depends on two main factors.…”

Section: Introductionmentioning

confidence: 99%

“…Web objects are typically small, and consequently eviction policies can replace entire contents at once [12]. Objects in P2P systems are nevertheless typically too big to be replaced at once, so that eviction policies for P2P caches have to allow partial caching of contents [10], [11]. By allowing partial caching, P2P eviction policies can achieve within 10 to 20 percent of the optimal offline eviction policy [10], [11].…”

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: B Stationary Arrival Processmentioning

confidence: 98%

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

“…According to the authors' knowledge, the first work that studied the potential of the caches usage to improve the operation of P2P networks was presented in [10], where the possibility to decrease bandwidth usage was noticed. The positive influence of caching on FastTrack (KaZaA) traffic was experimentally shown in [11]. Inter-connection and cooperation between caches located in different domains is studied in [12].…”

Section: Introductionmentioning

confidence: 99%

Performance evaluation of P2P caches: Flash-crowd case

Chołda

Domial

Wójcik

et al. 2010

2010 Australasian Telecommunication Networks and Applications Conference

View full text Add to dashboard Cite

Peer-to-peer (P2P) based content distribution networks (CDNs), e.g., BitTorrent, are widely used in the today's Internet. Since all peers interested in a specific content provide storage and upload capacity those CDNs facilitate a cheap and easy distribution of large amounts of data. However, they generate a lot of costs for Internet Service Providers (ISPs) as normal users also act as a source for downloads.One option for ISPs to encounter the problem of the costly inter-domain traffic is to establish P2P caches. In this study we investigate the potential of those caches in flash-crowd scenarios, i.e., when a large number of peers tries to download the content at the same time. To that end, we perform simulations as well as experiments with real BitTorrent clients. The evaluation shows that ISPs as well as P2P users will benefit from the use of caches.

show abstract

SeekStream: adapting to dynamic user behavior in P2P video‐on‐demand

Deltouzos

Gkortsilas

Efthymiopoulos

et al. 2016

Int J Communication

View full text Add to dashboard Cite

In recent years, the users' perceived quality of experience (QoE) in streaming services has gained a lot of attention. Particularly, a number of research efforts have focused on providing live streaming and video-ondemand (VoD) services using peer-to-peer (P2P) architectures. However, in these proposed architectures, the heterogeneity of users and their dynamic behavior has not been sufficiently studied. In a real life scenario, where users have highly heterogeneous bandwidth resources (cable, DSL, 3G networks, etc) and can arbitrarily decide to perform a VCR function (stop, fast forward and seeking), ignoring this behavior can significantly deteriorate the system's efficiency and the perceived QoE. In this paper, we present SeekStream, a scalable P2P VoD architecture that ensures the stable delivery of the video stream to every participating user even in cases of high heterogeneity and frequent seeking operations. Specifically, SeekStream is a set of algorithms that optimize the P2P overlay dynamically and in a distributed fashion, making it adaptive to users dynamic behavior and bandwidth changes. The available bandwidth resources of the participating users are optimally exploited, keeping the contribution from the media server(s) to a minimal level. To illustrate the performance of the proposed algorithms, we are using a centralized overlay network manager that discovers the optimal network graph as a reference. We have developed an extensive P2P VoD simulator that shows the efficiency, scalability, and stability of our system under variant and dynamic conditions. The algorithms of our proposed system introduce less than 4% bandwidth overhead while we achieve high offloading of the media server(s). SeekStream guarantees a high block reception rate for the users, even under extreme seeking patterns.In P2P streaming services, each media object (video) is assumed to have a certain average playback rate and is usually divided into blocks of equal size. Peers that are interested to watch the video may enter the system at arbitrary time instants and consume the video fraction(s) of their interest.Adequate space is allocated in each peer's hard disk for the purpose of saving these blocks, which are provided either directly from the media server or from the participating peers. Generally, peers join the system and watch the video sequentially. However, it is not uncommon for someone to skip one or more parts of the video that are of no interest to it.For example, in Figure 1, we depict the hard disk of peer i watching a video of 64 blocks. Peer i joined the system and opted to watch the video not from its beginning, but starting from block 5. Then after having watched until block 12, it jumped to block 17, then from 28 to 37. Its current playback point is block 50 at time t 0 . Because of the jumps, we can see that the white blocks have not been requested, thus creating blank areas, whereas the blocks that are pending (requested but not yet delivered) and received are orange and green respectively. Different video par...

show abstract

Cache replacement policies for P2P file sharing protocols

Cited by 26 publications

References 11 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

Performance evaluation of P2P caches: Flash-crowd case

SeekStream: adapting to dynamic user behavior in P2P video‐on‐demand

Contact Info

Product

Resources

About