Adaptive Lookup for Unstructured Peer-to-Peer Overlays

TL;DR

This paper introduces a QoS-enabled lookup method for unstructured peer-to-peer overlays that enhances search efficiency, scalability, and performance guarantees by selectively forwarding queries based on QoS metrics.

Contribution

It proposes a novel adaptive lookup protocol that incorporates QoS constraints, improving scalability and performance in dynamic unstructured P2P networks.

Findings

Improved search performance with QoS constraints

Reduced message overhead in overlay networks

Enhanced scalability during high peer churn

Abstract

Scalability and efficient global search in unstructured peer-to-peer overlays have been extensively studied in the literature. The global search comes at the expense of local interactions between peers. Most of the unstructured peer-to-peer overlays do not provide any performance guarantee. In this work we propose a novel Quality of Service enabled lookup for unstructured peer-to-peer overlays that will allow the user's query to traverse only those overlay links which satisfy the given constraints. Additionally, it also improves the scalability by judiciously using the overlay resources. Our approach selectively forwards the queries using QoS metrics like latency, bandwidth, and overlay link status so as to ensure improved performance in a scenario where the degree of peer joins and leaves are high. User is given only those results which can be downloaded with the given constraints. Also, the protocol aims at minimizing the message overhead over the overlay network.