基于双向拍卖的适应性云计算资源分配机制.pdfVIP

33 Z1 Vol.33 No. Z1 2012 9 Journal on Communications September 2012 doi:10.3969/j.issn.1000-436x.2012.z1.017 100044 ADAM(adaptive double auction mechanism)ADAM ADAM ADAM ADAM ADAM TP393 A 1000-436X(2012)Z1-0132-09 Adaptive double auction mechanism for cloud resource allocation DING Ding, LUO Si-wei, AI Li-hua (School of Computer and Information Technology, Beijing Jiaotong University, Beijing 100044, China) Abstract: By integrating the auction mechanism in economic field into cloud, an adaptive double auction mecha- nism(ADAM) was proposed to allocate resources in cloud computing. Compared to traditional double auction mecha- nisms, ADAM traded cloud resource sellers and cloud resource buyers at their expected price and quantity, guaranteed the profits of all participants. Moreover, ADAM applied different auction rules in different cases to satisfy as more partici- pants as possible. As a new mechanism for cloud resource allocation, ADAM was proved to be strategy-proof, weakly budget-balanced and individual rational even under the conditions that the price and quantity of participants were private information. Simulation results also confirm that ADAM outperforms the traditional one on both cloud user satisfaction degree and cloud resource utilization rate and is also economically efficient, especially as more users are involved in the auction market. Key words: cloud computing; resource allocation; double auction; adaptive [1,2] 1