Performance analysis of stochastic fair sharing (SFS) scheme for link sharing

We address the problem of the performance analysis of the stochastic fair sharing (SFS) algorithm for fair link sharing. The SFS scheme has been proposed (see Garg, R. and Saran, H., Infocom, 2000) to carry out a fair link sharing and fair sharing among virtual private networks (VPNs). Depending on the current utilization and provisioned capacities of the classes, the SFS admission control algorithm decides which sessions to accept and which to reject. We undertake the performance evaluation of the SFS scheme analytically. The main performance measure in our analysis is the session blocking probability. In particular, we obtain the Roberts-Kaufman like recursion (see Kaufman, J.S., IEEE Trans. Commun., vol.COM-29, no.19, p.1474-81, 1981) for the SFS scheme to compute the blocking probability. We then use linear programming techniques to compute the blocking probability from the above recursion.