메뉴 건너뛰기




Volumn 28, Issue 3, 2017, Pages 677-688

An Online Auction Mechanism for Dynamic Virtual Cluster Provisioning in Geo-Distributed Clouds

Author keywords

auction mechanism design; Cloud computing; online algorithm; resource allocation

Indexed keywords

CLOUD COMPUTING; CLUSTER COMPUTING; CLUSTERING ALGORITHMS; COMPETITION; COMPUTATIONAL COMPLEXITY; COST FUNCTIONS; COSTS; DYNAMICS; EFFICIENCY; ELECTRONIC COMMERCE; MACHINE DESIGN; RESOURCE ALLOCATION;

EID: 85013093032     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/TPDS.2016.2601905     Document Type: Article
Times cited : (28)

References (40)
  • 2
    • 81255197424 scopus 로고    scopus 로고
    • Secondnet: A data center network virtualization architecture with bandwidth guarantees
    • C. Guo, et al., "Secondnet: A data center network virtualization architecture with bandwidth guarantees," in Proc. ACM Co-NEXT, 2010, Art. no. 15.
    • (2010) Proc. ACM Co-NEXT
    • Guo, C.1
  • 7
    • 85013099146 scopus 로고    scopus 로고
    • [Online]
    • Comcast case study. (2016). [Online]. Available: https://aws.amazon. com/solutions/case-studies/comcast/
    • (2016) Comcast Case Study
  • 8
    • 85013038743 scopus 로고    scopus 로고
    • [Online]
    • Amazon virtual cluster. (2016). [Online]. Available: http://docs.aws. amazon.com/redshift/latest/mgmt/managing-clusters-vpc.html
    • (2016) Amazon Virtual Cluster
  • 9
    • 84861597727 scopus 로고    scopus 로고
    • When cloud meets eBay: Towards effective pricing for cloud computing
    • Q. Wang, K. Ren, and X. Meng, "When cloud meets eBay: Towards effective pricing for cloud computing," in Proc. IEEE INFOCOM, 2012, pp. 936-944.
    • (2012) Proc. IEEE INFOCOM , pp. 936-944
    • Wang, Q.1    Ren, K.2    Meng, X.3
  • 11
    • 84904410744 scopus 로고    scopus 로고
    • Let's stay together: Towards traffic aware virtual machine placement in data centers
    • X. Li, J. Wu, S. Tang, and S. Lu, "Let's stay together: Towards traffic aware virtual machine placement in data centers," in Proc. IEEE INFOCOM, 2014, pp. 1842-1850.
    • (2014) Proc. IEEE INFOCOM , pp. 1842-1850
    • Li, X.1    Wu, J.2    Tang, S.3    Lu, S.4
  • 12
    • 84904434343 scopus 로고    scopus 로고
    • Venice: Reliable virtual data center embedding in clouds
    • Q. Zhang, M. F. Zhani, M. Jabri, and R. Boutaba, "Venice: Reliable virtual data center embedding in clouds," in Proc. IEEE INFOCOM, 2014, pp. 289-297.
    • (2014) Proc. IEEE INFOCOM , pp. 289-297
    • Zhang, Q.1    Zhani, M.F.2    Jabri, M.3    Boutaba, R.4
  • 14
    • 84907377252 scopus 로고    scopus 로고
    • A decomposition-based architecture for distributed virtual network embedding
    • F. Esposito and I. Matta, "A decomposition-based architecture for distributed virtual network embedding," in Proc. ACM SIGCOMM Workshop Distrib. Cloud Comput., 2014, pp. 53-58.
    • (2014) Proc. ACM SIGCOMM Workshop Distrib. Cloud Comput. , pp. 53-58
    • Esposito, F.1    Matta, I.2
  • 15
    • 70349682522 scopus 로고    scopus 로고
    • Virtual network embedding with coordinated node and link mapping
    • N. M. K. Chowdhury, M. R. Rahman, and R. Boutaba, "Virtual network embedding with coordinated node and link mapping," in Proc. IEEE INFOCOM, 2009, pp. 783-791.
    • (2009) Proc. IEEE INFOCOM , pp. 783-791
    • Chowdhury, N.M.K.1    Rahman, M.R.2    Boutaba, R.3
  • 17
    • 84983256871 scopus 로고    scopus 로고
    • Online multi-commodity flow with highDemands
    • Berlin, Germany: Springer
    • G. Even and M. Medina, "Online multi-commodity flow with highDemands," in Approximation and Online Algorithms. Berlin, Germany: Springer, 2013.
    • (2013) Approximation and Online Algorithms
    • Even, G.1    Medina, M.2
  • 18
    • 84855724135 scopus 로고    scopus 로고
    • Competitive and deterministic embeddings of virtual networks
    • Berlin, Germany: Springer
    • G. Even, M. Medina, G. Schaffrath, and S. Schmid, "Competitive and deterministic embeddings of virtual networks," in Distributed Computing and Networking. Berlin, Germany: Springer, 2012, pp. 106-121.
    • (2012) Distributed Computing and Networking , pp. 106-121
    • Even, G.1    Medina, M.2    Schaffrath, G.3    Schmid, S.4
  • 20
    • 0242550383 scopus 로고    scopus 로고
    • Truth revelation in approximately efficient combinatorial auctions
    • D. Lehmann, L. I. Očallaghan, and Y. Shoham, "Truth revelation in approximately efficient combinatorial auctions," J. ACM (JACM), vol. 49, pp. 577-602, 2002.
    • (2002) J. ACM (JACM) , vol.49 , pp. 577-602
    • Lehmann, D.1    Očallaghan, L.I.2    Shoham, Y.3
  • 21
    • 84980096808 scopus 로고
    • Counterspeculation, auctions, and competitive sealed tenders
    • W. Vickrey, "Counterspeculation, auctions, and competitive sealed tenders," J. Finance, vol. 16, pp. 8-37, 1961.
    • (1961) J. Finance , vol.16 , pp. 8-37
    • Vickrey, W.1
  • 22
    • 84919977312 scopus 로고    scopus 로고
    • Fair pricing in the sky: Truthful frequency allocation with dynamic spectrum supply
    • Q. Sun, Q. Wang, K. Ren, and X. Jia, "Fair pricing in the sky: Truthful frequency allocation with dynamic spectrum supply," in Proc. IEEE ICNP, 2014, pp. 245-256.
    • (2014) Proc. IEEE ICNP , pp. 245-256
    • Sun, Q.1    Wang, Q.2    Ren, K.3    Jia, X.4
  • 23
    • 84919793096 scopus 로고    scopus 로고
    • Incentive-compatible online mechanism for resource provisioning and allocation in cloud
    • L. Mashayekhy, M. M. Nejad, D. Grosu, and A. V. Vasilakos, "Incentive-compatible online mechanism for resource provisioning and allocation in cloud," in Proc. IEEE CLOUD, 2014, pp. 312-319.
    • (2014) Proc. IEEE CLOUD , pp. 312-319
    • Mashayekhy, L.1    Nejad, M.M.2    Grosu, D.3    Vasilakos, A.V.4
  • 24
    • 33748120378 scopus 로고    scopus 로고
    • Truthful and near-optimal mechanism design via linear programming
    • R. Lavi and C. Swamy, "Truthful and near-optimal mechanism design via linear programming," in Proc. 46th Annu. IEEE Symp. Found. Comput. Sci., 2005, pp. 595-604.
    • (2005) Proc. 46th Annu. IEEE Symp. Found. Comput. Sci. , pp. 595-604
    • Lavi, R.1    Swamy, C.2
  • 25
    • 84904289472 scopus 로고    scopus 로고
    • Dynamic resource provisioning in cloud computing: A randomized auction approach
    • L. Zhang, C. Wu, and Z. Li, "Dynamic resource provisioning in cloud computing: A randomized auction approach," in Proc. IEEE INFOCOM, 2014, pp. 433-441.
    • (2014) Proc. IEEE INFOCOM , pp. 433-441
    • Zhang, L.1    Wu, C.2    Li, Z.3
  • 26
    • 84954230850 scopus 로고    scopus 로고
    • A truthful (1-)-optimal mechanism for on-demand cloud resource provisioning
    • X. Zhang, C. Wu, Z. Li, and F. C. Lau, "A truthful (1-)-optimal mechanism for on-demand cloud resource provisioning," in Proc. IEEE INFOCOM, 2015, pp. 1-9.
    • (2015) Proc. IEEE INFOCOM , pp. 1-9
    • Zhang, X.1    Wu, C.2    Li, Z.3    Lau, F.C.4
  • 28
    • 84919793180 scopus 로고    scopus 로고
    • Core-selecting auctions for dynamically allocating heterogeneous VMs in cloud computing
    • H. Fu, Z. Li, C. Wu, and X. Chu, "Core-selecting auctions for dynamically allocating heterogeneous VMs in cloud computing," in Proc. IEEE 7th Int. Conf. Cloud Comput., 2014, pp. 152-159.
    • (2014) Proc. IEEE 7th Int. Conf. Cloud Comput. , pp. 152-159
    • Fu, H.1    Li, Z.2    Wu, C.3    Chu, X.4
  • 29
    • 84883290864 scopus 로고    scopus 로고
    • B4: Experience with a globally-deployed software defined WAN
    • S. Jain, et al., "B4: Experience with a globally-deployed software defined WAN," in Proc. ACM SIGCOMM Conf. SIGCOMM, 2013, pp. 3-14.
    • (2013) Proc. ACM SIGCOMM Conf. SIGCOMM , pp. 3-14
    • Jain, S.1
  • 30
    • 0038784573 scopus 로고    scopus 로고
    • Reducing truth-telling online mechanisms to online optimization
    • A. Madry, "Reducing truth-telling online mechanisms to online optimization," in Proc. 35th Annu. ACM Symp. Theory Comput., 2003.
    • (2003) Proc. 35th Annu. ACM Symp. Theory Comput.
    • Madry, A.1
  • 31
    • 67650286588 scopus 로고    scopus 로고
    • The design of competitive online algorithms via a primal: Dual approach
    • N. Buchbinder and J. Naor, "The design of competitive online algorithms via a primal: Dual approach," Found. Trends Theoretical Comput. Sci., vol. 3, pp. 93-263, 2009.
    • (2009) Found. Trends Theoretical Comput. Sci. , vol.3 , pp. 93-263
    • Buchbinder, N.1    Naor, J.2
  • 32
    • 77954702543 scopus 로고    scopus 로고
    • Faster Approximation Schemes for Fractional Multicommodity Flow Problems via Dynamic Graph Algorithms
    • A. Madry, "Faster Approximation Schemes for Fractional Multicommodity Flow Problems via Dynamic Graph Algorithms," in Proc. 42nd ACM Symp. Theory Comput., 2010, pp. 121-130.
    • (2010) Proc. 42nd ACM Symp. Theory Comput. , pp. 121-130
    • Madry, A.1
  • 33
    • 85013091959 scopus 로고    scopus 로고
    • [Online]
    • Xen DVFS. (2009). [Online]. Available: http://lists.xen.org/archives/html/xen-devel/2009-09/msg00585.html
    • (2009) Xen DVFS
  • 34
    • 80051798127 scopus 로고    scopus 로고
    • Power-aware provisioning of virtual machines for real-time cloud services
    • K. H. Kim, A. Beloglazov, and R. Buyya, "Power-aware provisioning of virtual machines for real-time cloud services," Concurrency Comput. Practice Experience Archive, vol. 23, no. 13, pp. 1491-1505, 2011.
    • (2011) Concurrency Comput. Practice Experience Archive , vol.23 , Issue.13 , pp. 1491-1505
    • Kim, K.H.1    Beloglazov, A.2    Buyya, R.3
  • 36
    • 57349123055 scopus 로고    scopus 로고
    • Online primal-dual algorithms for covering and packing problems
    • Berlin, Germany: Springer
    • N. Buchbinder and J. Naor, "Online primal-dual algorithms for covering and packing problems," in Algorithms-ESA, Berlin, Germany: Springer, 2005.
    • (2005) Algorithms-ESA
    • Buchbinder, N.1    Naor, J.2
  • 37
    • 84963755486 scopus 로고    scopus 로고
    • [Online]
    • Google Cluster Data. (2015). [Online]. Available: https://github. com/google/cluster-data
    • (2015) Google Cluster Data


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.