Integrating P2P with Next Generation Networks

2005

The success of the P2P idea has created a huge diversity of approaches, among which overlay networks, for example, Gnutella, Kazaa, Chord, Pastry, Tapestry, P-Grid, or DKS, have received specific attention from both developers and researchers. A wide variety of algorithms, data structures, and architectures have been proposed. The terminologies and abstractions used, however, have become quite inconsistent since the P2P paradigm has attracted people from many different communities, e.g., networking, databases, distributed systems, graph theory, complexity theory, biology, etc. In this paper we propose a reference model for overlay networks which is capable of modeling different approaches in this domain in a generic manner. It is intended to allow researchers and users to assess the properties of concrete systems, to establish a common vocabulary for scientific discussion, to facilitate the qualitative comparison of the systems, and to serve as the basis for defining a standardized API to make overlay networks interoperable.

Regarding the limitations of the traditional Client/Server communication mode from the one hand, and of the P2P mode from the other hand, hybrid network architectures have recently gained large popularity. In this paper we propose a new hybrid architecture that is called P2PWeb, between the centralized client/server and the non-centralized P2P architectures for content delivery over the Internet. The main objective of this proposal is to reduce the load over the server in order to provide a better Quality of Service (QoS) for the end-users. A BitTorrent-like protocol has been implemented and deployed to reach the objective. Moreover, we support our system with a user-satisfaction control technique that helps to improve the provided service of the hybrid P2PWeb architecture. The experimentation results and the performance evaluations that we have made show the efficiency of the proposed system in terms of QoS evaluations.

PIK - Praxis der Informationsverarbeitung und Kommunikation, 2007

2005

This paper takes a novel perspective to P2P networking. Can a P2P system be used for the distribution of files with time-critical data such as relevant software patches or virus footprints updates?

2005

Due to the information growth, distributed environments are offered as a feasible and scalable solution where Peerto-Peer networks have become more relevant. They bring many advantages as high flexibility for peers to join or leave the network dynamically, scalability, autonomy and high resilience against peer failures. However, the use of proprietary interfaces within the network and the requirement that peers must implement them to join makes P2P networks unable to interact with other systems and environments, isolating the network as a whole. In this paper, we report on a solution based on a proxy-based architecture and semantic mappings in order to allow the sharing of content between peers within a P2P network with content from other systems outside the network.

Proceedings of the STreaming Day, 2007

As peer-to-peer (P2P) emerges as a new paradigm for scalable network application design, it is also posing significant new challenges to achieving efficient and fair utilization of network resources. In particular, without the ability to explicitly communicate with network providers, P2P applications may consume too much bandwidth than the network provider can afford, trigering network provider reaction. Furthermore, P2P applications depend mainly on inefficient network inference and network-oblivious peering, leading to potential inefficiencies for both P2P applications and network providers. In this paper, we propose a simple, light-weight architecture called P4P to allow more effective cooperative traffic control between applications and network providers. We conduct not only extensive simulations but also real-life experiments with three major ISPs to demonstrate the effectiveness and feasibility of P4P.

The Journal of Supercomputing, 2009

Traditional Peer-to-Peer (P2P) systems were restricted to sharing of files on the Internet. Although some of the more recent P2P distributed systems have tried to support transparent sharing of other types of resources, like computer processing power, but none allow and support sharing of all types of resources available on the Internet. This is mainly because the resource management part of P2P systems are custom designed in support of specific features of only one type of resource, making simultaneous access to all types of resources impractical. Another shortcoming of existing P2P systems is that they follow a client/server model of resource sharing that makes them structurally constrained and dependent on dedicated servers (resource managers). Clients must get permission from a limited number of servers to share or access resources, and resource management mechanisms run on these servers. Because resource management by servers is not dynamically reconfigurable, such P2P systems are not scalable to the ever growing extent of Internet. We present an integrated framework for sharing of all types of resources in P2P systems by using a dynamic structure for managing four basic types of resources, namely process, file, memory, and I/O, in the same way they are routinely managed by operating systems. The proposed framework allows P2P systems to use dynamically reconfigurable resource management mechanisms where each machine in the P2P system can at the same time serve both as a server and as a client. The pattern of requests for shared resources at a given time identifies which machines are currently servers and which ones are currently clients. The client server pattern changes with changes in the pattern of requests for distributed resources. Scalable P2P systems with dynamically M. Sharifi ( ) • S.

Peer-to-Peer Networking and Applications, 2018

Mutualcast is a one-to-many (peer-to-peer) scheme for content distribution that maximizes the overall throughput during a broadacast session. It is based on a fully-connected graph (full mesh topology), which introduces benefits such as robustness or simultaneous transmission from/to multiple devices. The main disadvantage of Mutualcast is scalability; it is constraint to a small P2P group for content distribution. In this paper, we make Mutualcast scalable. We propose a highly collaborative and scalable P2P tree-based architecture made of two main components: 1) Peer grouping or clustering and 2) Hierarchical tree-based content distribution. In step 1), peer nodes (content receivers) are grouped into equal-size clusters by using a proposed heuristic size-constrained algorithm based on k-means. In step 2), clusters (which become the nodes of the tree) are organized into a single hierarchical n-ary tree-based architecture, in which the root of the tree (Root Cluster) is the one closest to source peer, while intermediate and leaf clusters are positioned in the tree according to their delay-proximity to previously inserted clusters. During content distribution, the root cluster receives the blocks of content before any other cluster in the tree and directly from (and only from) the source peer; blocks are then passed on to the next hierarchical level down the tree in order (higher levels of the tree receive the content before lower levels). Inter-clusters and intra-clusters content distribution is performed concurrently and takes into account peers upload/download capacities to relay blocks of content. The evaluation of our hierarchical P2P architecture concentrates on the following metrics: scalability of the systems, overall end-to-end delay distribution, and efficient cluster size. Finally, our architecture is compared against two well-known P2P technologies in the literature, Super-Peer and Kademlia.

The scope of the peer-to-peer (P2P) paradigm has expanded beyond the research arena and has become ubiquitous in commercial, industrial and military applications. This ubiquity, however, comes at the cost of significant handicap in design and development of large- scale, reliable, complex realtime applications, as they do not fit into readily available optimized P2P solutions, such as file distribution, grid computing, or Pub/Sub message-passing networks. Rather, these applications necessitate custom development, a high-risk, time consuming and expensive process. We approach this gap by categorizing the problem space into an application taxonomy, and identifying a new class, which we call Extreme P2P applications. Extreme applications are characterized by cross-cutting dimensions of severe QoS requirements, variable resource constraints, evolution during deployment, inherent human participation during operation, and small market share - to name a few. Such characteristics contribute...