Analysis and design of book-ahead bandwidth-sharing mechanisms

In this article, we present a novel discrete-time Markov chain model of book-ahead bandwidth-sharing mechanisms. We use this analytical model and a simulation model to understand the benefits of book-ahead (BA) bandwidth-sharing when compared to the immediate-request (IR) call-blocking mode of bandwidth-sharing in circuit-switched networks. We study two different BA schemes, BA-all, in which the caller accepts any set of available timeslots, and BA-n, in which the caller specifies n call-initiation time options. Numerical results show that the BA-all achieves 95% utilization with a call-blocking probability of only 1%, while in the IR mode, call blocking probability is 23% even when utilization is only 80%. The BA-n schemes perform as well as the BA-all scheme if the call-initiation time options are restricted to fall on timeslot boundaries separated by the minimum call holding time. The length of the advance reservation horizon, K, is shown to increase linearly with call holding time, H. The ratio K/H is primarily dependent on the link capacity in channels. For example, if the link is divided into 10 channels, to achieve a 2% call blocking probability, the advance-reservation horizon needs to be a factor of 4 times the call holding time. In other words, the extra data storage and processing required to accept and maintain advance reservations is not significant.

[1]  Jorma T. Virtamo.  A model of reservation systems , 1992, IEEE Trans. Commun..

[2]  Kevin L. Mills,et al.  Expand-ing confidence in network simulation , 2000 .

[3]  Chase Qishi Wu,et al.  CHEETAH: circuit-switched high-speed end-to-end transport architecture testbed , 2005, IEEE Communications Magazine.

[4]  Dave Katz,et al.  Traffic Engineering (TE) Extensions to OSPF Version 2 , 2003, RFC.

[5]  J. Heidemann,et al.  Expanding confidence in network simulations , 2001, IEEE Netw..

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

[7]  Lou Berger,et al.  Generalized Multi-Protocol Label Switching (GMPLS) Signaling Resource ReserVation Protocol-Traffic Engineering (RSVP-TE) Extensions , 2003, RFC.

[8]  B. Poonen,et al.  Reservation Probabilities , 2022 .

[9]  Ralf Steinmetz,et al.  Concepts for Resource Reservation in Advance , 2004, Multimedia Tools and Applications.

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

[11]  Kishor S. Trivedi.  Probability and Statistics with Reliability, Queuing, and Computer Science Applications , 1984 .

[12]  Sally Floyd,et al.  Wide-area traffic: the failure of Poisson modeling , 1994 .

[13]  Roy D. Yates,et al.  Probability and stochastic processes , 1998 .

[14]  Chase Qishi Wu,et al.  Ultrascience net: network testbed for large-scale science applications , 2005, IEEE Communications Magazine.

[15]  Chen-Khong Tham,et al.  A Probing Approach for Effective Distributed Resource Reservation , 2003, QoS-IP.

[16]  Eric Mannie,et al.  Generalized Multi-Protocol Label Switching (GMPLS) Architecture , 2004, RFC.

[17]  Mischa Schwartz,et al.  Telecommunication networks: protocols, modeling and analysis , 1986 .

[18]  Malathi Veeraraghavan,et al.  CAM03-1: On the Suitability of Applications for GMPLS Networks , 2006, IEEE Globecom 2006.