Bidding and allocation in combinatorial auctions
Proceedings of the 2nd ACM conference on Electronic commerce
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
A taxonomy and survey of grid resource management systems for distributed computing
Software—Practice & Experience
Sharing the cost of multicast transmissions
Journal of Computer and System Sciences - Special issue on Internet algorithms
Chord: a scalable peer-to-peer lookup protocol for internet applications
IEEE/ACM Transactions on Networking (TON)
Architectural Models for Resource Management in the Grid
GRID '00 Proceedings of the First IEEE/ACM International Workshop on Grid Computing
G-commerce: Market Formulations Controlling Resource Allocation on the Computational Grid
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
Combinatorial Auctions
A taxonomy of market-based resource management systems for utility-driven cluster computing
Software—Practice & Experience
Dynamic Bandwidth Auctions in Multioverlay P2P Streaming with Network Coding
IEEE Transactions on Parallel and Distributed Systems
SORMA --- Business Cases for an Open Grid Market: Concept and Implementation
GECON '08 Proceedings of the 5th international workshop on Grid Economics and Business Models
A Strategy-proof Pricing Scheme for Multiple Resource Type Allocations
ICPP '09 Proceedings of the 2009 International Conference on Parallel Processing
Market-Oriented Grid and Utility Computing
Market-Oriented Grid and Utility Computing
A taxonomy of rational attacks
IPTPS'05 Proceedings of the 4th international conference on Peer-to-Peer Systems
Strategy-Proof dynamic resource pricing of multiple resource types on federated clouds
ICA3PP'10 Proceedings of the 10th international conference on Algorithms and Architectures for Parallel Processing - Volume Part I
| Hi-index | 0.00 |
Current distributed computing infrastructures, such as peerto-peer networks, grids, and more recently clouds, make sharing and trading resources ubiquitous. In these large distributed systems, rational users are both providers and consumers of resources. Currently, there is growing interest in exploiting economic models for the allocation of shared computing resources that incentivize rational users. However, when the number of resource types and users increases, computational complexity of the allocation algorithms grows rapidly and efficiency deteriorates. In this paper, we propose a scalable distributed market framework for the allocation of shared resources in large distributed systems. We use mechanism design to create a pricing scheme that allocates a request for multiple resource types, by trading economic efficiency for computational efficiency, strategy-proof and budget-balance. To address scalability, our proposed framework leverages on a peer-to-peer overlay for resource discovery and management. We prototype our framework using FreePastry, a popular overlay network based on the Pastry protocol. We show that our scheme is efficient and scalable using both simulation experiments and results from the deployment on PlantLab.