메뉴 건너뛰기




Volumn , Issue , 2010, Pages 305-314

New algorithms for planning bulk transfer via internet and shipping networks

Author keywords

[No Author keywords available]

Indexed keywords

BULK TRANSFER; BUSINESS PARTNERS; CLOUD COMPUTING; DATA CENTERS; DATA SETS; EXPERIMENTAL EVALUATION; GROUP-BASED; NOVEL ALGORITHM; NP-HARDNESS; PLANETLAB; PLANNING SYSTEMS; PROGRAMMING TECHNIQUE; STORAGE DEVICES; TOTAL TRANSFER; TRANSFER PROBLEMS;

EID: 77955914560     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDCS.2010.59     Document Type: Conference Paper
Times cited : (24)

References (31)
  • 1
  • 2
    • 84871950357 scopus 로고    scopus 로고
    • Website
    • "BitTorrent," Website, http://www.bittorrent.com/.
    • BitTorrent
  • 5
    • 77957936026 scopus 로고    scopus 로고
    • Website
    • "Google App Engine," Website, http://code.google.com/appengine/ .
    • Google App Engine
  • 6
    • 77955883889 scopus 로고    scopus 로고
    • Website
    • "GridFTP," Website, http://www.globus.org/toolkit/docs/4.0/ data/gridftp/.
    • GridFTP
  • 7
    • 77955855150 scopus 로고    scopus 로고
    • Website
    • "Hadoop," Website, http://hadoop.apache.org/.
    • Hadoop
  • 8
    • 74349113862 scopus 로고    scopus 로고
    • Website
    • "IBM Blue Cloud," Website, http://www-03.ibm.com/press/us/en/ pressrelease/22613.wss.
    • IBM Blue Cloud
  • 11
    • 85015587674 scopus 로고    scopus 로고
    • Website
    • "Open Cirrus," Website, http://www.opencirrus.org.
    • Open Cirrus
  • 13
    • 77955882930 scopus 로고    scopus 로고
    • Website
    • "UPS Online Tools," Website, http://www.ups.com/e-comm-access.
    • UPS Online Tools
  • 16
    • 67650569302 scopus 로고    scopus 로고
    • Emergence of the academic clouds
    • Aug
    • K. A. Delic and M. A. Walker, "Emergence of the academic clouds," ACM Ubiquity, vol. 9, Aug 2008.
    • (2008) ACM Ubiquity , vol.9
    • Delic, K.A.1    Walker, M.A.2
  • 17
    • 0015330635 scopus 로고
    • Theoretical improvements in algorithmic efficiency for network flow problems
    • J. Edmonds and R. M. Karp, "Theoretical improvements in algorithmic efficiency for network flow problems," J. ACM, vol. 19, no. 2, pp. 248-264, 1972.
    • (1972) J. ACM , vol.19 , Issue.2 , pp. 248-264
    • Edmonds, J.1    Karp, R.M.2
  • 18
    • 34247544986 scopus 로고    scopus 로고
    • Quickest Flows over Time
    • L. Fleischer and M. Skutella, "Quickest Flows Over Time," SIAM J. Computing, vol. 36, no. 6, pp. 1600-1630, 2007.
    • (2007) SIAM J. Computing , vol.36 , Issue.6 , pp. 1600-1630
    • Fleischer, L.1    Skutella, M.2
  • 19
    • 0001424107 scopus 로고
    • Constructing Maximal Dynamic Flows from Static Flows
    • L. R. Ford and D. R. Fulkerson, "Constructing Maximal Dynamic Flows from Static Flows," Operations Research, vol. 6, no. 3, pp. 419-433, 1958.
    • (1958) Operations Research , vol.6 , Issue.3 , pp. 419-433
    • Ford, L.R.1    Fulkerson, D.R.2
  • 21
    • 0024755290 scopus 로고
    • Finding minimum-cost circulations by canceling negative cycles
    • A. V. Goldberg and R. E. Tarjan, "Finding minimum-cost circulations by canceling negative cycles," J. ACM, vol. 36, no. 4, pp. 873-886, 1989.
    • (1989) J. ACM , vol.36 , Issue.4 , pp. 873-886
    • Goldberg, A.V.1    Tarjan, R.E.2
  • 22
    • 4143144615 scopus 로고    scopus 로고
    • A conversation with Jim Gray
    • J. Gray and D. Patterson, "A conversation with Jim Gray," ACM Queue, vol. 1, no. 4, pp. 8-17, 2003.
    • (2003) ACM Queue , vol.1 , Issue.4 , pp. 8-17
    • Gray, J.1    Patterson, D.2
  • 23
    • 84948978064 scopus 로고    scopus 로고
    • Minimum Cost Dynamic Flows: The Series-Parallel Case
    • B. Klinz and G. J. Woeginger, "Minimum Cost Dynamic Flows: The Series-Parallel Case," in Proc. of IPCO, 1995, pp. 329-343.
    • Proc. of IPCO, 1995 , pp. 329-343
    • Klinz, B.1    Woeginger, G.J.2
  • 25
    • 51849134699 scopus 로고    scopus 로고
    • Scale and performance in the CoBlitz large-file distribution service
    • K. Park and V. S. Pai, "Scale and performance in the CoBlitz large-file distribution service," in Proc. of USENIX NSDI, 2006, pp. 29-44.
    • Proc. of USENIX NSDI, 2006 , pp. 29-44
    • Park, K.1    Pai, V.S.2


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