Optimized Traffic Grooming through modified PSO based Iterative Hungarian algorithm in Optical Networks

Due to huge size of the data and quick transmission of data between the nodes present in the optical network, a condition of network traffic is created among the nodes of the network. This issue of traffic can be overcome by employing numerous traffic grooming techniques. In this research paper, the best suitable shortest path is determined by the multi objective modified PSO algorithm and an innovative visibility graph based Iterative Hungarian Traffic grooming algorithm is implemented to reduce the blocking ratio through improving the allocation of bandwidth between the users. Then finally the performance analysis is carried out by means of performance measures such as traffic throughput, transceivers count, average propagation delay, blocking ratio, and success ratio. It can be inferred that the proposed work obtains enhanced outcomes when compared to the other existing techniques.

Fragmentation-Aware Traffic Grooming with Lane Changes in Spectrally–Spatially Flexible Optical Networks

Traffic in current networks is constantly increasing due to the growing popularity of various network services. The currently deployed backbone optical networks apply wavelength division multiplexing (WDM) techniques in single-core single-mode fibers (SMFs) to transmit the light. However, the capacity of SMFs is limited due to physical constraints, and new technologies are required in the near future. Spectrally–spatially-flexible optical networks (SS-FONs) are proposed to provide a substantial capacity increase by exploring the spatial dimension. However, before this technology will reach maturity, various aspects need to be addressed. In particular, during traffic grooming, multiple small requests are aggregated into large-capacity optical corridors in an optical layer to increase the spectral efficiency. As the summary traffic volume is dynamically changing, it may be required to set up and tear down optical channels, which results in network fragmentation. As a consequence, in a congested network, part of the requests can be blocked due to the lack of spectrum resources. Thus, the grooming of traffic and the creation of lightpaths should be carefully designed to minimize network fragmentation. In this study, we present several fragmentation metrics and develop a fragmentation-aware traffic grooming algorithm that reduces the bandwidth blocking probability.