Routing and scheduling connections in networks that support advance reservations

A key problem in networks that support advance reservations is the routing and time scheduling of connections with flexible starting time and known data transfer size. In this paper we present a multicost routing and scheduling algorithm for selecting the path to be followed by such a connection and the time the data should start and end transmission at each link so as to minimize the reception time at the destination, or optimize some other performance criterion. The utilization profiles of the network links, the link propagation delays, and the parameters of the connection to be scheduled form the inputs to the algorithm. We initially present a scheme of non-polynomial complexity to compute a set of so-called non-dominated candidate paths, from which the optimal path can be found. We then propose two mechanisms to appropriately prune the set of candidate paths in order to find multicost routing and scheduling algorithms of polynomial complexity. We examine the performance of the algorithms in the special case of an Optical Burst Switched network. Our results indicate that the proposed polynomial-time algorithms have performance that is very close to that of the optimal algorithm. We also study the effects network propagation delays and link-state update policies have on performance.

[1]  Olov Schelén,et al.  Sharing Resources through Advance Reservation Agents , 1997 .

[2]  H. T. Mouftah,et al.  Routing and wavelength assignment for advance reservation in wavelength-routed WDM optical networks , 2002, 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333).

[3]  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).

[4]  Klara Nahrstedt,et al.  A distributed resource management architecture that supports advance reservations and co-allocation , 1999, 1999 Seventh International Workshop on Quality of Service. IWQoS'99. (Cat. No.98EX354).

[5]  Jonathan S. Turner,et al.  Terabit burst switching , 1999, J. High Speed Networks.

[6]  Alpár Jüttner,et al.  Lagrange relaxation based method for the QoS routing problem , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[7]  Alexander Schill,et al.  Design and evaluation of an advance reservation protocol on top of RSVP , 1998, Broadband Communications.

[8]  Halima Elbiaze,et al.  An efficient adaptive offset mechanism to reduce burst losses in OBS networks , 2005, GLOBECOM '05. IEEE Global Telecommunications Conference, 2005..

[9]  Giorgio Ventre,et al.  Distributed advance reservation of real-time connections , 1997, Multimedia Systems.

[10]  Piet Van Mieghem,et al.  Concepts of exact QoS routing algorithms , 2004, IEEE/ACM Transactions on Networking.

[11]  Chunming Qiao,et al.  Efficient channel scheduling algorithms in optical burst switched networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[12]  Jon Crowcroft,et al.  Quality-of-Service Routing for Supporting Multimedia Applications , 1996, IEEE J. Sel. Areas Commun..

[13]  Gang Liu,et al.  A*Prune: an algorithm for finding K shortest paths subject to multiple constraints , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[14]  Fernando A. Kuipers,et al.  An overview of constraint-based path selection algorithms for QoS routing , 2002 .

[15]  Ian Foster,et al.  The Grid 2 - Blueprint for a New Computing Infrastructure, Second Edition , 1998, The Grid 2, 2nd Edition.

[16]  Chunming Qiao,et al.  Optical burst switching (OBS) - a new paradigm for an Optical Internet^{1} , 1999, J. High Speed Networks.

[17]  Kaizar Amin,et al.  Analysis and Provision of QoS for Distributed Grid Applications , 2004, Journal of Grid Computing.

[18]  Klara Nahrstedt,et al.  On finding multi-constrained paths , 1998, ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220).

[19]  George N. Rouskas,et al.  JumpStart: a just-in-time signaling architecture for WDM burst-switched networks , 2002 .

[20]  Ralf Steinmetz,et al.  Issues ofReserving Resources in Advance , 1995, NOSSDAV.

[21]  Warren Smith,et al.  Scheduling with advanced reservations , 2000, Proceedings 14th International Parallel and Distributed Processing Symposium. IPDPS 2000.

[22]  Emmanouel A. Varvarigos,et al.  The ready-to-go virtual circuit protocol: a loss-free protocol for multigigabit networks using FIFO buffers , 1997, TNET.

[23]  Xi Wang,et al.  CAM03-6: AR-PIN/PDC: Flexible Advance Reservation of Intradomain and Interdomain Lightpaths , 2006, IEEE Globecom 2006.

[24]  Chunming Qiao,et al.  High-speed protocol for bursty traffic in optical networks , 1997, Other Conferences.

[25]  Scott Shenker,et al.  Specification of Guaranteed Quality of Service , 1997, RFC.

[26]  Emmanouel Varvarigos,et al.  An Efficient Reservation Connection Control Protocol for Gigabit Networks , 1998, Comput. Networks.

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

[28]  H. Mouftah,et al.  Robust optical burst switching , 2004, 11th International Telecommunications Network Strategy and Planning Symposium. NETWORKS 2004,.

[29]  Xin Yuan.  Heuristic algorithms for multiconstrained quality-of-service routing , 2002, IEEE/ACM Trans. Netw..

[30]  Emmanouel A. Varvarigos,et al.  A Bandwidth Monitoring Mechanism Enhancing SNMP to Record Timed Resource Reservations , 2006, Journal of Network and Systems Management.

[31]  Douglas S. Reeves,et al.  A distributed algorithm for delay-constrained unicast routing , 2000, TNET.

[32]  M. Duser,et al.  Analysis of a dynamically wavelength-routed optical burst switched network architecture , 2002 .

[33]  Klara Nahrstedt,et al.  Resource Management in Networked Multimedia Systems , 1995, Computer.

[34]  Huyin Zhang,et al.  Flexible Advance Reservation for Grid Computing , 2004, GCC.

[35]  George N. Rouskas,et al.  On the Design of Online Scheduling Algorithms for Advance Reservations and QoS in Grids , 2007, 2007 IEEE International Parallel and Distributed Processing Symposium.

[36]  Polina Bayvel,et al.  Dynamic wavelength-routed optical burst-switched networks: scalability analysis and comparison with static wavelength-routed optical networks , 2003, OFC 2003 Optical Fiber Communications Conference, 2003..

[37]  Emmanouel A. Varvarigos,et al.  Relaxing Delayed Reservations: An approach for Quality of Service differentiation in Optical Burst Switching networks , 2006, 2006 3rd International Conference on Broadband Communications, Networks and Systems.

[38]  Chunming Qiao,et al.  QoS performance of optical burst switching in IP-over-WDM networks , 2000, IEEE Journal on Selected Areas in Communications.