Iterative Combinatorial Auction for Two-Sided Grid Markets: Multiple users and Multiple Providers

Aminul Haque

Iterative Combinatorial Auction for Two-Sided Grid Markets: Multiple users and Multiple Providers

Aminul Haque * §

Contact

§ Daffodil International University

Iterative Combinatorial Auction for Two-Sided Grid Markets: Multiple users and Multiple Providers

Article Fingerprint

ReserarchID

CSTR78FH

Iterative Combinatorial Auction for Two-Sided Grid Markets: Multiple users and Multiple Providers Banner

Key Research Insights

Synthesized scholarly intelligence & interactive research assistant

This converted HTML version may contain rendering inconsistencies. Please refer to the PDF for the authoritative version, or click here to provide feedback.

Abstract

Heterogeneity and different ownerships of grid computing resources impose complexity in evaluating the market value of these resources. Auction protocols are proposed to meet this challenge efficiently. Auction models are also suitable for achieving better payoff and resource allocation for grid providers. Grid users and providers are usually geographically distributed. The number of users in grid computing could also be very high. Hence, models provide seamless support to multiple users and providers would be useful to promote grid computing. In this paper, we implement a novel First Price Open Cry auction (ascending-bid auction) that supports for multiple users and providers simultaneously. We explain about (i) bundle generation (resource packages by providers), (ii) creating corresponding agents to bundles, (iii) allowing users to choose their suitable bundles, and (iv) clearing bundles through solving winner determination problem. The simulation results predict when and how to map providers’ private values on resource bundles, such that maximum revenue and better utilization of idle resources.

References

12 Cites in Article

Reference Format

1. D Roure,M Baker,N Jennings (2003). The Evolution of the Grid, in Grid computing: making the global infrastructure a reality. The Evolution of the Grid, in Grid computing: making the global infrastructure a reality, 65-100.
2. R Buyya (2002). Economic-based distributed resource management and scheduling for Grid computing. Economic-based distributed resource management and scheduling for Grid computing
3. C David,H Lyle (2000). Iterative combinatorial auctions: theory and practice. DOI={HYPERLINK
4. X Liu,L Zhao (2009). A Method Based on Iterative Combinatorial Auction Mechanism for Resource Allocation in Grid Multi-agent Systems. International Conference on Intelligent Human-Machine Systems and Cybernetics
5. S Middleton,M Surridge,S Benkner,G Engelbrecht,A Attanasio,G Ghiani,L Grandinetti,F Guerriero (2006). Auction algorithms for decentralized parallel machine scheduling. Parallel Computing, 32(9), 701-709.
6. D Anubhav,D Grosu (2005). Combinatorial auction-based protocols for resource allocation in grids. 19th IEEE International Symposium on Parallel and Distributed Processing
7. A Alvin (2004). Resource Allocation in Federated Distributed Computing Infrastructures. Proceedings of the 1st Workshop on Operating System and Architectural Support for the Ondemand IT Infrastructure
8. G Peter (2005). Grid Scheduling and Resource Management. Proceedings of the 1st International Workshop on Smart Grid Technologies, 241-300.
9. Y Sallez,T Berger,C Tahon (2004). Simulating intelligent routing in flexible manufacturing systems using NetLogo. IEEE International Conference on Industrial Technology
10. R.-C Damaceanu (2008). An agent-based computational study of wealth distribution in function of resource growth interval using NetLogo. Applied Mathematics and Computation, 201(1-2), 371-377.
11. J Michael,T Nicholson,Jerry,R (2006). Experiences creating three implementations of the repast agent modeling toolkit. ACM Trans. Model. Comput. Simul, 16, 1-25.
12. F Bellifemine,I Constantinescu,S Willmott (2000). A Uniform Resource Name (URN) Namespace for Foundation for Intelligent Physical Agents (FIPA). FIPA English Auction Interaction Protocol Specification. Foundation for Intelligent Physical Agents

Download References

Funding

No external funding was declared for this work.

Conflict of Interest

The authors declare no conflict of interest.

Ethical Approval

No ethics committee approval was required for this article type.

Data Availability

Not applicable for this article.

How to Cite This Article

Aminul Haque. 2018. "Iterative Combinatorial Auction for Two-Sided Grid Markets: Multiple users and Multiple Providers". Global Journal of Computer Science and Technology - B: Cloud & Distributed GJCST-B Volume 18 (GJCST Volume 18 Issue B1).

More Citation Formats

Select Citation Style:

Download Citation

GJCST Volume 18 Issue B1

Explore Journals Explore Volume Read This Issue

Journal Specifications

Crossref Journal DOI 10.17406/gjcst

Print ISSN 0975-4350

e-ISSN 0975-4172

Keywords

Not Found

Classification

GJCST-B Classification G.0

Submission ReceivedDecember 15, 2017
Peer Review Double Blind
Handling Editor
Accepted January 3, 2018
Published January 15, 2018

Version of record

v1.2

Issue date

June 8, 2018

Language

English

Order Article Reprint

Experiance in AR

Explore published articles in an immersive Augmented Reality environment. Our platform converts research papers into interactive 3D books, allowing readers to view and interact with content using AR and VR compatible devices.

View in VR

Read in 3D

Your published article is automatically converted into a realistic 3D book. Flip through pages and read research papers in a more engaging and interactive format.

View in 3D

Article Matrices

Total Score: 141

Country: Bangladesh

Subject: Global Journal of Computer Science and Technology

Authors: Aminul Haque (PhD/Dr. count: 0)

View Count (all-time): 570

Total Views (Real + Logic): 1558

Total Downloads (simulated): 105

Publish Date: 2018 01, Mon

Monthly Totals (Real + Logic):

Month 1: 38 views
Month 2: 23 views
Month 3: 43 views
Month 4: 48 views
Month 5: 64 views
Month 6: 16 views
Month 7: 25 views
Month 8: 40 views
Month 9: 23 views
Month 10: 31 views
Month 11: 44 views
Month 12: 27 views
Month 13: 27 views
Month 14: 41 views
Month 15: 38 views
Month 16: 22 views
Month 17: 40 views
Month 18: 27 views
Month 19: 34 views
Month 20: 47 views
Month 21: 22 views
Month 22: 21 views
Month 23: 21 views
Month 24: 42 views
Month 25: 27 views
Month 26: 34 views
Month 27: 34 views
Month 28: 22 views
Month 29: 29 views
Month 30: 39 views
Month 31: 29 views
Month 32: 22 views
Month 33: 26 views
Month 34: 46 views
Month 35: 37 views
Month 36: 27 views
Month 37: 14 views
Month 38: 40 views
Month 39: 33 views
Month 40: 10 views
Month 41: 18 views
Month 42: 11 views
Month 43: 40 views
Month 44: 18 views
Month 45: 13 views
Month 46: 35 views
Month 47: 41 views
Month 48: 22 views
Month 49: 24 views
Month 50: 43 views
Month 51: 31 views
Month 52: 24 views
Month 53: 42 views
Month 54: 32 views
Month 55: 31 views
Month 56: 47 views
Month 57: 20 views
Month 58: 26 views
Month 59: 35 views
Month 60: 28 views
Month 61: 38 views
Month 62: 31 views
Month 63: 14 views
Month 64: 25 views
Month 65: 31 views
Month 66: 22 views
Month 67: 26 views
Month 68: 18 views
Month 69: 40 views
Month 70: 37 views
Month 71: 28 views
Month 72: 43 views
Month 73: 16 views
Month 74: 34 views
Month 75: 34 views
Month 76: 43 views
Month 77: 30 views
Month 78: 20 views
Month 79: 20 views
Month 80: 34 views
Month 81: 47 views
Month 82: 41 views
Month 83: 22 views
Month 84: 14 views
Month 85: 37 views
Month 86: 24 views
Month 87: 33 views
Month 88: 41 views
Month 89: 27 views
Month 90: 56 views
Month 91: 40 views
Month 92: 35 views
Month 93: 70 views
Month 94: 72 views
Month 95: 67 views
Month 96: 58 views
Month 97: 57 views
Month 98: 31 views
Month 99: 15 views
Month 100: 37 views
Month 101: 25 views
Month 102: 31 views
Month 103: 75 views
Month 104: 38 views
Month 105: 55 views

Total Views: 1.6K

Total Downloads: 105

All Trends