Article ID Journal Published Year Pages File Type
10349115 Journal of Systems and Software 2005 15 Pages PDF
Abstract
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.
Keywords
Related Topics
Physical Sciences and Engineering Computer Science Computer Networks and Communications
Preview
Distributed multiple selection algorithm for peer-to-peer systems
Authors
,