In a growing number of information processing applications, data takes the form of continuous data streams rather than traditional stored databases. Monitoring systems that seek to provide monitoring services in cloud environment must be prepared to deal gracefully with huge data collection without compromising system performance. In this paper, we show that by using a concept of urgent data, system can shorten the response time for most `urgent' queries while guarantee lower bandwidth consumption. We argue that monitoring data can be treated differently. Some data capture critical system events, the arrival of these data will significantly influence the monitoring reaction speed, we call them urgent data. High speed urgent data collection would help system to act in real time when facing fatal error. On the other hand, slowing down the collection speed of others may render more bandwidth. Then several urgent data collection strategies that focus on reducing the urgent data volume are also proposed and evaluated to guarantee the efficiency.
{"title":"Differentiating data collection for cloud environment monitoring","authors":"You Meng, Zhongzhi Luan, Zhendong Cheng, D. Qian","doi":"10.1109/CC.2014.6827565","DOIUrl":"https://doi.org/10.1109/CC.2014.6827565","url":null,"abstract":"In a growing number of information processing applications, data takes the form of continuous data streams rather than traditional stored databases. Monitoring systems that seek to provide monitoring services in cloud environment must be prepared to deal gracefully with huge data collection without compromising system performance. In this paper, we show that by using a concept of urgent data, system can shorten the response time for most `urgent' queries while guarantee lower bandwidth consumption. We argue that monitoring data can be treated differently. Some data capture critical system events, the arrival of these data will significantly influence the monitoring reaction speed, we call them urgent data. High speed urgent data collection would help system to act in real time when facing fatal error. On the other hand, slowing down the collection speed of others may render more bandwidth. Then several urgent data collection strategies that focus on reducing the urgent data volume are also proposed and evaluated to guarantee the efficiency.","PeriodicalId":285812,"journal":{"name":"2013 IFIP/IEEE International Symposium on Integrated Network Management (IM 2013)","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121159540","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2013-05-27DOI: 10.1587/TRANSFUN.E98.A.618
K. Hiraishi, Miwa Yoshimoto, Koichi Kobayashi
In this paper, a new approach to the diagnosis of stochastic discrete event system is presented. We are developing a method, called sequence profiling, based on N-gram models. The information necessary for sequence profiling is only event logs from the target system. From event logs in the normal situation, N-gram models are constructed through a simple statistical analysis. Based on the N-gram model, the diagnoser estimates what kind of faults has occurred in the system, or may conclude that no faults occurs. When the target system is a distributed system consisting of several subsystems, event sequences from subsystems may be interleaved and the method cannot separate the event sequence from local event sequences by subsystems. To improve this situation, we introduce the wildcard characters in the short sequences used in the N-grams. This contributes to removing the effect by subsystems which may not be related to faults. Effectiveness of the proposed approach is demonstrated by application to fault diagnosis of a multi-processor system.
{"title":"Diagnosis of stochastic discrete event systems based on N-gram models with wildcard characters","authors":"K. Hiraishi, Miwa Yoshimoto, Koichi Kobayashi","doi":"10.1587/TRANSFUN.E98.A.618","DOIUrl":"https://doi.org/10.1587/TRANSFUN.E98.A.618","url":null,"abstract":"In this paper, a new approach to the diagnosis of stochastic discrete event system is presented. We are developing a method, called sequence profiling, based on N-gram models. The information necessary for sequence profiling is only event logs from the target system. From event logs in the normal situation, N-gram models are constructed through a simple statistical analysis. Based on the N-gram model, the diagnoser estimates what kind of faults has occurred in the system, or may conclude that no faults occurs. When the target system is a distributed system consisting of several subsystems, event sequences from subsystems may be interleaved and the method cannot separate the event sequence from local event sequences by subsystems. To improve this situation, we introduce the wildcard characters in the short sequences used in the N-grams. This contributes to removing the effect by subsystems which may not be related to faults. Effectiveness of the proposed approach is demonstrated by application to fault diagnosis of a multi-processor system.","PeriodicalId":285812,"journal":{"name":"2013 IFIP/IEEE International Symposium on Integrated Network Management (IM 2013)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129636411","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Alexandru-Florian Antonescu, P. Robinson, T. Braun
Cost-efficient operation while satisfying performance and availability guarantees in Service Level Agreements (SLAs) is a challenge for Cloud Computing, as these are potentially conflicting objectives. We present a framework for SLA management based on multi-objective optimization. The framework features a forecasting model for determining the best virtual machine-to-host allocation given the need to minimize SLA violations, energy consumption and resource wasting. A comprehensive SLA management solution is proposed that uses event processing for monitoring and enables dynamic provisioning of virtual machines onto the physical infrastructure. We validated our implementation against serveral standard heuristics and were able to show that our approach is significantly better.
{"title":"Dynamic SLA management with forecasting using multi-objective optimization","authors":"Alexandru-Florian Antonescu, P. Robinson, T. Braun","doi":"10.7892/BORIS.44005","DOIUrl":"https://doi.org/10.7892/BORIS.44005","url":null,"abstract":"Cost-efficient operation while satisfying performance and availability guarantees in Service Level Agreements (SLAs) is a challenge for Cloud Computing, as these are potentially conflicting objectives. We present a framework for SLA management based on multi-objective optimization. The framework features a forecasting model for determining the best virtual machine-to-host allocation given the need to minimize SLA violations, energy consumption and resource wasting. A comprehensive SLA management solution is proposed that uses event processing for monitoring and enables dynamic provisioning of virtual machines onto the physical infrastructure. We validated our implementation against serveral standard heuristics and were able to show that our approach is significantly better.","PeriodicalId":285812,"journal":{"name":"2013 IFIP/IEEE International Symposium on Integrated Network Management (IM 2013)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131235157","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2013-05-27DOI: 10.1007/978-3-642-40552-5_10
D. Klein, T. Zinner, Stanislav Lange
{"title":"Video quality monitoring based on precomputed frame distortions","authors":"D. Klein, T. Zinner, Stanislav Lange","doi":"10.1007/978-3-642-40552-5_10","DOIUrl":"https://doi.org/10.1007/978-3-642-40552-5_10","url":null,"abstract":"","PeriodicalId":285812,"journal":{"name":"2013 IFIP/IEEE International Symposium on Integrated Network Management (IM 2013)","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123803562","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Andri Lareida, T. Bocek, M. Waldburger, B. Stiller
Finding a good balance between link congestion and over-provisioning for network service providers is a challenge. Recent advances in transport protocols promise a smoother transfer of bulk background data-traffic that P2P (Peer-to-Peer) file sharing systems are significantly contributing to still today. This paper focuses on reducing the link congestion, and traffic peaks originating from P2P systems by replicating data during periods of low network traffic. For this purpose, RB-Tracker is proposed as an extension of B-Tracker in order to automatically manage the overlay network and replication of content, similar to a Content Delivery Network (CDN). RB-Tracker is designed to manage autonomously a P2P network and to use state-of-the-art mechanisms, such as biased neighbor selection.
{"title":"RB-tracker: A fully distributed, replicating, network-, and topology-aware P2P CDN","authors":"Andri Lareida, T. Bocek, M. Waldburger, B. Stiller","doi":"10.5167/UZH-89243","DOIUrl":"https://doi.org/10.5167/UZH-89243","url":null,"abstract":"Finding a good balance between link congestion and over-provisioning for network service providers is a challenge. Recent advances in transport protocols promise a smoother transfer of bulk background data-traffic that P2P (Peer-to-Peer) file sharing systems are significantly contributing to still today. This paper focuses on reducing the link congestion, and traffic peaks originating from P2P systems by replicating data during periods of low network traffic. For this purpose, RB-Tracker is proposed as an extension of B-Tracker in order to automatically manage the overlay network and replication of content, similar to a Content Delivery Network (CDN). RB-Tracker is designed to manage autonomously a P2P network and to use state-of-the-art mechanisms, such as biased neighbor selection.","PeriodicalId":285812,"journal":{"name":"2013 IFIP/IEEE International Symposium on Integrated Network Management (IM 2013)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132703427","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Guilherme Sperb Machado, F. Hecht, M. Waldburger, B. Stiller
A fundamental Software-as-a-Service (SaaS) characteristic in Cloud Computing is to be application-specific; depending on the application, Cloud Providers (CPs) restrict data formats and attributes allowed into their servers via a data validation process. An ill-defined data validation process may directly impact both security (e.g. application failure, legal issues) and accounting and charging (e.g. trusting metadata in file headers). Therefore, this paper investigates, evaluates (by means of tests), and discusses data validation processes of popular CPs. A proof of concept system was thus built, implementing encoders carefully crafted to circumvent data validation processes, ultimately demonstrating how large amounts of unaccounted, arbitrary data can be stored into CPs.
{"title":"Bypassing Cloud Providers' data validation to store arbitrary data","authors":"Guilherme Sperb Machado, F. Hecht, M. Waldburger, B. Stiller","doi":"10.5167/UZH-89242","DOIUrl":"https://doi.org/10.5167/UZH-89242","url":null,"abstract":"A fundamental Software-as-a-Service (SaaS) characteristic in Cloud Computing is to be application-specific; depending on the application, Cloud Providers (CPs) restrict data formats and attributes allowed into their servers via a data validation process. An ill-defined data validation process may directly impact both security (e.g. application failure, legal issues) and accounting and charging (e.g. trusting metadata in file headers). Therefore, this paper investigates, evaluates (by means of tests), and discusses data validation processes of popular CPs. A proof of concept system was thus built, implementing encoders carefully crafted to circumvent data validation processes, ultimately demonstrating how large amounts of unaccounted, arbitrary data can be stored into CPs.","PeriodicalId":285812,"journal":{"name":"2013 IFIP/IEEE International Symposium on Integrated Network Management (IM 2013)","volume":"273 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125833820","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：