TY - GEN
T1 - Online combinatorial double auction for mobile cloud computing markets
AU - Xu, Ke
AU - Zhang, Yuchao
AU - Shi, Xuelin
AU - Wang, Haiyang
AU - Wang, Yong
AU - Shen, Meng
N1 - Publisher Copyright:
© 2014 IEEE.
PY - 2015/1/20
Y1 - 2015/1/20
N2 - The emergence of cloud computing as an efficient means of providing computing as a form of utility can already be felt with the burgeoning of cloud service companies. Notable examples including Amazon EC2, Rackspace, Google App and Microsoft Azure have already attracted an increasing number of users over the Internet. However, due to the dynamic behaviors of some users, the traditional cloud pricing models cannot well support such popular applications as Mobile Cloud Computing (MCC). To mitigate this problem, we take our first steps towards the design of an efficient double-sided combinatorial auction model in the context of mobile cloud computing. In particular, we carefully develop the framework of online combinatorial double auctions and apply a Winner Determination Problem (WDP) model for the proposed auction mechanism. The experiment results indicate that the allocation efficiency of our proposed online auction mechanism is comparable to the social optimal solution.
AB - The emergence of cloud computing as an efficient means of providing computing as a form of utility can already be felt with the burgeoning of cloud service companies. Notable examples including Amazon EC2, Rackspace, Google App and Microsoft Azure have already attracted an increasing number of users over the Internet. However, due to the dynamic behaviors of some users, the traditional cloud pricing models cannot well support such popular applications as Mobile Cloud Computing (MCC). To mitigate this problem, we take our first steps towards the design of an efficient double-sided combinatorial auction model in the context of mobile cloud computing. In particular, we carefully develop the framework of online combinatorial double auctions and apply a Winner Determination Problem (WDP) model for the proposed auction mechanism. The experiment results indicate that the allocation efficiency of our proposed online auction mechanism is comparable to the social optimal solution.
UR - http://www.scopus.com/inward/record.url?scp=84983174936&partnerID=8YFLogxK
U2 - 10.1109/PCCC.2014.7017103
DO - 10.1109/PCCC.2014.7017103
M3 - Conference contribution
AN - SCOPUS:84983174936
T3 - 2014 IEEE 33rd International Performance Computing and Communications Conference, IPCCC 2014
BT - 2014 IEEE 33rd International Performance Computing and Communications Conference, IPCCC 2014
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 33rd IEEE International Performance Computing and Communications Conference, IPCCC 2014
Y2 - 5 December 2014 through 7 December 2014
ER -
