A scalable and automatic mechanism for resource allocation in self-organizing cloud
- Publisher:
- SPRINGER
- Publication Type:
- Journal Article
- Citation:
- Peer-to-Peer Networking and Applications, 2016, 9, (1), pp. 28-41
- Issue Date:
- 2016-01-01
Closed Access
| Filename | Description | Size | |||
|---|---|---|---|---|---|
| Wu2016_Article_AScalableAndAutomaticMechanism.pdf | Published version | 1.95 MB |
Copyright Clearance Process
- Recently Added
- In Progress
- Closed Access
This item is closed access and not available.
Taking advantage of the huge potential of consumers’ untapped computing power, self-organizing cloud is a novel computing paradigm where the consumers are able to contribute/sell their computing resources. Meanwhile, host machines held by the consumers are connected by a peer-to-peer (P2P) overlay network on the Internet. In this new architecture, due to large and varying multitudes of resources and prices, it is inefficient and tedious for consumers to select the proper resource manually. Thus, there is a high demand for a scalable and automatic mechanism to accomplish resource allocation. In view of this challenge, this paper proposes two novel economic strategies based on mechanism design. Concretely, we apply the Modified Vickrey Auction (MVA) mechanism to the case where the resource is sufficient; and the Continuous Double Auction (CDA) mechanism is employed when the resource is insufficient. We also prove that aforementioned mechanisms have dominant strategy incentive compatibility. Finally, extensive experiment results are conducted to verify the performance of the proposed strategies in terms of procurement cost and execution efficiency.
Please use this identifier to cite or link to this item: