Bidirectional bidding for efficient allocation of multiple resources in clouds

Designing an efficient double sided auction based allocation mechanism for dynamic Virtual Machine (VM) provisioning and allocation is a big challenge. Double sided allocation mechanisms have been widely used to allocate multiple resources to a single user without considering the scarcity of the resources. An integrated approach has been introduced to allocate resources from multiple providers considering the scarcity of resources. Bidirectional Bidding Allocation (BBA) mechanism is proposed to solve the allocation problem of multiple resources (CPU, memory and storage) to users in the multiple provider cloud platform. BBA mechanism solves this problem as Integer programming by introducing critical value allocation mechanism. This mechanism allows the users to obtain the resources as bundle who provide true bid values without any incentives and thus bidirectional bidding mechanism is monotone. The result analysis shows that the allocation mechanism runs in a linear time and provides efficient allocation of resources.