De Bruijn Graph Based Solution for Lookup Acceleration and Optimization in P2P Networks

Abstract

There is no doubt that P2P traffic mainly video traffic (e.g. P2P streaming, P2P file sharing, P2P IPTV) increases and will represent a significant percent of the total IP video traffic (80 percent by 2018 of the global IP traffic according forecasts). Peer-to-peer (P2P) is based on some main concepts such as mutualization of resources (e.g. data, programs, service) at Internet scale. It is also considered as one of the most important models able to replace the client-server model (e.g. for media streaming). Nevertheless, one of the fundamental problems of P2P networks is to locate node emplacements or resources and service location. Localisation problem is critical as there is no central server and churn rate can be high in some environments (high dynamicity). Lookup optimization in terms of number of hops or delay is not well considered in existing models, and still represents a real challenge. In this context and according to their specific characteristics and properties, De Bruijn graph based solutions constitute good candidates for lookup optimization. In this paper, we propose a new optimized model for lookup acceleration on P2P networks based on De Bruijn graph. Performance evaluations and simulation results show that our proposed approach is performant, compared to the main existing model.

A new overlay P2P network for efficient routing in group communication with regular topologies

“…x x ,..., k x , by the symbols composing the node 1 2 y y ,..., k y , where each shift defines a hop, so, it follows all nodes 2x ,..., x y ,..., ( 1) k y  . The number of hops is optimised by using this idea that before any shift (hop), we delete the shared sequence between the prefix and the suffix of the both neighbouring nodes (Amad et al, 2015).…”

“… Koorde protocol (Kaashoek and Karger, 2003) which extends that of Chord (Stoica et al, 2003) to reach the performances of a graph (2, ) B L of De Bruijn. It is one of DHTs which represents the lowest rate of the latency, in the absence of congestion,  Broose (Gai and Viennot, 2004) adapts Kademlia (Maymounkov and Mazieres, 2002) to the topology of De Bruijn,  D2B (Fraigniaud and Gauron, 2006) adapts CAN (Ratnasamy et al, 2001) to the graph of De Bruijn,  Optimal Diameter Routing Infrastructure (ODRI) (Loguinov et al, 2005) for the networks with constant degree,  The protocol in Amad et al (2015) that optimises the lookup process in a dynamic environment.…”

Intelligent query processing in P2P networks: Semantic issues and routing algorithms

“…In [23], the authors have proposed a scalable solution for lookup acceleration and optimization based on the de Bruijn graph with right shift. The proposed solution is principally based on the determination and elimination of the common string between source and destination.…”