State-of-the-art survey on P2P overlay networks in pervasive computing environments

Abstract

a b s t r a c t P2P overlay networks have attracted significant research interest due to their utility as virtualized abstractions of complex network infrastructures, optimized to satisfy specific criteria, e.g. minimum delay or shortest diameter. In the context of modern pervasive environments, which are characterized by complexity, heterogeneity, dynamicity, and mobility in terms of the underlying networks, the utilization of P2P overlays accordingly offers a series of advantages by countering the aforementioned adverse characteristics. The widespread deployment of pervasive environments and the plethora of proposed P2P systems, both call for a systematic way to study related research works. In this paper we review related research on P2P (peer-to-peer) overlay networks in pervasive environments. In this respect, we therefore analyze relevant requirements and discuss the application and deployment of P2P overlays and systems on top of the networking infrastructures that are supported by pervasive environments. Aspects such as scalability, resource discovery, algorithmic complexity, security, and support for dynamicity are examined for existing research works, in an effort to identify the most suitable P2P overlay for the requirements set by the nature of pervasive environments. We also taxonomize P2P overlays using the well-established classification scheme in regard to their structure or lack of it. Furthermore, we study the notions of multi-layer and bio-inspired P2P overlays that have great synergies with pervasive environments due to their inherent characteristics, especially in terms of flexibility and robustness. By describing and critically analyzing existing systems and discussing current research and open issues, we aim to instigate further research in this domain, while at the same time this work should serve as a point of reference for state-of-the-art P2P overlays in pervasive environments.

Routing at Large Scale: Advances and Challenges for Complex Networks

“…In this way an adaptive load balancing mechanism can be achieved. P2P networks as a potential data distribution paradigm of the future Internet require further investigation to improve aspects such as security, dynamicity, redundancy and load balancing [10].…”

“…The current Internet routing follows a two-level hierarchy: routing between almost 60 K ASes in the core (forming a scale-free network), and routing within the ASes. The true challenge is in the inter-AS routing, driven by the Border Gateway Protocol (BGP), which is a path-vector routing protocol, 10 exchanging network reachability information with peering BGP routers. Reachability information includes an AS path listing the sequence of AS numbers traversed by the BGP route advertisement comprising reachability information from the originating AS.…”

“…These networks are highly scalable, resilient and self configurable, which motivates their widespread use. The authors in [10] survey several algorithms and mechanisms considered in P2P overlay networks. One of the interesting concepts considered in P2P is applying a DHT structure on top of the overlay.…”

Adaptive and reliable multipath provisioning for media transfer in SDN-based overlay networks

“…Although P2P live streaming is known to be cost-effective, it is not clear whether it can provide the same level of scalability and QoS as provided by dedicated overlay networks. (18) surveys several algorithms and mechanisms considered in P2P overlay networks.…”

Comparative Analysis of P2P Architectures for Energy Trading and Sharing

“…The energy protocol compared with Kademlia [25] that is more robust through redundancy for fault or failure of peers. In addition, considering the unstructured protocol Gia [26], a topology adaptation algorithm implemented makes the network more robust in high churn rates (connection and disconnection of peers) [24]. Gia is an improved version of the broadcasting techniques that considers peers' capacity before broadcasting information to the peers, thus significantly reducing the consumption of network bandwidth.…”