Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  consider several reliability problems that arise when allocating applications to processing resources in a Cloud computing platform. More specifically,  assume on the one hand that each computing resource is associated to a capacity constraint and to a probability of failure. On the other hand,  assume that each service runs as a set of independent instances of identical Virtual Machines, and that the Service Level Agreement beten the Cloud provider and the client states that a minimal number of instances of the service should run with a given probability. In this context, given the capacity and failure probabilities of the machines, and the capacity and reliability demands of the services, the question for the cloud provider is to find an allocation of the instances of the services (possibly using replication) onto machines satisfying all types of constraints during a given time period. , our goal is to assess the impact of the reliability constraint on the complexity of resource allocation problems.  consider several variants of this problem, depending on the number of services and whether their reliability demand is individual or global.  prove several fundamental complexity results (#P' and NP-completeness results) and  provide several optimal and approximation algorithms. In particular,  prove that a basic randomized allocation algorithm, that is easy to implement, provides optimal or quasi-optimal results in several contexts, and  show through simulations that it also achieves very good results in more general settings.
['Olivier Beaumont', 'Lionel Eyraud-Dubois', 'Hubert Larchevêque']
I am writing a research paper on a idea Reliable Service Allocation in Clouds
[{"from": "human", "value": "I am writing a research paper on a idea Reliable Service Allocation in Clouds"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  consider several reliability problems that arise when allocating applications to processing resources in a Cloud computing platform. More specifically,  assume on the one hand that each computing resource is associated to a capacity constraint and to a probability of failure. On the other hand,  assume that each service runs as a set of independent instances of identical Virtual Machines, and that the Service Level Agreement beten the Cloud provider and the client states that a minimal number of instances of the service should run with a given probability. In this context, given the capacity and failure probabilities of the machines, and the capacity and reliability demands of the services, the question for the cloud provider is to find an allocation of the instances of the services (possibly using replication) onto machines satisfying all types of constraints during a given time period. , our goal is to assess the impact of the reliability constraint on the complexity of resource allocation problems.  consider several variants of this problem, depending on the number of services and whether their reliability demand is individual or global.  prove several fundamental complexity results (#P' and NP-completeness results) and  provide several optimal and approximation algorithms. In particular,  prove that a basic randomized allocation algorithm, that is easy to implement, provides optimal or quasi-optimal results in several contexts, and  show through simulations that it also achieves very good results in more general settings."}]