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

TOSSMA: A Tenant-Oriented SaaS Security Management Architecture TOSSMA:一个面向租户的SaaS安全管理架构

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

Mohamed Almorsy, J. Grundy, Amani S. Ibrahim

{"title":"TOSSMA: A Tenant-Oriented SaaS Security Management Architecture","authors":"Mohamed Almorsy, J. Grundy, Amani S. Ibrahim","doi":"10.1109/CLOUD.2012.146","DOIUrl":"https://doi.org/10.1109/CLOUD.2012.146","url":null,"abstract":"Multi-tenancy helps service providers to save costs, improve resource utilization, and reduce service customization and maintenance time by sharing of resources and services. On the other hand, supporting multi-tenancy adds more complexity to the shared application's required capabilities. Security is a key requirement that must be addressed when engineering new SaaS applications or when re-engineering existing applications to support multi-tenancy. Traditional security (re)engineering approaches do not fit with the multi-tenancy application model where tenants and their security requirements emerge after the system was first developed. Enabling, runtime, adaptable and tenant-oriented application security customization on single service instance is a key challenging security goal in multi-tenant application engineering. In this paper we introduce TOSSMA, a Tenant-Oriented SaaS Security Management Architecture. TOSSMA allows service providers to enable their tenants in defining, customizing and enforcing their security requirements without having to go back to application developers for maintenance or security customizations. TOSSMA supports security management for both new and existing systems. Service providers are not required to write security integration code to use a specific security platform or mechanism. In this paper, we describe details of our approach and architecture, our prototype implementation of TOSSMA, give a usage example of securing a multi-tenant SaaS, and discuss our evaluation experiments of TOSSMA.","PeriodicalId":214084,"journal":{"name":"2012 IEEE Fifth International Conference on Cloud Computing","volume":"70 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":"129429552","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

Space Reduction for Extreme Aggregation of Data Stream over Time-Based Sliding Window 基于时间的滑动窗口数据流极端聚合的空间缩减

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

Weilong Ding, Yanbo Han, Jing Wang, Zhuofeng Zhao

引用次数: 1

GARDEN: Generic Addressing and Routing for Data Center Networks GARDEN:数据中心网络通用寻址和路由

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

Yan Hu, M. Zhu, Yong Xia, Kai Chen, Yanlin Luo

{"title":"GARDEN: Generic Addressing and Routing for Data Center Networks","authors":"Yan Hu, M. Zhu, Yong Xia, Kai Chen, Yanlin Luo","doi":"10.1109/CLOUD.2012.9","DOIUrl":"https://doi.org/10.1109/CLOUD.2012.9","url":null,"abstract":"Data centers often hold tens to hundreds of thousands of servers in order to offer cloud computing services at scale. Ethernet switching and IP routing have their own advantages and limitations in building data center networks. Recent research, such as PortLand and BCube, has proposed scalable data center network designs. A common feature of these designs is that their addressing and routing are customized to specific topologies. In this paper, we propose a generic addressing, routing and forwarding protocol for data center networks, which works on arbitrarily \"layered'' network topologies. We first form the network as a multi-rooted tree. Each network node (i.e., hosts and switches) is then assigned one or more locators, and each locator encodes a downward path from the roots to this node. Data center networks often have rich path diversity, so tracking all locators of a destination node will cause switches to have very large forwarding tables. We further use a new forwarding model to reduce the forwarding states. In addition, the multiple-locator mechanism brings built-in support for multi-path routing, load balancing and fault tolerance. Evaluations based on simulations and prototype experiments demonstrate that our proposal achieves our design goals.","PeriodicalId":214084,"journal":{"name":"2012 IEEE Fifth International Conference on Cloud Computing","volume":"17 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":"120946334","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}

引用次数: 10

MiyakoDori: A Memory Reusing Mechanism for Dynamic VM Consolidation MiyakoDori:动态虚拟机整合的内存重用机制

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

Soramichi Akiyama, Takahiro Hirofuchi, Ryousei Takano, S. Honiden

引用次数: 44

Cryptonite: A Secure and Performant Data Repository on Public Clouds Cryptonite:公共云上安全、高性能的数据存储库

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

A. Kumbhare, Yogesh L. Simmhan, V. Prasanna

{"title":"Cryptonite: A Secure and Performant Data Repository on Public Clouds","authors":"A. Kumbhare, Yogesh L. Simmhan, V. Prasanna","doi":"10.1109/CLOUD.2012.109","DOIUrl":"https://doi.org/10.1109/CLOUD.2012.109","url":null,"abstract":"Cloud storage has become immensely popular for maintaining synchronized copies of files and for sharing documents with collaborators. However, there is heightened concern about the security and privacy of Cloud-hosted data due to the shared infrastructure model and an implicit trust in the service providers. Emerging needs of secure data storage and sharing for domains like Smart Power Grids, which deal with sensitive consumer data, require the persistence and availability of Cloud storage but with client-controlled security and encryption, low key management overhead, and minimal performance costs. Cryptonite is a secure Cloud storage repository that addresses these requirements using a Strongbox model for shared key management. We describe the Cryptonite service and desktop client, discuss performance optimizations, and provide an empirical analysis of the improvements. Our experiments shows that Cryptonite clients achieve a 40% improvement in file upload bandwidth over plaintext storage using the Azure Storage Client API despite the added security benefits, while our file download performance is 5 times faster than the baseline for files greater than 100MB.","PeriodicalId":214084,"journal":{"name":"2012 IEEE Fifth International Conference on Cloud Computing","volume":"26 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":"125206477","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}

引用次数: 32

Optimal Bids for Spot VMs in a Cloud for Deadline Constrained Jobs 为限期作业在云中提供现货虚拟机的最佳出价

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

M. Zafer, Yang Song, Kang-Won Lee

{"title":"Optimal Bids for Spot VMs in a Cloud for Deadline Constrained Jobs","authors":"M. Zafer, Yang Song, Kang-Won Lee","doi":"10.1109/CLOUD.2012.59","DOIUrl":"https://doi.org/10.1109/CLOUD.2012.59","url":null,"abstract":"Spot virtual-machine (VM) instances, such as Amazon EC2 Spot VMs, are a class of VMs that are purchased through a market mechanism of price-bids submitted by cloud users. Spot VMs can be obtained at substantially lower cost than other VM classes such as Reserved and On-demand instances, but they do not have guaranteed availability since it depends on the submitted price bids and the fluctuating spot VM price. Many applications with large computing requirements but no real-time availability constraints, such as scientific computing, financial modelling and large data analysis, can be carried out at a significantly lower cost using spot VMs. For such jobs, an important question that arises is what should the submitted price bids be so that the computation is completed within a fixed time interval while the cost is minimized. Towards this goal, we model a job as a fixed computation request with a deadline constraint and formulate the problem of designing a dynamic bidding policy that minimizes the average cost of job completion. We obtain analytical and closed-form results for the optimal strategy under a Markov spot price evolution, and then evaluate the performance of the algorithms on the actual spot price history of Amazon EC2 Spot VMs.","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":"127985036","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}

引用次数: 104

An Availability-Aware Approach to Resource Placement of Dynamic Scaling in Clouds 云中动态扩展资源配置的可用性感知方法

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

Wenting Wang, Hao-peng Chen, X. Chen

引用次数: 18

Evaluating Hadoop for Data-Intensive Scientific Operations 评估Hadoop在数据密集型科学操作中的应用

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

Zacharia Fadika, M. Govindaraju, S. Canon, L. Ramakrishnan

{"title":"Evaluating Hadoop for Data-Intensive Scientific Operations","authors":"Zacharia Fadika, M. Govindaraju, S. Canon, L. Ramakrishnan","doi":"10.1109/CLOUD.2012.118","DOIUrl":"https://doi.org/10.1109/CLOUD.2012.118","url":null,"abstract":"Emerging sensor networks, more capable instruments, and ever increasing simulation scales are generating data at a rate that exceeds our ability to effectively manage, curate, analyze, and share it. Data-intensive computing is expected to revolutionize the next-generation software stack. Hadoop, an open source implementation of the MapReduce model provides a way for large data volumes to be seamlessly processed through use of large commodity computers. The inherent parallelization, synchronization and fault-tolerance the model offers, makes it ideal for highly-parallel data-intensive applications. MapReduce and Hadoop have traditionally been used for web data processing and only recently been used for scientific applications. There is a limited understanding on the performance characteristics that scientific data intensive applications can obtain from MapReduce and Hadoop. Thus, it is important to evaluate Hadoop specifically for data-intensive scientific operations -- filter, merge and reorder-- to understand its various design considerations and performance trade-offs. In this paper, we evaluate Hadoop for these data operations in the context of High Performance Computing (HPC) environments to understand the impact of the file system, network and programming modes on performance.","PeriodicalId":214084,"journal":{"name":"2012 IEEE Fifth International Conference on Cloud Computing","volume":"213 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":"132683287","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}

引用次数: 40

Bi-criteria Workflow Tasks Allocation and Scheduling in Cloud Computing Environments 云计算环境下双准则工作流任务分配与调度

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

Kahina Bessai, S. Youcef, A. Oulamara, C. Godart, S. Nurcan

{"title":"Bi-criteria Workflow Tasks Allocation and Scheduling in Cloud Computing Environments","authors":"Kahina Bessai, S. Youcef, A. Oulamara, C. Godart, S. Nurcan","doi":"10.1109/CLOUD.2012.83","DOIUrl":"https://doi.org/10.1109/CLOUD.2012.83","url":null,"abstract":"Although there are few efficient algorithms in the literature for scientific workflow tasks allocation and scheduling for heterogeneous resources such as those proposed in grid computing context, they usually require a bounded number of computer resources that cannot be applied in Cloud computing environment. Indeed, unlike grid, elastic computing, such asAmazon's EC2, allows users to allocate and release compute resources on-demand and pay only for what they use. Therefore, it is reasonable to assume that the number of resources is infinite. This feature of Clouds has been called âillusion of infiniteresourcesâ. However, despite the proven benefits of using Cloud to run scientific workflows, users lack guidance for choosing between multiple offering while taking into account several objectives which are often conflicting. On the other side, the workflow tasks allocation and scheduling have been shown to be NP-complete problems. Thus, it is convenient to use heuristic rather than deterministic algorithm. The objective of this paper is to design an allocation strategy for Cloud computing platform. More precisely, we propose three complementary bi-criteria approaches for scheduling workflows on distributed Cloud resources, taking into account the overall execution time and the cost incurred by using a set of resources.","PeriodicalId":214084,"journal":{"name":"2012 IEEE Fifth International Conference on Cloud Computing","volume":"8 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":"121294724","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}

引用次数: 79

Comparison of Multiple Cloud Frameworks 多个云框架的比较

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

G. Laszewski, Javier Diaz, Fugang Wang, G. Fox

引用次数: 119