메뉴 건너뛰기




Volumn , Issue , 2014, Pages 248-257

Energy-efficient flow scheduling and routing with hard deadlines in data center networks

Author keywords

cloud computing; data center networks; energy efficiency

Indexed keywords

APPROXIMATION ALGORITHMS; CLOUD COMPUTING; ENERGY EFFICIENCY; GREEN COMPUTING; HAMILTONIANS; POLYNOMIAL APPROXIMATION; SCHEDULING;

EID: 84907750021     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDCS.2014.33     Document Type: Conference Paper
Times cited : (56)

References (35)
  • 2
    • 78149287594 scopus 로고    scopus 로고
    • Energy-aware routing in data center network
    • Y. Shang, D. Li, and M. Xu, "Energy-aware routing in data center network," in Green Networking, 2010, pp. 1-8.
    • (2010) Green Networking , pp. 1-8
    • Shang, Y.1    Li, D.2    Xu, M.3
  • 3
    • 84861607596 scopus 로고    scopus 로고
    • Carpo: Correlationaware power optimization in data center networks
    • X. Wang, Y. Yao, X. Wang, K. Lu, and Q. Cao, "Carpo: Correlationaware power optimization in data center networks," in INFOCOM, 2012, pp. 1125-1133.
    • (2012) INFOCOM , pp. 1125-1133
    • Wang, X.1    Yao, Y.2    Wang, X.3    Lu, K.4    Cao, Q.5
  • 8
    • 80053169446 scopus 로고    scopus 로고
    • Better never than late: Meeting deadlines in datacenter networks
    • C. Wilson, H. Ballani, T. Karagiannis, and A. I. T. Rowstron, "Better never than late: meeting deadlines in datacenter networks," in SIGCOMM, 2011, pp. 50-61.
    • (2011) SIGCOMM , pp. 50-61
    • Wilson, C.1    Ballani, H.2    Karagiannis, T.3    Rowstron, A.I.T.4
  • 9
    • 84894583153 scopus 로고    scopus 로고
    • Deadline-aware datacenter tcp (d2tcp)
    • B. Vamanan, J. Hasan, and T. N. Vijaykumar, "Deadline-aware datacenter tcp (d2tcp)," in SIGCOMM, 2012, pp. 115-126.
    • (2012) SIGCOMM , pp. 115-126
    • Vamanan, B.1    Hasan, J.2    Vijaykumar, T.N.3
  • 10
    • 84894564139 scopus 로고    scopus 로고
    • Finishing flows quickly with preemptive scheduling
    • C.-Y. Hong, M. Caesar, and B. Godfrey, "Finishing flows quickly with preemptive scheduling," in SIGCOMM, 2012, pp. 127-138.
    • (2012) SIGCOMM , pp. 127-138
    • Hong, C.-Y.1    Caesar, M.2    Godfrey, B.3
  • 11
    • 84866481397 scopus 로고    scopus 로고
    • Detail: Reducing the flow completion time tail in datacenter networks
    • D. Zats, T. Das, P. Mohan, D. Borthakur, and R. H. Katz, "Detail: reducing the flow completion time tail in datacenter networks," in SIGCOMM, 2012, pp. 139-150.
    • (2012) SIGCOMM , pp. 139-150
    • Zats, D.1    Das, T.2    Mohan, P.3    Borthakur, D.4    Katz, R.H.5
  • 13
    • 84883067937 scopus 로고    scopus 로고
    • Online packet scheduling with hard deadlines in multihop communication networks
    • Z. Mao, C. E. Koksal, and N. B. Shroff, "Online packet scheduling with hard deadlines in multihop communication networks," in INFOCOM, 2013.
    • (2013) INFOCOM
    • Mao, Z.1    Koksal, C.E.2    Shroff, N.B.3
  • 14
    • 70450249797 scopus 로고    scopus 로고
    • A scalable, commodity data center network architecture
    • M. Al-Fares, A. Loukissas, and A. Vahdat, "A scalable, commodity data center network architecture," in SIGCOMM, 2008.
    • (2008) SIGCOMM
    • Al-Fares, M.1    Loukissas, A.2    Vahdat, A.3
  • 15
    • 70450255244 scopus 로고    scopus 로고
    • Bcube: A high performance, server-centric network architecture for modular data centers
    • C. Guo, G. Lu, D. Li, H. Wu, X. Zhang, Y. Shi, C. Tian, Y. Zhang, and S. Lu, "Bcube: a high performance, server-centric network architecture for modular data centers," in SIGCOMM, 2009, pp. 63-74.
    • (2009) SIGCOMM , pp. 63-74
    • Guo, C.1    Lu, G.2    Li, D.3    Wu, H.4    Zhang, X.5    Shi, Y.6    Tian, C.7    Zhang, Y.8    Lu, S.9
  • 16
    • 84857370948 scopus 로고    scopus 로고
    • Routing for power minimization in the speed scaling model
    • M. Andrews, A. F. Anta, L. Zhang, and W. Zhao, "Routing for power minimization in the speed scaling model," IEEE/ACM Trans. Netw., vol. 20, no. 1, pp. 285-294, 2012.
    • (2012) IEEE/ACM Trans. Netw. , vol.20 , Issue.1 , pp. 285-294
    • Andrews, M.1    Anta, A.F.2    Zhang, L.3    Zhao, W.4
  • 17
    • 0003630894 scopus 로고
    • ser. SIAM studies in applied and numerical mathematics: Society for Industrial and Applied Mathematics. Society for Industrial and Applied Mathematics
    • Y. Nesterov and A. Nemirovskii, Interior Point Polynomial Algorithms in Convex Programming, ser. SIAM studies in applied and numerical mathematics: Society for Industrial and Applied Mathematics. Society for Industrial and Applied Mathematics, 1994.
    • (1994) Interior Point Polynomial Algorithms in Convex Programming
    • Nesterov, Y.1    Nemirovskii, A.2
  • 18
    • 0029488569 scopus 로고
    • A scheduling model for reduced cpu energy
    • F. F. Yao, A. J. Demers, and S. Shenker, "A scheduling model for reduced cpu energy," in FOCS, 1995, pp. 374-382.
    • (1995) FOCS , pp. 374-382
    • Yao, F.F.1    Demers, A.J.2    Shenker, S.3
  • 21
    • 51249173817 scopus 로고
    • Randomized rounding: A technique for provably good algorithms and algorithmic proofs
    • Dec.
    • P. Raghavan and C. D. Tompson, "Randomized rounding: a technique for provably good algorithms and algorithmic proofs," Combinatorica, vol. 7, no. 4, pp. 365-374, Dec. 1987.
    • (1987) Combinatorica , vol.7 , Issue.4 , pp. 365-374
    • Raghavan, P.1    Tompson, C.D.2
  • 23
    • 80053149976 scopus 로고    scopus 로고
    • Pcube: Improving power efficiency in data center networks
    • L. Huang, Q. Jia, X. Wang, S. Yang, and B. Li, "Pcube: Improving power efficiency in data center networks," in IEEE CLOUD, 2011, pp. 65-72.
    • (2011) IEEE CLOUD , pp. 65-72
    • Huang, L.1    Jia, Q.2    Wang, X.3    Yang, S.4    Li, B.5
  • 25
    • 84889005077 scopus 로고    scopus 로고
    • Incorporating rate adaptation into green networking for future data centers
    • L. Wang, F. Zhang, C. Hou, J. A. Aroca, and Z. Liu, "Incorporating rate adaptation into green networking for future data centers," in NCA, 2013, pp. 106-109.
    • (2013) NCA , pp. 106-109
    • Wang, L.1    Zhang, F.2    Hou, C.3    Aroca, J.A.4    Liu, Z.5
  • 26
    • 84871983069 scopus 로고    scopus 로고
    • Hero: Hierarchical energy optimization for data center networks
    • Y. Zhang and N. Ansari, "Hero: Hierarchical energy optimization for data center networks," in ICC, 2012, pp. 2924-2928.
    • (2012) ICC , pp. 2924-2928
    • Zhang, Y.1    Ansari, N.2
  • 27
    • 84891415826 scopus 로고    scopus 로고
    • Improving the network energy efficiency in mapreduce systems
    • L.Wang, F. Zhang, and Z. Liu, "Improving the network energy efficiency in mapreduce systems," in ICCCN, 2013, pp. 1-7.
    • (2013) ICCCN , pp. 1-7
    • Wang, L.1    Zhang, F.2    Liu, Z.3
  • 28
    • 84900872555 scopus 로고    scopus 로고
    • Joint virtual machine assignment and traffic engineering for green data center networks
    • L. Wang, F. Zhang, A. V. Vasilakos, C. Hou, and Z. Liu, "Joint virtual machine assignment and traffic engineering for green data center networks," SIGMETRICS Performance Evaluation Review, vol. 41, no. 3, pp. 107-112, 2013.
    • (2013) SIGMETRICS Performance Evaluation Review , vol.41 , Issue.3 , pp. 107-112
    • Wang, L.1    Zhang, F.2    Vasilakos, A.V.3    Hou, C.4    Liu, Z.5
  • 30
    • 84884204565 scopus 로고    scopus 로고
    • Greening data center networks with throughput-guaranteed power-aware routing
    • M. Xu, Y. Shang, D. Li, and X. Wang, "Greening data center networks with throughput-guaranteed power-aware routing," Computer Networks, vol. 57, no. 15, pp. 2880-2899, 2013.
    • (2013) Computer Networks , vol.57 , Issue.15 , pp. 2880-2899
    • Xu, M.1    Shang, Y.2    Li, D.3    Wang, X.4
  • 31
    • 0032662985 scopus 로고    scopus 로고
    • Packet routing with arbitrary end-to-end delay requirements
    • M. Andrews and L. Zhang, "Packet routing with arbitrary end-to-end delay requirements," in STOC, 1999, pp. 557-565.
    • (1999) STOC , pp. 557-565
    • Andrews, M.1    Zhang, L.2
  • 32
    • 84883067937 scopus 로고    scopus 로고
    • Online packet scheduling with hard deadlines in multihop communication networks
    • Z. Mao, C. E. Koksal, and N. B. Shroff, "Online packet scheduling with hard deadlines in multihop communication networks," in INFOCOM, 2013, pp. 2463-2471.
    • (2013) INFOCOM , pp. 2463-2471
    • Mao, Z.1    Koksal, C.E.2    Shroff, N.B.3
  • 33
    • 84876291931 scopus 로고    scopus 로고
    • Routing and scheduling for energy and delay minimization in the powerdown model
    • M. Andrews, A. F. Anta, L. Zhang, and W. Zhao, "Routing and scheduling for energy and delay minimization in the powerdown model," Networks, vol. 61, no. 3, pp. 226-237, 2013.
    • (2013) Networks , vol.61 , Issue.3 , pp. 226-237
    • Andrews, M.1    Anta, A.F.2    Zhang, L.3    Zhao, W.4
  • 34
    • 79960884323 scopus 로고    scopus 로고
    • Energy-aware scheduling algorithms for network stability
    • M. Andrews, S. Antonakopoulos, and L. Zhang, "Energy-aware scheduling algorithms for network stability," in INFOCOM, 2011, pp. 1359-1367.
    • (2011) INFOCOM , pp. 1359-1367
    • Andrews, M.1    Antonakopoulos, S.2    Zhang, L.3
  • 35
    • 84868524466 scopus 로고    scopus 로고
    • Scheduling algorithms for optimizing the tradeoffs between delay, queue size and energy
    • M. Andrews and L. Zhang, "Scheduling algorithms for optimizing the tradeoffs between delay, queue size and energy," in CISS, 2012, pp. 1-6.
    • (2012) CISS , pp. 1-6
    • Andrews, M.1    Zhang, L.2


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