Recommending resolutions for problems identified by monitoring

Service Providers are facing an increasingly intense competitive landscape and growing industry requirements. Modern service infrastructure management focuses on the development of methodologies and tools for improving the efficiency and quality of service. It is desirable to run a service in a fully automated operation environment. Automated problem resolution, however, is difficult. It is particularly difficult for the weakly-coupled service composition, since the coupling is not defined at design time. Monitoring software systems are designed to actively capture events and automatically generate incident tickets or event tickets. Repeating events generate similar event tickets, which in turn have a vast number of repeated problem resolutions likely to be found in earlier tickets. We apply a recommendation systems approach to resolution of event tickets. In addition, we extend the recommendation methodology to take into account possible falsity of some of the tickets. The paper presents an analysis of the historical event tickets from a large service provider and proposes two resolution-recommendation algorithms for event tickets utilizing historical tickets. The recommendation algorithms take into account false positives often generated by monitoring systems. An additional penalty is incorporated in the algorithms to control the number of misleading resolutions in the recommendation results. An extensive empirical evaluation on three ticket data sets demonstrates that our proposed algorithms achieve a high accuracy with a small percentage of misleading results.

[1]  Loren Terveen,et al.  Beyond Recommender Systems: Helping People Help Each Other , 2001 .

[2]  Yi Chen,et al.  EasyTicket: a ticket routing recommendation engine for enterprise problem resolution , 2008, Proc. VLDB Endow..

[3]  Sahibsingh A. Dudani The Distance-Weighted k-Nearest-Neighbor Rule , 1976, IEEE Transactions on Systems, Man, and Cybernetics.

[4]  Daniel T. Larose,et al.  Discovering Knowledge in Data: An Introduction to Data Mining , 2005 .

[5]  Piotr Indyk,et al.  Similarity Search in High Dimensions via Hashing , 1999, VLDB.

[6]  Michael McGill,et al.  Introduction to Modern Information Retrieval , 1983 .

[7]  Yehuda Koren,et al.  Collaborative filtering with temporal dynamics , 2009, KDD.

[8]  George Karypis,et al.  SLIM: Sparse Linear Methods for Top-N Recommender Systems , 2011, 2011 IEEE 11th International Conference on Data Mining.

[9]  Benny Rochwerger,et al.  2013 IFIP/IEEE International Symposium on Integrated Network Management (IM 2013), Ghent, Belgium, May 27-31, 2013 , 2013, IM.

[10]  Yixin Diao,et al.  IT service management automation - A hybrid methodology to integrate and orchestrate collaborative human centric and automation centric workflows , 2007, IEEE International Conference on Services Computing (SCC 2007).

[11]  Yihong Gong,et al.  iHelp: An Intelligent Online Helpdesk System , 2011, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[12]  Jon Louis Bentley,et al.  Multidimensional binary search trees used for associative searching , 1975, CACM.

[13]  John Langford,et al.  Cover trees for nearest neighbor , 2006, ICML.

[14]  Peter N. Yianilos,et al.  Data structures and algorithms for nearest neighbor search in general metric spaces , 1993, SODA '93.

[15]  Nikolay Mehandjiev,et al.  Multi-criteria service recommendation based on user criteria preferences , 2011, RecSys '11.

[16]  Yehuda Koren,et al.  Scalable Collaborative Filtering with Jointly Derived Neighborhood Interpolation Weights , 2007, Seventh IEEE International Conference on Data Mining (ICDM 2007).

[17]  Liang Tang,et al.  Discovering lag intervals for temporal dependencies , 2012, KDD.

[18]  George Karypis,et al.  Item-based top-N recommendation algorithms , 2004, TOIS.

[19]  Antonin Guttman,et al.  R-trees: a dynamic index structure for spatial searching , 1984, SIGMOD '84.

[20]  Larisa Shwartz,et al.  Managing Faults in the Service Delivery Process of Service Provider Coalitions , 2009, 2009 IEEE International Conference on Services Computing.

[21]  Wolfgang Emmerich,et al.  Monere: Monitoring of Service Compositions for Failure Diagnosis , 2011, ICSOC.

[22]  Liang Tang,et al.  Optimizing system monitoring configurations for non-actionable alerts , 2012, 2012 IEEE Network Operations and Management Symposium.

[23]  George Karypis,et al.  Evaluation of Item-Based Top-N Recommendation Algorithms , 2001, CIKM '01.

[24]  Louise E. Moser,et al.  Generative models for ticket resolution in expert networks , 2010, KDD.

[25]  John Riedl,et al.  Application of Dimensionality Reduction in Recommender System - A Case Study , 2000 .

[26]  Pascal Poizat,et al.  Repair vs. Recomposition for Broken Service Compositions , 2010, ICSOC.

[27]  Xue Li,et al.  Time weight collaborative filtering , 2005, CIKM '05.