메뉴 건너뛰기




Volumn , Issue , 2012, Pages 526-535

Dynamic service placement in geographically distributed clouds

Author keywords

[No Author keywords available]

Indexed keywords

DEMAND PATTERN; DYNAMIC NATURE; DYNAMIC SERVICES; DYNAMIC SOLUTIONS; GAME-THEORETIC MODEL; INFRASTRUCTURE COSTS; MULTIPLE SERVICES; NASH EQUILIBRIA; ON-LINE SERVICE; PERFORMANCE REQUIREMENTS; PLACEMENT PROBLEMS; RESOURCE PRICE; SERVICE APPLICATIONS; SERVICE HOSTING; SERVICE PROVIDER;

EID: 84866937947     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDCS.2012.74     Document Type: Conference Paper
Times cited : (67)

References (35)
  • 2
    • 77953299793 scopus 로고    scopus 로고
    • Minimizing electricity cost: Optimization of distributed internet data centers in a multi-electricity-market environment
    • L. Rao, X. Liu, and W. Liu, "Minimizing electricity cost: Optimization of distributed internet data centers in a multi-electricity-market environment," in Proceedings of IEEE IN-FOCOM, 2010.
    • (2010) Proceedings of IEEE IN-FOCOM
    • Rao, L.1    Liu, X.2    Liu, W.3
  • 7
    • 84893080851 scopus 로고    scopus 로고
    • Dynamic replica placement and traffic redirection in content delivery networks
    • C. Vicari, C. Petrioli, and F. Presti, "Dynamic replica placement and traffic redirection in content delivery networks," in Proceeding of IEEE (MASCOTS), 2007.
    • (2007) Proceeding of IEEE (MASCOTS)
    • Vicari, C.1    Petrioli, C.2    Presti, F.3
  • 10
    • 84858160602 scopus 로고    scopus 로고
    • Network edge intelligence for the emerging next-generation internet
    • S. Islam and J. Grégoire, "Network edge intelligence for the emerging next-generation internet," Future Internet, 2010.
    • (2010) Future Internet
    • Islam, S.1    Grégoire, J.2
  • 11
    • 8344272786 scopus 로고    scopus 로고
    • On replica placement for qosaware content distribution
    • X. Tang and X. Jianliang, "On replica placement for qosaware content distribution," Proc. of IEEE INFOCOM, 2004.
    • (2004) Proc. of IEEE INFOCOM
    • Tang, X.1    Jianliang, X.2
  • 27
    • 51249181640 scopus 로고
    • Bin packing can be solved within 1+ ε in linear time
    • W. Fernandez de La Vega and G. Lueker, "Bin packing can be solved within 1+ ε in linear time," Combinatorica, 1981.
    • (1981) Combinatorica
    • De La Vega, W.F.1    Lueker, G.2
  • 29
    • 77957795795 scopus 로고    scopus 로고
    • Price of anarchy and price of information in n-person linear-quadratic differential games
    • Q. Zhu and T. Basar, "Price of anarchy and price of information in n-person linear-quadratic differential games," in IEEE American Control Conference (ACC), 2010.
    • (2010) IEEE American Control Conference (ACC)
    • Zhu, Q.1    Basar, T.2
  • 30
    • 84855731076 scopus 로고    scopus 로고
    • Prices of anarchy, information, and cooperation in differential games
    • T. Başar and Q. Zhu, "Prices of anarchy, information, and cooperation in differential games," Dynamic Games and Applications, 2011.
    • (2011) Dynamic Games and Applications
    • Başar, T.1    Zhu, Q.2
  • 33
    • 84866906909 scopus 로고    scopus 로고
    • "GTITM homepage," http://www.cc.gatech.edu/projects/gtitm/.
    • GTITM Homepage
  • 34
    • 0036343302 scopus 로고    scopus 로고
    • Topologically-aware overlay construction and server selection
    • S. Ratnasamy, M. Handley, R. Karp, and S. Scott, "Topologically- aware overlay construction and server selection," IEEE INFOCOM, 2002.
    • (2002) IEEE INFOCOM
    • Ratnasamy, S.1    Handley, M.2    Karp, R.3    Scott, S.4


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