{"title":"基于残差高斯-马尔科夫随机场的云遥测建模","authors":"Nicholas C. Landolfi, Daniel C. O’Neill, S. Lall","doi":"10.1109/ICIN51074.2021.9385544","DOIUrl":null,"url":null,"abstract":"Can probabilistic graphical models characterize cloud telemetry? This paper promotes the affirmative view. Cloud systems are large, connected, and dynamic. Consequently, databased techniques to model their telemetry are high-dimensional, spatial, and unsupervised. Undirected probabilistic graphical models seem natural, but remain unexplored. We discuss one way around the limitation that cloud measurements violate usual assumptions of normality, and give a tractable estimation procedure for a candidate data model. As a preliminary test, we fit the model and use it to detect and localize anomalies in a synthetic environment and for a small-scale software system.","PeriodicalId":347933,"journal":{"name":"2021 24th Conference on Innovation in Clouds, Internet and Networks and Workshops (ICIN)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Cloud Telemetry Modeling via Residual Gauss-Markov Random Fields\",\"authors\":\"Nicholas C. Landolfi, Daniel C. O’Neill, S. Lall\",\"doi\":\"10.1109/ICIN51074.2021.9385544\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Can probabilistic graphical models characterize cloud telemetry? This paper promotes the affirmative view. Cloud systems are large, connected, and dynamic. Consequently, databased techniques to model their telemetry are high-dimensional, spatial, and unsupervised. Undirected probabilistic graphical models seem natural, but remain unexplored. We discuss one way around the limitation that cloud measurements violate usual assumptions of normality, and give a tractable estimation procedure for a candidate data model. As a preliminary test, we fit the model and use it to detect and localize anomalies in a synthetic environment and for a small-scale software system.\",\"PeriodicalId\":347933,\"journal\":{\"name\":\"2021 24th Conference on Innovation in Clouds, Internet and Networks and Workshops (ICIN)\",\"volume\":\"49 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-03-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 24th Conference on Innovation in Clouds, Internet and Networks and Workshops (ICIN)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICIN51074.2021.9385544\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 24th Conference on Innovation in Clouds, Internet and Networks and Workshops (ICIN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICIN51074.2021.9385544","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Cloud Telemetry Modeling via Residual Gauss-Markov Random Fields
Can probabilistic graphical models characterize cloud telemetry? This paper promotes the affirmative view. Cloud systems are large, connected, and dynamic. Consequently, databased techniques to model their telemetry are high-dimensional, spatial, and unsupervised. Undirected probabilistic graphical models seem natural, but remain unexplored. We discuss one way around the limitation that cloud measurements violate usual assumptions of normality, and give a tractable estimation procedure for a candidate data model. As a preliminary test, we fit the model and use it to detect and localize anomalies in a synthetic environment and for a small-scale software system.