Geodemlia: A robust peer-to-peer overlay supporting location-based search

Abstract

Existing peer-to-peer overlay approaches for location-based search have proven to be a valid alternative to client-server-based schemes. One of the key issues of the peerto-peer approach is the high churn rate caused by joining and leaving peers. To address this problem, this paper proposes a new location-aware peer-to-peer overlay termed Geodemlia to achieve a robust and efficient location-based search. To evaluate Geodemlia, a real world workload model for peer-to-peer location-based services is derived from traces of Twitter. Using the workload model, a system parameter analysis of Geodemlia is conducted with the goal of finding a suitable parameter configuration. In addition, the scalability and robustness of Geodemlia is compared to a state-of-the-art tree-based approach by investigating the performance and costs of both overlays under an increasing number of peers, an increasing radius of area searches, an increasing level of churn as well as for different peer placement and search request schemes. The evaluation results reveal that in contrast to the tree-based approach, Geodemlia provides on average a 46% better success ratio as well as a 18% better recall at a moderate higher traffic overhead of 13 bytes/s and an increased average response time of 0.2 s.

Overdrive an overlay-based geocast service for smart traffic applications

“…1) Neighborhood Structure: The neighborhood structure is based on mapping neighbors to a set of k concentric rings around the position of the current node. Similar to [6], the radii of these rings start with r b and grow exponentially with the distance from the common center. Based on the distance from the current node, neighbors fall into one of the different rings.…”

“…GeoKad is explicitly designed towards supporting moving nodes: Each node sends location updates to its neighbors whenever its position becomes significantly different than the one advertised last. Geodemlia [6] also uses rings to divide up the geographic space. However, the radii of its rings increase exponentially.…”

On Underlay-Aware Self-Stabilizing Overlay Networks

“…Last, there are several non-self-stabilizing approaches for creating underlay-aware overlays, e.g., [15,27,2,25]. With their often-cited work in [25], Plaxton et al introduced these so-called location-aware overlays.…”

OBST: A self-adjusting peer-to-peer overlay based on multiple BSTs

“…More generally, one may also regard geography [13] or latency-aware [9] p2p systems as providing a certain degree of self-adaptiveness. However, these systems are typically optimized towards more static criteria, and change less frequently.…”