Optimizing Locality for Self-organizing Context-Based Systems

Knoll, Mirko; Weis, Torben

doi:10.1007/11822035_7

Cited by 20 publications

(11 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…With respect to the first category, a variety of approaches have been developed that utilize space filling curves [4], [17] in order to solve the two elementary problems: (i) mapping a multi-dimensional space onto a one dimensional ID space of a DHT, while (ii) preserving the locality of peers. According to Knoll et al [17] finding an optimal mapping that solves both problems is impossible. Therefore, the authors conducted a performance study on various approaches for space filling curves and found out that S-shaped curves as well as Lebesque curves perform poorly whereas more complex approaches such as the Hilbert curve show a better locality property.…”

Section: ) Peer and Request Distributionmentioning

confidence: 99%

“…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]. With respect to the first category, a variety of approaches have been developed that utilize space filling curves [4], [17] in order to solve the two elementary problems: (i) mapping a multi-dimensional space onto a one dimensional ID space of a DHT, while (ii) preserving the locality of peers. According to Knoll et al [17] finding an optimal mapping that solves both problems is impossible.…”

Section: ) Peer and Request Distributionmentioning

confidence: 99%

“…On the other hand, there exist approaches using space filling curves on top of a DHT [17]. Those approaches, however, do not preserve the directionality and locality of the multi-dimensional space, which both are important properties enabling efficient search for location-based information [15].…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

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

Section: ) Peer and Request Distributionmentioning

confidence: 99%

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

show abstract

“…The linearization of two-dimensional map projections is achieved using different space filling curves. The suitability of different space-filling curves is discussed in [12]. The focus of [5] in developing Prefix Hash Trees (PHTs) was to meet the needs of an end-user positioning system, without modifying the underlying DHT.…”

Section: Related Workmentioning

confidence: 99%

Globase.KOM - A P2P Overlay for Fully Retrievable Location-based Search

Kovačević

Liebau

Steinmetz

2007

Seventh IEEE International Conference on Peer-to-Peer Computing (P2P 2007)

View full text Add to dashboard Cite

Location based services are becoming increasingly popular as devices that determine geographical position become more available to end users. The main problem of existing solutions to location-based search is keeping information updated requires centralized maintenance at specific times. Therefore, retrieved results do not include all objects that exist in reality. A peer-to-peer (P2P) approach can easily overcome this issue as peers are responsible for the information users are searching for. Unfortunately, current state-of-the-art overlays cannot fulfill the requirements for efficient and fully retrievable location-based search. In this paper we present Globase.KOM, a hierarchical treebased P2P overlay that enables fully retrievable locationbased overlay operations which proved to be highly efficient and logarithmically scalable.

show abstract

“…Approaches in the first cate gory use the well known concept of a Distributed Hash Table (DHT) and extend it to support location-based search. This is done by either mapping the multidimensional space onto the one dimensional space of the DHT by using linearization techniques such as space-filling curves [6], [20], [34] or by mapping tree structures onto the DHT [14] , [16] . Approaches using a space filling curve on top of a DHT suffer from efficiency issues, because the mapping of multidimensional data onto the one-dimensional space of the DHT does not preserve the locality and directionality of data.…”

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

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

Optimizing Locality for Self-organizing Context-Based Systems

Cited by 20 publications

References 11 publications

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

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

Globase.KOM - A P2P Overlay for Fully Retrievable Location-based Search

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

Contact Info

Product

Resources

About