Path protection and blocking probability minimization in optical networks

2004 ◽  
Author(s):  
D. Lee ◽  
L. Libman ◽  
A. Orda
Keyword(s):  
Optical Networks ◽  
Blocking Probability ◽  
Path Protection

scholarly journals A Resource Efficient Recovery Strategy for a Failure in Elastic Optical Networks

2020 ◽  
Vol 8 (5) ◽  
pp. 4245-4249
Keyword(s):  
Optical Networks ◽  
Recovery Time ◽  
Blocking Probability ◽  
Optical Network ◽  
Capacity Utilization ◽  
Network Capacity ◽  
Live Streaming ◽  
Recovery Strategy ◽  
Traffic Demand ◽  
Path Protection

In the last few years, internet traffic increases continuously due to the more use of live streaming and social sites. To accommodate such high traffic demand the more bandwidth is required. The elastic optical network (EON) is a promising solution for the capacity expansion that can meet the future bandwidth requirement. The EON can provide a higher bit rate. In this paper we purposed a recovery strategy for failure in EON. Our purposed strategy shows the more acceptance rate for randomly generated source (s)-destination (d) requests. Here we considered two topologies viz. COST239 and NSFNET. Then evaluate their performance for Recovery Time, bandwidth blocking probability (BBP) and network capacity utilization (NCU), in which our purposed scheme provides lesser BBP and lower NCU for both topologies and low recovery time than shared path protection (SPP and dedicated path protection (DPP).

New Dimensions for Survivable Service Provisioning in Optical Backbone and Access Networks

2011 ◽  
pp. 227-252
Author(s):  
Paolo Monti ◽  
Lena Wosinska ◽  
Cicek Cavdar ◽  
Andrea Fumagalli ◽  
Jiajia Chen
Keyword(s):  
Optical Networks ◽  
Service Providers ◽  
Blocking Probability ◽  
Access Networks ◽  
Service Provisioning ◽  
Protection Scheme ◽  
Path Protection ◽  
Trade Offs ◽  
Set Up ◽  
Shared Path Protection

<div>Originally, networks were engineered to provide only one type of service, i.e. either voice or data, so only one level of resiliency was requested. This trend has changed, and today’s approach in service provisioning is quite different. A Service Level Agreement (SLA) stipulated between users and service providers (or network operators) regulates a series of specific requirements, e.g., connection set-up times and connection availability that has to be met in order to avoid monetary fines. In recent years this has caused a paradigm shift on how to provision these services. From a “one-solution-fits-all” scenario, we witness now a more diversified set of approaches where trade-offs among different network parameters (e.g., level of protection vs. cost and/or level of protection vs. blocking probability) play an important role.</div><div>This chapter aims at presenting a series of network resilient methods that are specifically tailored for a dynamic provisioning with such differentiated requirements. Both optical backbone and access networks are considered. In the chapter a number of provisioning scenarios - each one focusing on a specific Quality of Service (QoS) parameter - are considered. First the effect of delay tolerance, defined as the amount of time a connection request can wait before being set up, on blocking probability is investigated when Shared Path Protection is required. Then the problem of how to assign “just-enough” resources to meet each connection availability requirement is described, and a possible solution via a Shared Path Protection Scheme with Differentiated Reliability is presented. Finally a possible trade off between deployment cost and level of reliability performance in Passive Optical Networks (PONs) is investigated.&nbsp;The presented results highlight the importance of carefully considering each connection’s QoS parameters while devising a resilient provisioning strategy. By doing so the benefits in terms of cost saving and blocking probability improvement becomes relevant, allowing network operators and service providers to maintain satisfied customers at reasonable capital and operational expenditure levels</div>

A parallel cross-connection recovery scheme for dual link failure in elastic optical networks

2021 ◽  
Vol 0 (0) ◽  
Author(s):  
Dinesh Kumar ◽  
Rajiv Kumar ◽  
Neeru Sharma
Keyword(s):  
Optical Networks ◽  
High Speed ◽  
Blocking Probability ◽  
Link Failure ◽  
Recovery Strategy ◽  
Intermediate Node ◽  
Path Protection ◽  
Connection Recovery ◽  
Shared Path Protection ◽  
Cross Connection

Abstract In this paper, we proposed a fast recovery strategy for a dual link failure (DLF) in elastic optical network (EON). The EON is a promising solution to meet the next generation higher bandwidth demand. The survivability of high speed network is very crucial. As the network size increases the probability of the DLF and node failure also increases. Here, we proposed a parallel cross connection backup recovery strategy for DLF in the network. The average bandwidth blocking probability (BBP), bandwidth provisioning ratio (BPR), and recovery time (RT) for our proposed Intermediate node cross-connect backup for shared path protection (INCB-SPP) for ARPANET are 0.38, 2.71, 4.68 ms, and for DPP 0.70, 6.02, 8.71 ms and for SPP 0.40, 2.87, and 16.33 ms respectively. The average BBP, BPR, and RT of INCB-SPP for COST239 are 0.01, 1.71, 3.79 ms and for DPP are 0.39, 3.50, 8.20 ms and SPP are 0.04, 1.75, and 12.47 ms respectively. Hence, the proposed strategy shows lower BBP, fast connection recovery, and BPR when compared with the existing shared path protection (SPP) and dedicated path protection (DPP) approaches. Simulation is performed on ARPANET and COST239 topology networks.

scholarly journals Towards an Efficient and Exact Algorithm for Dynamic Dedicated Path Protection

Entropy ◽  
2021 ◽  
Vol 23 (9) ◽  
pp. 1116
Author(s):  
Ireneusz Szcześniak ◽  
Ireneusz Olszewski ◽  
Bożena Woźna-Szcześniak
Keyword(s):  
Optical Networks ◽  
Operations Management ◽  
Fundamental Problem ◽  
Blocking Probability ◽  
Worst Case Analysis ◽  
Dijkstra Algorithm ◽  
Worst Case ◽  
Path Protection ◽  
Dedicated Path Protection ◽  
Simulation Results

We present a novel algorithm for dynamic routing with dedicated path protection which, as the presented simulation results suggest, can be efficient and exact. We present the algorithm in the setting of optical networks, but it should be applicable to other networks, where services have to be protected, and where the network resources are finite and discrete, e.g., wireless radio or networks capable of advance resource reservation. To the best of our knowledge, we are the first to propose an algorithm for this long-standing fundamental problem, which can be efficient and exact, as suggested by simulation results. The algorithm can be efficient because it can solve large problems, and it can be exact because its results are optimal, as demonstrated and corroborated by simulations. We offer a worst-case analysis to argue that the search space is polynomially upper bounded. Network operations, management, and control require efficient and exact algorithms, especially now, when greater emphasis is placed on network performance, reliability, softwarization, agility, and return on investment. The proposed algorithm uses our generic Dijkstra algorithm on a search graph generated “on-the-fly” based on the input graph. We corroborated the optimality of the results of the proposed algorithm with brute-force enumeration for networks up to 15 nodes large. We present the extensive simulation results of dedicated-path protection with signal modulation constraints for elastic optical networks of 25, 50, and 100 nodes, and with 160, 320, and 640 spectrum units. We also compare the bandwidth blocking probability with the commonly-used edge-exclusion algorithm. We had 48,600 simulation runs with about 41 million searches.

scholarly journals Attack-Aware Dedicated Path Protection in Optical Networks

2016 ◽  
Vol 34 (4) ◽  
pp. 1050-1061 ◽  
Author(s):  
Marija Furdek ◽  
Nina Skorin-Kapov ◽  
Lena Wosinska
Keyword(s):  
Optical Networks ◽  
Path Protection ◽  
Dedicated Path Protection

scholarly journals LBFA: A Load-Balanced and Fragmentation-Aware Resource Allocation Algorithm in Space-Division Multiplexing Elastic Optical Networks

Photonics ◽  
2021 ◽  
Vol 8 (10) ◽  
pp. 456
Author(s):  
Shengyu Zhang ◽  
Kwan Lawrence Yeung ◽  
Along Jin
Keyword(s):  
Optical Networks ◽  
Blocking Probability ◽  
Optical Network ◽  
Computation Method ◽  
Resource Allocation Algorithm ◽  
Space Division Multiplexing ◽  
Space Division ◽  
Critical Issues ◽  
Joint Load ◽  
Load Balanced

We consider a space-division multiplexing elastic optical network (SDM-EON) that supports super-channels (SChs). A Sch comprises a set of contiguous frequency slots on multiple cores in a multi-core fiber. The problem of finding a lightpath using SChs involves routing, modulation, spectrum and core assignment (RMSCA). To minimize the request blocking probability (RBP), two critical issues must be addressed. First, routing and modulation assignment (RMA) should not cause hotspots, or overutilized links. Second, spectrum and core assignment (SCA) should aim at minimizing fragmentation, or small frequency slot blocks that can hardly be utilized by future requests. In this paper, a pre-computation method is first proposed for better load balancing in RMA. Then an efficient fragmentation-aware SCA is proposed based on a new fragmentation metric that measures both the spectral and spatial fragmentation. With the enhanced RMA and SCA, a joint load-balanced and fragmentation-aware algorithm called LBFA is designed to solve the RMSCA problem. As compared with the existing algorithms, simulation results show that our LBFA provides significant reduction in RBP.

scholarly journals Routing Strategies in Survivable Optical Networks

2013 ◽  
Vol 9 (2) ◽  
pp. 1055-1062
Author(s):  
Ifrah Amin ◽  
Gulzar Ahmad dar ◽  
Hrdeep singh Saini
Keyword(s):  
Optical Networks ◽  
Blocking Probability ◽  
Optical Network ◽  
Routing And Wavelength Assignment ◽  
Wavelength Assignment ◽  
Routing Problem ◽  
Routing Strategy ◽  
Survivable Optical Networks ◽  
Conventional Algorithm ◽  
Better Than

Routing and wavelength assignment problem is one of the main problem in optical networks. The foremost problem is the routing problem after which the wavelength assignment is to be decided. In this paper we have proposed a routing strategy for optimization of the performance of the optical network in terms of blocking probability. The strategy proposed is better than the conventional algorithm in terms of blocking. 

Sign in / Sign up

Export Citation Format

Share Document