Performance Analysis of Stochastic Fair Sharing Scheme for Link Sharing

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

doi:10.1109/TCOMM.2003.822749

Performance Analysis of Stochastic Fair Sharing Scheme for Link Sharing

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

^*Corresponding author for this work

Research output: Contribution to journal › 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 to carry out a fair link sharing and fair sharing among virtual private networks. 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 letter, we undertake the performance evaluation of the SFS scheme analytically. We explore the tradeoff between fairness and the blocking probability by varying the trunk reservation parameter. The results show that the analytical performance measure agrees well with the simulation results.

Original language	English
Pages (from-to)	195-198
Number of pages	4
Journal	IEEE Transactions on Communications
Volume	52
Issue number	2
DOIs	https://doi.org/10.1109/TCOMM.2003.822749
Publication status	Published - Feb 2004
Externally published	Yes

Keywords

Link sharing
Routing and resource allocation
Stochastic fair sharing (SFS)
Virtual private networks (VPNs)

Access to Document

10.1109/TCOMM.2003.822749

Cite this

@article{b4647fd83e9b46b1a9e6e3e0d7840d85,

title = "Performance Analysis of Stochastic Fair Sharing 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 to carry out a fair link sharing and fair sharing among virtual private networks. 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 letter, we undertake the performance evaluation of the SFS scheme analytically. We explore the tradeoff between fairness and the blocking probability by varying the trunk reservation parameter. The results show that the analytical performance measure agrees well with the simulation results.",

keywords = "Link sharing, Routing and resource allocation, Stochastic fair sharing (SFS), Virtual private networks (VPNs)",

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

year = "2004",

month = feb,

doi = "10.1109/TCOMM.2003.822749",

language = "English",

volume = "52",

pages = "195--198",

journal = "IEEE Transactions on Communications",

issn = "1558-0857",

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

number = "2",

}

TY - JOUR

T1 - Performance Analysis of Stochastic Fair Sharing Scheme for Link Sharing

AU - Manivasakan, R.

AU - Hamdi, Mounir

AU - Tsang, Danny H.K.

PY - 2004/2

Y1 - 2004/2

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 to carry out a fair link sharing and fair sharing among virtual private networks. 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 letter, we undertake the performance evaluation of the SFS scheme analytically. We explore the tradeoff between fairness and the blocking probability by varying the trunk reservation parameter. The results show that the analytical performance measure agrees well with the simulation results.

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 to carry out a fair link sharing and fair sharing among virtual private networks. 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 letter, we undertake the performance evaluation of the SFS scheme analytically. We explore the tradeoff between fairness and the blocking probability by varying the trunk reservation parameter. The results show that the analytical performance measure agrees well with the simulation results.

KW - Link sharing

KW - Routing and resource allocation

KW - Stochastic fair sharing (SFS)

KW - Virtual private networks (VPNs)

UR - https://www.scopus.com/pages/publications/1642381215

U2 - 10.1109/TCOMM.2003.822749

DO - 10.1109/TCOMM.2003.822749

M3 - Article

AN - SCOPUS:1642381215

SN - 1558-0857

VL - 52

SP - 195

EP - 198

JO - IEEE Transactions on Communications

JF - IEEE Transactions on Communications

IS - 2

ER -

Performance Analysis of Stochastic Fair Sharing Scheme for Link Sharing

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this