메뉴 건너뛰기




Volumn , Issue , 2014, Pages 1303-1311

Optimal approximation algorithm of virtual machine placement for data latency minimization in cloud systems

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; BIG DATA; COMPUTER SIMULATION;

EID: 84904438179     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFOCOM.2014.6848063     Document Type: Conference Paper
Times cited : (63)

References (31)
  • 1
    • 84904435158 scopus 로고    scopus 로고
    • Applying the cloud to big data storage
    • Applying the cloud to big data storage. [Online]. Available: http://www.appistry.com/sites/default/files/downloads/Applying the Cloud to Big Data Storage.pdf
  • 2
    • 84883074509 scopus 로고    scopus 로고
    • Optimizing data access latencies in cloud systems by intelligent virtual machine placement
    • M. Alicherry and T. V. Lakshman, "Optimizing data access latencies in cloud systems by intelligent virtual machine placement," in IEEE INFOCOM, 2013.
    • (2013) IEEE INFOCOM
    • Alicherry, M.1    Lakshman, T.V.2
  • 3
    • 37549003336 scopus 로고    scopus 로고
    • MapReduce: Simplified data processing on large clusters
    • J. Dean and S. Ghemawat, "MapReduce: Simplified data processing on large clusters," Commun. ACM, vol. 51, pp. 107-113, 2008.
    • (2008) Commun. ACM , vol.51 , pp. 107-113
    • Dean, J.1    Ghemawat, S.2
  • 4
    • 84904435163 scopus 로고    scopus 로고
    • Hadoop
    • Hadoop. [Online]. Available: http://hadoop.apache.org/
  • 7
    • 77953309404 scopus 로고    scopus 로고
    • Improving the scalability of data center networks with traffic-aware virtual machine placement
    • X. Meng, V. Pappas, and L. Zhang, "Improving the scalability of data center networks with traffic-aware virtual machine placement," in IEEE INFOCOM, 2010.
    • (2010) IEEE INFOCOM
    • Meng, X.1    Pappas, V.2    Zhang, L.3
  • 9
    • 84904435154 scopus 로고    scopus 로고
    • Understanding switch latency
    • Understanding switch latency. [Online]. Available: http://www.cisco.com/ en/US/prod/collateral/switches/ps9441/ ps11541/white paper c11-661939.html
  • 10
    • 84904435155 scopus 로고    scopus 로고
    • Speed reduction by distance
    • Speed reduction by distance. [Online]. Available: http://www.numion. com/calculators/Distance.html
  • 11
    • 84861624273 scopus 로고    scopus 로고
    • Network aware resource allocation in distributed clouds
    • M. Alicherry and T. Lakshman, "Network aware resource allocation in distributed clouds," in IEEE INFOCOM, 2012.
    • (2012) IEEE INFOCOM
    • Alicherry, M.1    Lakshman, T.2
  • 12
    • 0000203509 scopus 로고
    • On the ratio of optimal integral and fractional covers
    • L. Lovász, "On the ratio of optimal integral and fractional covers," Discrete Math., vol. 13, pp. 383-390, 1975.
    • (1975) Discrete Math. , vol.13 , pp. 383-390
    • Lovász, L.1
  • 14
    • 0024665752 scopus 로고
    • Interior path following primal-dual algorithms. Part I: Linear programming
    • R. Monteiro and I. Adler, "Interior path following primal-dual algorithms. part I: Linear programming," Math. Program., vol. 44, pp. 27-41, 1989.
    • (1989) Math. Program. , vol.44 , pp. 27-41
    • Monteiro, R.1    Adler, I.2
  • 15
    • 84904435156 scopus 로고    scopus 로고
    • Data centre link lengths
    • Data centre link lengths. [Online]. Available: http://www.ieee802.org/3/ NGBASET/public/nov12/flatman 01a 1112 ngbt.pdf
  • 16
    • 0016473805 scopus 로고
    • A branch and bound algorithm for the generalized assignment problem
    • G. T. Ross and R. M. Soland, "A branch and bound algorithm for the generalized assignment problem," Math. Program., vol. 8, pp. 91-103, 1975.
    • (1975) Math. Program. , vol.8 , pp. 91-103
    • Ross, G.T.1    Soland, R.M.2
  • 17
    • 0000354875 scopus 로고
    • A multiplier adjustment method for the generalized assignment problem
    • M. L. Fisher, R. Jaikumar, and L. N. Van Wassenhove, "A multiplier adjustment method for the generalized assignment problem," Manage. Sci., vol. 32, pp. 1095-1103, 1986.
    • (1986) Manage. Sci. , vol.32 , pp. 1095-1103
    • Fisher, M.L.1    Jaikumar, R.2    Van Wassenhove, L.N.3
  • 18
    • 0038309442 scopus 로고
    • An approximation algorithm for the generalized assignment problem
    • D. B. Shmoys and E. Tardos, "An approximation algorithm for the generalized assignment problem," Math. Program., vol. 62, pp. 461-474, 1993.
    • (1993) Math. Program. , vol.62 , pp. 461-474
    • Shmoys, D.B.1    Tardos, E.2
  • 19
    • 0033895870 scopus 로고    scopus 로고
    • A PTAS for the multiple knapsack problem
    • C. Chekuri and S. Khanna, "A PTAS for the multiple knapsack problem," in ACM-SIAM SODA, 2000.
    • (2000) ACM-SIAM SODA
    • Chekuri, C.1    Khanna, S.2
  • 21
    • 34250227246 scopus 로고
    • Heuristics for the fixed cost median problem
    • D. S. Hochbaum, "Heuristics for the fixed cost median problem," Math. Program., vol. 22, pp. 148-162, 1982.
    • (1982) Math. Program. , vol.22 , pp. 148-162
    • Hochbaum, D.S.1
  • 22
    • 84904435157 scopus 로고    scopus 로고
    • Facility location with nonuniform hard capacities
    • M. Pál, E. Tardos, and T. Wexler, "Facility location with nonuniform hard capacities," in IEEE FOCS, 2001.
    • (2001) IEEE FOCS
    • Pál, M.1    Tardos, E.2    Wexler, T.3
  • 23
    • 84904435149 scopus 로고    scopus 로고
    • LP-based approximation algorithms for capacitated facility location
    • R. Levi and D. B. Shmoys, "LP-based approximation algorithms for capacitated facility location," in ACM-SIAM SODA, 2004.
    • (2004) ACM-SIAM SODA
    • Levi, R.1    Shmoys, D.B.2
  • 24
    • 70349130748 scopus 로고    scopus 로고
    • Assignment problem in content distribution networks: Unsplittable hard-capacitated facility location
    • M. H. Bateni and M. T. Hajiaghayi, "Assignment problem in content distribution networks: Unsplittable hard-capacitated facility location," in ACM-SIAM SODA, 2009.
    • (2009) ACM-SIAM SODA
    • Bateni, M.H.1    Hajiaghayi, M.T.2
  • 26
    • 84861623251 scopus 로고    scopus 로고
    • Joint VM placement and routing for data center traffic engineering
    • J. Jiang, T. Lan, S. Ha, M. Chen, and M. Chiang, "Joint VM placement and routing for data center traffic engineering," in IEEE INFOCOM, 2012.
    • (2012) IEEE INFOCOM
    • Jiang, J.1    Lan, T.2    Ha, S.3    Chen, M.4    Chiang, M.5
  • 27
    • 84861621601 scopus 로고    scopus 로고
    • Improving consolidation of virtual machines with risk-aware bandwidth oversubscription in compute clouds
    • D. Breitgand and A. Epstein, "Improving consolidation of virtual machines with risk-aware bandwidth oversubscription in compute clouds," in IEEE INFOCOM, 2012.
    • (2012) IEEE INFOCOM
    • Breitgand, D.1    Epstein, A.2
  • 29
    • 84883070508 scopus 로고    scopus 로고
    • Almost optimal virtual machine placement for traffic intense data centers
    • R. Cohen, L. Lewin-Eytan, J. S. Naor, and D. Raz, "Almost optimal virtual machine placement for traffic intense data centers," in IEEE INFOCOM, 2013.
    • (2013) IEEE INFOCOM
    • Cohen, R.1    Lewin-Eytan, L.2    Naor, J.S.3    Raz, D.4


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