메뉴 건너뛰기




Volumn , Issue , 2013, Pages 25-29

Profit-maximizing virtual machine trading in a federation of selfish clouds

Author keywords

[No Author keywords available]

Indexed keywords

AUCTION MECHANISMS; DYNAMIC ALGORITHM; DYNAMIC RESOURCE TRADING; ELECTRICITY PRICES; LONG-TERM PROFITS; RIGOROUS ANALYSIS; TEMPORAL AVAILABILITY; VIRTUAL MACHINES;

EID: 84883112358     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2013.6566728     Document Type: Conference Paper
Times cited : (58)

References (14)
  • 1
    • 77953299793 scopus 로고    scopus 로고
    • Minimizing electricity cost: Optimization of distributed internet data centers in a multi-electricitymarket environment
    • L. Rao, X. Liu, L. Xie, and W. Liu, "Minimizing electricity cost: Optimization of distributed internet data centers in a multi-electricitymarket environment," in Prof. of IEEE INFOCOM'10, 2010.
    • (2010) Prof. of IEEE INFOCOM , vol.10
    • Rao, L.1    Liu, X.2    Xie, L.3    Liu, W.4
  • 3
  • 4
    • 84960378385 scopus 로고    scopus 로고
    • Nimrod/g: An architecture of a resource management and scheduling system in a global computational grid
    • R. Buyya, D. Abramson, and J. Giddy., "Nimrod/g: An architecture of a resource management and scheduling system in a global computational grid," in Proc. of HPC Asia'00, 2000.
    • (2000) Proc. of HPC Asia'00
    • Buyya, R.1    Abramson, D.2    Giddy, J.3
  • 5
    • 70349694010 scopus 로고    scopus 로고
    • Trust: A general framework for truthful double spectrum auctions
    • X. Zhou and H. Zheng, "Trust: A general framework for truthful double spectrum auctions," in Proc. of IEEE INFOCOM'09, 2009.
    • (2009) Proc. of IEEE INFOCOM'09
    • Zhou, X.1    Zheng, H.2
  • 7
    • 84883128135 scopus 로고    scopus 로고
    • Available:
    • [Online]. Available: http://aws.amazon.com/ec2
  • 10
    • 84883085037 scopus 로고    scopus 로고
    • [Online]. Available: http://www.linode.com/faq.cfm
  • 11
    • 79960880059 scopus 로고    scopus 로고
    • Opportunistic scheduling with worst case delay guarantees in single and multi-hop networks
    • M. J. Neely, "Opportunistic scheduling with worst case delay guarantees in single and multi-hop networks," in Proc. of IEEE INFOCOM'11, 2011.
    • (2011) Proc. of IEEE INFOCOM , vol.11
    • Neely, M.J.1
  • 13
    • 84883063141 scopus 로고    scopus 로고
    • Profit-maximizing virtual machine trading in a federation of selfish clouds
    • H. Li, C. Wu, Z. Li, and F. C. Lau, "Profit-maximizing virtual machine trading in a federation of selfish clouds," The University of Hong Kong, http://i.cs.hku.hk/?hxli/profit-federation.pdf, Tech. Rep., 2012.
    • (2012) Tech. Rep the University of Hong Kong
    • Li, H.1    Wu, C.2    Li, Z.3    Lau, F.C.4


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