Almost-optimal gossip-based aggregate computation
Motivated by applications to modern networking technologies, there has been interest in designing efficient gossip-based protocols for computing aggregate functions. While gossip-based protocols provide robustness due to their randomized nature, reducing the message and time complexity of these prot...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Journal Article |
Language: | English |
Published: |
2013
|
Online Access: | https://hdl.handle.net/10356/97889 http://hdl.handle.net/10220/10895 |