Gossip protocols for aggregation

Opened: Saturday, 25 March 2017, 12:00 AM
Due: Friday, 21 April 2017, 1:00 AM

Read the paper:

Jelasity, M., Montresor, A., Babaoglu, O.: Gossip-based aggregation in
large dynamic net-works. ACM Transactions on Computer Systems 23(3),
219–252 (2005).

Write a report that describes:
1) the gossip strategy to perfrom aggregation with the main charateristics of the protocol. Provide a short description of the functions that is possible to implement with gossip aggregation.
(Optional bonus question: how would you estimate a distribution of values?)

2) the impact of node failures, message losses, and message delay on the correctness of aggregation. Describe one way to cope with failures.