Less is more: Service Profit Maximization in Geo-Distributed Clouds
ABSTARCT :
Nowadays cloud providers purchase a good deal of bandwidth from Internet service providers to satisfy the growing requests from corporate customers for the exclusive use of inter-datacenter bandwidth. For exclusive bandwidth services, neither maximizing the revenue nor minimizing the cost can bring the maximal profit to cloud providers. The diversity of bandwidth prices and the random arrival time of user requests further increase the difficulty in economically scheduling the services to meet user requests from cloud providers. In this paper, we propose to help cloud providers maximize their service profits by properly selecting user requests to serve rather than satisfying them all. We formulate the problem of service profit maximization and prove its NP-hardness. To handle offline request submission, we propose a solution that maximizes the service profit by alternately maximizing the service revenue and minimizing the service cost. To maximize service profit under online request submission, we propose an online scheduling algorithm that carefully handles the risk of not being able to pay off the incremental service cost and makes scheduling decisions in real time. Our extensive evaluations demonstrate that our solutions can achieve more than 1.6x the service profits of existing solutions.
EXISTING SYSTEM :
The proliferation of cloud computing relied on the virtualization of the compute and storage resources and provisioning them dynamically according to users’ needs on a pay-per-use model. Massive cloud providers have geo-distributed cloud data centers to ensure service reliability, availability and satisfy user’s need. Therefore, cloud management systems are necessary to increase the profit of cloud providers and to improve the quality-of service demanded by users.
DISADVANTAGE :
? The problem of allocating data-intensive bagof-tasks BoT workloads is formulated as a nonlinear optimization problem taking into consideration the network’s delay times to minimize the make span of the workload, i.e., enhance the users QoS
? The extensive growth of cloud systems has led to the construction of geo-distributed Data Centers (DCs) worldwide with thousands of computing, networking and storage nodes. Consequently, this led to a drastic increase in the DCs energy consumption, that directly affect cloud providers profit and leads to serious environmental issues (high carbon emission) that affect cloud computing sustainability.
PROPOSED SYSTEM :
This paper focuses on an energy-efficient method to solve the problem of allocating data-intensive workloads in geographically distributed data centers. The workload’s tasks are characterized by large data transfer times than their execution times. The problem formulated as a nonlinear programming optimization problem. Then, to find an optimal solution to the problem, meta-heuristic genetic algorithm is proposed. The designed heuristic takes into account the cost of the data transfer time from the storage location to the computer servers as well as the workload make span on the available hosts. Extensive simulations using the Clouds simulator are conducted to evaluate the efficacy of the proposed allocation method and how it performs with respect to other methods in the literature. Our results show significant enhancements in energy consumption while respecting the user’s QoS.
ADVANTAGE :
The proposed method improved the net profit due to energy efficient using of computing resources.
The minimization of energy consumption and improving the QoS. However, they do not consider the problem of transmission delay and cost in selecting the most suitable computing resources for workload execution.
|