Mixed Channel Traffic Grooming in Shared Backup Path Protected IP over Elastic Optical Network

Author(s):  
Fengxian Tang ◽  
Longfei Li ◽  
Bowen Chen ◽  
Sanjay K. Bose ◽  
Gangxiang Shen
2019 ◽  
Vol 41 (1) ◽  
pp. 73-82
Author(s):  
Jijun Zhao ◽  
Yuehuan Xu ◽  
Danping Ren ◽  
Jinhua Hu

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.


2015 ◽  
Vol 23 (15) ◽  
pp. 20158
Author(s):  
Hong Guo ◽  
Hua Dai ◽  
Chao Wang ◽  
Yongcheng Li ◽  
Sanjay K. Bose ◽  
...  

2018 ◽  
Vol 0 (0) ◽  
Author(s):  
Ujjwal ◽  
Jaisingh Thangaraj

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.


Sign in / Sign up

Export Citation Format

Share Document