Rerouting in advance for preempted IR calls in QoS-enabled networks

When network resources are shared between Instantaneous Request (IR) and Book-Ahead (BA) connections, activation of future BA connections may cause preemption of on-going IR connections due to resource scarcity. Rerouting of preempted calls via alternative feasible paths is often considered as the final option to restore and maintain service continuity. Existing rerouting techniques, however, do not ensure acceptably low service disruption time and suffer from high failure rate and low network utilization. In this work, a new rerouting strategy is proposed that estimates the future resource scarcity, identifies the probable candidate connections for preemption and initiates the rerouting process in advance for those connections. Simulations on a widely used network topology suggest that the proposed rerouting scheme achieves a higher successful rerouting rate with lower service disruption time, while not compromising other network performance metrics like utilization and call blocking rate.

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

[2]  Keith W. Ross,et al.  Multiservice Loss Models for Broadband Telecommunication Networks , 1997 .

[3]  Joarder Kamruzzaman,et al.  Look-ahead Rerouting of Pre-empted Calls , 2006 .

[4]  Luis Cardoso,et al.  QoS: Measurement and Evaluation of Telecommunications Quality of Service , 2001 .

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

[6]  Murali S. Kodialam,et al.  Dynamic routing of restorable bandwidth-guaranteed tunnels using aggregated network resource usage information , 2003, TNET.

[7]  G. Manimaran,et al.  Reliability constrained routing in QoS networks , 2005, IEEE/ACM Transactions on Networking.

[8]  R. K. Shyamasundar,et al.  Introduction to algorithms , 1996 .

[9]  Deepinder P. Sidhu,et al.  Comparative analysis of path computation techniques for MPLS traffic engineering , 2002, Comput. Networks.

[10]  Iftekhar Ahmad,et al.  A dynamic approach to reduce preemption in book-ahead reservation in QoS-enabled networks , 2006, Comput. Commun..

[11]  T. Spyropoulos,et al.  Efficient Routing in Intermittently Connected Mobile Networks: The Multiple-Copy Case , 2008, IEEE/ACM Transactions on Networking.

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

[13]  R. Doverspike A multi-layered model for survivability in intra-LATA transport networks , 1991, IEEE Global Telecommunications Conference GLOBECOM '91: Countdown to the New Millennium. Conference Record.

[14]  N. F. Maxemchuk Dispersity Routing: Past and Present , 2007, MILCOM 2007 - IEEE Military Communications Conference.

[15]  Kang G. Shin,et al.  Efficient spare-resource allocation for fast restoration of real-time channels from network component failures , 1997, Proceedings Real-Time Systems Symposium.

[16]  Anindo Banerjea,et al.  Fault recovery for guaranteed performance communications connections , 1999, TNET.

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

[18]  Iftekhar Ahmad,et al.  Preemption Policy in QoS-Enabled Networks: A Customer Centric Approach , 2007, J. Res. Pract. Inf. Technol..