A book-ahead routing scheme to reduce instantaneous request call blocking and preemption rate

Book-Ahead (BA) reservation which allows booking of network bandwidth long before its actual usage time is a key reservation technique in a QoS-enabled network. BA reservation is highly attractive for high bandwidth requiring time sensitive multimedia and distributed applications. Routing of book-ahead (BA) and instantaneous request (IR) reservations has been an important area of research of late. Among all other routing techniques, shortest path routing has been the strongest candidate for BA and IR routing for its resource conservative nature. Imprecise link state information contributes to high call blocking which is a major obstacle for widespread implementation of linkstate QoS routing. In this paper, we propose an improved BA routing scheme by formulating a link cost function that comprises of hop count and a measure to asses the impact of inaccurate state information on call connection at each link. The motivation of this work is to achieve higher network performance by improving existing BA routing in a way that reduces the detrimental effect of imprecise state information on IR call blocking and preemption rate. The proposed BA routing is not an alternative, but a complementary approach to any of the IR routing algorithms formulated with specific interest to address the problem of imprecise routing information on IR call connection. Simulation results show improved network performances in the form of lower IR call blocking rate, lower preemption rate and higher utilization when the proposed routing technique is adopted in a communication network.

[1]  Meng Chang Chen,et al.  Admission Control and Capacity Management for Advance Reservations with Uncertain Service Duration , 2002, NETWORKING.

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

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

[4]  Ariel Orda,et al.  QoS Routing Mechanisms and OSPF Extensions , 1999, RFC.

[5]  Pierre A. Humblet,et al.  Routing subject to quality of service constraints in integrated communication networks , 1995, IEEE Netw..

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

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

[8]  Ariel Orda,et al.  QoS routing in networks with inaccurate information: theory and algorithms , 1999, TNET.

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

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

[11]  Marwan Krunz,et al.  Bandwidth-delay constrained path selection under inaccurate state information , 2003, TNET.

[12]  Lei Wang,et al.  A novel QoS routing scheme for MPLS traffic engineering , 2003, International Conference on Communication Technology Proceedings, 2003. ICCT 2003..

[13]  Iftekhar Ahmad,et al.  Dynamic look-ahead time in book-ahead reservation in QoS-enabled networks , 2004, Proceedings. 2004 12th IEEE International Conference on Networks (ICON 2004) (IEEE Cat. No.04EX955).

[14]  Karol Kowalik,et al.  Should QoS routing algorithms prefer shortest paths? , 2003, IEEE International Conference on Communications, 2003. ICC '03..