A Multi-criteria Based Double Auctioning Mechanism with Undesignated Resources Constraints in Cloud

Abstract

Now a day’s double auctioning mechanism considered to be effective mechanism which is based on the fundamental of many to many negotiations. In this mechanism the seller and buyer both provides their ask and needs respectively and the Auctioning mechanism are used to match this for effective allotment. If there is no any constraint available with the algorithm than it works fine but when some criteria like budget from seller or buyer, execution time, location, Past history, Feedback Etc. are involved than this allotment become very difficult. Besides this some issue may arise when even the auctioning algorithm failed to allocated all the available resources due to unhandled criteria. This is called undesignated resources constraint issue. So here we not only aim to design a multi-criteria based effective Double auctioning mechanism which efficiently increases the allotment but also consider to handle the issue of unallocated resources.