A survey of peer-to-peer content distribution technologies

  title={A survey of peer-to-peer content distribution technologies},
  author={Stephanos Androutsellis-Theotokis and Diomidis D. Spinellis},
  journal={ACM Comput. Surv.},
Distributed computer architectures labeled "peer-to-peer" are designed for the sharing of computer resources (content, storage, CPU cycles) by direct exchange, rather than requiring the intermediation or support of a centralized server or authority. Peer-to-peer architectures are characterized by their ability to adapt to failures and accommodate transient populations of nodes while maintaining acceptable connectivity and performance.Content distribution is an important peer-to-peer application… 

Figures and Tables from this paper

Global-scale peer-to-peer file services with DFS

The Distributed File Services architecture is described - a peer-to-peer service overlay, which allows distinct administrative entities to form arbitrary tile distribution relationships and introduces the notion of a "web of files", as a non-hierarchical, global-scale namespace of distributed data collections.

Overlay network mechanisms for Peer-to-Peer systems

This thesis investigates a novel architecture for designing effective overlay networks for P2P systems that considers the most important characteristics of widely deployed systems and proposes an open architecture simulation framework to augment the evaluation of the work.

Osprey: peer-to-peer enabled content distribution

  • John ReuningPaul Jones
  • Computer Science
    Proceedings of the 5th ACM/IEEE-CS Joint Conference on Digital Libraries (JCDL '05)
  • 2005
Osprey (http://osprey.ibiblio.org) addresses these problems by combining a flexible metadata management system with the BitTorrent peer-to-peer protocol, which lowers the bandwidth costs by employing distributed downloading.

Exploiting heterogeneity in peer-to-peer systems using gradient topologies

This thesis presents a novel class of peer-to-peer topologies, called gradientTopologies, which generalise the concept of super-peer networks and captures application-speci c peer requirements and re ects peers' utility.

A peer-to-peer system for on-demand sharing of capacity across network applications

This paper presents a number of important extensions to the basic Hoverlay architecture, which collectively enhance the degree of control owners have over their nodes and the overall level of cooperation among servers.

Peer-to-peer Overlays for Resource Discovery

The solution seek the development of a P2P middleware infrastructure based on the concept of a Gridlet, a semanticsaware unit of workload division and computation off-load, to exploit different peer-to-peer network topologies that maximize the system performance metrics.

Peer to Peer Networks Management Survey

A survey on P2P networks management: classification, applications, platforms, simulators and security is presented.

Fair Peer Assignment Scheme for Peer-to-Peer File Sharing

Simulation results show that the proposed mechanisms are simple but effective in maintaining service agility and fairness, without loss of overall service capacity in peer-to-peer files sharing systems.

Peer Interest-based Discovery for Decentralized Peer-to-Peer Systems

This paper proposes a structured solution for resource discovery in decentralized peer-to-peer systems, which is guided by peer interest in collaborating with other peers, and develops the overlay network to ensure a very small number of messages required to retrieve, insert or delete a file even in the case of a very large network containing millions of nodes.

A holistic redundancy- and incentive-based framework to improve content availability in peer-to-peer networks

Two complementary, low cost mechanisms are proposed, whereby nodes self-organize to overcome failures and improve content availability, whereby the incentive-based mechanism can promote fair exchange of resources and limits the impact of uncooperative behaviors such as “free-riding”.



Peer-to-Peer Resource Trading in a Reliable Distributed System

This work proposes data trading, a mechanism where a site acquires remote resources in the community by trading away its own local resources, and discusses the application of data trading to the data replication problem, and examines other applications of trading.

PAST: a large-scale, persistent peer-to-peer storage utility

The design of PAST is sketched, a large-scale, Internet-based, global storage utility that provides scalability, high availability, persistence and security, and the use of randomization to ensure diversity in the set of nodes that store a file's replicas.

A local search mechanism for peer-to-peer networks

The modified Breadth-First Search (BFS) mechanism, is an extension of the current Gnuttela protocol, allows searching with keywords, and is designed to minimize the number of messages that are needed to search the network.

Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems

Experimental results obtained with a prototype implementation on an emulated network of up to 100,000 nodes confirm Pastry's scalability and efficiency, its ability to self-organize and adapt to node failures, and its good network locality properties.

KARMA : A Secure Economic Framework for Peer-to-Peer Resource Sharing

A general economic framework for avoiding freeloaders in peer-to-peer systems that is resistant to malicious attempts by the resource provider, consumer, and a fraction of the members of the bank set.

A Comparison of Peer-to-Peer Search Methods

This work presents an overview of several search methods for unstructured peer-to-peer networks, and analyzes the performance of the algorithms relative to their success rates, bandwidth consumption and adaptation to changing topologies.

A Survey of Peer-to-Peer Security Issues

It is discussed how techniques, ranging from cryptography, to random network probing, to economic incentives, can be used to address problems in the underlying p2p routing protocols, as well as fairness and trust issues that occur in file sharing and other p2P applications.

Secure routing for structured peer-to-peer overlay networks

This paper studies attacks aimed at preventing correct message delivery in structured peer-to-peer overlays and presents defenses to these attacks, and describes and evaluates techniques that allow nodes to join the overlay, to maintain routing state, and to forward messages securely in the presence of malicious nodes.

Pastry: Scalable, distributed object location and routing for large-scale peer-to-

Experimental results obtained with a prototype implementa tion on a simulated network of up to 100,000 nodes confirm Pastry’s scalability, its ability to selfconfigure and adapt to node failures, and its good network loc ality properties.

Open Problems in Data-Sharing Peer-to-Peer Systems

This paper proposes future directions for research in P2P systems, and highlights problems that have not yet been studied in great depth, and suggests several open and important research problems for the community to address.