{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T20:37:27Z","timestamp":1778877447323,"version":"3.51.4"},"reference-count":20,"publisher":"MDPI AG","issue":"3","license":[{"start":{"date-parts":[[2017,9,6]],"date-time":"2017-09-06T00:00:00Z","timestamp":1504656000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Future Internet"],"abstract":"<jats:p>The expansion of telecommunication technologies touches almost all aspects life that we are living nowadays. Indeed, such technologies have emerged as a fourth essential utility alongside the traditional utilities of electricity, water, and gas. In this context, Cloud Data Center Networks (cloud-DCNs) have been proposed as a promising way to cope with such a high-tech era and with any expected trends in future computing networks. Resources of cloud-DCNs are leased to the interested users in the form of services, such services come in different models that vary between software, platform, and infrastructure. The leasing process of any service model starts with the users (i.e., service tenants). A tenant asks for the service resources, and the cloud-provider allocates the resources with a charge that follows a predefined cost policy. Cloud resources are limited, and those cloud providers have profit objectives to be satisfied. Thus, to comply with the aforementioned promise, the limited resources need to be carefully allocated. Existing allocation proposals in the literature dealt with this problem in varying ways. However, none proposes a win-win allocation model that satisfies both the providers and tenants. This work proposes A Rational Allocation Approach in Cloud Data Center Networks (ARAAC) that efficiently allocates the available cloud resources, in a way that allows for a win-win environment to satisfy both parties: the providers and tenants. To do so, ARAAC deploys the Second Best-Price (SBP) mechanism along with a behavioral-based reputation model. The reputation is built according to the tenants\u2019 utilization history throughout their previous service allocations. The reputation records along with the adoption of the SBP mechanism allows for a locally free-equilibrium approach that allocates the available cloud-DCN resources in an efficient and fair manner. In ARAAC, through an auction scenario, tenants with positive reputation records are awarded by having the required resources allocated at prices that are lower than what they have offered. Compared to other benchmark models, simulation results show that ARAAC can efficiently adapt the behavior of those rational service-tenants to provide for better use of the cloud resources, with an increase in the providers\u2019 profits.<\/jats:p>","DOI":"10.3390\/fi9030050","type":"journal-article","created":{"date-parts":[[2017,9,6]],"date-time":"2017-09-06T11:23:34Z","timestamp":1504697014000},"page":"50","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["ARAAC: A Rational Allocation Approach in Cloud Data Center Networks"],"prefix":"10.3390","volume":"9","author":[{"given":"Ahmad","family":"Quttoum","sequence":"first","affiliation":[{"name":"Department of Computer Engineering, Faculty of Engineering, The Hashemite University, Zarqa 13133, Jordan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ayoub","family":"Alsarhan","sequence":"additional","affiliation":[{"name":"Department of Computer Information System, Faculty of I.T., The Hashemite University, Zarqa 13133, Jordan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abidalrahman","family":"Moh\u2019d","sequence":"additional","affiliation":[{"name":"Faculty of Computer Science, Dalhousie University, Halifax, NS B3H 4R2, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2017,9,6]]},"reference":[{"key":"ref_1","unstructured":"Duan, Q. (2013, January 28\u201331). Modeling and Delay Analysis for Converged Network-Cloud Service Provisioning Systems. Proceedings of the IEEE International Conference on Computing, Networking, and Communications (ICNC\u201913), San Diego, CA, USA."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/j.dcan.2016.12.002","article-title":"Cloud Service Performance Evaluation: Status, Challenges, and Opportunities\u2014A Survey from the System Modeling Perspective","volume":"32","author":"Duan","year":"2017","journal-title":"J. Digit. Commun. Netw."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"954","DOI":"10.1109\/COMST.2017.2647981","article-title":"Resource Management in Cloud Networking Using Economic Analysis and Pricing Models: A Survey","volume":"19","author":"Luong","year":"2017","journal-title":"IEEE Commun. Surv. Tutor."},{"key":"ref_4","unstructured":"Wee, K.T., Dinil, M.D., and Mohan, G. (2014, January 10\u201314). Uniform Price Auction for Allocation of Dynamic Cloud Bandwidth. Proceedings of the 2014 IEEE International Conference on Communications (ICC), Sydney, NSW, Australia."},{"key":"ref_5","unstructured":"Hsu, C.H., Yang, L.T., Park, J.H., and Yeo, S.S. (2010). Strategy-Proof Dynamic Resource Pricing of Multiple Resource Types on Federated Clouds. Algorithms and Architectures for Parallel Processing (ICA3PP) 2010, Springer."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"927","DOI":"10.1016\/j.comnet.2011.11.013","article-title":"A distributed resource management model for Virtual Private Networks: Tit-for-Tat strategies","volume":"56","author":"Robert","year":"2012","journal-title":"J. Comput. Netw."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"1093","DOI":"10.1257\/00028280260344632","article-title":"Last-Minute Bidding and the Rules for Ending Second-Price Auctions: Evidence from eBay and Amazon Auctions on the Internet","volume":"92","author":"Alvin","year":"2002","journal-title":"Am. Econ. Rev."},{"key":"ref_8","unstructured":"Wee, K.T., Dinil, M.D., and Mohan, G. (2008, January 14\u201317). Near-Optimal Dynamic Spectrum Allocation in Cellular Networks. Proceedings of the 3rd IEEE Symposium on New Frontiers in Dynamic Spectrum Access Networks, DySPAN 2008, Chicago, IL, USA."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"9055","DOI":"10.3390\/s120709055","article-title":"Game Theory for Wireless Sensor Networks: A Survey","volume":"12","year":"2012","journal-title":"J. Sens."},{"key":"ref_10","unstructured":"Roger, B.M. (1991). Game Theory: Analysis of Conflict, Harvard University Press."},{"key":"ref_11","unstructured":"Robert, M.A. (2006). The Evolution of Cooperation: Revised Edition, Basic Books."},{"key":"ref_12","unstructured":"Yang, G., Zhenzhe, Z., Fan, W., Xiaofeng, G., and Guihai, C. (2014, January 19\u201321). SOAR: Strategy-proof auction mechanisms for distributed cloud bandwidth reservation. Proceedings of the 2014 IEEE International Conference on Communication Systems (ICCS), Macau, China."},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Quttoum, A.N., Otrok, H., and Dzion, Z. (2010, January 12\u201315). ARMM: An Autonomic Resource Management Model for Virtual Private Networks. Proceedings of the 2010 IEEE International Conference on Consumer Communications and Networking Conference (CCNC), Las Vegas, NV, USA.","DOI":"10.1109\/CCNC.2010.5421818"},{"key":"ref_14","unstructured":"SHI, W., Wu, C., and Li, Z. (2015). A Shapley-value Mechanism for Bandwidth On Demand between Datacenters. IEEE Trans. Cloud Comput."},{"key":"ref_15","first-page":"551","article-title":"Uncertain Shapley value of coalitional game with application to supply chain alliance","volume":"56","author":"Jinwu","year":"2017","journal-title":"J. Sens."},{"key":"ref_16","unstructured":"Ilan, K., and Kjell, G.N. (2003). Underpricing and Market Power in Uniform Price Auctions, Oxford Academic."},{"key":"ref_17","unstructured":"Kabir, M.E., Mahmood, A.N., Mustafa, A.K., and Wang, H. (2015). Micoraggregation Sorting Framework for K-Anonymity Statistical Disclosure Control in Cloud Computing. IEEE Trans. Cloud Comput."},{"key":"ref_18","unstructured":"Wang, H., Yi, H., Bertino, E., and Sun, L. (2014). Protecting Outsourced Data in Cloud Computing Through Access Management. Concurr. Comput. Pract. Exp., 137\u2013153."},{"key":"ref_19","unstructured":"Jian, G., Fangming, L., Dan, Z., John, C.S.L., and Hai, J. (2013, January 14\u201319). A cooperative game based allocation for sharing data center networks. Proceedings of the IEEE 2013 INFOCOM Conference, Turin, Italy."},{"key":"ref_20","unstructured":"Jian, G., Fangming, L., Haowen, T., Yingnan, L., Hai, J., John, C., and Lui, S. (2013, January 7\u201310). Falloc: Fair network bandwidth allocation in IaaS datacenters via a bargaining game approach. Proceedings of the 21st Internation IEEE Conference on Network Protocols (ICNP), Goettingen, Germany."}],"container-title":["Future Internet"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-5903\/9\/3\/50\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T18:44:17Z","timestamp":1760208257000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-5903\/9\/3\/50"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,9,6]]},"references-count":20,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2017,9]]}},"alternative-id":["fi9030050"],"URL":"https:\/\/doi.org\/10.3390\/fi9030050","relation":{},"ISSN":["1999-5903"],"issn-type":[{"value":"1999-5903","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,9,6]]}}}