arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1706.03568cs.DS
收藏

分布式数据流中领域相关问题的监控

Monitoring of Domain-Related Problems in Distributed Data Streams

Pascal Bemmann, Felix Biermeier, Jan Bürmann, Arne Kemper, Till Knollmann, Steffen Knorr, Nils Kothe, Alexander Mäcker, Manuel Malatyali, Friedhelm Meyer auf de… 展开作者

Pascal Bemmann, Felix Biermeier, Jan Bürmann, Arne Kemper, Till Knollmann, Steffen Knorr, Nils Kothe, Alexander Mäcker, Manuel Malatyali, Friedhelm Meyer auf der Heide, Sören Riechers, Johannes Schaefer, Jannik Sundermeier

摘要:

考虑一个网络,其中$n$分布式节点连接到单个服务器。每个节点连续观察由每个离散时间步长的一个值组成的数据流。服务器必须连续监视在分布式节点处可用的所有信息上定义的给定参数。也就是说,在任何时间步长$t$中,它必须基于当前在所有流上观察到的所有值来计算输出。为此,节点可以向服务器发送消息,并且服务器可以向节点广播消息。目标是最小化通信,同时允许服务器计算所需的输出。我们考虑与定义为在时间$t$由至少一个节点观察到的值的集合的域$D_t$相关的监视问题。我们提供了监测$D_t$的随机化算法,(近似值)$|D_t|$的大小和$D_t$所有成员的频率。除了最坏情况下的界限,我们也得到了改进的结果时,输入参数化,根据连续时间步长之间的观测值的相似性。这种参数化允许排除快速和剧烈变化的输入,这通常会导致最坏情况的界限,但在某些情况下可能是人为的。

英文摘要:

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 $D_t$ defined to be the set of values observed by at least one node at time $t$. We provide randomised algorithms for monitoring $D_t$, (approximations of) the size $|D_t|$ and the frequencies of all members of $D_t$. 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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑