The Community for Technology Leaders
RSS Icon
Issue No.11 - November (2009 vol.20)
pp: 1682-1697
Kannan Rajah , VMware, Sunnyvale
Sanjay Ranka , University of Florida, Gainesville
Ye Xia , University of Florida, Gainesville
Data-intensive e-science collaborations often require the transfer of large files with predictable performance. To meet this need, we design novel admission control (AC) and scheduling algorithms for bulk data transfer in research networks for e-science. Due to their small sizes, the research networks can afford a centralized resource management platform. In our design, each bulk transfer job request, which can be made in advance to the central network controller, specifies a start time and an end time. If admitted, the network guarantees to complete the transfer before the end time. However, there is flexibility in how the actual transfer is carried out, that is, in the bandwidth assignment on each allowed path of the job on each time interval, and it is up to the scheduling algorithm to decide this. To improve the network resource utilization or lower the job rejection ratio, the network controller solves optimization problems in making AC and scheduling decisions. Our design combines the following elements into a cohesive optimization-based framework: advance reservations, multipath routing, and bandwidth reassignment via periodic reoptimization. We evaluate our algorithm in terms of both network efficiency and the performance level of individual transfer. We also evaluate the feasibility of our scheme by studying the algorithm execution time.
Admission control, advance reservation, bulk data transfer, e-science, grid computing, scheduling, multipath routing, network flow.
Kannan Rajah, Sanjay Ranka, Ye Xia, "Advance Reservations and Scheduling for Bulk Transfers in Research Networks", IEEE Transactions on Parallel & Distributed Systems, vol.20, no. 11, pp. 1682-1697, November 2009, doi:10.1109/TPDS.2008.250
[1] The U.K. Research Councils, /, Feb. 2008.
[2] I. Foster and C. Kesselman, The Grid: Blueprint for a New Computing Infrastructure. Morgan Kaufmann, 1999.
[3] H.B. Newman, M.H. Ellisman, and J.A. Orcutt, “Data-Intensive e-Science Frontier Research,” Comm. ACM, vol. 46, no. 11, pp.68-77, Nov. 2003.
[4] J. Bunn and H. Newman, “Data-Intensive Grids for High-Energy Physics,” Grid Computing: Making the Global Infrastructure a Reality, F. Berman, G. Fox, and T. Hey, eds., John Wiley & Sons, 2003.
[5] T. DeFanti, C.d. Laat, J. Mambretti, K. Neggers, and B. Arnaud, “TransLight: A Global-Scale LambdaGrid for e-Science,” Comm. ACM, vol. 46, no. 11, pp. 34-41, Nov. 2003.
[6] National Lambda Rail, http:/, Feb. 2008.
[7] Abilene Network, http://www.internet2.edunetwork/, Feb. 2008.
[8] ${\rm CA}^{\ast}{\rm net}4$ ,, Feb. 2008.
[9] I. Foster, C. Kesselman, C. Lee, R. Lindell, K. Nahrstedt, and A. Roy, “A Distributed Resource Management Architecture that Supports Advance Reservations and Co-Allocation,” Proc. IFIP Seventh Int'l Workshop Quality of Service (IWQoS), 1999.
[10] The Globus Alliance, http:/, Feb. 2008.
[11] T. Lehman, J. Sobieski, and B. Jabbari, “DRAGON: A Framework for Service Provisioning in Heterogeneous Grid Networks,” IEEE Comm. Magazine, Mar. 2006.
[12] T. Ferrari, Grid Network Services Use Cases from the e-Science Community, The Open Grid Forum, Comment_Docs/ Documents/Jul-2007draft-ggf-ghpn-netser vices-usecases-2-12.pdf , site last visited on Feb. 18, 2008. Dec. 2007.
[13] S. Naiksatam and S. Figueira, “Elastic Reservations for Efficient Bandwidth Utilization in LambdaGrids,” The Int'l J. Grid Computing, vol. 23, no. 1, pp. 1-22, Jan. 2007.
[14] B.B. Chen and P.V.-B. Primet, “Scheduling Deadline-Constrained Bulk Data Transfers to Minimize Network Congestion,” Proc.Seventh IEEE Int'l Symp. Cluster Computing and the Grid (CCGRID '07), May 2007.
[15] L. Marchal, P. Primet, Y. Robert, and J. Zeng, “Optimal Bandwidth Sharing in Grid Environment,” Proc. IEEE High Performance Distributed Computing (HPDC '06), June 2006.
[16] K. Rajah, S. Ranka, and Y. Xia, “Scheduling Bulk File Transfers with Start and End Times,” Computer Networks, vol. 52, no. 5, pp.1105-1122, Apr. 2008.
[17] K. Munir, S. Javed, M. Welzl, and M. Junaid, “Using an Event Based Priority Queue for Reliable and Opportunistic Scheduling of Bulk Data Transfers in Grid Networks,” Proc. 11th IEEE Int'l Multitopic Conf. (INMIC '07), Dec. 2007.
[18] K. Munir, S. Javed, M. Welzl, H. Ehsan, and T. Javed, “An End-to-End QoS Mechanism for Grid Bulk Data Transfer for Supporting Virtualization,” Proc. IEEE/IFIP Int'l Workshop End-to-End Virtualization and Grid Management (EVGM '07), Oct. 2007.
[19] K. Munir, S. Javed, and M. Welzl, “A Reliable and Realistic Approach of Advance Network Reservations with Guaranteed Completion Time for Bulk Data Transfers in Grids,” Proc. ACM Int'l Conf. Networks for Grid Applications (GridNets '07), Oct. 2007.
[20] R. Guerin and A. Orda, “Networks with Advance Reservations: The Routing Perspective,” Proc. IEEE INFOCOM, 1999.
[21] L.-O. Burchard and H.-U. Heiss, “Performance Issues of Bandwidth Reservation for Grid Computing,” Proc. 15th Symp. Computer Architecture and High Performance Computing (SBAC-PAD), 2003.
[22] E. He, X. Wang, V. Vishwanath, and J. Leigh, “AR-PIN/PDC: Flexible Advance Reservation of Intradomain and Interdomain Lightpaths,” Proc. IEEE GLOBECOM, 2006.
[23] M. Crovella and A. Bestavros, “Self-Similarity in World Wide Web Traffic: Evidence and Possible Causes,” IEEE/ACM Trans. Networking, vol. 5, no. 6, pp. 835-846, Dec. 1997.
[24] D.E. McDysan and D.L. Spohn, ATM Theory and Applications. McGraw-Hill, 1998.
[25] E. Rosen, A. Viswanathan, and R. Callon, Multiprotocol Label Switching Architecture, RFC 3031, IETF, Jan. 2001.
[26] F.P. Kelly, P.B. Key, and S. Zachary, “Distributed Admission Control,” IEEE J. Selected Areas in Comm., vol. 18, no. 12, Dec. 2000.
[27] G. de Veciana, G. Kesidis, and J. Walrand, “Resource Management in Wide-Area ATM Networks Using Effective Bandwidths,” IEEE J. Selected Areas in Comm., vol. 13, no. 6, pp. 1081-1090, Aug. 1995.
[28] R. Braden, D. Clark, and S. Shenker, Integrated Services in the Internet Architecture: An Overview, RFC 1633, IETF, June 1994.
[29] S. Blake, D. Black, M. Carlson, E. Davies, Z. Wang, and W. Weiss, An Architecture for Differentiated Services, RFC 2475, IETF, Dec. 1998.
[30] O. Schelén, A. Nilsson, J. Norrgård, and S. Pink, “Performance of QoS Agents for Provisioning Network Resources,” Proc. IFIP Seventh Int'l Workshop Quality of Service (IWQoS '99), June 1999.
[31] A. Brodnik and A. Nilsson, “A Static Data Structure for Discrete Advance Bandwidth Reservations on the Internet,” Technical Report cs.DS/0308041, Dept. Computer Science and Electrical Eng., Luleå Univ. of Tech nology, 2003.
[32] L.-O. Burchard, J. Schneider, and B. Linnert, “Rerouting Strategies for Networks with Advance Reservations,” Proc. First IEEE Int'l Conf. e-Science and Grid Computing (e-Science '05), Dec. 2005.
[33] Q. Xiong, C. Wu, J. Xing, L. Wu, and H. Zhang, “A Linked-List Data Structure for Advance Reservation Admission Control,” Proc. IEEE Int'l Conf. Computer Networks and Mobile Computing (ICCNMC), 2005.
[34] T. Wang and J. Chen, “Bandwidth Tree—A Data Structure for Routing in Networks with Advanced Reservations,” Proc. IEEE Int'l Performance, Computing and Comm. Conf. (IPCCC'02), Apr. 2002.
[35] T. Erlebach, “Call Admission Control for Advance Reservation Requests with Alternatives,” Technical Report TIK-Report No. 142, Computer Eng. and Networks Laboratory, Swiss Fed. Inst. Technology (ETH) Zurich, 2002.
[36] L. Lewin-Eytan, J. Naor, and A. Orda, “Routing and Admission Control in Networks with Advance Reservations,” Proc. Fifth Int'l Workshop Approximation Algorithms for Combinatorial Optimization (APPROX), 2002.
[37] R. Bhatia, M. Kodialam, and T.V. Lakshman, “Fast Network Re-Optimization Schemes for MPLS and Optical Networks,” Computer Networks, vol. 50, no. 3, Feb. 2006.
[38] D. Banerjee and B. Mukherjee, “Wavelength-Routed Optical Networks: Linear Formulation, Resource Budgeting Tradeoffs, and a Reconfiguration Study,” IEEE/ACM Trans. Networking, vol. 8, no. 5, pp. 598-607, Oct. 2000.
[39] E. Bouillet, J.-F. Labourdette, R. Ramamurthy, and S. Chaudhuri, “Lightpath Re-Optimization in Mesh Optical Networks,” IEEE/ACM Trans. Networking, vol. 13, no. 2, pp. 437-447, 2005.
[40] E. Mannie, Generalized Multi-Protocol Label Switching (GMPLS) Architecture, RFC 3945, IETF, Oct. 2004.
[41] C. Curti, T. Ferrari, L. Gommans, B. van Oudenaarde, E. Ronchieri, F. Giacomini, and C. Vistoli, “On Advance Reservation of Heterogeneous Network Paths,” Future Generation Computer Systems, vol. 21, no. 4, pp. 525-538, Apr. 2005.
[42] S.R. Thorpe, D. Stevenson, and G.K. Edwards, “Using Just-in-Time to Enable Optical Networking for Grids,” First ICST/IEEE Int'l Workshop Networks for Grid Applications (GridNets), 2004.
[43] J. Mambretti et al., “The Photonic TeraStream: Enabling Next Generation Applications Through Intelligent Optical Networking at iGRID2002,” Future Generation Computer Systems, vol. 19, no. 6, pp. 897-908, Aug. 2003.
[44] R. Boutaba, W. Golab, Y. Iraqi, T. Li, and B. Arnaud, “Grid-Controlled Lightpaths for High Performance Grid Applications,” J. Grid Computing, vol. 1, no. 4, pp. 387-394, Dec. 2003.
[45] L.-O. Burchard, “Networks with Advance Reservations: Applications, Architecture, and Performance,” J. Network and Systems Management, vol. 13, no. 4, pp. 429-449, Dec. 2005.
[46] N. Garg and J. Köenemann, “Faster and Simpler Algorithms for Multi-Commodity Flow and Other Fractional Packing Problems,” Proc. 39th Ann. Symp. Foundations of Computer Science (FOCS '98), pp. 300-309, Nov. 1998.
[47] B. Awerbuch and F.T. Leighton, “Improved Approximation Algorithms for Multi-Commodity Flow Problem and Local Competitive Routing in Dynamic Networks,” Proc. 26th Ann. ACM Symp. Theory of Computing (STOC '94), pp. 487-496, 1994.
15 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool