Advance bandwidth reservation with deadline constraint in high-performance networks

In high-performance networks with both advance and immediate reservations, activating an advance reservation may result in the preemption of some ongoing data transfers based on immediate reservations due to insufficient bandwidth. To minimize such service disruption, we explore the interactions between advance and immediate reservations, and propose an integrated reservation solution with two components: (i) a scheduling algorithm based on statistical analysis of reservation dynamics that routes deadline-constrained advance reservations to minimize the probabilistic number of immediate reservation preemptions, (ii) a runtime preemption scheme to minimize the actual number of immediate reservation preemptions at the activation of an advance reservation. Simulation results show that the proposed reservation solution exhibits a superior performance over existing methods.

[1]  Juan A. Garay,et al.  Call preemption in communication networks , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.

[2]  Harry G. Perros,et al.  Nonstationary analysis of circuit-switched communication networks , 2006, Perform. Evaluation.

[3]  Chase Qishi Wu,et al.  Advance bandwidth scheduling with minimal impact on immediate reservations in high-performance networks , 2012, 2012 IEEE Network Operations and Management Symposium.

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

[5]  Jason Lee,et al.  Intra and Interdomain Circuit Provisioning Using the OSCARS Reservation System , 2006, 2006 3rd International Conference on Broadband Communications, Networks and Systems.

[6]  I. Ahmad,et al.  A book-ahead routing scheme to reduce instantaneous request call blocking and preemption rate , 2005, 2005 13th IEEE International Conference on Networks Jointly held with the 2005 IEEE 7th Malaysia International Conf on Communic.

[7]  R. Srikant,et al.  Resource sharing for book-ahead and instantaneous-request calls , 1999, TNET.

[8]  Young-Chon Kim,et al.  Connection Preemption in Multi-Class Networks , 2006 .

[9]  Iftekhar Ahmad,et al.  Preemption-aware routing for QoS-enabled networks , 2005, GLOBECOM '05. IEEE Global Telecommunications Conference, 2005..

[10]  Young-Chon Kim,et al.  CAM01-3: Connection Preemption in Multi-Class Networks , 2006, IEEE Globecom 2006.

[11]  Iftekhar Ahmad,et al.  Preemption-Aware Instantaneous Request Call Routing for Networks With Book-Ahead Reservation , 2007, IEEE Transactions on Multimedia.

[12]  Wei Guo,et al.  Routing for Deadline-Constrained Bulk Data Transfers Based on Transfer Failure Probability , 2011, 2011 IEEE International Conference on Communications (ICC).

[13]  Yi Zhu,et al.  Routing and Scheduling for Variable Bandwidth Advance Reservation , 2009, IEEE/OSA Journal of Optical Communications and Networking.

[14]  Pascale Vicat-Blanc Primet,et al.  Scheduling deadline-constrained bulk data transfers to minimize network congestion , 2007, Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGrid '07).

[15]  Olov Schelén,et al.  Resource sharing in advance reservation agents , 1998, J. High Speed Networks.