• KSII Transactions on Internet and Information Systems
    Monthly Online Journal (eISSN: 1976-7277)

A Secure and Efficient Cloud Resource Allocation Scheme with Trust Evaluation Mechanism Based on Combinatorial Double Auction

Vol. 11, No.9, September 30, 2017
10.3837/tiis.2017.09.002, Download Paper (Free):

Abstract

Cloud computing is a new service to provide dynamic, scalable virtual resource services via the Internet. Cloud market is available to multiple cloud computing resource providers and users communicate with each other and participate in market transactions. However, since cloud computing is facing with more and more security issues, how to complete the allocation process effectively and securely become a problem urgently to be solved. In this paper, we firstly analyze the cloud resource allocation problem and propose a mathematic model based on combinatorial double auction. Secondly, we introduce a trust evaluation mechanism into our model and combine genetic algorithm with simulated annealing algorithm to increase the efficiency and security of cloud service. Finally, by doing the overall simulation, we prove that our model is highly effective in the allocation of cloud resources.


Statistics

Show / Hide Statistics

Statistics (Cumulative Counts from December 1st, 2015)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article

[IEEE Style]
Yunhao Xia, Hanshu Hong, Guofeng Lin and Zhixin Sun, "A Secure and Efficient Cloud Resource Allocation Scheme with Trust Evaluation Mechanism Based on Combinatorial Double Auction," KSII Transactions on Internet and Information Systems, vol. 11, no. 9, pp. 4197-4219, 2017. DOI: 10.3837/tiis.2017.09.002

[ACM Style]
Xia, Y., Hong, H., Lin, G., and Sun, Z. 2017. A Secure and Efficient Cloud Resource Allocation Scheme with Trust Evaluation Mechanism Based on Combinatorial Double Auction. KSII Transactions on Internet and Information Systems, 11, 9, (2017), 4197-4219. DOI: 10.3837/tiis.2017.09.002