WEKO3
アイテム
Study on Combinatorial Auction Mechanism for Resource Allocation in Cloud Computing Environment
https://ir.soken.ac.jp/records/3140
https://ir.soken.ac.jp/records/31401090f34d-d71b-4c8c-8c0f-eb0684ee5e94
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
要旨・審査要旨 (267.6 kB)
|
||
|
本文 (5.4 MB)
|
| Item type | 学位論文 / Thesis or Dissertation(1) | |||||||
|---|---|---|---|---|---|---|---|---|
| 公開日 | 2012-09-13 | |||||||
| タイトル | ||||||||
| タイトル | Study on Combinatorial Auction Mechanism for Resource Allocation in Cloud Computing Environment | |||||||
| タイトル | ||||||||
| タイトル | Study on Combinatorial Auction Mechanism for Resource Allocation in Cloud Computing Environment | |||||||
| 言語 | en | |||||||
| 言語 | ||||||||
| 言語 | eng | |||||||
| 資源タイプ | ||||||||
| 資源タイプ識別子 | http://purl.org/coar/resource_type/c_46ec | |||||||
| 資源タイプ | thesis | |||||||
| 著者名 |
藤原, 一毅
× 藤原, 一毅
|
|||||||
| フリガナ |
フジワラ, イッキ
× フジワラ, イッキ
|
|||||||
| 著者 |
FUJIWARA, Ikki
× FUJIWARA, Ikki
|
|||||||
| 学位授与機関 | ||||||||
| 学位授与機関名 | 総合研究大学院大学 | |||||||
| 学位名 | ||||||||
| 学位名 | 博士（情報学） | |||||||
| 学位記番号 | ||||||||
| 内容記述タイプ | Other | |||||||
| 内容記述 | 総研大甲第1513号 | |||||||
| 研究科 | ||||||||
| 値 | 複合科学研究科 | |||||||
| 専攻 | ||||||||
| 値 | 17 情報学専攻 | |||||||
| 学位授与年月日 | ||||||||
| 学位授与年月日 | 2012-03-23 | |||||||
| 学位授与年度 | ||||||||
| 値 | 2011 | |||||||
| 要旨 | ||||||||
| 内容記述タイプ | Other | |||||||
| 内容記述 | This thesis proposes a combinatorial auction-based marketplace mechanism for cloud computing services, which allows users to reserve arbitrary combination of services at requested timeslots, prices and quality of service. The proposed mechanism helps enterprise users build workflow applications in a cloud computing environment, specifically on the platform-as-a-service, where the users need to compose multiple types of services at different timeslots. The proposed marketplace mechanism consists of a forward market for an advance reservation and a spot market for an immediate allocation of services. Each market employs mixed integer programming to enforce a Pareto optimum allocation with maximized social economic welfare, as well as double-sided auction design to encourage both users and providers to compete for buying and selling the services. A marketplace simulator, named W-Mart, is specially developed for this thesis. It implements the proposed mechanism on Java platform being powered by CPLEX, the state-of-the-art MIP solver. W-Mart is designed after the multi-agent virtual market system U-Mart, and is also capable to deal with human agents and machine agents at the same time. Three experiments are carried out by means of multi-agent simulations. First, the accuracy of the combinatorial allocation scheme is validated. The result demonstrates that it works properly. Second, the overhead of the proposed market mechanism including MIP solver is assessed. The result shows that the overhead is acceptable to deal with an expected number of participants within the proposed trading schedule. Third, the performances of four types of market mechanisms are extensively evaluated. The results clarify that (1) the proposed forward/combinatorial mechanism outperforms other non-combinatorial and/or non-reservation (spot) mechanisms in both user-centric rationality and global efficiency, (2) running both a forward market and a spot market improves resource utilization without disturbing advance reservations, and (3) the users' preference between the forward market and the spot market affects the performance of whole marketplace significantly in tight demand/supply conditions. |
|||||||
| 所蔵 | ||||||||
| 値 | 有 | |||||||
| フォーマット | ||||||||
| 内容記述タイプ | Other | |||||||
| 内容記述 | application/pdf | |||||||
