Almost-Optimal Gossip-Based Aggregate Computation

DOI10.1137/100793104zbMath1247.68027OpenAlexW2063513700MaRDI QIDQ2910849

Jen-Yeu Chen, Gopal Pandurangan

Publication date: 12 September 2012

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10220/10895

zbMATH Keywords

time complexityaggregate functionspeer-to-peer networksaggregate computationgossip-based protocolsparse communication networksmessage complexityaddress-oblivious algorithmdistribution random rankingnon-address-oblivious algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Information storage and retrieval of data (68P20) Distributed systems (68M14) Randomized algorithms (68W20) Network protocols (68M12) Distributed algorithms (68W15) Internet topics (68M11)

Related Items (2)

The Cost of Fault Tolerance in Multi-Party Communication Complexity ⋮ Discovery Through Gossip

This page was built for publication: Almost-Optimal Gossip-Based Aggregate Computation