Gossip-based aggregate computation: computing faster with non address-oblivious schemes

In this paper, we sketch a novel gossip-based scheme that allows all the nodes in an n-node overlay network to compute a common aggregate (MAX) of their values using O(n log log n) messages within O(log n) rounds of communication. Our result is achieved relaxing the hypothesis that nodes are address-oblivious, raising the question whether this paradigm (address-aware) is more expressive than the address-oblivious one.