Distributed multiple selection algorithm for peer-to-peer systems

Complexity analyses are presented to provide theoretical upper bounds of this algorithm. The correctness of the theoretical predication is verified by experiments with 40 computers connected using Web technologies.