Clustering hosts in P2P and global computing platforms
作者： A. Agrawal , H. Casanova
DOI: 10.1109/CCGRID.2003.1199389
关键词: Host (network) 、 Web application 、 Computer network 、 The Internet 、 Computer science 、 Distributed computing 、 Internet topology 、 Overlay network 、 Internet hosting service 、 Hierarchical clustering 、 Cluster analysis
摘要: Being able to identify clusters of nearby hosts among Internet clients provides very useful information for a number internet and p2p applications. Examples such applications include web applications, request routing in peer-to-peer overlay network, distributed computing In this paper, we present formulate the host clustering problem. Leveraging previous work on distance measurement, propose two hierarchical techniques solve The first technique is marker based partitioning approach. second well known K-means algorithm. We evaluated these approaches simulation using representative topology generated with GT ITM generator over 1,000 hosts. Our results demonstrate that our algorithmic effectively arbitrary diameters. conclusion by leveraging estimation, it possible cluster benefit various requirements.
acm.org
sci-hub.se 参考文章(13)
A. Bestavros, S. Mehrotra, DNS-based Internet client clustering and characterization ieee international symposium on workload characterization. pp. 159- 168 ,(2001) , 10.1109/WWC.2001.11
Ben Yanbin Zhao, John Kubiatowicz, Anthony D Joseph, Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and Routing ,(2001)
A. Medina, A. Lakhina, I. Matta, J. Byers, BRITE: an approach to universal topology generation modeling analysis and simulation on computer and telecommunication systems. pp. 346- 353 ,(2001) , 10.1109/MASCOT.2001.948886
Krishna P. Gummadi, Stefan Saroiu, Steven D. Gribble, King: estimating latency between arbitrary internet end hosts acm special interest group on data communication. ,vol. 32, pp. 5- 18 ,(2002) , 10.1145/571697.571700
P. Francis, S. Jamin, V. Paxson, Lixia Zhang, D.F. Gryniewicz, Yixin Jin, An architecture for a global Internet host distance estimation service international conference on computer communications. ,vol. 1, pp. 210- 217 ,(1999) , 10.1109/INFCOM.1999.749285
Michael R. Garey, David S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness ,(1979)
D. Kondo, H. Casanova, E. Wing, F. Berman, Models and scheduling mechanisms for global computing applications international parallel and distributed processing symposium. ,vol. 1, pp. 216- ,(2002) , 10.1109/IPDPS.2002.1015590
Balachander Krishnamurthy, Jia Wang, On network-aware clustering of Web clients acm special interest group on data communication. ,vol. 30, pp. 97- 110 ,(2000) , 10.1145/347057.347412
T.S.E. Ng, Hui Zhang, Predicting Internet network distance with coordinates-based approaches international conference on computer communications. ,vol. 1, pp. 170- 179 ,(2002) , 10.1109/INFCOM.2002.1019258
E.W. Zegura, K.L. Calvert, S. Bhattacharjee, How to model an internetwork international conference on computer communications. ,vol. 2, pp. 594- 602 ,(1996) , 10.1109/INFCOM.1996.493353