Query workload-aware overlay construction using histograms

Koloniari, Georgia; Petrakis, Yannis; Pitoura, Evaggelia; Tsotsos, Thodoris

doi:10.1145/1099554.1099717

Cited by 12 publications

(4 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Piggybacking is used also in Kademlia, but only partially, to improve multiple routings between the same source and destination. The concept of using application traffic for building overlays is used also in [9]. This study assumes that the application issues repeatedly similar queries, and therefore it links together nodes which collaborated in previous queries.…”

Section: B the Scale Of Lazinessmentioning

confidence: 99%

Koala: Towards Lazy and Locality-Aware Overlays for Decentralized Clouds

Tato

Bertier

Tedeschi

2018

2018 IEEE 2nd International Conference on Fog and Edge Computing (ICFEC)

View full text Add to dashboard Cite

Current cloud computing infrastructures and their management are highly centralized, and therefore they suffer from limitations in terms of network latency, energy consumption, and possible legal restrictions. Decentralizing the Cloud has been recently proposed as an alternative. However, the efficient management of a geographically dispersed platform brings new challenges related to service localization, network utilization and locality-awareness. We here consider a cloud topology composed of many small datacenters geographically dispersed within the backbone network. In this paper, we present the design, development and experimental validation of Koala, a novel overlay network that specifically targets such a geographically distributed cloud platform. The three key characteristics of Koala are laziness, latencyawareness and topology-awareness. By using application traffic, Koala maintains the overlay lazily while it takes locality into account in each routing decision. Although Koala's performance depends on application traffic, through simulation experiments we show that for a uniformly distributed traffic, Koala delivers similar routing complexity and reduced latency compared to a traditional proactive protocol, such as Chord. Additionally, we show that despite its passive maintenance, Koala can appropriately deal with churn by keeping the number of routing failures low, without significantly degrading the routing performance. Finally, we show how such an overlay adapts to a decentralized cloud composed of multiple small datacenters.

show abstract

Section: B the Scale Of Lazinessmentioning

confidence: 99%

Koala: Towards Lazy and Locality-Aware Overlays for Decentralized Clouds

Tato

Bertier

Tedeschi

2018

2018 IEEE 2nd International Conference on Fog and Edge Computing (ICFEC)

View full text Add to dashboard Cite

show abstract

“…In particular, CLON targets a multicloud environment and introduces some locality-awareness by favoring local nodes while building the views. Other works focus on creating links between nodes with similar contents, assuming that they serve similar queries [7].…”

Section: The Unstructured Approach To Disseminationmentioning

confidence: 99%

Designing Overlay Networks for Decentralized Clouds

Tato

Bertier²,

Tedeschi³

2017

2017 IEEE International Conference on Cloud Computing Technology and Science (CloudCom)

View full text Add to dashboard Cite

Recent increase in demand for next-to-source data processing and low-latency applications has shifted attention from the traditional centralized cloud to more distributed models such as edge computing. In order to fully leverage these models it is necessary to decentralize not only the computing resources but also their management. While a decentralized cloud has various inherent advantages, it also introduces different challenges with respect to coordination and collaboration between resources. A large-scale system with multiple administrative entities requires an overlay network which enables data and service localization based only on a partial view of the network. Numerous existing overlay networks target different properties but they are built in a generic context, without taking into account the specific requirements of a decentralized cloud. In this paper we identify some of these requirements and introduce Koala, a novel overlay network designed specifically to meet them.

show abstract

“…Several unstructured P2P information discovery systems have been suggested that improve the efficiency of future queries based on the past query workload in the system [3,13,14,17]. The major difference between these systems and the structured P2P systems such as ours is that, each peer in these systems tries to optimize the performance of queries individually by modifying local data index.…”

Section: Unstructured P2p Systemsmentioning

confidence: 99%

Optimized information discovery using self-adapting indices over Distributed Hash Tables

Memon

Tiebler

Dürr

et al. 2010

International Performance Computing and Communications Conference

View full text Add to dashboard Cite

Distributed Hash Table (DHT)-based peer-to-peer information discovery systems have emerged as highly scalable systems for information storage and discovery in massively distributed networks. Originally DHTs supported only point queries. However, recently they have been extended to support more complex queries, such as multiattribute range (MAR) queries. Generally, the support for MAR queries over DHTs has been provided either by creating an individual index for each data attribute or by creating a single index using the combination of all data attributes. In contrast to these approaches, we propose to create and modify indices using the attribute combinations that dynamically appear in MAR queries in the system.In this paper, we present an adaptive information discovery system that adapts the set of indices according to the dynamic set of MAR queries in the system. The main contribution of this paper is a four-phase index adaptation process. Our evaluations show that the adaptive information discovery system continuously optimizes the overall system performance for MAR queries. Moreover, compared to a non-adaptive system, our system achieves several orders of magnitude improved performance.

show abstract

Query workload-aware overlay construction using histograms

Cited by 12 publications

References 27 publications

Koala: Towards Lazy and Locality-Aware Overlays for Decentralized Clouds

Koala: Towards Lazy and Locality-Aware Overlays for Decentralized Clouds

Designing Overlay Networks for Decentralized Clouds

Optimized information discovery using self-adapting indices over Distributed Hash Tables

Contact Info

Product

Resources

About