IDEAS home Printed from https://ideas.repec.org/a/apb/jaterr/2016p12-17.html
   My bibliography  Save this article

A new method of winner determination for economic resource allocation in cloud computing systems

Author

Listed:
  • Ebrahim Behrouzian Nejad

    (Department of Computer, Andimeshk Branch, Islamic Azad University, Andimeshk, Iran)

  • Rezvan Ali poorsabzevari

    (Department of Computer, Khouzestan Science and Research Branch, Islamic Azad University, Ahvaz, Iran)

Abstract

Cloud computing systems are large-scale distributed systems, so that they focus more on large scale resource sharing, cooperation of several organizations and their use in new applications. One of the main challenges in this realm is resource allocation. There are many different ways of resource allocation in cloud computing. One of the common methods of resource allocation are economic methods. Among these methods, the auctionbased method has greater prominence compared with Fixed-Price method. The double combinatorial auction is one of the proper ways of resource allocation in cloud computing. This method includes two phases: winner determination and resource allocation. In this paper a new method has been presented to determine winner in double combinatorial auction-based resource allocation using Imperialist Competitive Algorithm (ICA). The experimental results show that in our new proposed method, the number of winner users is higher than genetic algorithm. On the other hand, in proposed algori hm, the number of winner providers is higher in genetic algorithm.

Suggested Citation

  • Ebrahim Behrouzian Nejad & Rezvan Ali poorsabzevari, 2016. "A new method of winner determination for economic resource allocation in cloud computing systems," Journal of Advances in Technology and Engineering Research, A/Professor Akbar A. Khatibi, vol. 2(1), pages 12-17.
    • Handle: RePEc:apb:jaterr:2016:p:12-17
    DOI: 10.20474/jater-2.1.3
    as

    Download full text from publisher

    File URL: https://tafpublications.com/platform/Articles/full-jater2.1.3.php
    Download Restriction: no
    File URL: https://tafpublications.com/gip_content/paper/jater-2.1.3.pdf
    Download Restriction: no
    File URL: https://libkey.io/10.20474/jater-2.1.3?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Xia, Mu & Stallaert, Jan & Whinston, Andrew B., 2005. "Solving the combinatorial double auction problem," European Journal of Operational Research, Elsevier, vol. 164(1), pages 239-251, July.
    2. Schnizler, Bjorn & Neumann, Dirk & Veit, Daniel & Weinhardt, Christof, 2008. "Trading grid services - a multi-attribute combinatorial approach," European Journal of Operational Research, Elsevier, vol. 187(3), pages 943-961, June.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Mary Ann B. Taduyo & Augusto K. Fabella, 2017. "Utilizing Regression Algorithms for ATS Route Forecasts," Journal of ICT, Design, Engineering and Technological Science, Juhriyansyah Dalle, vol. 1(1), pages 13-24.
    2. Jono M Munandar & Dadang Firmansyah, 2018. "The role of digital marketing in improving SME’s prod- uct competitiveness in The ASEAN Economic Community (AEC) (Case study in Indonesia)," Journal of Administrative and Business Studies, Professor Dr. Usman Raja, vol. 4(4), pages 206-218.
    3. Andrei Vasilateanu & Razvan Ene, 2018. "Call-Center Virtual Assistant Using Natural Language Processing and Speech Recognition," Journal of ICT, Design, Engineering and Technological Science, Juhriyansyah Dalle, vol. 2(2), pages 40-46.
    4. Briliantie Irma & Imam Baihaqi, 2018. "The integration of AHP and QFD for contractors selection," Journal of Advances in Technology and Engineering Research, A/Professor Akbar A. Khatibi, vol. 4(3), pages 118-129.
    5. Julian R. Eichhoff & Felix W. Baumann & Dieter Roller, 2017. "In search of missing design rules: Using rule induction to extend existing rule bases," Journal of Advances in Technology and Engineering Research, A/Professor Akbar A. Khatibi, vol. 3(4), pages 150-169.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Schellhorn, Henry, 2011. "A trading mechanism contingent on several indices," European Journal of Operational Research, Elsevier, vol. 213(3), pages 551-558, September.
    2. Zhiling Guo & Gary J. Koehler & Andrew B. Whinston, 2012. "A Computational Analysis of Bundle Trading Markets Design for Distributed Resource Allocation," Information Systems Research, INFORMS, vol. 23(3-part-1), pages 823-843, September.
    3. Jinpeng Ma & Qiongling Li, 2016. "Convergence of price processes under two dynamic double auctions," The Journal of Mechanism and Institution Design, Society for the Promotion of Mechanism and Institution Design, University of York, vol. 1(1), pages 1-44, December.
    4. Csercsik, Dávid, 2022. "Convex combinatorial auction of pipeline network capacities," Energy Economics, Elsevier, vol. 111(C).
    5. Zhang, Meng & Kong, Zhaojun, 2023. "A two-phase combinatorial double auction and negotiation mechanism for socialized joint reserve mode in emergency preparedness," Socio-Economic Planning Sciences, Elsevier, vol. 87(PA).
    6. Holmberg, Pär & Tangerås, Thomas & Ahlqvist, Victor, 2018. "Central- versus Self-Dispatch in Electricity Markets," Working Paper Series 1257, Research Institute of Industrial Economics, revised 27 Mar 2019.
    7. Gediminas Adomavicius & Alok Gupta & Mochen Yang, 2022. "Bidder Support in Multi-item Multi-unit Continuous Combinatorial Auctions: A Unifying Theoretical Framework," Information Systems Research, INFORMS, vol. 33(4), pages 1174-1195, December.
    8. Avenali, Alessandro, 2009. "Exploring the VCG mechanism in combinatorial auctions: The threshold revenue and the threshold-price rule," European Journal of Operational Research, Elsevier, vol. 199(1), pages 262-275, November.
    9. Meeus, Leonardo & Verhaegen, Karolien & Belmans, Ronnie, 2009. "Block order restrictions in combinatorial electric energy auctions," European Journal of Operational Research, Elsevier, vol. 196(3), pages 1202-1206, August.
    10. Drexl, Andreas & Jørnsten, Kurt & Knof, Diether, 2009. "Non-linear anonymous pricing combinatorial auctions," European Journal of Operational Research, Elsevier, vol. 199(1), pages 296-302, November.
    11. Marcel Risch & Ivona Brandic & Jorn Altmann, 2009. "Using SLA Mapping to Increase Market Liquidity," TEMEP Discussion Papers 200937, Seoul National University; Technology Management, Economics, and Policy Program (TEMEP), revised Oct 2009.
    12. Alessandro Avenali & Giorgio Matteucci & Fabio Nonino, 2010. "Outsourcing of Facility Management Activities and Procurement Design," DIS Technical Reports 2010-13, Department of Computer, Control and Management Engineering, Universita' degli Studi di Roma "La Sapienza".
    13. Kumar, Subodha & Dutta, Kaushik & Mookerjee, Vijay, 2009. "Maximizing business value by optimal assignment of jobs to resources in grid computing," European Journal of Operational Research, Elsevier, vol. 194(3), pages 856-872, May.
    14. Pellegrini, Paola & Castelli, Lorenzo & Pesenti, Raffaele, 2012. "Secondary trading of airport slots as a combinatorial exchange," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 48(5), pages 1009-1022.
    15. Stößer, Jochen & Neumann, Dirk & Weinhardt, Christof, 2010. "Market-based pricing in grids: On strategic manipulation and computational cost," European Journal of Operational Research, Elsevier, vol. 203(2), pages 464-475, June.
    16. Widmer, Tobias & Leukel, Joerg, 2016. "Efficiency of electronic service allocation with privately known quality," European Journal of Operational Research, Elsevier, vol. 255(3), pages 856-868.
    17. Petr Fiala, 2016. "Supply chain coordination with auctions," Journal of Business Economics, Springer, vol. 86(1), pages 155-171, January.
    18. Ivan Breskovic & Jorn Altmann & Ivona Brandic, 2012. "Creating Standardized Products for Electronic Markets," TEMEP Discussion Papers 201296, Seoul National University; Technology Management, Economics, and Policy Program (TEMEP), revised Sep 2012.
    19. Choi, Jin Ho & Chang, Yong Sik & Han, Ingoo, 2009. "The empirical analysis of the N-bilateral optimized combinatorial auction model," Omega, Elsevier, vol. 37(2), pages 482-493, April.
    20. Gediminas Adomavicius & Alok Gupta, 2005. "Toward Comprehensive Real-Time Bidder Support in Iterative Combinatorial Auctions," Information Systems Research, INFORMS, vol. 16(2), pages 169-185, June.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:apb:jaterr:2016:p:12-17. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: A/Professor Akbar A. Khatibi (email available below). General contact details of provider: https://tafpublications.com/platform/published_papers/10 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.