cloud computing-ieee-2014-projects

Cloud Computing IEEE 2014 Projects

Web : www.kasanpro.com     Email : sales@kasanpro.com

List Link : http://kasanpro.com/projects-list/cloud-computing-ieee-2014-projects

Title :NCCloud: A Network-Coding-Based Storage System in a Cloud-of-CloudsLanguage : C#

Project Link : http://kasanpro.com/p/c-sharp/nccloud-network-coding-based-storage-system-cloud-clouds

Abstract : To provide fault tolerance for cloud storage, recent studies propose to stripe data across multiple cloudvendors. However, if a cloud suffers from a permanent failure and loses all its data, we need to repair the lost datawith the help of the other surviving clouds to preserve data redundancy. We present a proxy-based storage system forfault-tolerant multiple-cloud storage called NCCloud, which achieves cost-effective repair for a permanent single-cloudfailure. NCCloud is built on top of a network-coding-based storage scheme called the functional minimum-storageregenerating (FMSR) codes, which maintain the same fault tolerance and data redundancy as in traditional erasurecodes (e.g., RAID-6), but use less repair traffic and hence incur less monetary cost due to data transfer. One keydesign feature of our FMSR codes is that we relax the encoding requirement of storage nodes during repair, whilepreserving the benefits of network coding in repair. We implement a proof-of-concept prototype of NCCloud anddeploy it atop both local and commercial clouds. We validate that FMSR codes provide significant monetary costsavings in repair over RAID-6 codes, while having comparable response time performance in normal cloud storageoperations such as upload/download.

Title :NCCloud: A Network-Coding-Based Storage System in a Cloud-of-CloudsLanguage : NS2

Project Link : http://kasanpro.com/p/ns2/nccloud-network-coding-based-storage-system-cloud-clouds-code

Abstract : To provide fault tolerance for cloud storage, recent studies propose to stripe data across multiple cloudvendors. However, if a cloud suffers from a permanent failure and loses all its data, we need to repair the lost datawith the help of the other surviving clouds to preserve data redundancy. We present a proxy-based storage system forfault-tolerant multiple-cloud storage called NCCloud, which achieves cost-effective repair for a permanent single-cloudfailure. NCCloud is built on top of a network-coding-based storage scheme called the functional minimum-storageregenerating (FMSR) codes, which maintain the same fault tolerance and data redundancy as in traditional erasurecodes (e.g., RAID-6), but use less repair traffic and hence incur less monetary cost due to data transfer. One keydesign feature of our FMSR codes is that we relax the encoding requirement of storage nodes during repair, whilepreserving the benefits of network coding in repair. We implement a proof-of-concept prototype of NCCloud anddeploy it atop both local and commercial clouds. We validate that FMSR codes provide significant monetary costsavings in repair over RAID-6 codes, while having comparable response time performance in normal cloud storageoperations such as upload/download.

Title :Privacy-Preserving Multi-keyword Ranked Search over Encrypted Cloud DataLanguage : C#

Project Link : http://kasanpro.com/p/c-sharp/privacy-preserving-multi-keyword-ranked-search-encrypted-cloud-data-code

Abstract : With the advent of cloud computing, data owners are motivated to outsource their complex datamanagement systems from local sites to the commercial public cloud for great flexibility and economic savings. Butfor protecting data privacy, sensitive data has to be encrypted before outsourcing, which obsoletes traditional datautilization based on plaintext keyword search. Thus, enabling an encrypted cloud data search service is of paramountimportance. Considering the large number of data users and documents in the cloud, it is necessary to allow multiplekeywords in the search request and return documents in the order of their relevance to these keywords. Relatedworks on searchable encryption focus on single keyword search or Boolean keyword search, and rarely sort thesearch results. In this paper, for the first time, we define and solve the challenging problem of privacypreservingmulti-keyword ranked search over encrypted cloud data (MRSE).We establish a set of strict privacy requirements forsuch a secure cloud data utilization system. Among various multikeyword semantics, we choose the efficient similarity

measure of "coordinate matching", i.e., as many matches as possible, to capture the relevance of data documents tothe search query. We further use "inner product similarity" to quantitatively evaluate such similarity measure. We firstpropose a basic idea for the MRSE based on secure inner product computation, and then give two significantlyimproved MRSE schemes to achieve various stringent privacy requirements in two different threat models. Thoroughanalysis investigating privacy and efficiency guarantees of proposed schemes is given. Experiments on the real-worlddataset further show proposed schemes indeed introduce low overhead on computation and communication.

Title :Compatibility-aware Cloud Service Composition Under Fuzzy PreferencesLanguage : C#

Project Link : http://kasanpro.com/p/c-sharp/compatibility-aware-cloud-service-composition-under-fuzzy-preferences

Abstract : When a single Cloud service (i.e., a software image and a virtual machine), on its own, cannot satisfy allthe user requirements, a composition of Cloud services is required. Cloud service composition, which includes severaltasks such as discovery, compatibility checking, selection, and deployment, is a complex process and users find itdifficult to select the best one among the hundreds, if not thousands, of possible compositions available. Servicecomposition in Cloud raises even new challenges caused by diversity of users with different expertise requiring theirapplications to be deployed across difference geographical locations with distinct legal constraints. The main difficultylies in selecting a combination of virtual appliances (software images) and infrastructure services that are compatibleand satisfy a user with vague preferences. Therefore, we present a framework and algorithms which simplify Cloudservice composition for unskilled users. We develop an ontologybased approach to analyze Cloud servicecompatibility by applying reasoning on the expert knowledge. In addition, to minimize effort of users in expressingtheir preferences, we apply combination of evolutionary algorithms and fuzzy logic for composition optimization. Thislets users express their needs in linguistics terms which brings a great comfort to them compared to systems thatforce users to assign exact weights for all preferences.

Title :Compatibility-aware Cloud Service Composition Under Fuzzy PreferencesLanguage : NS2

Project Link : http://kasanpro.com/p/ns2/compatibility-aware-cloud-service-composition-under-fuzzy-preference

Abstract : When a single Cloud service (i.e., a software image and a virtual machine), on its own, cannot satisfy allthe user requirements, a composition of Cloud services is required. Cloud service composition, which includes severaltasks such as discovery, compatibility checking, selection, and deployment, is a complex process and users find itdifficult to select the best one among the hundreds, if not thousands, of possible compositions available. Servicecomposition in Cloud raises even new challenges caused by diversity of users with different expertise requiring theirapplications to be deployed across difference geographical locations with distinct legal constraints. The main difficultylies in selecting a combination of virtual appliances (software images) and infrastructure services that are compatibleand satisfy a user with vague preferences. Therefore, we present a framework and algorithms which simplify Cloudservice composition for unskilled users. We develop an ontologybased approach to analyze Cloud servicecompatibility by applying reasoning on the expert knowledge. In addition, to minimize effort of users in expressingtheir preferences, we apply combination of evolutionary algorithms and fuzzy logic for composition optimization. Thislets users express their needs in linguistics terms which brings a great comfort to them compared to systems thatforce users to assign exact weights for all preferences.

Cloud Computing IEEE 2014 Projects

Title :Automating Cloud Services Life Cycle through Semantic TechnologiesLanguage : C#

Project Link : http://kasanpro.com/p/c-sharp/automating-cloud-services-life-cycle-semantic-technologies

Abstract : Managing virtualized services efficiently over the cloud is an open challenge. Traditional models ofsoftware development are not appropriate for the cloud computing domain, where software (and other) services areacquired on demand. In this paper, we describe a new integrated methodology for the life cycle of IT servicesdelivered on the cloud and demonstrate how it can be used to represent and reason about services and servicerequirements and so automate service acquisition and consumption from the cloud. We have divided the IT servicelife cycle into five phases of requirements, discovery, negotiation, composition, and consumption. We detail eachphase and describe the ontologies that we have developed to represent the concepts and relationships for eachphase. To show how this life cycle can automate the usage of cloud services, we describe a cloud storage prototypethat we have developed. This methodology complements previous work on ontologies for service descriptions in thatit is focused on supporting negotiation for the particulars of a service and going beyond simple matchmaking.

Title :Achieving Effective Cloud Search Services: Multi-keyword Ranked Search over Encrypted Cloud Data

Supporting Synonym QueryLanguage : C#

Project Link : http://kasanpro.com/p/c-sharp/cloud-search-services-multi-keyword-ranked-search-encrypted-cloud

Abstract : In recent years, consumer-centric cloud computing paradigm has emerged as the development of smartelectronic devices combined with the emerging cloud computing technologies. A variety of cloud services aredelivered to the consumers with the premise that an effective and efficient cloud search service is achieved. Forconsumers, they want to find the most relevant products or data, which is highly desirable in the "pay-as-you use"cloud computing paradigm. As sensitive data (such as photo albums, emails, personal health records, financialrecords, etc.) are encrypted before outsourcing to cloud, traditional keyword search techniques are useless.Meanwhile, existing search approaches over encrypted cloud data support only exact or fuzzy keyword search, butnot semantics-based multi-keyword ranked search. Therefore, how to enable an effective searchable system withsupport of ranked search remains a very challenging problem. This paper proposes an effective approach to solve theproblem of multi-keyword ranked search over encrypted cloud data supporting synonym queries. The maincontribution of this paper is summarized in two aspects: multi-keyword ranked search to achieve more accuratesearch results and synonym-based search to support synonym queries. Extensive experiments on real-world datasetwere performed to validate the approach, showing that the proposed solution is very effective and efficient formultikeyword ranked searching in a cloud environment.

Title :Achieving Effective Cloud Search Services: Multi-keyword Ranked Search over Encrypted Cloud DataSupporting Synonym QueryLanguage : NS2

Project Link : http://kasanpro.com/p/ns2/multi-keyword-ranked-search-cloud-search-services-encrypted-cloud

Abstract : In recent years, consumer-centric cloud computing paradigm has emerged as the development of smartelectronic devices combined with the emerging cloud computing technologies. A variety of cloud services aredelivered to the consumers with the premise that an effective and efficient cloud search service is achieved. Forconsumers, they want to find the most relevant products or data, which is highly desirable in the "pay-as-you use"cloud computing paradigm. As sensitive data (such as photo albums, emails, personal health records, financialrecords, etc.) are encrypted before outsourcing to cloud, traditional keyword search techniques are useless.Meanwhile, existing search approaches over encrypted cloud data support only exact or fuzzy keyword search, butnot semantics-based multi-keyword ranked search. Therefore, how to enable an effective searchable system withsupport of ranked search remains a very challenging problem. This paper proposes an effective approach to solve theproblem of multi-keyword ranked search over encrypted cloud data supporting synonym queries. The maincontribution of this paper is summarized in two aspects: multi-keyword ranked search to achieve more accuratesearch results and synonym-based search to support synonym queries. Extensive experiments on real-world datasetwere performed to validate the approach, showing that the proposed solution is very effective and efficient formultikeyword ranked searching in a cloud environment.

http://kasanpro.com/ieee/final-year-project-center-theni-reviews

Title :A Mechanism Design Approach to Resource Procurement in Cloud ComputingLanguage : C#

Project Link : http://kasanpro.com/p/c-sharp/resource-procurement-cloud-computing-module

Abstract : We present a cloud resource procurement approach which not only automates the selection of anappropriate cloud vendor but also implements dynamic pricing. Three possible mechanisms are suggested for cloudresource procurement: cloud-dominant strategy incentive compatible (C-DSIC), cloud-Bayesian incentive compatible(C-BIC), and cloud optimal (C-OPT). C-DSIC is dominant strategy incentive compatible, based on the VCGmechanism, and is a low-bid Vickrey auction. C-BIC is Bayesian incentive compatible, which achieves budgetbalance. C-BIC does not satisfy individual rationality. In C-DSIC and C-BIC, the cloud vendor who charges the lowestcost per unit QoS is declared the winner. In C-OPT, the cloud vendor with the least virtual cost is declared the winner.C-OPT overcomes the limitations of both C-DSIC and C-BIC. C-OPT is not only Bayesian incentive compatible, butalso individually rational. Our experiments indicate that the resource procurement cost decreases with increase innumber of cloud vendors irrespective of the mechanisms. We also propose a procurement module for a cloud brokerwhich can implement C-DSIC, C-BIC, or C-OPT to perform resource procurement in a cloud computing context. Acloud broker with such a procurement module enables users to automate the choice of a cloud vendor among manywith diverse offerings, and is also an essential first step toward implementing dynamic pricing in the cloud.

Title :A Mechanism Design Approach to Resource Procurement in Cloud ComputingLanguage : NS2

Project Link : http://kasanpro.com/p/ns2/resource-procurement-cloud-computing

Abstract : We present a cloud resource procurement approach which not only automates the selection of anappropriate cloud vendor but also implements dynamic pricing. Three possible mechanisms are suggested for cloudresource procurement: cloud-dominant strategy incentive compatible (C-DSIC), cloud-Bayesian incentive compatible(C-BIC), and cloud optimal (C-OPT). C-DSIC is dominant strategy incentive compatible, based on the VCGmechanism, and is a low-bid Vickrey auction. C-BIC is Bayesian incentive compatible, which achieves budgetbalance. C-BIC does not satisfy individual rationality. In C-DSIC and C-BIC, the cloud vendor who charges the lowestcost per unit QoS is declared the winner. In C-OPT, the cloud vendor with the least virtual cost is declared the winner.C-OPT overcomes the limitations of both C-DSIC and C-BIC. C-OPT is not only Bayesian incentive compatible, butalso individually rational. Our experiments indicate that the resource procurement cost decreases with increase innumber of cloud vendors irrespective of the mechanisms. We also propose a procurement module for a cloud brokerwhich can implement C-DSIC, C-BIC, or C-OPT to perform resource procurement in a cloud computing context. Acloud broker with such a procurement module enables users to automate the choice of a cloud vendor among manywith diverse offerings, and is also an essential first step toward implementing dynamic pricing in the cloud.

Cloud Computing IEEE 2014 Projects

Title :A Novel Model for Competition and Cooperation Among Cloud ProvidersLanguage : C#

Project Link : http://kasanpro.com/p/c-sharp/competition-cooperation-among-cloud-providers

Abstract : Having received significant attention in the industry, the cloud market is nowadays fiercely competitive withmany cloud providers. On one hand, cloud providers compete against each other for both existing and new cloudusers. To keep existing users and attract newcomers, it is crucial for each provider to offer an optimal price policywhich maximizes the final revenue and improves the competitive advantage. The competition among providers leadsto the evolution of the market and dynamic resource prices over time. On the other hand, cloud providers maycooperate with each other to improve their final revenue. Based on a Service Level Agreement, a provider canoutsource its users' resource requests to its partner to reduce the operation cost and thereby improve the finalrevenue. This leads to the problem of determining the cooperating parties in a cooperative environment. This papertackles these two issues of the current cloud market. First, we solve the problem of competition among providers andpropose a dynamic price policy. We employ a discrete choice model to describe the user's choice behavior based onhis obtained benefit value. The choice model is used to derive the probability of a user choosing to be served by acertain provider. The competition among providers is formulated as a non-cooperative stochastic game where theplayers are providers who act by proposing the price policy simultaneously. The game is modelled as a MarkovDecision Process whose solution is a Markov Perfect Equilibrium. Then, we address the cooperation among providersby presenting a novel algorithm for determining a cooperation strategy that tells providers whether to satisfy users'resource requests locally or outsource them to a certain provider. The algorithm yields the optimal cooperationstructure from which no provider unilaterally deviates to gain more revenue. Numerical simulations are carried out toevaluate the performance of the proposed models.

Title :A Novel Model for Competition and Cooperation Among Cloud ProvidersLanguage : NS2

Project Link : http://kasanpro.com/p/ns2/competition-cooperation-model-among-cloud-providers

Abstract : Having received significant attention in the industry, the cloud market is nowadays fiercely competitive withmany cloud providers. On one hand, cloud providers compete against each other for both existing and new cloudusers. To keep existing users and attract newcomers, it is crucial for each provider to offer an optimal price policywhich maximizes the final revenue and improves the competitive advantage. The competition among providers leadsto the evolution of the market and dynamic resource prices over time. On the other hand, cloud providers maycooperate with each other to improve their final revenue. Based on a Service Level Agreement, a provider canoutsource its users' resource requests to its partner to reduce the operation cost and thereby improve the finalrevenue. This leads to the problem of determining the cooperating parties in a cooperative environment. This papertackles these two issues of the current cloud market. First, we solve the problem of competition among providers andpropose a dynamic price policy. We employ a discrete choice model to describe the user's choice behavior based onhis obtained benefit value. The choice model is used to derive the probability of a user choosing to be served by acertain provider. The competition among providers is formulated as a non-cooperative stochastic game where theplayers are providers who act by proposing the price policy simultaneously. The game is modelled as a MarkovDecision Process whose solution is a Markov Perfect Equilibrium. Then, we address the cooperation among providersby presenting a novel algorithm for determining a cooperation strategy that tells providers whether to satisfy users'resource requests locally or outsource them to a certain provider. The algorithm yields the optimal cooperationstructure from which no provider unilaterally deviates to gain more revenue. Numerical simulations are carried out to

evaluate the performance of the proposed models.

Title :Consistency as a Service: Auditing Cloud ConsistencyLanguage : C#

Project Link : http://kasanpro.com/p/c-sharp/consistency-service-auditing-cloud-consistency

Abstract : Cloud storage services have become commercially popular due to their overwhelming advantages. Toprovide ubiquitous always-on access, a cloud service provider (CSP) maintains multiple replicas for each piece ofdata on geographically distributed servers. A key problem of using the replication technique in clouds is that it is veryexpensive to achieve strong consistency on a worldwide scale. In this paper, we first present a novel consistency as aservice (CaaS) model, which consists of a large data cloud and multiple small audit clouds. In the CaaS model, a datacloud is maintained by a CSP, and a group of users that constitute an audit cloud can verify whether the data cloudprovides the promised level of consistency or not. We propose a two-level auditing architecture, which only requires aloosely synchronized clock in the audit cloud. Then, we design algorithms to quantify the severity of violations withtwo metrics: the commonality of violations, and the staleness of the value of a read. Finally, we devise a heuristicauditing strategy (HAS) to reveal as many violations as possible. Extensive experiments were performed using acombination of simulations and real cloud deployments to validate HAS.

Title :Consistency as a Service: Auditing Cloud ConsistencyLanguage : NS2

Project Link : http://kasanpro.com/p/ns2/consistency-as-a-service-auditing-cloud-consistency

Abstract : Cloud storage services have become commercially popular due to their overwhelming advantages. Toprovide ubiquitous always-on access, a cloud service provider (CSP) maintains multiple replicas for each piece ofdata on geographically distributed servers. A key problem of using the replication technique in clouds is that it is veryexpensive to achieve strong consistency on a worldwide scale. In this paper, we first present a novel consistency as aservice (CaaS) model, which consists of a large data cloud and multiple small audit clouds. In the CaaS model, a datacloud is maintained by a CSP, and a group of users that constitute an audit cloud can verify whether the data cloudprovides the promised level of consistency or not. We propose a two-level auditing architecture, which only requires aloosely synchronized clock in the audit cloud. Then, we design algorithms to quantify the severity of violations withtwo metrics: the commonality of violations, and the staleness of the value of a read. Finally, we devise a heuristicauditing strategy (HAS) to reveal as many violations as possible. Extensive experiments were performed using acombination of simulations and real cloud deployments to validate HAS.

Title :Panda: Public Auditing for Shared Data with Efficient User Revocation in the CloudLanguage : C#

Project Link : http://kasanpro.com/p/c-sharp/panda-public-auditing-shared-data-efficient-user-revocation-cloud

Abstract : With data storage and sharing services in the cloud, users can easily modify and share data as a group.To ensure shared data integrity can be verified publicly, users in the group need to compute signatures on all theblocks in shared data. Different blocks in shared data are generally signed by different users due to data modificationsperformed by different users. For security reasons, once a user is revoked from the group, the blocks which werepreviously signed by this revoked user must be re-signed by an existing user. The straightforward method, whichallows an existing user to download the corresponding part of shared data and re-sign it during user revocation, isinefficient due to the large size of shared data in the cloud. In this paper, we propose a novel public auditingmechanism for the integrity of shared data with efficient user revocation in mind. By utilizing the idea of proxyre-signatures, we allow the cloud to re-sign blocks on behalf of existing users during user revocation, so that existingusers do not need to download and re-sign blocks by themselves. In addition, a public verifier is always able to auditthe integrity of shared data without retrieving the entire data from the cloud, even if some part of shared data hasbeen re-signed by the cloud. Moreover, our mechanism is able to support batch auditing by verifying multiple auditingtasks simultaneously. Experimental results show that our mechanism can significantly improve the efficiency of userrevocation.

Cloud Computing IEEE 2014 Projects

Title :Panda: Public Auditing for Shared Data with Efficient User Revocation in the CloudLanguage : NS2

Project Link : http://kasanpro.com/p/ns2/panda-public-auditing-shared-data-efficient-user-revocation-cloud-code

Abstract : With data storage and sharing services in the cloud, users can easily modify and share data as a group.To ensure shared data integrity can be verified publicly, users in the group need to compute signatures on all theblocks in shared data. Different blocks in shared data are generally signed by different users due to data modificationsperformed by different users. For security reasons, once a user is revoked from the group, the blocks which werepreviously signed by this revoked user must be re-signed by an existing user. The straightforward method, whichallows an existing user to download the corresponding part of shared data and re-sign it during user revocation, isinefficient due to the large size of shared data in the cloud. In this paper, we propose a novel public auditingmechanism for the integrity of shared data with efficient user revocation in mind. By utilizing the idea of proxyre-signatures, we allow the cloud to re-sign blocks on behalf of existing users during user revocation, so that existingusers do not need to download and re-sign blocks by themselves. In addition, a public verifier is always able to auditthe integrity of shared data without retrieving the entire data from the cloud, even if some part of shared data hasbeen re-signed by the cloud. Moreover, our mechanism is able to support batch auditing by verifying multiple auditingtasks simultaneously. Experimental results show that our mechanism can significantly improve the efficiency of userrevocation.

http://kasanpro.com/ieee/final-year-project-center-theni-reviews

Title :Performance and cost evaluation of an adaptive encryption architecture for cloud databasesLanguage : C#

Project Link : http://kasanpro.com/p/c-sharp/performance-cost-evaluation-adaptive-encryption-architecture-cloud-databases

Abstract : The cloud database as a service is a novel paradigm that can support several Internet-based applications,but its adoption requires the solution of information confidentiality problems. We propose a novel architecture foradaptive encryption of public cloud databases that offers an interesting alternative to the trade-off between therequired data confidentiality level and the flexibility of the cloud database structures at design time. We demonstratethe feasibility and performance of the proposed solution through a software prototype. Moreover, we propose anoriginal cost model that is oriented to the evaluation of cloud database services in plain and encrypted instances andthat takes into account the variability of cloud prices and tenant workload during a medium-term period.

Title :Performance and cost evaluation of an adaptive encryption architecture for cloud databasesLanguage : NS2

Project Link : http://kasanpro.com/p/ns2/performance-cost-evaluation-adaptive-encryption-architecture-cloud-databases-code

Abstract : The cloud database as a service is a novel paradigm that can support several Internet-based applications,but its adoption requires the solution of information confidentiality problems. We propose a novel architecture foradaptive encryption of public cloud databases that offers an interesting alternative to the trade-off between therequired data confidentiality level and the flexibility of the cloud database structures at design time. We demonstratethe feasibility and performance of the proposed solution through a software prototype. Moreover, we propose anoriginal cost model that is oriented to the evaluation of cloud database services in plain and encrypted instances andthat takes into account the variability of cloud prices and tenant workload during a medium-term period.

Title :Comprehensive Explanation of SLA Violations at RuntimeLanguage : Java

Project Link : http://kasanpro.com/p/java/comprehensive-explanation-sla-violations-runtime

Abstract : Service Level Agreements (SLAs) establish the Quality of Service (QoS) agreed between service-basedsystems consumers and providers. Since the violation of such SLAs may involve penalties, quality assurancetechniques have been developed to supervise the SLAs fulfillment at runtime. However, existing proposals presentsome drawbacks: 1) the SLAs they support are not expressive enough to model real-world scenarios, 2) they couplethe monitoring configuration to a given SLA specification, 3) the explanations of the violations are difficult tounderstand and even potentially inaccurate, 4) some proposals either do not provide an architecture, or present lowcohesion within their elements. In this paper, we propose a comprehensive solution, from a conceptual referencemodel to its design and implementation, that overcomes these drawbacks. The resulting platform, SALMonADA,receives the SLA agreed between the parties as input and reports timely and comprehensive explanations of SLAviolations. SALMonADA performs an automated monitoring configuration and it analyses highly expressive SLAs bymeans of a constraint satisfaction problems based technique. We have evaluated the impact of SALMonADA over theresulting service consumption time performance. The results are satisfactory enough to consider SALMonADA forSLA supervision because of its low intrusiveness.