scholarly journals New Heuristic Algorithm for Dynamic Traffic in WDM Optical Networks

2015 ◽  
Vol 35 (3) ◽  
pp. 100-106 ◽  
Author(s):  
Arturo Benito Rodríguez Garcia ◽  
Leonardo Ramirez Lopez ◽  
Juan Carlos Travieso Torres
Keyword(s):  
Genetic Algorithms ◽  
Optical Networks ◽  
Heuristic Algorithm ◽  
Heuristic Algorithms ◽  
Blocking Probability ◽  
Wdm Optical Networks ◽  
Dynamic Traffic ◽  
Relative Growth ◽  
Traffic Conditions ◽  
Network Utilization

<p class="Abstractandkeywordscontent">The results and comparison of the simulation of a new heuristic algorithm called Snake One are presented. The comparison is made with three heuristic algorithms, Genetic Algorithms, Simulated Annealing, and Tabu Search, using blocking probability and network utilization as standard indicators. The simulation was made on the WDM NSFNET under dynamic traffic conditions. The results show a substantial decrease of blocking, but this causes a relative growth of network utilization. There are also load intervals at which its performance improves, decreasing the number of blocked requests.</p>

A heuristic algorithm for lightpath scheduling in next-generation WDM optical networks

2011 ◽  
Vol 23 (3) ◽  
pp. 272-284 ◽  
Author(s):  
Goran Marković ◽  
Vladanka Aćimović-Raspopović ◽  
Valentina Radojičić
Keyword(s):  
Optical Networks ◽  
Heuristic Algorithm ◽  
Wdm Optical Networks ◽  
Next Generation ◽  
Lightpath Scheduling

Simulation Analysis of Routing Strategies in Multicasting Multiservice Loss Networks

SIMULATION ◽  
1997 ◽  
Vol 68 (1) ◽  
pp. 34-43
Author(s):  
Krzysztof Szarkowicz ◽  
Gábor Fodor ◽  
András Faragó ◽  
Tamás Henk
Keyword(s):  
Heuristic Algorithms ◽  
Simulation Analysis ◽  
Blocking Probability ◽  
Asynchronous Transfer Mode ◽  
Steiner Tree Problem ◽  
Weight Functions ◽  
Shortest Path Routing ◽  
Allocation Policy ◽  
Network Utilization ◽  
Multicast Algorithms

This paper begins with an overview of multicast algorithms, which are the most promising candidates to be in wide use in first generation Asynchronous Transfer Mode (ATM) based Broadband Integrated Services Digital Networks (B-ISDN). Since the Multiple Destination Routing (MDR) problem and the associated Steiner Tree problem are known to be NP-complete and therefore a number of heuristic algorithms have been proposed in the literature, we first need to establish which of these are the best candidates for the B-ISDN. We conclude that the weighted greedy -type algorithms are promising ones, and therefore we examine the behavior of these algorithms in terms of blocking probability and network utilization. In doing so, we use a B-ISDN call level simulation program, which proves to be an indispensable tool in the quest for efficient multicast algorithms. We find that shortest path routing with appropriate (adaptive) weight functions combined with the complete partitioning link allocation policy may give satisfactory blocking values and good network utilization in networks of different sizes.

Dynamic routing and wavelength assignment for efficient traffic grooming

2020 ◽  
Vol 0 (0) ◽  
Author(s):  
Neeraj Mohan ◽  
Priyanka Kaushal
Keyword(s):  
Optical Networks ◽  
Resource Utilization ◽  
Wavelength Division Multiplexing ◽  
Computer Network ◽  
Blocking Probability ◽  
Traffic Grooming ◽  
Routing And Wavelength Assignment ◽  
Wavelength Assignment ◽  
Dynamic Traffic ◽  
Network Efficiency

AbstractThe routing and wavelength assignment (RWA) schemes play an important role in all computer networks. The performance of a computer network and resource utilization largely depend on the RWA. The demand for higher bandwidth is increasing with each passing day, so more efficient RWA schemes need to be devolved to cater the increasing requirements. RWA becomes more challenging for dynamic traffic as the nature and flow of data are not known in advance. In this paper, a dynamic RWA scheme has been proposed for establishing a path in optical networks. The proposed scheme is based upon dynamic conversion sensing algorithm. It can be applied on a number of different network topologies. The proposed scheme is dynamic in nature, which is significantly useful for dynamic traffic grooming. The proposed scheme has been applied on 14 nodes National Science Foundation Network (NFSNet). Simulation results have shown that the blocking probability of this scheme is very low as compared to the existing schemes. So, the proposed dynamic RWA scheme enhances the network efficiency. It is useful for congestion hit networks. The reduced blocking probability in wavelength division multiplexing optical networks leads to better resource utilization and enhanced performance.

Sign in / Sign up

Export Citation Format

Share Document