This research paper proposes a cluster-based framework for Infrastructure-as-a-Service (IAAS) which enables customers effectively hosted intensified performance computing applications and cloud service providers (CSP’s) to use their resources beneficially. The solution incorporates the cluster-based framework which handles the geographical data centers grouped logically in clusters. This cluster-based framework overcomes the challenges of traditional centralized provisioning approaches. A. Efficient on-demand IaaS provisioning. B. Auto-scaling of increasing number of IaaS requests. C. Effectively use of Geographical Data center computing resources. D. Maintain Quality of Service parameter requirements for different IaaS requests. Incorporate Vickrey-Clarke-Groves (VCG) mechanism to solve exaggeration and collusion issues. The solution generated extended to host cloud applications based on mobile and how effectively it will work in a changeable environment. To pace the performance of the distributed IaaS framework vs (RCG-IaaS) regional IaaS provisioning model based on an efficient decomposition technique, Column generation as a large scale optimization tool, I use the additional performance metrics as follows: Basic Performance metric: Speedup (Su): Speed gain of using more processing nodes over a single node, Efficiency (E): Percentage of maximum performance (speedup or utilization) achievable (%), Elasticity (El): Dynamic interval of auto-scaling resources with workload variation & Cloud Productivity: QoS of Cloud (QoS): The satisfaction rate of a cloud service or benchmark testing (%), Service Cost (Cost): The price per cloud service (Compute, Storage etc.) provided ($/hour), Availability (A): Percentage of time the system is up to deliver useful work (%).

Cloud Computing, VCG mechanism, IaaS, Data Centers, Cluster, Auction, Distributed, Geo (Geographically)

[1] J. Shamsi, M. A. Khojaye, and M. A. Qasmi, “Data-intensive cloud computing: Requirements, expectations, challenges, and solutions,” J. Grid Comput., vol. 11, no. 2, pp. 281–310, Jun. 2013.
[2] C. Vecchiola, S. Pandey, and R. Buyya, “High-performance cloud computing: A view of scientific applications,” in 2009 10th International Symposium on Pervasive Systems, Algorithms, and Networks (ISPAN), Dec 2009, pp. 4–16.
[3] R. Tudoran, A. Costan, R. Wang, L. Bouge, and G. Antoniu, “Bridging data in the clouds: An environment-aware system for
geographically distributed data transfers,” in 2014 14th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGrid), May 2014, pp. 92–101.
[4] D. Ardagna, S. Casolari, and B. Panicucci, “Flexible distributed capacity allocation and load redirect algorithms for cloud systems,” in Cloud Computing (CLOUD), 2011 IEEE International Conference on, July 2011, pp. 163–170.
[5] C. Papagianni, A. Leivadeas, S. Papavassiliou, V. Maglaris, C. Cervello-Pastor, and A. Monje, “On the optimal allocation of virtual resources in cloud computing networks,” IEEE Transactions on Computers, vol. 62, no. 6, pp. 1060–1071, June 2013.
[6] F. Wuhib, R. Stadler, and H. Lindgren, “Dynamic resource allocation with management objectives: Implementation for an openstack cloud,” in Proceedings of the 8th International Conference on Network and Service Management, ser. CNSM ’12. Laxenburg, Austria, Austria: International Federation for Information Processing, 2013, pp. 309–315.
[7] A. Ahmed, Z. M. Faten, L. Rami, B. Raouf, and P. Guy, “Greenhead: Virtual data center embedding across distributed infrastructures,” IEEE Transactions on Cloud Computing, vol. 1, no. 1, January-June 2013.
[8] S. Zhang, Z. Qian, J. Wu, and S. Lu, “SEA: Stable resource allocation in geographically distributed clouds,” in Communications (ICC), 2014 IEEE International Conference on, June 2014, pp. 2932–2937.
[9] I. Houidi, W. Louati, and D. Zeghlache, “A distributed virtual network mapping algorithm,” in Communications, 2008. ICC ’08. IEEE International Conference on, May 2008, pp. 5634–5640.
[10] F. Samuel, M. Chowdhury, and R. Boutaba, “Polyvine: policybased virtual network embedding across multiple domains,” Journal of Internet Services and Applications, vol. 4, no. 1, 2013.
[11] B. Kantarci and H. Mouftah, “Inter-data center network dimensioning under time-of-use pricing,” IEEE Transactions on Cloud Computing, vol. 4, pp. 402–414, 2017.
[12] Q. Zhang, Q. Zhu, M. Zhani, and R. Boutaba, “Dynamic service placement in geographically distributed clouds,” in 2012 IEEE 32nd International Conference on Distributed Computing Systems
(ICDCS), June 2012, pp. 526–535.
[13] M. Alicherry and T. Lakshman, “Network aware resource allocation in distributed clouds,” in INFOCOM, 2012 Proceedings IEEE, March 2012, pp. 963–971.
[14] I. Houidi, W. Louati, W. B. Ameur, and D. Zeghlache, “Virtual network provisioning across multiple substrate networks,” Computer Networks, vol. 55, no. 4, pp. 1011 – 1023, 2011, special Issue on Architectures and Protocols for the Future Internet.
[15] Khaled Metwally, Abdallah Jarray, and Ahmed Karmouch, “A Distributed Auction-based Framework for Scalable IaaS Provisioning in Geo-Data Centers” IEEE transactions on cloud computing, Oct 2018, pp. 1-14
[16] J.W. Charles Reiss, “Google cluster-usage traces: format+schema,”Tech. Rep., 2011.
[17] M. Al-Fares, A. Loukissas, and A. Vahdat, “A scalable, commodity data center network architecture,” in Proceedings of the ACM SIGCOMM 2008 Conference on Data Communication, ser. SIGCOMM ’08. ACM, 2008, pp. 63–74.
[18] Optimal shill bidding in the VCG mechanism, Itai Sher University of Minnesota, September 3, 2010.
[19] Jackson, M. O. (2000). Mechanism theory. In the Encyclopedia of Life Support Systems. EOLSS Publishers. Jackson, 2000
[20] Krishna, V. (2002). Sealed-bid (Vickrey) auction, Auction Theory. Academic Press.
[21] The Vickrey-Clarke-Groves Mechanism work is licensed under the Creative Commons Attribution-NonCommercial-ShareAlike 3.0 License, Jeffrey Ely, July 8, 2009
[22] Vickrey-Clarke-Groves Mechanisms, Economics 285, Market Design, Jonathan Levin, Paul Milgrom’s Winter 2009.