Robust clustering analysis for the management of self-monitoring distributed systems

Cluster Computing

Volumn 12, Issue 1, 2009, Pages 73-85

  Quiroz, Andres ^a   Gnanasambandam, Nathan ^b   Parashar, Manish ^a   Sharma, Naveen ^b  

^a RUTGERS UNIVERSITY   (United States)

^b XEROX CORPORATION   (United States)

Author keywords

Anomaly detection; Autonomic system management; Clustering analysis; Fault tolerance; Self monitoring

Indexed keywords

ELECTRIC NETWORK ANALYSIS; FAULT DETECTION; FAULT TOLERANCE; FAULT TOLERANT COMPUTER SYSTEMS; ONLINE SYSTEMS; QUALITY ASSURANCE;

ANOMALY DETECTION; AUTONOMIC SYSTEM MANAGEMENT; CLUSTERING ANALYSIS; COMPUTING RESOURCES; DECENTRALIZED ALGORITHMS; DETECTION ACCURACIES; DISTRIBUTED SYSTEMS; IN NETWORKS; NETWORK INFRASTRUCTURES; ON-LINE CLUSTERING; PRINTING DEVICES; ROBUST CLUSTERING; SELF-MONITORING;

CLUSTERING ALGORITHMS;

EID: 60549110650     PISSN: 13867857     EISSN: 15737543     Source Type: Journal    
DOI: 10.1007/s10586-008-0068-5     Document Type: Article

References (24)

1. Kiciman, E., Wang, Y.M.: Discovering correctness constraints for self-management of system configuration. In: Proceedings of the First International Conference on Autonomic Computing, pp. 28-35. New York, NY (2004)
2. Chen, M., Zheng, A.X., Lloyd, J., Jordan, M.I., Brewer, E.: Failure diagnosis using decision trees. In: Proceedings of the First International Conference on Autonomic Computing, pp. 36-37. New York, NY (2004)
3. Jiang, G., Chen, H., Ungureanu, C., Yoshihira, K.: Multi-resolution abnormal trace detection using varied-length n-grams and automata. In: Proceedings of the 2nd International Conference on Autonomic Computing, pp. 111-122. Seattle, WA (2005)
4. Jiang, G., Chen, H., Yoshihira, K.: Discovering likely invariants of distributed transaction systems for autonomic system management. Clust. Comput. 9(4), 385-399 (2006)
5. Jain, A.K., Dubes, R.C.: Algorithms for Clustering Data. Prentice-Hall, New York (1988)
6. Ester, M., Kriegel, H.P., Sander, J., Xu, X.: A density-based algorithm for discovering clusters in large spatial databases with noise. In: Proceedings of 2nd International Conference on Knowledge Discovery and Data Mining (KDD-96) (1996)
7. Agrawal, R., Gehrke, J., Gunopulos, D., Raghavan, P.: Automatic subspace clustering of high dimensional data for data mining applications. In: Proceedings of 1998 ACM-SIGMOD Int. Conf. Management of Data, pp. 94-105. Seattle, Washington (1998)
8. Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup service for internet applications. In: Proceedings of ACM SIGCOMM, pp. 149-160. San Diego, CA (2001)
9. Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable content-addressable network. In: Proceedings of ACM SIGCOMM, pp. 161-172. San Diego, CA (2001)
10. Rowstron, A., Druschel, P.: Pastry: Scalable, descentralized object location and routing for large-scale peer-to-peer systems. In: Proceedings of IFIP/ACM International Conference on Distributed Systems Platforms (Middleware), pp. 329-350. Heidelberg, Germany (2001)
11. Sagan, H.: Space-Filling Curves. Springer, Berlin (1994)
12. Schmidt, C., Parashar, M.: Flexible information discovery in descentralized distributed systems. In: 12th IEEE International Symposium on High Performance Distributed Computing (HPDC-12'03) (2003)
13. Moon, B., Jagadish, H., Faloutsos, C.: Analysis of the clustering properties of the Hilbert space-filling curve. IEEE Trans. Knowl. Data Eng. 13(1), 124-141 (2001)
14. Quiroz, A., Parashar, M., Gnanasambandam, N., Sharma, N.: Clustering analysis for the management of self-monitoring device networks. In: Proceedings of the International Conference on Autonomic Computing (ICAC 2008). Chicago (2008)
15. Bandyopadhyay, S., Gianella, C., Maulik, U., Kargupta, H., Liu, K., Datta, S.: Clustering distributed data streams in peer-to-peer environments. Inf. Sci. 176(14), 1952-1985 (2006)
16. Datta, S., Giannella, C., Kargupta, H.: K-means clustering over a large, dynamic network. In: Proceedings of the Sixth SIAM International Conference on Data Mining. Bethesda, MD (2006)
17. Li, M., Lee, W.C., Sivasubramaniam, A.: Pens: An algorithm for density-based clustering in peer-to-peer systems. In: Proceedings of the International Conference on Scalable Information Systems (INFOSCALE) (2006)
18. Cates, J.: Robust and efficient data management for a distributed hash table. Master's thesis, Massachusetts Institute of Technology (2003)
19. Naor, M., Wieder, U.: A simple fault-tolerant distributed hash table. In: Proceedings of the Second International Workshop on Peer-to-Peer Systems (2003)
20. Takemoto, D., Tagashira, S., Fujita, S.: A fault-tolerant content addressable network. IEICE Trans. E89-D (6), 1923-1930 (2006)
21. Cohen, E., Shenker, S.: Replication strategies in unstructured peer-to-peer networks. In: Proceedings of SIGCOMM'02. Pittsburgh (2002)
22. Kangasharju, J., Ross, K.W., Antipolls, S., Turner, D.A.: Optimal content replication in p2p communities. Tech. rep., TU Darmstadt (2002)
23. Cuenca-Acuna, F.M., Martin, R.P., Nguyen, T.D.: Autonomous replication for high availability in unstructured p2p systems. Tech. rep., Rutgers University (2003)
24. On, G., Schmitt, J., Steinmetz, R.: The effectiveness of realistic replication strategies on quality of availability for peer-to-peer systems. In: Proceedings of the Third International Conference on Peer-to-Peer Computing (P2P'03) (2003)