메뉴 건너뛰기




Volumn 68, Issue , 2014, Pages 123-137

Multiple bulk data transfers scheduling among datacenters

Author keywords

Bulk data transfers scheduling; Inter datacenter traffic; Optimization models and methods; Traffic engineering

Indexed keywords

COST REDUCTION; DATA TRANSFER; ELECTRIC NETWORK TOPOLOGY; ITERATIVE METHODS; LINEAR PROGRAMMING; NETWORK ARCHITECTURE; OPTIMIZATION; PROBLEM SOLVING; TRAFFIC CONGESTION;

EID: 84902372338     PISSN: 13891286     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comnet.2014.02.017     Document Type: Article
Times cited : (63)

References (31)
  • 2
    • 84902541421 scopus 로고    scopus 로고
    • Amazon CloudFront
    • Amazon CloudFront. < http://aws.amazon.com/cn/cloudfront/ >.
  • 10
    • 84902541423 scopus 로고    scopus 로고
    • Federal Express Developer Resources Center
    • Federal Express Developer Resources Center. < http://www.fedex.com/us/ developer/ >.
  • 11
    • 34548299846 scopus 로고    scopus 로고
    • Scheduling deadline-constrained bulk data transfers to minimize network congestion
    • DOI 10.1109/CCGRID.2007.102, 4215406, Proceedings - Seventh IEEE International Symposium on Cluster Computing and the Grid, CCGrid 2007
    • B.B. Chen, and P.B. Primet Scheduling deadline-constrained bulk data transfers to minimize network congestion CCGRID 2007. Seventh IEEE International Symposium on Cluster Computing and the Grid, 2007 2007 IEEE 410 417 (Pubitemid 47334579)
    • (2007) Proceedings - Seventh IEEE International Symposium on Cluster Computing and the Grid, CCGrid 2007 , pp. 410-417
    • Chen, B.B.1    Primet, P.V.-B.2
  • 12
    • 39649085817 scopus 로고    scopus 로고
    • Scheduling bulk file transfers with start and end times
    • K. Rajah, S. Ranka, and Y. Xia Scheduling bulk file transfers with start and end times Comput. Netw. 52 5 2008 1105 1122
    • (2008) Comput. Netw. , vol.52 , Issue.5 , pp. 1105-1122
    • Rajah, K.1    Ranka, S.2    Xia, Y.3
  • 13
    • 70350046944 scopus 로고    scopus 로고
    • Advance reservations and scheduling for bulk transfers in research networks
    • K. Rajah, S. Ranka, and Y. Xia Advance reservations and scheduling for bulk transfers in research networks IEEE Trans. Parall. Distr. Syst. 20 11 2009 1682 1697
    • (2009) IEEE Trans. Parall. Distr. Syst. , vol.20 , Issue.11 , pp. 1682-1697
    • Rajah, K.1    Ranka, S.2    Xia, Y.3
  • 15
    • 85134030336 scopus 로고    scopus 로고
    • Good things come to those who (can) wait or how to handle delay tolerant traffic and make peace on the internet
    • N. Laoutaris, P. Rodriguez, Good things come to those who (can) wait or how to handle delay tolerant traffic and make peace on the internet, in: Proceedings of ACM HotNets-VII, 2008.
    • (2008) Proceedings of ACM HotNets-VII
    • Laoutaris, N.1    Rodriguez, P.2
  • 18
  • 21
    • 84861644871 scopus 로고    scopus 로고
    • Characterizing geospatial dynamics of application usage in a 3g cellular data network
    • IEEE
    • M.Z. Shafiq, L. Ji, A.X. Liu, J. Pang, and J. Wang Characterizing geospatial dynamics of application usage in a 3g cellular data network INFOCOM, 2012 Proceedings IEEE 2012 IEEE 1341 1349
    • (2012) INFOCOM, 2012 Proceedings IEEE , pp. 1341-1349
    • Shafiq, M.Z.1    Ji, L.2    Liu, A.X.3    Pang, J.4    Wang, J.5
  • 23
    • 0001424107 scopus 로고
    • Constructing maximal dynamic flows from static flows
    • L. Ford Jr, and D. Fulkerson Constructing maximal dynamic flows from static flows Oper. Res. 1958 419 433
    • (1958) Oper. Res. , pp. 419-433
    • Ford, Jr.L.1    Fulkerson, D.2
  • 25
    • 67349166529 scopus 로고    scopus 로고
    • Max-min fairness and its applications to routing and load-balancing in communication networks: A tutorial
    • D. Nace, and M. Pióro Max-min fairness and its applications to routing and load-balancing in communication networks: a tutorial Commun. Surv. Tutor. IEEE 10 4 2008 5 17
    • (2008) Commun. Surv. Tutor. IEEE , vol.10 , Issue.4 , pp. 5-17
    • Nace, D.1    Pióro, M.2
  • 26
    • 84902541424 scopus 로고    scopus 로고
    • GNU Linear Programming Kit
    • GNU Linear Programming Kit. < http://www.gnu.org/s/glpk/ >.
  • 30
    • 0028123963 scopus 로고
    • Improved approximation algorithms for the multi-commodity flow problem and local competitive routing in dynamic networks
    • ACM
    • B. Awerbuch, and T. Leighton Improved approximation algorithms for the multi-commodity flow problem and local competitive routing in dynamic networks Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing 1994 ACM 487 496
    • (1994) Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing , pp. 487-496
    • Awerbuch, B.1    Leighton, T.2


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