loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Network Computing and Applications, Third IEEE International Symposium on (NCA'04)
Distance Measurement in Volunteer Computing Networks: A Completely Decentralized Approach
Boston, Massachusetts
August 30-September 01
ISBN: 0-7695-2242-4
Dimitris Kamenopoulos, National Technical University of Athens, Greece
Iosif A. Osman, National Technical University of Athens, Greece
Panayotis Tsanakas, National Technical University of Athens, Greece
Volunteer computing is a relatively new computing paradigm that is often the only solution to large computational tasks. Due to the dynamic structure of the peer-to-peer systems that usually form the backbone of volunteer computing, obtaining accurate distance metrics using traditional techniques is infeasible. Thus, techniques that could improve system performance, such as dynamic load balancing, are very difficult to implement. In this paper, we show that the master-worker paradigm used by the overwhelming majority of volunteer computing applications results in certain network topology and protocol characteristics that render distance measurement method with zero network overhead feasible and preferable. Therefore, we present a simple distance measurement method that is based on passive monitoring of application-level traffic. We subsequently test the method using simulation as well as a reference implementation. The paper concludes by summarizing the strong points and limitations of the proposed method and proposing further research directions.
Citation:
Dimitris Kamenopoulos, Iosif A. Osman, Panayotis Tsanakas, "Distance Measurement in Volunteer Computing Networks: A Completely Decentralized Approach," nca, pp.399-404, Network Computing and Applications, Third IEEE International Symposium on (NCA'04), 2004
Usage of this product signifies your acceptance of the Terms of Use.