About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
IM 2013
Conference paper
Recommending resolutions for problems identified by monitoring
Abstract
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. © 2013 IFIP.