TY - GEN
T1 - On-line Bayesian context change detection in Web service systems
AU - Tomczak, Jakub M.
AU - Ziȩba, Maciej
PY - 2013/7/10
Y1 - 2013/7/10
N2 - In real-life situations characteristics of Web service systems evolve in time. Therefore, change detection techniques become substantial elements of adaptive procedures for Web service systems management, such as resource allocation and anomaly detection methods. In this paper, we propose an on-line change detector which uses the Bayesian inference. We define two models which describe situations with one change and no change within data. Next we apply Bayesian model comparison for change detection. In order to obtain analytical expressions of model evidences used in the model comparison we provide a coherent framework of change detection which focuses on an approximation of the Bayes factor. The proposed solution, contrary to state-of-the-art methods, works in an on-line fashion and the algorithm's computational complexity is proportional to the constant size of the shifting window. Low computational complexity of the change detector enables its application in complex computer networks. At the end of the research paper, the quality of the proposed algorithm is examined using simulated Web service system.
AB - In real-life situations characteristics of Web service systems evolve in time. Therefore, change detection techniques become substantial elements of adaptive procedures for Web service systems management, such as resource allocation and anomaly detection methods. In this paper, we propose an on-line change detector which uses the Bayesian inference. We define two models which describe situations with one change and no change within data. Next we apply Bayesian model comparison for change detection. In order to obtain analytical expressions of model evidences used in the model comparison we provide a coherent framework of change detection which focuses on an approximation of the Bayes factor. The proposed solution, contrary to state-of-the-art methods, works in an on-line fashion and the algorithm's computational complexity is proportional to the constant size of the shifting window. Low computational complexity of the change detector enables its application in complex computer networks. At the end of the research paper, the quality of the proposed algorithm is examined using simulated Web service system.
KW - BIC
KW - Change detection
KW - Web service
UR - http://www.scopus.com/inward/record.url?scp=84879743068&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84879743068&partnerID=8YFLogxK
U2 - 10.1145/2462307.2462311
DO - 10.1145/2462307.2462311
M3 - Conference contribution
AN - SCOPUS:84879743068
SN - 9781450320511
T3 - HotTopiCS 2013 - Proceedings of the 2013 International Workshop on Hot Topics in Cloud Services
SP - 3
EP - 10
BT - HotTopiCS 2013 - Proceedings of the 2013 International Workshop on Hot Topics in Cloud Services
T2 - 2013 International Workshop on Hot Topics in Cloud Services, HotTopiCS 2013
Y2 - 20 April 2013 through 21 April 2013
ER -