Statistical analysis of blocking probability and fragmentation based on Markov modeling of elastic spectrum allocation on fiber link

Rosa, A. N. F.; Wiatr, Pawel; Çavdar, Çiçek; Carvalho, Solon; Costa, João B.; Wosinska, Lena

doi:10.1016/j.optcom.2015.03.039

Cited by 14 publications

(7 citation statements)

References 33 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…δ (S j , Sd ν ) π(S j ), ν = 1, ..., N D (12) In Eq. (12), the function δ (S j , Sd ν ) selects the corresponding fragmented states S j ∈ FB(k) with related rate λ k .…”

Section: Blocking and Security Analysismentioning

confidence: 99%

Balancing Data Security and Blocking Performance with Spectrum Randomization in Optical Networks

Bziuk

Jukan

2016

2016 IEEE Global Communications Conference (GLOBECOM)

View full text Add to dashboard Cite

Data randomization or scrambling has been effectively used in various applications to improve the data security. In this paper, we use the idea of data randomization to proactively randomize the spectrum (re)allocation to improve connections' security. As it is well-known that random (re)allocation fragments the spectrum and thus increases blocking in elastic optical networks, we analyze the tradeoff between system performance and security. To this end, in addition to spectrum randomization, we utilize an on-demand defragmentation scheme every time a request is blocked due to the spectrum fragmentation. We model the occupancy pattern of an elastic optical link (EOL) using a multi-class continuous-time Markov chain (CTMC) under the random-fit spectrum allocation method. Numerical results show that although both the blocking and security can be improved for a particular so-called randomization process (RP) arrival rate, while with the increase in RP arrival rate the connections' security improves at the cost of the increase in overall blocking.

show abstract

“…δ (S j , Sd ν ) π(S j ), ν = 1, ..., N D (12) In Eq. (12), the function δ (S j , Sd ν ) selects the corresponding fragmented states S j ∈ FB(k) with related rate λ k .…”

Section: Blocking and Security Analysismentioning

confidence: 99%

Balancing Data Security and Blocking Performance with Spectrum Randomization in Optical Networks

Bziuk

Jukan

2016

2016 IEEE Global Communications Conference (GLOBECOM)

View full text Add to dashboard Cite

show abstract

“…With the proposed approaches, different parameters are analyzed, such as blocking probability, resource utilization rate and fragmentation rate. Rosa et al present a Markov modelling framework to calculate steady‐state probabilities and to analyse fragmentation related problems under dynamic traffic conditions. The authors investigate how different allocation request sizes contribute to fragmentation and blocking probability.…”

Section: Related Workmentioning

confidence: 99%

Lightpath admission control and rerouting in dynamic flex‐grid optical transport networks

2016

View full text Add to dashboard Cite

In dynamic flex‐grid optical transport networks, Lightpath Admission Control (LAC) is the task of finding a Routing and Spectrum Assignment (RSA) solution for a current lightpath request; otherwise, the request is blocked if there are not enough free available resources. When rerouting is supported, one or more currently established lightpaths can be rerouted and/or assigned with a different spectrum in order to accommodate the current lightpath request. We propose LAC methods based on mixed integer linear programming that provide a RSA solution for the current request aiming to maximize the acceptance probability of future lightpath requests. When rerouting is supported, we consider that only one currently established lightpath can be rerouted. We compare the proposed methods with the traditional shortest path‐based approach through simulation. Without lightpath rerouting, the blocking probability is significantly improved. With lightpath rerouting, the number of rerouting operations is significantly decreased while the blocking probability is marginally improved. Moreover, the blocking fairness between lightpaths with different spectrum widths is improved both with and without lightpath rerouting. In all cases, the CPU times of the mixed integer linear programming approaches are a few seconds, on average. © 2016 Wiley Periodicals, Inc. NETWORKS, Vol. 69(1), 151–163 2017

show abstract

“…A similar fairness issue is highlighted in Rosa et al, where it is shown that bandwidth‐consuming connections are characterized by higher blocking probability. Finding larger continuous groups of unoccupied FSs is hard; contiguity exacerbates the situation.…”

Section: Introductionmentioning

confidence: 99%

Hop distance–based bandwidth allocation technique for elastic optical networks

Mavridopoulos

Beletsioti

Nicopolitidis

et al. 2020

Int J Communication

View full text Add to dashboard Cite

Summary Elastic optical networks (EON) have emerged as a solution to the growing needs of the future internet, by allowing for greater flexibility, spectrum efficiency, and scalability, when compared to WDM solutions. EONs achieve those improvements through finer spectrum allocation granularity. However, due to the continuity and contiguity constrains, distant connections that are routed through multiple hops suffer from increased bandwidth blocking probability (BBP), while more direct connections are easier to form. This paper proposes HopWindows, a novel method that strategically allocates bandwidth to connections based on their hop distance. This new algorithm applies masks that control the range of frequency slots (FSs) allocated to each n‐hop connection. Furthermore, a new network metric is introduced, the normalized bandwidth blocking probability (normalized BBP). Utilization of this metric ensures increased fairness to distant connections. Extended simulation results are presented which indicate that the proposed HopWindows method achieves a superior performance over the well‐known FirstFit algorithm. The proposed algorithm may achieve a decrease in bandwidth blocking probability of up to 50%.

show abstract

Statistical analysis of blocking probability and fragmentation based on Markov modeling of elastic spectrum allocation on fiber link

Cited by 14 publications

References 33 publications

Balancing Data Security and Blocking Performance with Spectrum Randomization in Optical Networks

Balancing Data Security and Blocking Performance with Spectrum Randomization in Optical Networks

Lightpath admission control and rerouting in dynamic flex‐grid optical transport networks

Hop distance–based bandwidth allocation technique for elastic optical networks

Contact Info

Product

Resources

About