Cooperative caching and relaying strategies for peer-to-peer content delivery (original) (raw)
Related papers
Caching and relaying strategies for peer-to-peer content delivery
2007
— Peer-to-peer content distribution has become a major source of bandwidth costs for Internet service providers (ISPs). One way for ISPs to decrease these costs is to deploy caches for p2p traffic. To make efficient use of the caches, in this paper we propose a cooperative caching and relaying scheme that is compatible with the existing business relations between ISPs. We formulate the problem of cooperative caches as a resource allocation problem, and show that it is related to the problem of r-configuration studied in graph theory. We propose a distributed algorithm to solve the resource allocation problem, and show that cooperation leads to significant gains compared to non-cooperative caching. I.
Cache replacement policies for P2P file sharing protocols
2004
Abstract Peer-to-peer (P2P) file-sharing applications generate a large part of today's Internet traffic. The large volume of this traffic (thus high potential caching benefits) and the large cache sizes required (thus non-trivial costs associated with caching) only underline that efficient cache replacement policies are important in this case. File popularity in P2P file-sharing networks does not follow Zipf's law and several additional characteristics set the generated traffic apart from well-studied Web traffic.
2014 International Conference and Workshop on the Network of the Future (NOF), 2014
ABSTRACT In-network content caching has recently emerged in the context of Information-Centric Networking (ICN), which allows content objects to be cached at the content router side. In this paper, we specifically focus on in-network caching of Peer-to-Peer (P2P) content objects for improving both service and operation efficiencies. We propose an intelligent in-network caching scheme of P2P content chunks, aiming to reduce P2Pbased content traffic load and also to achieve improved content distribution performance. Towards this end, the proposed holistic decision-making logic takes into account context information on the P2P characteristics such as chunk availability. In addition, we also analyse the benefit of coordination between neighbouring content routers when making caching decisions in order to avoid duplicated P2P chunk caching nearby. An analytical modelling framework is developed to quantitatively evaluate the efficiency of the proposed in-network caching scheme.
Cache me if you can: Capacitated selfish replication in networks
2016
Motivated by peer-to-peer (P2P) networks and content delivery applications, we study Capacitated Selfish Replication (CSR) games, which involve nodes on a network making strategic choices regarding the content to replicate in their caches. Selfish replication games were introduced in [6], who analyzed the uncapacitated case leaving the capacitated version as an open direction. In this work, we study pure Nash equilibria of CSR games with an emphasis on hierarchical net-works, which have been extensively used to model the communication costs of content delivery and P2P systems. The best result from previous work on CSR games for hierarchical networks [21, 27] is the ex-istence of a Nash equilibrium for a (slight generalization of a) 1-level hierarchy when the utility function is based on the sum of the costs of accessing the replicated objects in the network. Our main result is an exact polynomial-time algorithm for finding a Nash Equilibrium in any hierarchical network using a new t...
An Optimal Cache Partition Based Algorithm For Content Distribution And Replication
Generally, users can cast up two sorts of requests, such as elastic requests that contain no delay constraints, and inelastic requests that take an inflexible delay constraint. The distribution of WSN's in multiple areas like, target tracking in battle fields, environmental control needs an optimization for communication among the detectors to serve information in shorter latency and with minimal energy consumption. Cooperative data caching emerged as a productive technique to accomplish these ends simultaneously. The execution of protocols for that network depends mainly on the selection of the sensors which will call for special roles in accordance to the procedure of caching and take forwarding decisions. A perception of Wireless content distribution was shown in which there are numerous cellular base stations, each of which encompass a cache for storing of content. Content is typically partitioned into two disjoint sets of inelastic as well as elastic content. Cooperative caching is shown to be capable to reduce content provisioning cost which heavily depends on service and pricing dependencies among several stakeholders including content providers, web service providers, and end consumers. Hither, a practical network, service, and economic pricing models which are then utilized for making an optimal cooperative caching strategy based on social community abstraction in wireless nets are broken. Inelastic requests are provided by means of broadcast transmissions and here we develop algorithms in support of content spread by means of elastic and inelastic requests. The developed framework includes optimal caching algorithms, analytical models, for evaluating the operation of the suggested scheme. The primary donations are: i) formulation of economic cost-reward flow models among the WNET stakeholders, ii) developing optimal distributed cooperative caching algorithms, iii) characterizing the impacts of network, user and object dynamics, and finally iv) investigating the impacts of user noncooperation,