Determining the size of a network and its diameter are important functions in distributed systems, as there are a number of algorithms which rely on such parameters, or at least on estimates of those values. The Extrema Propagation technique allows the estimation of the size of a network in a fast, distributed and fault tolerant manner. The technique was previously studied in a simulation setting where rounds advance synchronously and where there is no message loss. This work presents two main contributions. The first, is the study of the Extrema Propagation technique under asynchronous rounds and integrated in the Network Friendly Epidemic Multicast (NeEM) framework. The second, is the evaluation of a diameter estimation technique associated with the Extrema Propagation. This study also presents a small enhancement to the Extrema Propagation in terms of communication cost and points out some other possible enhancements. Results show that there is a clear trade-off between time and communication that must be considered when configuring the protocol—a faster convergence time implies a higher communication cost. Results also show that its possible to reduce the total communication cost by more than 18% using a simple approach. The diameter estimation technique is shown to have a relative error of less than 10% even when using a small sample of nodes.
[1]
Johannes Gehrke,et al.
Gossip-based computation of aggregate information
,
2003,
44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..
[2]
Indranil Gupta.
Practical Algorithms for Size Estimation in Large and Dynamic Groups
,
2004
.
[3]
Márk Jelasity,et al.
Gossip-based aggregation in large dynamic networks
,
2005,
TOCS.
[4]
Raquel Menezes,et al.
Fast Estimation of Aggregates in Unstructured Networks
,
2009,
2009 Fifth International Conference on Autonomic and Autonomous Systems.
[5]
Anne-Marie Kermarrec,et al.
NEEM: network-friendly epidemic multicast
,
2003,
22nd International Symposium on Reliable Distributed Systems, 2003. Proceedings..
[6]
Anne-Marie Kermarrec,et al.
Lightweight probabilistic broadcast
,
2003,
TOCS.
[7]
Anne-Marie Kermarrec,et al.
Peer-to-Peer Membership Management for Gossip-Based Protocols
,
2003,
IEEE Trans. Computers.