P2P Frameworks Research Articles

Peer-to-Peer-Based Social Networks: A Comprehensive Survey

The use of online social networks, such as Facebook and Twitter, has grown at a phenomenal rate. These platforms offer services that support interactions via messaging, chatting or audio/video conferencing, and also sharing of content. Most, if not all, of these platforms use centralized computing systems; therefore, the control and management of the systems lies entirely in the hands of one provider, who must be trusted to treat the data and communication traces securely. As a zero-trust alternative, peer-to-peer (P2P) technologies promise to support end-to-end communication, uncompromising access control, anonymity and resilience against censorship and massive data leaks through misused trust. The goals of this survey are threefold. First, the survey elaborates the properties of P2P-based online social networks and defines the requirements for such (zero-trust) platforms. Second, it gives an exposition of the building blocks for P2P frameworks that allow the creation of such sophisticated and demanding applications, such as user/identity management, reliable data storage, secure communication, access control and general-purpose extensibility, which are not properly addressed in other P2P surveys. As a third point, it gives a comprehensive analysis of proposed P2P-based online social network applications, frameworks and architectures by exploring the technical details, inter-dependencies and maturity of these solutions.

Next level peer-to-peer overlay networks under high churns: a survey

Peer-to-Peer (P2P) technology has seen a remarkable progress due to its decentralized and distributed approach. A wide range of applications such as social networking, file sharing, long range interpersonal communication etc. are carried out with ease by employing P2P protocol candidates. There exists a huge span of such P2P protocols. In this paper, we review advanced protocols like ZeroNet, Dat, Ares Galaxy, Accordion etc. evolved from classic peer-to-peer (P2P) overlay networks. We utilize term classic to allude protocols like Chord, Pastry, Tapestry, Kademlia, BitTorrent, Gnutella, Gia, NICE etc. While coming to their design, several challenges existed with classic approach under high churn environment with growing network communication rate. To address these multifaceted network issues with classic P2P systems, novel approaches evolved which helped researchers to built new application layer networks on existing P2P networks. We contribute in this paper by systematically characterizing next-level P2P (NL P2P) and examining their key concepts. Arrangement of distributed networks is completed by numerous analysts, which incorporates classic P2P systems. In this work, we therefore aim to make a further stride by deliberately talking about protocols created from classic P2P systems, and their performance comparison in dynamically changing environment. Different aspects of P2P overlay frameworks like routing, security, query, adaptation to non-critical failure and so forth dependent on developed conventions are additionally examined. Further, based on our review and study we put forward some of the exploring challenges with NL P2P frameworks.

Peer-to-Peer Control System for DC Microgrids

We propose and implement a dc microgrid with a fully decentralized control system, using the ICT concept of network overlays and peer-to-peer (P2P) networks. Decentralization not only concerns the physical systems and control logic but also the control structure which provides the network infrastructure on which energy management is carried out. In this paper, we show how such decentralization can be achieved using P2P frameworks as underlying control structures and implemented a pure P2P to eliminate single points of failure. For this, a direct current open energy system made of the interconnection of standalone dc nanogrids is used as underlying microgrid. The power flows between nanogrids are controlled by a decentralized exchange strategy: each household can request or respond to energy deals with its neighbors without requiring system-wide knowledge or control. Using dc combined with a layered, modular software allows loose coupling which increases flexibility and dependability. The system has been implemented and tested on a full-scale platform in Okinawa including 19 inhabited houses. Real data analysis as well as simulations demonstrate improvements in self-sufficiency compared to other types of systems. Resilience against utility blackouts is proven in practice.

Using topology information for quality‐aware Peer‐to‐Peer multilayer video streaming

SummaryDue to increasing bandwidth capacities, the Internet has become a viable transport medium for a (live) video. Often, delivery of video streams relies on the client–server paradigm and therefore exhibits limited scalability. The Peer‐to‐Peer (P2P) network model is an attractive and scalable candidate to stream video content to end users. However, these P2P frameworks typically operate in a network agnostic mode. Introducing network topology information into these P2P frameworks offers opportunities to enhance the performance.In this paper, we introduce a model to include network information when streaming a (multilayered) video in P2P frameworks. An important metric for video stream providers is the content quality perceived by end users. The optimization studied here aims at maximizing the number of users receiving a high quality video.The paper addresses the optimization problem seen from the stream provider's viewpoint, having access to network topology information. An exact optimization approach is presented for benchmarking purposes and a heuristic approach to cope with realistic network sizes. In addition, we present an approach to decide the deployment location of peering functionality. The results show that our strategy significantly decreases the fraction of destinations receiving only the base layer, and by introducing extra peering functionality, network capacities are used more efficiently. Copyright © 2015 John Wiley & Sons, Ltd.

Preface: nature inspired solutions for high performance computing

Computer systems are characterized by an ever-growing complexity and a pronounced distributed nature. Since controlling highly distributed systems and managing the communication among them are far beyond the capabilities of a central entity, it is essential to develop new decentralized architectures. Such architectures, for example Grids, Clouds and P2P systems, are increasingly popular, but they need new types of algorithms to be efficiently managed. The recent paradigm of Organic computing (OC) concerns a large collection of intelligent (embedded) systems with potentially unlimited networks and spontaneous local interactions (Merkle et al. 2008; Muller-Schloer et al. 2011). The goal of OC is to develop new concepts and tools to manage the complexity of such systems, which must be designed to be adaptive, self-organized and manageable at the same time (Schmeck 2005). Adaptive OC systems must be capable of learning and adjusting their behaviour to dynamically changing environments. In addition, they should have self-x properties such as self-healing, selfdefining, self-configuring and self-optimizing. These properties are inspired by the mechanisms used by the autonomic nervous system to regulate the body without conscious input from the individual. Bio-inspired algorithms and techniques feature fault-tolerant and self-adaptive behaviours that help to boost the autonomic nature of distributed systems (Germain-Renaud and Rana 2009), and are proving effective to solve highly parallel and distributed problems. These techniques sometimes rely on the operations of agents, whose behaviour is inspired by biological systems, including ant colonies, bird flocks, honey bees, bacteria, and many more. In such systems, ‘‘swarm intelligence’’ emerges from the interaction of a large number of very simple agents. Bio-inspired algorithms have been successfully used as alternative and/or superior solutions to the problems that traditional algorithms cannot solve satisfactorily. In recognition of their achievements and potential, bio-inspired algorithms were named one of Scientific American magazine’s 10 ‘‘World Changing Ideas 2010’’. Bio-inspired algorithms and systems are applied to hard and large problems in a variety of areas. Some examples are optimization problems solved with genetic algorithms, routing strategies inspired by honey bee behaviour, ant-inspired resource discovery and data mining computations in Grid, Cloud and P2P frameworks, and so on. The papers included in this special issue show recent results in the area of bio-inspired distributed computing. The authors presented their preliminary works in the 3rd Workshop on Bio-Inspired and Self-* Algorithms for Distributed Systems, BADS 2011 (Folino et al. 2011), which was held together with the International Conference on Autonomic Computing (ICAC 2011) in Karlsruhe, Germany, in June 2011. The three papers were first selected among the papers presented in BADS 2011; then, they were extended and refined through two rounds of reviews. The paper ‘‘Protein structure prediction using distributed parallel particle swarm optimization’’, by Ivan Kondov, demonstrates the efficiency of the standard Particle swarm optimization (PSO) algorithm in the hard task of finding G. Folino (&) C. Mastroianni ICAR-CNR, Rendi, CS, Italy e-mail: folino@icar.cnr.it