2012 IEEE Fifth International Conference on Cloud Computing最新文献_第9页

Synchronous Parallel Processing of Big-Data Analytics Services to Optimize Performance in Federated Clouds 大数据分析服务的同步并行处理以优化联邦云中的性能

2012 IEEE Fifth International Conference on Cloud Computing Pub Date : 2012-06-24 DOI: 10.1109/CLOUD.2012.108

Gueyoung Jung, N. Gnanasambandam, Tridib Mukherjee

{"title":"Synchronous Parallel Processing of Big-Data Analytics Services to Optimize Performance in Federated Clouds","authors":"Gueyoung Jung, N. Gnanasambandam, Tridib Mukherjee","doi":"10.1109/CLOUD.2012.108","DOIUrl":"https://doi.org/10.1109/CLOUD.2012.108","url":null,"abstract":"Parallelization of big-data analytics services over a federation of heterogeneous clouds has been considered to improve performance. However, contrary to common intuition, there is an inherent tradeoff between the level of parallelism and the performance for big-data analytics principally because of a significant delay for big-data to get transferred over the network. The data transfer delay can be comparable or even higher than the time required to compute data. To address the aforementioned tradeoff, this paper determines: (a) how many and which computing nodes in federated clouds should be used for parallel execution of big-data analytics; (b) opportunistic apportioning of big-data to these computing nodes in a way to enable synchronized completion at best-effort performance; and (c) sequence of apportioned, different sizes of big-data chunks to be computed in each node so that transfer of a chunk is overlapped as much as possible with the computation of the previous chunk in the node. In this regard, Maximally Overlapped Bin-packing driven Bursting (MOBB) algorithm is proposed, which improve the performance by up to 60% against existing approaches.","PeriodicalId":214084,"journal":{"name":"2012 IEEE Fifth International Conference on Cloud Computing","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116313459","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}

引用次数: 68

Risk Aware Provisioning and Resource Aggregation Based Consolidation of Virtual Machines 基于虚拟机整合的风险感知配置和资源聚合

2012 IEEE Fifth International Conference on Cloud Computing Pub Date : 2012-06-24 DOI: 10.1109/CLOUD.2012.86

Kishaloy Halder, U. Bellur, Purushottam Kulkarni

{"title":"Risk Aware Provisioning and Resource Aggregation Based Consolidation of Virtual Machines","authors":"Kishaloy Halder, U. Bellur, Purushottam Kulkarni","doi":"10.1109/CLOUD.2012.86","DOIUrl":"https://doi.org/10.1109/CLOUD.2012.86","url":null,"abstract":"Server consolidation has emerged as an important technique to save on energy costs in virtualized datacenters. The issue of instantiation of a given set of Virtual Machines (VMs) on a set of Physical Machines (PMs) can be thought of as consisting of a provisioning step where we determine the amount of resources to be allocated to a VM and a placement step which decides which VMs can be placed together on a physical machines thereby allocating VMs to PMs. In this paper, we introduce a provisioning scheme which takes into account acceptable intensity of violation of provisioned resources. In addition we identify a serious shortcoming of existing placement schemes that correct in our correlation aware placement scheme. We consider correlation among aggregated resource demands of VMs while finding the VM-PM mapping. Experimental results reveal that our approach leads to a significant amount of reduction in the number of servers (up to 32% in our settings) required to host 1000 VMs and thus enables us to turn off unnecessary servers. It achieves this by packing VMs more tightly by correlating resource requirements across the entire set of VMs to be placed. We present a comprehensive set of experimental results comparing our scheme with the existing provisioning and placement schemes.","PeriodicalId":214084,"journal":{"name":"2012 IEEE Fifth International Conference on Cloud Computing","volume":"82 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123340807","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}

引用次数: 33

Supporting Virtualization-Aware Security Solutions Using a Systematic Approach to Overcome the Semantic Gap 支持虚拟化感知的安全解决方案，使用系统的方法来克服语义差距

2012 IEEE Fifth International Conference on Cloud Computing Pub Date : 2012-06-24 DOI: 10.1109/CLOUD.2012.129

Amani S. Ibrahim, J. Hamlyn-Harris, J. Grundy, Mohamed Almorsy

{"title":"Supporting Virtualization-Aware Security Solutions Using a Systematic Approach to Overcome the Semantic Gap","authors":"Amani S. Ibrahim, J. Hamlyn-Harris, J. Grundy, Mohamed Almorsy","doi":"10.1109/CLOUD.2012.129","DOIUrl":"https://doi.org/10.1109/CLOUD.2012.129","url":null,"abstract":"A prerequisite to implementing virtualization-aware security solutions is to solve the \"semantic gap\" problem. Current approaches require a deep knowledge of the kernel data to manually solve the semantic gap. However, kernel data is very complex; an Operating System (OS) kernel contains thousands of data structures that have direct and indirect (pointer) relations between each other with no explicit integrity constraints. This complexity makes it impractical to use manual methods. In this paper, we present a new solution to systematically and efficiently solve the semantic gap for any OS, without any prior knowledge of the OS. We present: (i) KDD, a tool that systematically builds a precise kernel data definition for any C-based OS such as Windows and Linux. KDD generates this definition by performing points-to analysis on the kernel's source code to disambiguate the pointer relations. (ii) SVA, a security appliance that solves the semantic gap based on the generated definition, to systematically and externally map the virtual machines' physical memory and extract the runtime dynamic objects. We have implemented prototypes for KDD and SVA, and have performed different experiments to prove their effectiveness.","PeriodicalId":214084,"journal":{"name":"2012 IEEE Fifth International Conference on Cloud Computing","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123497381","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}

引用次数: 6

Programmable Order-Preserving Secure Index for Encrypted Database Query 加密数据库查询的可编程保序安全索引

2012 IEEE Fifth International Conference on Cloud Computing Pub Date : 2012-06-24 DOI: 10.1109/CLOUD.2012.65

Dongxi Liu, Shenlu Wang

引用次数: 84

Increasing Spot Instances Reliability Using Dynamic Scalability 使用动态可伸缩性提高现场实例的可靠性

2012 IEEE Fifth International Conference on Cloud Computing Pub Date : 2012-06-24 DOI: 10.1109/CLOUD.2012.58

W. Dawoud, I. Takouna, C. Meinel

{"title":"Increasing Spot Instances Reliability Using Dynamic Scalability","authors":"W. Dawoud, I. Takouna, C. Meinel","doi":"10.1109/CLOUD.2012.58","DOIUrl":"https://doi.org/10.1109/CLOUD.2012.58","url":null,"abstract":"Traditionally, Infrastructure as a Service (IaaS)providers deliver their services as Reserved or On-Demand instances. Spot Instances (SIs) is a complementary service that allows customers to bid on the free capacity at the provider data centers. Therefore, the decrease in the free capacity may result in terminating instances abruptly. To ensure fair trading, the provider does not charge customers for the interrupted partial hours. However, SIs price history traces analysis shows that uncharged time could rise up to 30% of the instance total run time, which means a reduction in the provider's profit. In this paper, we propose Elastic Spot Instances (ESIs) approach. It is a trade-off between the price and the total run time, where instead of abruptly terminating the SIs, the provider scales down their capacity proportionally to the increase in the price. Our approach delegates the task of interrupting the instances into the customers, but at the same time keeps the control on the provider side to isolate SIs' impact on the other services at overloaded time. Our approach doesn't imply an additional overhead or complex modification to current IaaS, while it consumes interfaces that are available by most of nowadays virtualization technologies.","PeriodicalId":214084,"journal":{"name":"2012 IEEE Fifth International Conference on Cloud Computing","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128633150","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}

引用次数: 12

CloudProtect: Managing Data Privacy in Cloud Applications CloudProtect:管理云应用程序中的数据隐私

2012 IEEE Fifth International Conference on Cloud Computing Pub Date : 2012-06-24 DOI: 10.1109/CLOUD.2012.122

Mamadou H. Diallo, B. Hore, E. Chang, S. Mehrotra, N. Venkatasubramanian

引用次数: 21

An Online Mechanism for Dynamic VM Provisioning and Allocation in Clouds 云环境下虚拟机动态发放与分配的在线机制

2012 IEEE Fifth International Conference on Cloud Computing Pub Date : 2012-06-24 DOI: 10.1109/CLOUD.2012.26

Sharrukh Zaman, Daniel Grosu

引用次数: 49

Performance of Cloud Computing Centers with Multiple Priority Classes 多优先级云计算中心性能分析

2012 IEEE Fifth International Conference on Cloud Computing Pub Date : 2012-06-24 DOI: 10.1109/CLOUD.2012.96

W. Ellens, M. Zivkovic, J. Akkerboom, R. Litjens, H. V. D. Berg

引用次数: 54

Reliable State Monitoring in Cloud Datacenters 云数据中心的可靠状态监控

2012 IEEE Fifth International Conference on Cloud Computing Pub Date : 2012-06-24 DOI: 10.1109/CLOUD.2012.10

S. Meng, A. Iyengar, I. Rouvellou, Ling Liu, Kisung Lee, Balaji Palanisamy, Y. Tang

{"title":"Reliable State Monitoring in Cloud Datacenters","authors":"S. Meng, A. Iyengar, I. Rouvellou, Ling Liu, Kisung Lee, Balaji Palanisamy, Y. Tang","doi":"10.1109/CLOUD.2012.10","DOIUrl":"https://doi.org/10.1109/CLOUD.2012.10","url":null,"abstract":"State monitoring is widely used for detecting critical events and abnormalities of distributed systems. As the scale of such systems grows and the degree of workload consolidation increases in Cloud data centers, node failures and performance interferences, especially transient ones, become the norm rather than the exception. Hence, distributed state monitoring tasks are often exposed to impaired communication caused by such dynamics on different nodes. Unfortunately, existing distributed state monitoring approaches are often designed under the assumption of always-online distributed monitoring nodes and reliable inter-node communication. As a result, these approaches often produce misleading results which in turn introduce various problems to Cloud users who rely on state monitoring results to perform automatic management tasks such as auto-scaling. This paper introduces a new state monitoring approach that tackles this challenge by exposing and handling communication dynamics such as message delay and loss in Cloud monitoring environments. Our approach delivers two distinct features. First, it quantitatively estimates the accuracy of monitoring results to capture uncertainties introduced by messaging dynamics. This feature helps users to distinguish trustworthy monitoring results from ones heavily deviated from the truth, yet significantly improves monitoring utility compared with simple techniques that invalidate all monitoring results generated with the presence of messaging dynamics. Second, our approach also adapts to non-transient messaging issues by reconfiguring distributed monitoring algorithms to minimize monitoring errors. Our experimental results show that, even under severe message loss and delay, our approach consistently improves monitoring accuracy, and when applied to Cloud application auto-scaling, outperforms existing state monitoring techniques in terms of the ability to correctly trigger dynamic provisioning.","PeriodicalId":214084,"journal":{"name":"2012 IEEE Fifth International Conference on Cloud Computing","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130741626","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}

引用次数: 50

Content Based SLAs in Cloud Computing Environments 云计算环境中基于内容的sla

2012 IEEE Fifth International Conference on Cloud Computing Pub Date : 2012-06-24 DOI: 10.1109/CLOUD.2012.106

Nikoletta Mavrogeorgi, Spyridon V. Gogouvitis, A. Voulodimos, G. Katsaros, Stefanos Koutsoutos, D. Kyriazis, T. Varvarigou, E. K. Kolodner

引用次数: 7