Clustering Hosts in P2P and Global Computing Platforms

  • Authors:
  • Abhishek Agrawal;Henri Casanova

  • Affiliations:
  • -;-

  • Venue:
  • CCGRID '03 Proceedings of the 3st International Symposium on Cluster Computing and the Grid
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

Being able to identify clusters of nearby hosts among internetclients provides very useful information for a numberof internet and p2p applications. Examples of suchapplications include web applications, request routing inpeer-to-peer overlay network, and distributed computingapplications. In this paper, we present and formulatethe internet host clustering problem. Leveraging previouswork on internet host distance measurement, we proposetwo hierarchical clustering techniques to solve this problem.The first technique is a marker based hierarchicalpartitioning approach. The second technique is based onthe well known K-means clustering algorithm. We evaluatedthese two approaches in simulation using a representativeInternet topology generated with the GT-ITM generatorfor over 1,000 hosts. Our simulation results demonstratethat our algorithmic clustering approaches effectivelyidentify clusters with arbitrary diameters. Our conclusionis that by leveraging previous work on internet hostdistance estimation, it is possible to cluster internet hoststo benefit various applications with various requirements.