Abstract:
The cloud providers provide computing, storage and network resources in an on-demand manner and pay as per usage mode. Nevertheless, the cloud consumers are facing issue ...Show MoreMetadata
Abstract:
The cloud providers provide computing, storage and network resources in an on-demand manner and pay as per usage mode. Nevertheless, the cloud consumers are facing issue to find out the suitable cloud resources that will meet their application requirements. Hence, the proposed research work introduces the cloud brokering concept that acts as the mediator between the user and the cloud provider to perform the mapping between the user application requirements with the available cloud resources. In addition to that, in this research paper, we introduced Software-Defined Networking (SDN) based networking to manage and configure the networks in a dynamic manner. However, the conventional cloud brokering concepts selects the resources from a single cloud provider; in some circumstances, it fails to satisfy the user requests in a single cloud provider. Henceforth, the cloud broker selects the cloud resources across the multiple cloud resources known as federated clouds. In these scenarios, the placement of virtual machines is the most challenging and complex issue, hence, in this research work, a Multiple Knapsack Problem (MKP) has been designed to solve the complex virtual machine placement problem in the SDN-aware federated clouds. It is simulated and tested based on the real-world application traces and the various performance metrics such as execution time, execution cost, and user satisfaction values are measured.
Date of Conference: 21-23 May 2015
Date Added to IEEE Xplore: 08 October 2015
ISBN Information: