Abstract: Lookup services is still a key challenge in all distributed systems and particularly for P2P based services (e.g. distributed SDN node controllers, social networking…). In these networks, node searching for a specific service or resource has to discover the “best” path to the node offering the requested resource or service. Since P2P networking is implemented at application layer, the given optimized path from a source node to a destination one, in terms of number of hops is not necessarily the best path in terms of physical parameters (e.g. delay, physical proximity). For this, the lookup process optimization is still a real challenge in some environments, particularly for delay sensitive services. In this context, various topologies have been proposed in the literature such as: ring, tore, star, hypercub, De Bruijn graph, and skip graph. In this paper, we propose a new approach using Pancake graphs, for structuring the P2P topology in order to optimize the lookup process. The proposed solution is compared to some main existing solutions. Under certain conditions, the simulation results show better performance compared to existing approaches.
