A Peer-to-Peer Data Structure for Dynamic Location Data

Heutelbeck, Dominic; Hemmje, Matthias

doi:10.1109/percom.2006.4

Cited by 5 publications

(6 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The second category contains approaches that do not rely on a DHT and that utilize tree-structures [3], [15], [22] to structure the multidimensional space. Stand-alone tree based approaches such as RectNet [15], Globase [22], and GeoP2P [3] on the one hand allow for the efficient search of location-based search.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

GeoSwarm: A multi-source download scheme for peer-to-peer location-based services

Groß

Richerzhagen

Stingl

et al. 2013

IEEE P2P 2013 Proceedings

View full text Add to dashboard Cite

Existing peer-to-peer (p2p) overlays for location based services sufTer from two major drawbacks: (i) they do not store data persistently under peer churn and (ii) they do not allow for the fast retrieval of large files, especially under asymmetric link conditions. This tremendously limits the use of current and future p2p location-based services as users are not able to share larger files such as high resolution pictures or video snippets. To overcome these two problems, we present GeoSwarm: a reliable multi-source download scheme for p2p location-based services. GeoSwarm combines the strengths of a BitTorrent-like download scheme with the locality awareness of an overlay for location-based search and its built-in replication mechanism. Thereby, a robust and fast download as well as a reliable storage of location-related multimedia content is achieved. Through extensive evaluation, we show that 95% of all downloads in GeoSwarm are carried out successfully even under churn, while downloads benefit from a 100% increased throughput in comparison to traditional single-source downloads.

show abstract

Section: Related Workmentioning

confidence: 99%

“…Stand-alone tree based approaches such as RectNet [15], Globase [22], and GeoP2P [3] on the one hand allow for the efficient search of location-based search. On the other hand, they are susceptible to churn and network participating, especially when super peers in higher-levels of the tree or the root peer suddenly leave the system.…”

Section: Related Workmentioning

confidence: 99%

GeoSwarm: A multi-source download scheme for peer-to-peer location-based services

Groß

Richerzhagen

Stingl

et al. 2013

IEEE P2P 2013 Proceedings

View full text Add to dashboard Cite

show abstract

“…In order to do so, linearization techniques are required in order to map the multi-dimensional space onto the one dimensional ID space of the DHT. (ii) Approaches that were designed from scratch for solving the problem of location-based search [2], [3], [12], [18], [23], [30], [34] from which most of them utilize a treestructure. According to Asaduzzaman et al the unique combination of location-based search and the geographic distribution of information providing peers suggests the development of such a dedicated overlay supporting the locality of peers [3].…”

Section: ) Peer and Request Distributionmentioning

confidence: 99%

“…An approach very similar to Globase is RectNet developed by Heutelbeck et al [12]. RectNet uses a binary distributed space partitioning tree which simplifies the recovery in case of peer failures but reduces the search performance.…”

Section: ) Peer and Request Distributionmentioning

confidence: 99%

See 1 more Smart Citation

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

Groß

Stingl

Richerzhagen

et al. 2012

2012 IEEE 12th International Conference on Peer-to-Peer Computing (P2P)

View full text Add to dashboard Cite

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.

show abstract