End-to-end network QoS via scheduling of flexible resource reservation requests

Modern data-intensive applications move vast amounts of data between multiple locations around the world. To enable predictable and reliable data transfers, next generation networks allow such applications to reserve network resources for exclusive use. In this paper, we solve an important problem (called SMR3) to accommodate multiple and concurrent network reservation requests between a pair of end sites. Given the varying availability of bandwidth within the network, our goal is to accommodate as many reservation requests as possible while minimizing the total time needed to complete the data transfers. First, we prove that SMR3 is an NP-hard problem. Then, we solve it by developing a polynomial-time heuristic called RRA. The RRA algorithm hinges on an efficient mechanism to accommodate large number of requests in an iterative manner. Finally, we show via numerical results that RRA constructs schedules that accommodate significantly larger number of requests compared to other, seemingly efficient, heuristics.

[1]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[2]  Scott Shenker,et al.  Integrated Services in the Internet Architecture : an Overview Status of this Memo , 1994 .

[3]  R. Braden,et al.  Resource reSer Vation Protocol (RSVP) , 1997 .

[4]  Lixia Zhang,et al.  Resource ReSerVation Protocol (RSVP) - Version 1 Functional Specification , 1997, RFC.

[5]  Eric S. Crawley,et al.  A Framework for QoS-based Routing in the Internet , 1998, RFC.

[6]  Warren P. Adams,et al.  A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems , 1998 .

[7]  David L. Black,et al.  An Architecture for Differentiated Service , 1998 .

[8]  G. W..  The Internet 2 , 1999 .

[9]  Sanjeev Khanna,et al.  A PTAS for the multiple knapsack problem , 2000, SODA '00.

[10]  Ariel Orda,et al.  Networks with advance reservations: the routing perspective , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[11]  Ossama Younis,et al.  Constraint-based routing in the internet: Basic principles and recent research , 2003, IEEE Communications Surveys & Tutorials.

[12]  Sumit Naiksatam,et al.  Elastic reservations for efficient bandwidth utilization in LambdaGrids , 2007, Future Gener. Comput. Syst..

[13]  Sanjay Ranka,et al.  Advance Reservations and Scheduling for Bulk Transfers in Research Networks , 2009, IEEE Transactions on Parallel and Distributed Systems.

[14]  Thomas G. Robertazzi,et al.  TeraPaths: End-to-End Network Resource Scheduling in High-Impact Network Domains , 2010 .

[15]  Arie Shoshani,et al.  StorNet: Co-scheduling of end-to-end bandwidth reservation on storage and network systems for high-performance data transfers , 2011, 2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS).