Build one, get one free: Leveraging the coexistence of multiple p2p overlay networks

Many different P2P overlay networks providing various functionalities, targeting specific applications, have been proposed in the past five years. It is now reasonable to con-sider that multiple overlays may be deployed over a large set of nodes so that the most appropriate overlay might be chosen depending on the application. A physical peer may then host several instances of logical peers belonging to dif-ferent overlay networks. In this paper, we show that the co-existence of a structured P2P overlay and an unstructured one may be leveraged so that, by building one, the other is automatically constructed as well1. More specifically, we show that the randomness provided by an unstructured gossip-based overlay can be used to build the routing ta-ble of a structured P2P overlay and the randomness in the numerical proximity links in the structured networks pro-vides the random peer sampling required by gossip-based unstructured overlays. In this paper, we show that main-taining the leaf set of Pastry and the proximity links of an unstructured overlay is enough to build the complete over-lays. Simulation results comparing our approach with both a Pastry-like system and a gossip-based unstructured over-lay show that we significantly reduce the overlay mainte-nance overhead without sacrificing the performance.