On Competitive Algorithms for Approximations of Top-k-Position Monitoring of Distributed Streams

Mäcker, Alexander; Malatyali, Manuel; Heide, Friedhelm Meyer auf der

doi:10.1109/ipdps.2016.91

Cited by 6 publications

(5 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We have the following lemma, which bounds the expected communication cost of Algorithm 1 and has already appeared in a similar way in [8] (Lemma III.1).…”

Section: Node I Broadcasts Its Value In Round Logmentioning

confidence: 94%

“…, ∆}, a node ID and an identifier to distinguish between messages of different instances of an algorithm applied in parallel (as done when using standard probability amplification techniques). Having a broadcast channel is an extension to [1], which was originally proposed in [2] and afterwards applied in [7,8]. For ease of presentation, we assume that not only the server can send broadcast messages, but also the nodes.…”

Section: Model and Problemsmentioning

confidence: 99%

See 1 more Smart Citation

Monitoring of Domain-Related Problems in Distributed Data Streams

Bemmann

Biermeier

Bürmann

et al. 2017

Structural Information and Communication Complexity

Self Cite

View full text Add to dashboard Cite

Consider a network in which n distributed nodes are connected to a single server. Each node continuously observes a data stream consisting of one value per discrete time step. The server has to continuously monitor a given parameter defined over all information available at the distributed nodes. That is, in any time step t, it has to compute an output based on all values currently observed across all streams. To do so, nodes can send messages to the server and the server can broadcast messages to the nodes. The objective is the minimisation of communication while allowing the server to compute the desired output.We consider monitoring problems related to the domain Dt defined to be the set of values observed by at least one node at time t. We provide randomised algorithms for monitoring Dt, (approximations of) the size |Dt| and the frequencies of all members of Dt. Besides worst-case bounds, we also obtain improved results when inputs are parameterised according to the similarity of observations between consecutive time steps. This parameterisation allows to exclude inputs with rapid and heavy changes, which usually lead to the worst-case bounds but might be rather artificial in certain scenarios.

show abstract

“…We have the following lemma, which bounds the expected communication cost of Algorithm 1 and has already appeared in a similar way in [8] (Lemma III.1).…”

Section: Node I Broadcasts Its Value In Round Logmentioning

confidence: 94%

Section: Model and Problemsmentioning

confidence: 99%

Monitoring of Domain-Related Problems in Distributed Data Streams

Bemmann

Biermeier

Bürmann

et al. 2017

Structural Information and Communication Complexity

Self Cite

View full text Add to dashboard Cite

show abstract

“…A message will usually, besides a constant number of control bits, consist of a data item, a node ID and an identifier to distinguish between messages of different instances of an algorithm applied in parallel (as done when using standard probability amplification techniques). A broadcast channel is an extension to [2], which was originally proposed in [13] and afterwards applied in [4,5,17]. Between any two time steps we allow a communication protocol to take place, which may use a polylogarithmic number of rounds.…”

Section: Modelmentioning

confidence: 99%

A Communication-Efficient Distributed Data Structure for Top-k and k-Select Queries

Biermeier

Feldkord

Malatyali

et al. 2018

Approximation and Online Algorithms

Self Cite

View full text Add to dashboard Cite

We consider the scenario of n sensor nodes observing streams of data. The nodes are connected to a central server whose task it is to compute some function over all data items observed by the nodes. In our case, there exists a total order on the data items observed by the nodes. Our goal is to compute the k currently lowest observed values or a value with rank in [(1 − ε)k, (1 + ε)k] with probability (1 − δ). We propose solutions for these problems in an extension of the distributed monitoring model where the server can send broadcast messages to all nodes for unit cost. We want to minimize communication over multiple time steps where there are m updates to a node's value in between queries. The result is composed of two main parts, which each may be of independent interest: * This work was partially supported by the German Research Foundation (DFG) within the Priority Program "Algorithms for Big Data" (SPP 1736).Consider a distributed sensor network which is a system consisting of a huge amount of nodes. Each node continuously observes its environment and measures information (e.g. temperature, pollution or similar parameters). We are interested in aggregations describing the current observations at a central server.To keep the server's information up to date, the server and the nodes can communicate with each other. In sensor networks, however, the amount of such communication is particularly crucial, as communication has the largest impact to energy consumption, which is limited due to battery capacities [11]. Therefore, algorithms aim at minimizing the (total) communication required for computing the respective aggregation function at the server.We consider several ideas to potentially lower the communication used. Each single computation of an aggregate should use as little communication as possible. Computations of the same aggregate should reuse parts of previous computations. Only compute aggregates, if necessary. Recall that the continuous monitoring model creates a new output as often as possible.

show abstract

“…The distributed monitoring model introduced by Cormode, Muthukrishnan, and Yi in [8] allows exchanging single cast messages. The extension we use is the Distributed Monitoring Model with a Broadcast Channel (DMBC-Model) (proposed in [7] and exploited in [3,4,9,10]) which allows, in addition, to broadcast messages from the server to all nodes. Both types of communication are instantaneous and have unit cost per message.…”

Section: The Distributed Monitoring Model With Broadcast Channel (Dmbmentioning

confidence: 99%

A Dynamic Distributed Data Structure for Top-k and k-Select Queries

Feldkord

Malatyali

Heide

2018

Adventures Between Lower Bounds and Higher Altitudes

Self Cite

View full text Add to dashboard Cite

We consider a scenario where n sensor nodes observe streams of data. The nodes are connected to a central server whose task it is to compute some function over all data items observed by the nodes. Extending the capabilities of the distributed monitoring model from [8], we allow, in addition to sending messages from the sensor nodes to the server, also broadcasts from the server to the sensor nodes (see for example [9]). In this paper, we address the problem of answering Top-k queries (report the k largest data items currently observed) and approximate k-Select queries (report an element with rank close to k). We present a communication-efficient dynamic data structure that supports these queries under updates of the data items arriving at the sensor nodes.

show abstract

On Competitive Algorithms for Approximations of Top-k-Position Monitoring of Distributed Streams

Cited by 6 publications

References 17 publications

Monitoring of Domain-Related Problems in Distributed Data Streams

Monitoring of Domain-Related Problems in Distributed Data Streams

A Communication-Efficient Distributed Data Structure for Top-k and k-Select Queries

A Dynamic Distributed Data Structure for Top-k and k-Select Queries

Contact Info

Product

Resources

About