메뉴 건너뛰기




Volumn , Issue , 2011, Pages 71-80

Budget-constrained bulk data transfer via internet and shipping networks

Author keywords

cloud computing; data intensive computing; wide area data transfer

Indexed keywords

AUTONOMIC SYSTEMS; BINARY SEARCH; BUDGET CONSTRAINT; BULK DATA TRANSFER; CRITICAL STEPS; DATA-INTENSIVE COMPUTING; EXPERIMENTAL EVALUATION; LARGE AMOUNTS OF DATA; OPTIMAL TRANSFERS; PLANNING PROBLEM; SOLUTION SPACE; TRANSFER LATENCY; WIDE AREA;

EID: 79960152104     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1998582.1998595     Document Type: Conference Paper
Times cited : (31)

References (25)
  • 1
  • 5
    • 77955882930 scopus 로고    scopus 로고
    • Website
    • "UPS Online Tools," Website, http://www.ups.com/e comm access.
    • UPS Online Tools
  • 7
    • 77955914560 scopus 로고    scopus 로고
    • New Algorithms for Planning Bulk Transfer via Internet and Shipping Networks
    • B. Cho and I. Gupta, "New Algorithms for Planning Bulk Transfer via Internet and Shipping Networks," in Proc. of IEEE ICDCS, 2010.
    • Proc. of IEEE ICDCS, 2010
    • Cho, B.1    Gupta, I.2
  • 9
    • 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
  • 10
    • 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
  • 12
    • 36949024394 scopus 로고    scopus 로고
    • Bridging the digital divide: Storage media + postal network = generic high-bandwidth communication
    • N. Garg, S. Sobti, J. Lai, F. Zheng, K. Li, R. Y. Wang, and A. Krishnamurthy, "Bridging the digital divide: storage media + postal network = generic high-bandwidth communication," Trans. Storage, vol. 1, no. 2, pp. 246-275, 2005.
    • (2005) Trans. Storage , vol.1 , Issue.2 , pp. 246-275
    • Garg, N.1    Sobti, S.2    Lai, J.3    Zheng, F.4    Li, K.5    Wang, R.Y.6    Krishnamurthy, A.7
  • 13
    • 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
  • 15
    • 0034138344 scopus 로고    scopus 로고
    • The Quickest Transshipment Problem
    • B. Hoppe and E. Tardos, "The Quickest Transshipment Problem," Math. Oper. Res., vol. 25, no. 1, pp. 36-62, 2000.
    • (2000) Math. Oper. Res. , vol.25 , Issue.1 , pp. 36-62
    • Hoppe, B.1    Tardos, E.2
  • 18
    • 0036439218 scopus 로고    scopus 로고
    • Solving fixed-charge network flow problems with a hybrid optimization and constraint programming approach
    • H.-J. Kim and J. N. Hooker, "Solving fixed-charge network flow problems with a hybrid optimization and constraint programming approach," Annals of Operations Research, vol. 115, pp. 95-124, 2002.
    • (2002) Annals of Operations Research , vol.115 , pp. 95-124
    • Kim, H.-J.1    Hooker, J.N.2
  • 19
    • 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가 분석하여 추출한 것입니다.