Performance analysis of Stochastic Fair Sharing (SFS) scheme for link sharing

R. Manivasakan; Mounir Hamdi; Danny H.K. Tsang

Performance analysis of Stochastic Fair Sharing (SFS) scheme for link sharing

R. Manivasakan, Mounir Hamdi^*, Danny H.K. Tsang

^*Corresponding author for this work

Hong Kong University of Science and Technology

Research output: Contribution to journal › Conference article › peer-review

Abstract

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 in [1] to carry out a fair link sharing and fair sharing among Virtual Private Networks (VPNs). Depending upon the current utilization and provisioned capacities of the classes, the SFS admission control algorithm decides which sessions to accept and which to reject. In this paper, 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's like recursion for the SFS scheme to compute the blocking probability. We then use linear programming techniques to compute the blocking probability from the above recursion.

Original language	English
Pages (from-to)	1264-1268
Number of pages	5
Journal	Conference Record - International Conference on Communications
Volume	2
Publication status	Published - 2002
Externally published	Yes
Event	2002 International Conference on Communications (ICC 2002) - New York, NY, United States Duration: 28 Apr 2002 → 2 May 2002

Keywords

Link sharing
SFS
VPN

Cite this

@article{750f7e70a46e413b89a423b0c7787222,

title = "Performance analysis of Stochastic Fair Sharing (SFS) scheme for link sharing",

abstract = "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 in [1] to carry out a fair link sharing and fair sharing among Virtual Private Networks (VPNs). Depending upon the current utilization and provisioned capacities of the classes, the SFS admission control algorithm decides which sessions to accept and which to reject. In this paper, 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's like recursion for the SFS scheme to compute the blocking probability. We then use linear programming techniques to compute the blocking probability from the above recursion.",

keywords = "Link sharing, SFS, VPN",

author = "R. Manivasakan and Mounir Hamdi and Tsang, {Danny H.K.}",

year = "2002",

language = "English",

volume = "2",

pages = "1264--1268",

journal = "Conference Record - International Conference on Communications",

issn = "0536-1486",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

note = "2002 International Conference on Communications (ICC 2002) ; Conference date: 28-04-2002 Through 02-05-2002",

}

TY - JOUR

T1 - Performance analysis of Stochastic Fair Sharing (SFS) scheme for link sharing

AU - Manivasakan, R.

AU - Hamdi, Mounir

AU - Tsang, Danny H.K.

PY - 2002

Y1 - 2002

N2 - 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 in [1] to carry out a fair link sharing and fair sharing among Virtual Private Networks (VPNs). Depending upon the current utilization and provisioned capacities of the classes, the SFS admission control algorithm decides which sessions to accept and which to reject. In this paper, 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's like recursion for the SFS scheme to compute the blocking probability. We then use linear programming techniques to compute the blocking probability from the above recursion.

AB - 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 in [1] to carry out a fair link sharing and fair sharing among Virtual Private Networks (VPNs). Depending upon the current utilization and provisioned capacities of the classes, the SFS admission control algorithm decides which sessions to accept and which to reject. In this paper, 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's like recursion for the SFS scheme to compute the blocking probability. We then use linear programming techniques to compute the blocking probability from the above recursion.

KW - Link sharing

KW - SFS

KW - VPN

UR - http://www.scopus.com/inward/record.url?scp=0036285957&partnerID=8YFLogxK

M3 - Conference article

AN - SCOPUS:0036285957

SN - 0536-1486

VL - 2

SP - 1264

EP - 1268

JO - Conference Record - International Conference on Communications

JF - Conference Record - International Conference on Communications

T2 - 2002 International Conference on Communications (ICC 2002)

Y2 - 28 April 2002 through 2 May 2002

ER -

Performance analysis of Stochastic Fair Sharing (SFS) scheme for link sharing

Abstract

Keywords

Other files and links

Fingerprint

Cite this