Fault-tolerant aggregation: flow-updating meets mass-distribution

DOI10.1007/s00446-016-0288-5zbMath1420.68022arXiv1109.4373OpenAlexW2552350633MaRDI QIDQ2401680

Paulo Sérgio Almeida, Carlos Baquero, Paulo Jesus, Miguel A. Mosteiro, Martín Farach-Colton

Publication date: 4 September 2017

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1109.4373

zbMATH Keywords

communication networksdistributed computingaggregate computationradio networks

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (3)

Fault-tolerant aggregation: flow-updating meets mass-distribution ⋮ A faster exact-counting protocol for anonymous dynamic networks ⋮ LiMoSense: live monitoring in dynamic sensor networks

Uses Software

• TAG

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An early-stopping protocol for computing aggregate functions in Sensor Networks
• Approximate counting, uniform generation and rapidly mixing Markov chains
• Time complexity of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism
• Fault-tolerant aggregation: flow-updating meets mass-distribution
• Fast linear iterations for distributed averaging
• Geographic Gossip: Efficient Averaging for Sensor Networks
• Consensus Problems in Networks of Agents With Switching Topology and Time-Delays
• Communication in dynamic radio networks
• Probability and Computing

This page was built for publication: Fault-tolerant aggregation: flow-updating meets mass-distribution