Revisit of statistical selection algorithm for peer to peer system

Abstract

Over the years, the distributed computing environment has been developed so fast that there's a need to develop an effective selection algorithm for it. Loo [9] has proposed a statistical selection algorithm with the same objective and run in multicast / broadcast environment that has been proved that it is the best among others in term of the number of messages needed to complete the searching process. This work revisited the work by Loo [9] through simulation. The result obtained from the simulation is almost the same with [9] in terms of the number of messages needed and the number of rounds needed