Fang Liu, W. Ng, Wei Zhang, Do Hoang Giang, Shuguo Han
{"title":"Encrypted Set Intersection Protocol for Outsourced Datasets","authors":"Fang Liu, W. Ng, Wei Zhang, Do Hoang Giang, Shuguo Han","doi":"10.1109/IC2E.2014.18","DOIUrl":"https://doi.org/10.1109/IC2E.2014.18","url":null,"abstract":"Secure and efficient data storage and computation for an outsourced database is a primary concern for users, especially with the push for cloud computing that affords both compute and resource scalability. Among the diverse secure building blocks for secure analytical computations on outsourced databases, the encrypted set intersection operation extracts common sensitive information from datasets belonging to different users. In existing methods, each user holds their sensitive data and all users follow a secure protocol to perform set intersection. This approach is not applicable to the cloud platform, where data resides in the cloud platform in encrypted form and not at each user site. To address this limitation, in this paper, we design the Encrypted Set Intersection Protocol (ESIP) that allows server and users to perform collaborative operations to obtain the correct set intersection result without violating privacy of data contributed by each user at the server.","PeriodicalId":273902,"journal":{"name":"2014 IEEE International Conference on Cloud Engineering","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127996412","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}
Jinho Hwang, Guyue Liu, Sai Zeng, Frederick Y. Wu, Timothy Wood
{"title":"Topology Discovery and Service Classification for Distributed-Aware Clouds","authors":"Jinho Hwang, Guyue Liu, Sai Zeng, Frederick Y. Wu, Timothy Wood","doi":"10.1109/IC2E.2014.86","DOIUrl":"https://doi.org/10.1109/IC2E.2014.86","url":null,"abstract":"Cloud data centers are difficult to manage because providers have no knowledge of what applications are being run by customers or how they interact. As a consequence, current clouds provide minimal automated management functionality, passing the problem on to users who have access to even fewer tools since they lack insight into the underlying infrastructure. Ideally, the cloud platform, not the customer, should be managing data center resources in order to both use them efficiently and provide strong application-level performance and reliability guarantees. To do this, we believe that clouds must become \"distibuted-aware\" so that they can deduce the overall structure and dependencies within a client's distributed applications and use that knowledge to better guide management services. Towards this end we are developing a light-weight topology detection system that maps distributed applications and a service classification algorithm that can determine not only overall application types, but individual VM roles as well.","PeriodicalId":273902,"journal":{"name":"2014 IEEE International Conference on Cloud Engineering","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133557550","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}
{"title":"Self-Managing Data in the Clouds","authors":"J. Hurley, D. Johansen","doi":"10.1109/IC2E.2014.31","DOIUrl":"https://doi.org/10.1109/IC2E.2014.31","url":null,"abstract":"The cloud offers an attractive platform for storage and access to data. However, data is usually expected to only exist within the context of a single cloud platform. We investigate a concept where management meta-code is coupled with data items. Meta-code describes core functionality which should always be considered when storing or accessing data. The goal is to simplify management tasks by composing the desired set of meta-code modules for collections of data items, and executing them when appropriate. We evaluate the run-time environment, Suorgi, which is designed to achieve this. Our results show that Suorgi and meta-code is a practical approach to supporting data management tasks, and it makes this fine-level management easy to express for the data owner.","PeriodicalId":273902,"journal":{"name":"2014 IEEE International Conference on Cloud Engineering","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132755260","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}
{"title":"Virtualization vs Containerization to Support PaaS","authors":"Rajdeep Dua, A. Raja, Dharmesh Kakadia","doi":"10.1109/IC2E.2014.41","DOIUrl":"https://doi.org/10.1109/IC2E.2014.41","url":null,"abstract":"PaaS vendors face challenges in efficiently providing services with the growth of their offerings. In this paper, we explore how PaaS vendors are using containers as a means of hosting Apps. The paper starts with a discussion of PaaS Use case and the current adoption of Container based PaaS architectures with the existing vendors. We explore various container implementations - Linux Containers, Docker, Warden Container, lmctfy and OpenVZ. We look at how each of this implementation handle Process, FileSystem and Namespace isolation. We look at some of the unique features of each container and how some of them reuse base Linux Container implementation or differ from it. We also explore how IaaSlayer itself has started providing support for container lifecycle management along with Virtual Machines. In the end, we look at factors affecting container implementation choices and some of the features missing from the existing implementations for the next generation PaaS.","PeriodicalId":273902,"journal":{"name":"2014 IEEE International Conference on Cloud Engineering","volume":"102 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121486970","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}
{"title":"Analytics-as-a-Service (AaaS) Tool for Unstructured Data Mining","authors":"Richard K. Lomotey, R. Deters","doi":"10.1109/IC2E.2014.15","DOIUrl":"https://doi.org/10.1109/IC2E.2014.15","url":null,"abstract":"Analytics-as-a-Service (AaaS) has become indispensable because it affords stakeholders to discover knowledge in Big Data. Previously, data stored in data warehouses follow some schema and standardization which leads to efficient data mining. However, the \"Big Data\" epoch has witnessed the rise of structured, semi-structured, and unstructured data, a trend that motivated enterprises to employ the NoSQL data storages to accommodate the high-dimensional data. In this paper, we introduce an AaaS tool that aims at accomplishing terms and topics extraction and organization from unstructured data sources such as NoSQL databases and textual contents (e.g., websites). The primary accomplishment in this paper is the detail justification of the architectural design of our proposed framework. This includes the proposed algorithms (e.g., concurrency search, linear search, etc.) and the performance of macro tasks such as filtering, tagging, and so on.","PeriodicalId":273902,"journal":{"name":"2014 IEEE International Conference on Cloud Engineering","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123207813","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}
Sundeep Kambhampati, Jaimie Kelley, Christopher Stewart, William C. L. Stewart, R. Ramnath
{"title":"Managing Tiny Tasks for Data-Parallel, Subsampling Workloads","authors":"Sundeep Kambhampati, Jaimie Kelley, Christopher Stewart, William C. L. Stewart, R. Ramnath","doi":"10.1109/IC2E.2014.94","DOIUrl":"https://doi.org/10.1109/IC2E.2014.94","url":null,"abstract":"Subsampling workloads compute statistics from a set of observed samples using a random subset of sample data (i.e., a subsample). Data-parallel platforms group these samples into tasks, each task subsamples its data in parallel. In this paper, we study subsampling workloads that benefit from tiny tasks-i.e., tasks comprising few samples. Tiny tasks reduce processor cache misses caused by random subsampling, which speeds up per-task running time. However, they can also cause significant scheduling overheads that negate the time reduction from reduced cache misses. For example, vanilla Hadoop takes longer to start tiny tasks than to run them. We compared the task scheduling overheads of vanilla Hadoop, lightweight Hadoop setups, and BashReduce. BashReduce, the best platform, outperformed the worst by 3.6X but scheduling overhead was still 12% of a task's running time. We improved BashReduce's scheduler by allowing it to size tasks according to kneepoints on the miss rate curve. We tested these changes on high-throughput genotype data and on data obtained from Netflix. Our improved BashReduce outperformed vanilla Hadoop by almost 3X and completed short, interactive jobs almost as efficiently as long jobs. These results held at scale and across diverse, heterogeneous hardware.","PeriodicalId":273902,"journal":{"name":"2014 IEEE International Conference on Cloud Engineering","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126090822","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}
Li Qiong, Xiong Shaojin, Le Dan, Lin Zhibin, Liu Hucheng
{"title":"A FPGA Based Real-time Design of Efficient Sifting Module in QKD System","authors":"Li Qiong, Xiong Shaojin, Le Dan, Lin Zhibin, Liu Hucheng","doi":"10.1109/IC2E.2014.22","DOIUrl":"https://doi.org/10.1109/IC2E.2014.22","url":null,"abstract":"Since the Quantum Key Distribution (QKD)technique makes it possible to construct an absolute secure cryptographic system by combing the One-time pad, QKD has drawn many attention these years. The insufficient implementation speed of the post-processing system of QKD is one of the greatest obstacle to wide application of QKD. The sifting module of QKD post-processing system needs to deal with the heaviest incoming load, it is of crucial importance to study how to design and implement an efficient sifting module to accelerate the QKD post-processing system. In this paper, an efficient FPGA based design scheme of the sifting module is presented. Our scheme can decrease the demands for storage resource and communication traffic obviously.","PeriodicalId":273902,"journal":{"name":"2014 IEEE International Conference on Cloud Engineering","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127008475","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}
{"title":"Highly Available Primary-Backup Mechanism for Internet Services with Optimistic Consensus","authors":"Koji Hasebe, Naofumi Nishita, Kazuhiko Kato","doi":"10.1109/IC2E.2014.71","DOIUrl":"https://doi.org/10.1109/IC2E.2014.71","url":null,"abstract":"We present an optimistic primary-backup (so-called passive replication) mechanism for highly available Internet services on intercloud platforms. Our proposed method aims at providing Internet services despite the occurrence of a large-scale disaster. To this end, each service in our method creates replicas in different data centers and coordinates them with an optimistic consensus algorithm instead of a majority-based consensus algorithm such as Paxos. Although our method allows temporary inconsistencies among replicas, it eventually converges on the desired state without an interruption in services. In particular, the method tolerates simultaneous failure of the majority of nodes and a partitioning of the network. Moreover, through interservice communications, members of the service groups are autonomously reorganized according to the type of failure and changes in system load. This enables both load balancing and power savings, as well as provisioning for the next disaster. We demonstrate the service availability provided by our approach for simulated failure patterns and its adaptation to changes in workload for load balancing and power savings by experiments with a prototype implementation.","PeriodicalId":273902,"journal":{"name":"2014 IEEE International Conference on Cloud Engineering","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129281605","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}
{"title":"A Decentralized Autonomic Architecture for Performance Control in the Cloud","authors":"Ian Gergin, B. Simmons, Marin Litoiu","doi":"10.1109/IC2E.2014.75","DOIUrl":"https://doi.org/10.1109/IC2E.2014.75","url":null,"abstract":"In this paper, we introduce a decentralized autonomic architecture for multi-tier applications deployed in cloud environments. The architecture maintains the application's service level objective at a predefined level and, implicitly, reduces the cost. The architecture uses a series of autonomic controllers, in which each controller independently regulates a tier of the application. The architecture utilizes feedback loops and implements Proportional, Integrative and Derivative control laws at each autonomic controller. A prototype is described and an initial set of experiments is conducted on a public commercial cloud. The experiments demonstrate the effectiveness of this approach at maintaining a service level objective through the decomposition of an application's aggregate performance into its set of discretely managed component tiers.","PeriodicalId":273902,"journal":{"name":"2014 IEEE International Conference on Cloud Engineering","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127610357","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}
Johannes Wettinger, V. Andrikopoulos, Steve Strauch, F. Leymann
{"title":"Characterizing and Evaluating Different Deployment Approaches for Cloud Applications","authors":"Johannes Wettinger, V. Andrikopoulos, Steve Strauch, F. Leymann","doi":"10.1109/IC2E.2014.32","DOIUrl":"https://doi.org/10.1109/IC2E.2014.32","url":null,"abstract":"Fully automated provisioning and deployment in order to reduce the costs for managing applications is one of the most essential requirements to make use of the benefits of Cloud computing. Several approaches and tools are available to automate the involved processes. The DevOps community, for example, provides tooling and artifacts to realize deployment automation on Infrastructure as a Service level in a mostly application-oriented manner. Platform as a Service frameworks are also available for the same purpose. In this paper we categorize and characterize available deployment approaches independently from the underlying technology used. For this purpose, we choose Web applications with different technology stacks and analyze their specific deployment requirements. Afterwards, we provision these applications using each of the identified types of deployment approaches in the Cloud. Finally, we discuss the evaluation results and derive recommendations which deployment approach to use based on the deployment requirements of an application.","PeriodicalId":273902,"journal":{"name":"2014 IEEE International Conference on Cloud Engineering","volume":"8 6","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132899292","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}