Limitation of Erlang B Traffic Model in Elastic Optical Network for Blocking Probability Estimation

2018 ◽  
Vol 0 (0) ◽  
Author(s):  
Ujjwal ◽  
Jaisingh Thangaraj
Keyword(s):  
Blocking Probability ◽  
Optical Network ◽  
Constant Load ◽  
Traffic Model ◽  
Service Rate ◽  
Service Provisioning ◽  
Connection Request ◽  
Elastic Optical Network ◽  
Simulation Results ◽  
Single Path

Abstract In this paper, an algorithm for multipath connection provisioning in elastic optical network (EON) has been proposed. Initially, the algorithm prefers the single-path routing for service provisioning. But when single-path routing is not adequate to serve a dynamic connection, the algorithm switches to the connection request fragmentation. Its computation is based on the parameters such as capacity_constant and capacity_allowed to fragment the connection request on disjoint paths. Simulation results clearly state that the proposed algorithm performs well in service provisioning as compared to the traditional single-path routing algorithms and improves the average network throughput. Thereafter, we have investigated the limitation of Erlang B traffic model in EON for calculation of link blocking probability using routing and spectrum assignment (RSA) algorithm. It is verified by the following two ways: (i) effect on the blocking probability in case of constant load and (ii) effect of slot width on the blocking probability. Our simulation results indicate that in EON due to dynamic RSA, blocking probability is not constant in case of proportionate varying of call arrival and service rate giving constant load and blocking probability depends on the number of slots per link, but in Erlang B traffic model blocking probability is always constant in case of constant load and it considers wavelength per link instead of slots per link. This is attributed to the fact that Erlang B traffic model fails to calculate blocking probability accurately in EON. We have computed the carried traffic on 14 nodes, 21-link National Science Foundation Network (NSFNET) topology.

scholarly journals Performance Evaluation of Survivability Strategies for Elastic Optical Networks under Physical Layer Impairments

2017 ◽  
Vol 20 (2) ◽  
Author(s):  
Jurandir Lacerda Jr ◽  
Alexandre Fontinele ◽  
Igo Moura ◽  
André Soares
Keyword(s):  
Performance Evaluation ◽  
Optical Networks ◽  
Blocking Probability ◽  
Optical Network ◽  
Evaluation Study ◽  
Physical Layer ◽  
Elastic Optical Network ◽  
Physical Layer Impairments ◽  
A Performance

This paper carried out a performance evaluation study that compares two survivability strategies (DPP and SM-RSA) for elastic optical networks with and without physical layer impairments. The evaluated scenarios include three representative topologies for elastic optical network, NSFNET, EON and USA. It also analyzes the increase of blocking probability when the survivability strategies are evaluated under the realistic scenario that assumes physical layer impairments. For all studied topologies under physical layer impairments, the survivability strategies achieved blocking probability above 80%.

A Cross-layer Traffic Grooming Algorithm in Joint Optimization of the IP over Elastic Optical Network

2019 ◽  
Vol 41 (1) ◽  
pp. 73-82
Author(s):  
Jijun Zhao ◽  
Yuehuan Xu ◽  
Danping Ren ◽  
Jinhua Hu
Keyword(s):  
Blocking Probability ◽  
Adaptive Modulation ◽  
Optical Network ◽  
Traffic Grooming ◽  
Spectrum Allocation ◽  
Joint Optimization ◽  
Cross Layer ◽  
Dynamic Traffic ◽  
Elastic Optical Network ◽  
Dynamic Traffic Grooming

Abstract To fully utilize the existing optical network resource, the dynamic traffic grooming technology, which could efficiently multiplex many low-speed services arriving dynamically onto high-capacity optical channels, has been studied extensively and used widely. In this article, the problem of dynamic traffic grooming in joint optimization of IP over elastic optical network (EON) is studied. This problem consists of three sub-problems at two layers: the routing problem at the IP-layer (IPR), the routing, modulation level (RML), and the spectrum allocation (SA) problems at the optical layers. We proposed a novel topology-integration and adaptive-modulation based in cross-layer routing spectrum allocation (CL-RSA) algorithm, which follows a multi-cost approach that solves the IPR, the RML, and the SA problems jointly. The most important features of the proposed algorithm are merging physical topology with virtual topology and using the minimum-weight preferred method for route selection. Meanwhile, the effect of physical-layer impairments (PLI) on signal transmission is considered. In addition, the adaptive modulation scheme is used to allocate the spectrum resource. The simulation results show that the algorithm can effectively improve the spectrum resource utilization and reduce the network blocking probability compared to other algorithms in various network conditions, especially in the high load condition effectively.

scholarly journals A Spectrum Defragmentation Algorithm Using Jellyfish Optimization Technique in Elastic Optical Network (EON)

2021 ◽  
Author(s):  
Selvakumar S ◽  
S S Manivannan
Keyword(s):  
Quality Of Service ◽  
Blocking Probability ◽  
Optical Network ◽  
Optimization Technique ◽  
Spectrum Utilization ◽  
Network Efficiency ◽  
Internet Service ◽  
Cloud Data ◽  
Elastic Optical Network

Abstract The rapid growth of the technologies, high bandwidth applications and cloud data centers consume heavy internet service. So, the consumer of the internet expects a high capacity medium for communication. The Elastic Optical Network (EON) provides a flexible and reliable transmission service for the consumers. The spectrum fragmentation is a key challenge in EON. In simple terms, unaligned Frequency Slots (FSs) in the network are referred to as fragmented spectrum, while in defragmentation, the available FSs need to be rearranged to create room for the new connection requests. The problem in defragmentation occurs due to the lack of a continuous spectrum and it leads to depreciation in spectrum usage and simultaneously increasing the Blocking Probability (BP) which disrupts the majority of the existing connections in the network. Several techniques and approaches were suggested to reduce the possibility of disruption and reconfiguration in the network while defragmenting the frequency slots. This paper proposes a new algorithm to overcome the drawbacks and improvement in the quality of service of the network. The proposed algorithm holds the approach of proactive and reactive along with the meta-heuristic nature-inspired optimization technique called Jellyfish Search Optimization (JSO). The proposed combination, PR-DF-JFSO outperforms well in terms of spectrum utilization, network efficiency, and quality of service offered when compared to the state-of-the-art spectrum defragmentation algorithms according to the results of experiments done using standard quality metrics.

Identified Traffic Partition Grooming in Multi-Granularity Optical Network

2012 ◽  
Vol 433-440 ◽  
pp. 5136-5141
Author(s):  
Wei Gang Hou ◽  
Lei Guo ◽  
Xing Wei Wang ◽  
Zhao Long Ning
Keyword(s):  
State Of The Art ◽  
Blocking Probability ◽  
Optical Network ◽  
Traffic Grooming ◽  
Np Hard ◽  
Waveband Switching ◽  
Art Methods ◽  
Simulation Results ◽  
Layered Graph

Currently, the required bandwidth of users tends to be diversity, i.e., coarse-granularity demands (e.g., terabit/circuit routing) and small-granularity demands (e.g., sub-rate traffic streams). Only employing traffic grooming or waveband switching may result in several traffic-diversity problems. Therefore, the traffic partition grooming technique with considering traffic transferring is proposed in this paper to solve the traffic-diversity problems, especially for achieving blocking probability reduction and port savings. Correspondingly, we devise the heuristic and Identified MG-IGAG (IMG-IGAG) algorithm based on Granularity-Layered Graph (GLG) since the problem of grooming is the NP-hard. The simulation results show that our IMG-IGAG is more effective and practical than other state-of-the-art methods.

Sign in / Sign up

Export Citation Format

Share Document