一级黄色片免费播放|中国黄色视频播放片|日本三级a|可以直接考播黄片影视免费一级毛片

高級搜索

留言板

尊敬的讀者、作者、審稿人, 關(guān)于本刊的投稿、審稿、編輯和出版的任何問題, 您可以本頁添加留言。我們將盡快給您答復。謝謝您的支持!

姓名
郵箱
手機號碼
標題
留言內(nèi)容
驗證碼

基于監(jiān)督學習的可信云計算資源拍賣機制研究

張驥先 謝寧 張學杰 李偉東

張驥先, 謝寧, 張學杰, 李偉東. 基于監(jiān)督學習的可信云計算資源拍賣機制研究[J]. 電子與信息學報, 2019, 41(5): 1243-1250. doi: 10.11999/JEIT180587
引用本文: 張驥先, 謝寧, 張學杰, 李偉東. 基于監(jiān)督學習的可信云計算資源拍賣機制研究[J]. 電子與信息學報, 2019, 41(5): 1243-1250. doi: 10.11999/JEIT180587
Jixian ZHANG, Ning XIE, Xuejie ZHANG, Weidong LI. Supervised Learning Based Truthful Auction Mechanism Design in Cloud Computing[J]. Journal of Electronics & Information Technology, 2019, 41(5): 1243-1250. doi: 10.11999/JEIT180587
Citation: Jixian ZHANG, Ning XIE, Xuejie ZHANG, Weidong LI. Supervised Learning Based Truthful Auction Mechanism Design in Cloud Computing[J]. Journal of Electronics & Information Technology, 2019, 41(5): 1243-1250. doi: 10.11999/JEIT180587

基于監(jiān)督學習的可信云計算資源拍賣機制研究

doi: 10.11999/JEIT180587
基金項目: 國家自然科學基金(61472345, 61762091, 11663007),云南省教育廳科學研究基金(2017ZZX228)
詳細信息
    作者簡介:

    張驥先:男,1980年生,講師,研究方向為分布式系統(tǒng)、云計算、移動計算

    謝寧:女,1991年生,碩士生,研究方向為云計算

    張學杰:男,1965 年生,教授,博士生導師,研究方向為高性能計算、可重構(gòu)計算

    李偉東:男,1981年生,副教授,研究方向為組合優(yōu)化和算法博弈論

    通訊作者:

    李偉東 weidong@ynu.edu.cn

  • 中圖分類號: TP302

Supervised Learning Based Truthful Auction Mechanism Design in Cloud Computing

Funds: The National Natural Science Foundation of China (61472345, 61762091, 11663007), The Scientific Research Foundation of Department of Education of Yunnan Province (2017ZZX228)
  • 摘要: 使用拍賣方式來進行資源分配可以使得資源提供商獲得更大的收益,是云計算領(lǐng)域近年來研究的重點之一。但資源分配問題是NP難的,無法在多項式時間內(nèi)求解,現(xiàn)有研究主要通過近似算法或啟發(fā)式算法來實現(xiàn)資源分配,但存在算法耗時長,與最優(yōu)解相比準確度低的缺點。監(jiān)督學習中分類及回歸思想可對多維云資源分配問題進行建模和分析,針對不同問題規(guī)模,該文提出基于線性回歸、邏輯回歸、支持向量機的3種資源分配算法,并且基于臨界值理論設(shè)計了支付價格算法,從而確保拍賣機制的可信性。在社會福利、分配準確率、算法執(zhí)行時間、資源利用率等多個方面進行測試分析,取得了很好的效果。
  • 圖  1  兩種算法預(yù)測錯誤率與參數(shù)$\lambda $變化關(guān)系

    圖  2  SVM-ALLOC預(yù)測錯誤率與參數(shù)C及$\sigma $變化關(guān)系

    圖  3  3種監(jiān)督學習算法的訓練時間

    圖  4  不同分配算法求解社會福利與預(yù)測準確率對比

    圖  5  不同分配算法資源利用率對比

    表  1  基于臨界值的價格計算算法(CV-PAY)

     輸入 所有用戶的需求信息集:${R} = \{ R_{}^{(1)}\,R_{}^{(2)}\, ·\!·\!· \,R_{}^{(m)}\} $
        監(jiān)督學習算法對資源分配的預(yù)測結(jié)果:
    ${PD} = ({\rm{pd}}_{}^{(1)}\,{\rm{pd}}_{}^{(2)}\, ·\!·\!· \,{\rm{pd}}_{}^{(m)})$
        每類虛擬資源的容量:${C} = ({c_1}\;\;\;{c_2}\;\;\; ·\!·\!· \;\;\;{c_n})$
     輸出 被選中的用戶需要支付的價格,
    ${Pay} = ({\rm pay}_{}^{(1)}\,{\rm{pay}}_{}^{(2)}\, ·\!·\!· \,{\rm{pay}}_{}^{(m)})$
     (1) ${{PD}^{\rm{*}}} \leftarrow 0$
     (2) $\delta \leftarrow {10^{{\rm{ - }}6}}$
     (3) for each $i \leftarrow \{ i|{\rm{pd}}_{}^{(i)} \in {PD}, {\rm{pd}}_{}^{(i)}{\rm{ = 1}}\} $ do
       (4) ${\rm{pay}}_{}^{(i)} \leftarrow b_{}^{(i)};{\rm{pay}}_{}^{(i)'} \leftarrow 0\;\;\;\;;\;\;\;b_{}^{(i)} \leftarrow ({\rm{pay}}_{}^{(i)} + {\rm{pay}}_{}^{(i)'})/2$
       (5) while (${\rm{|pay}}_{}^{(i)}{\rm{ - pay}}_{}^{(i)'}{\rm{| > }}\delta $) do
         (6) 運行LN-ALLOC, LG-ALLOC或SVM-ALLOC求解
    出新的資源分配解${P}{{D}^{\rm{*}}}$
         (7) if ${\rm{pd}}_{}^{(i)}{\rm{ = }}1\;\;\;,{\rm{pd}}_{}^{(i)} \in {P}{{D}^{\rm{*}}}$
           (8) ${\rm{pay}}_{}^{(i)} \leftarrow b_{}^{(i)};b_{}^{(i)} \leftarrow ({\rm{pay}}_{}^{(i)} + {\rm{pay}}_{}^{(i)'})/2$
         (9) else
           (10) ${\rm{pay}}_{}^{(i)'} \leftarrow b_{}^{(i)};b_{}^{(i)} \leftarrow ({\rm{pay}}_{}^{(i)} + {\rm{pay}}_{}^{(i)'})/2$
         (11) end if
         (12) end while
       (13) ${Pay} \leftarrow {Pay} \cup {\rm{pay}}_{}^{(i)}$
     (14) end for
     (15) return ${Pay}$
    下載: 導出CSV
  • NISAN T, ROUGHGARDEN T, TARDOS E, et al. Algorithmic Game Theory[M]. Cambridge: Cambridge Univ. Press, 2007: 218–233.
    LEHMANN D, O’CALLAGHAN L, and SHOHAM Y. Truth revelation in approximately efficient combinatorial auctions[J]. Journal of the ACM, 2002, 49(5): 577–602. doi: 10.1145/585265.585266
    NEJAD M M, MASHAYEKHY L, and GROSU D. Truthful greedy mechanisms for dynamic virtual machine provisioning and allocation in clouds[J]. IEEE Transactions on Parallel and Distributed Systems, 2015, 26(2): 594–603. doi: 10.1109/TPDS.2014.2308224
    MASHAYEKHY L, FISHER N, and GROSU D. Truthful mechanisms for competitive reward-based scheduling[J]. IEEE Transactions on Computers, 2016, 65(7): 2299–2312. doi: 10.1109/TC.2015.2479598
    WU Qinghua and HAO Jinkao. A clique-based exact method for optimal winner determination in combinatorial auctions[J]. Information Sciences, 2016, 334(c): 103–121. doi: 10.1016/j.ins.2015.11.029
    LAI J and PARKES D. Monotone branch-and-bound search for restricted combinatorial auctions[C]. Proceedings of the 13th ACM Conference on Electronic Commerce, Valencia, Spain, 2012: 705–722.
    BANSAL N, FRIGGSTAD Z, KHANDEKAR R, et al. A logarithmic approximation for unsplittable flow on line graphs[C]. Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, New York, USA, 2009: 702–709.
    CHAKRABARTI A, CHEKURI C, GUPTA A, et al. Approximation algorithms for the unsplittable flow problem[J]. Algorithmica, 2007, 47(1): 53–78. doi: 10.1007/s00453-006-1210-5
    MASHAYEKHY L, NEJAD M M, and GROSU D. A PTAS mechanism for provisioning and allocation of heterogeneous cloud resources[J]. IEEE Transactions on Parallel and Distributed Systems, 2015, 26(9): 2386–2399. doi: 10.1109/TPDS.2014.2355228
    SHI Weijie, ZHANG Linquan, WU Chuan, et al. An online auction framework for dynamic resource provisioning in cloud computing[J]. IEEE/ACM Transactions on Networking, 2016, 24(4): 2060–2073. doi: 10.1109/TNET.2015.2444657
    LIU Xi, LI Weidong, and ZHANG Xuejie. Strategy-proof mechanism for provisioning and allocation virtual machines in heterogeneous clouds[J]. IEEE Transactions on Parallel and Distributed Systems, 2018, 29(7): 1650–1663. doi: 10.1109/TPDS.2017.2785815
    ZAMAN S and GROSU D. Combinatorial auction-based dynamic VM provisioning and allocation in clouds[C]. Proceedings of the 2011 IEEE Third International Conference on Cloud Computing Technology and Science (CloudCom), Athens, Greece, 2011: 107–114.
    ZAMAN S and GROSU D. Combinatorial auction-based allocation of virtual machine instances in clouds[J]. Journal of Parallel and Distributed Computing, 2013, 73(4): 495–508. doi: 10.1109/CloudCom.2010.28
    ZHANG Jixian, XIE Ning, ZHANG Xuejie, et al. An online auction mechanism for cloud computing resource allocation and pricing based on user evaluation and cost[J]. Future Generation Computer Systems, 2018, 89: 286–299. doi: 10.1016/j.future.2018.06.034
    張驥先, 謝寧, 李偉東, 等. 一種支持云計算虛擬資源分配的可信多需求拍賣機制[J]. 電子與信息學報, 2018, 40(1): 25–34. doi: 10.11999/JEIT170353

    ZHANG Jixian, XIE Ning, LI Weidong, et al. Truthful multi requirements auction mechanism for virtual resource allocation of cloud computing[J]. Journal of Electronics &Information Technology, 2018, 40(1): 25–34. doi: 10.11999/JEIT170353
    ZHANG Jixian, XIE Ning, ZHANG Xuejie, et al. Machine learning based resource allocation of cloud computing in auction[J]. Computers Materials & Continua, 2018, 56(1): 123–135. doi: 10.3970/cmc.2018.03728
    Grid Workloads Archives[OL]. http://gwa.ewi.tudelft.nl,2018.2.
  • 加載中
圖(5) / 表(1)
計量
  • 文章訪問數(shù):  2373
  • HTML全文瀏覽量:  787
  • PDF下載量:  81
  • 被引次數(shù): 0
出版歷程
  • 收稿日期:  2018-06-13
  • 修回日期:  2018-12-24
  • 網(wǎng)絡(luò)出版日期:  2019-01-02
  • 刊出日期:  2019-05-01

目錄

    /

    返回文章
    返回