2014•Unpublished venueRequires access

Blocking probability and fairness in two-rate Elastic Optical Networks

Xue Wang, Joobum Kim, Shuyi Yan, Miguel Razo, Marco Tacca, Andrea Fumagalli

Open publisher page 16 citations

Abstract

Routing and Spectrum Allocation (RSA) algorithms are used to compute both routing and spectrum allocation of connection demands in Elastic Optical Networks (EONs). A number of RSA algorithms have been proposed. Their performance is usually measured in terms of overall blocking probability. In this paper the authors pursue an additional performance indicator that is introduced to quantify the level of fairness (or unfairness) experienced by two types of demands, each type requiring a distinct spectrum bandwidth size. A new RSA algorithm is also proposed to jointly control blocking and fairness by partitioning the spectrum into dedicated and shared bands. Simulation results are used to estimate the trade-off between the blocking probability experienced by all demands and the level of fairness as it is achieved by a total of six RSA algorithms.

About this research paper

What this paper is about

Routing and Spectrum Allocation (RSA) algorithms are used to compute both routing and spectrum allocation of connection demands in Elastic Optical Networks (EONs). A number of RSA algorithms have been proposed. Their performance is usually measured in terms of overall blocking probability. In this paper the authors pursue an additional performance indicator that is introduced to quantify the level of fairness (or unfairness) experienced by two types of demands, each type requiring a distinct spectrum bandwidth size. A new RSA algorithm is also proposed to jointly control blocking and fairness by partitioning the spectrum into dedicated and shared bands. Simulation results are used to estimate the trade-off between the blocking probability experienced by all demands and the level of fairness as it is achieved by a total of six RSA algorithms.

Why it matters

OpenAlex reports 16 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Routing and Spectrum Allocation (RSA) algorithms are used to compute both routing and spectrum allocation of connection demands in Elastic Optical Networks (EONs). A number of RSA algorithms have been proposed. Their performance is usually measured in terms of overall blocking probability. In this paper the authors pursue an additional performance indicator that is introduced to quantify the level of fairness (or unfairness) experienced by two types of demands, each type requiring a distinct spectrum bandwidth size. A new RSA algorithm is also proposed to jointly control blocking and fairness by partitioning the spectrum into dedicated and shared bands. Simulation results are used to estimate the trade-off between the blocking probability experienced by all demands and the level of fairness as it is achieved by a total of six RSA algorithms.

Key concepts: Blocking (statistics), Computer science, Frequency allocation, Bandwidth (computing), Max-min fairness, Computer network, Bandwidth allocation, Routing (electronic design automation)

Related papers

Back to paper searchBrowse research topicsOriginal source
Blocking probability and fairness in two-rate Elastic Optical Networks — Research Paper | ScholarLens