Scheduling bulk file transfers with start and end times

Computer Networks

Volumn 52, Issue 5, 2008, Pages 1105-1122

  Rajah, Kannan ^a   Ranka, Sanjay ^a   Xia, Ye ^a  

^a UNIVERSITY OF FLORIDA   (United States)

Author keywords

Bulk file transfers; E science; Maximum concurrent flow; Multipath; Optical networks; Rerouting; Scheduling

Indexed keywords

CONSTRAINT THEORY; DATA TRANSFER; ONLINE SYSTEMS; SCHEDULING;

BULK FILE TRANSFERS; PERFORMANCE OBJECTIVES;

FIBER OPTIC NETWORKS;

EID: 39649085817     PISSN: 13891286     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comnet.2007.12.005     Document Type: Article

References (47)

1. Abilene, .
2. Paul Avery, Grid computing in high energy physics, in: Proceedings of the International Beauty 2003 Conference, Pittsburgh, PA, October 2003.
3. B. Awerbuch, F.T. Leighton, A simple local-control approximation algorithm for multicommodity flow, in: Proceedings of the IEEE Symposium on Theory of Computing, 1993, pp. 459-468.
4. B. Awerbuch, F.T. Leighton, Improved approximation algorithms for multi-commodity flow problem and local competitive routing in dynamic networks, in: Proceedings of the ACM Symposium on Theory of Computing, 1994, pp. 487-496.
5. Banerjee D., and Mukherjee B. Wavelength-routed optical networks: linear formulation, resource budgeting tradeoffs, and a reconfiguration study. IEEE/ACM Transactions on Networking 8 5 (2000) 598-607
6. Bhatia R., Kodialam M., and Lakshman T.V. Fast network re-optimization schemes for MPLS and optical networks. Computer Networks 50 3 (2006)
7. Bouillet E., Labourdette J.-F., Ramamurthy R., and Chaudhuri S. Lightpath re-optimization in mesh optical networks. IEEE/ACM Transactions on Networking 13 2 (2005) 437-447
8. Andrej Brodnik, Andreas Nilsson, A static data structure for discrete advance bandwidth reservations on the Internet, Technical Report cs.DS/0308041, Department of Computer Science and Electrical Engineering, Luleå University of Technology, Sweden, 2003.
9. Bunn J., and Newman H. Data-intensive grids for high-energy physics. In: Berman F., Fox G., and Hey T. (Eds). Grid Computing: Making the Global Infrastructure a Reality (2003), John Wiley & Sons, Inc.
10. L.-O. Burchard, Source routing algorithms for networks with advance reservations, Technical Report 2003-03, Communications and Operating Systems Group, Technical University of Berlin, 2003.
11. Burchard L.-O. Networks with advance reservations: applications, architecture, and performance. Journal of Network and Systems Management 13 4 (2005) 429-449
12. L.-O. Burchard, H.-U. Heiss, Performance evaluation of data structures for admission control in bandwidth brokers, Technical Report TR-KBS-01-02, Communications and Operating Systems Group, Technical University of Berlin, 2002.
13. L.-O. Burchard, H.-U. Heiss, Performance issues of bandwidth reservation for grid computing, in: Proceedings of the 15th Symposium on Computer Architecture and High Performance Computing (SBAC-PAD'03), 2003.
14. L.-O. Burchard, J. Schneider, B. Linnert, Rerouting strategies for networks with advance reservations, in: Proceedings of the First IEEE International Conference on e-Science and Grid Computing (e-Science 2005), Melbourne, Australia, December 2005.
15. CA*net4, .
16. CERN, .
17. Compact Muon Solenoid (CMS), .
18. Dunn D.A., Grover W.D., and MacGregor M.H. Comparison of k-shortest paths and maximum flow routing for network facility restoration. IEEE Journal on Selected Areas in Communications 12 1 (1994) 88-99
19. The Earth System Grid (ESG), .
20. EarthScope, .
21. E. Mannie (Ed.), Generalized multi-protocol label switching (GMPLS) architecture, RFC 3945, IETF, October 2004.
22. T. Erlebach, Call admission control for advance reservation requests with alternatives, Technical Report TIK-Report Nr. 142, Computer Engineering and Networks Laboratory, Swiss Federal Institute of Technology (ETH) Zurich, 2002.
23. Curti C., et al. On advance reservation of heterogeneous network paths. Future Generation Computer Systems 21 4 (2005) 525-538
24. Fleischer L.K. Approximating fractional multicommodity flow independent of the number of commodities. SIAM Journal of Discrete Mathematics 13 4 (2000) 505-520
25. I. Foster, C. Kesselman, C. Lee, R. Lindell, K. Nahrstedt, A. Roy, A distributed resource management architecture that supports advance reservations and co-allocation, in: Proceedings of the International Workshop on Quality of Service (IWQoS'99), 1999.
26. N. Garg, J. Köenemann, Faster and simpler algorithms for multi-commodity flow and other fractional packing problems, in: Proceedings of the 39th Annual Symposium on Foundations of Computer Science, November 1998, pp. 300-309.
27. R. Guerin, A. Orda, Networks with advance reservations: the routing perspective, in: Proceedings of IEEE INFOCOM 99, 1999.
28. E. He, X. Wang, J. Leigh, A flexible advance reservation model for multi-domain WDM optical networks, in: Proceedings of GRIDNETS 2006, San Jose, CA, 2006.
29. E. He, X. Wang, V. Vishwanath, J. Leigh, AR-PIN/PDC: Flexible advance reservation of intradomain and interdomain lightpaths, in: Proceedings of the IEEE GLOBECOM 2006, 2006.
30. Internet2, .
31. Joint Institute for Very Long Baseline Interferometry (JIVE), .
32. Jon Kleinberg, Approximation Algorithms for Disjoint Paths Problems, PhD thesis, Massachusetts Institute of Technology, 1996.
33. Lehman T., Sobieski J., and Jabbari B. DRAGON: a framework for service provisioning in heterogeneous grid networks. IEEE Communications Magazine March (2006)
34. L. Lewin-Eytan, J. Naor, A. Orda, Routing and admission control in networks with advance reservation, in: Proceedings of the Fifth International Workshop on Approximation Algorithms for Combinatorial Optimization (APPROX 02), 2002.
35. L. Marchal, P. Vicat-Blanc Primet, Y. Robert, J. Zeng, Scheduling network requests with transmission window, Technical Report 2005-32, LIP, ENS Lyon, France, 2005.
36. National Lambda Rail, .
37. Newman H.B., Ellisman M.H., and Orcutt J.A. Data-intensive e-science frontier research. Communications of the ACM 46 11 (2003) 68-77
38. The Particle Physics Data Grid (PPDG), .
39. Kannan Rajah, Sanjay Ranka, Ye Xia, Advance Reservation and Scheduling of Large Transfer in e-science (manuscript).
40. O. Schelén, A. Nilsson, Joakim Norrgård, S. Pink, Performance of QoS agents for provisioning network resources, in: Proceedings of IFIP Seventh International Workshop on Quality of Service (IWQoS'99), London, UK, June 1999.
41. Shahrokhi F., and Matula D.W. The maximum concurrent flow problem. Journal of the Association for Computing Machinery 37 2 (1990) 318-334
42. SURFnet, .
43. Suurballe J.W. Disjoint paths in a network. Networks 4 2 (1974) 125-145
44. Tao Wang, Jianer Chen, Bandwidth tree - a data structure for routing in networks with advanced reservations, in: Proceedings of the IEEE International Performance, Computing and Communications Conference (IPCCC 2002), April 2002.
45. Qing Xiong, Chanle Wu, Jianbing Xing, Libing Wu, Huyin Zhang, A linked-list data structure for advance reservation admission control, in: ICCNMC 2005, Lecture Notes in Computer Science, vol. 3619/2005, 2005.
46. Yen J.Y. Finding the k shortest loopless paths in a network. Management Science 17 11 (1971) 712-716
47. Jun Zheng, Hussein T. Mouftah, Routing and wavelength assignment for advance reservation in wavelength-routed WDM optical networks, in: Proceedings of the IEEE International Conference on Communications (ICC), 2002.