Simulation of Dynamic Routing in Dense Wavelength Division Multiplexing Networks Using Backward Reservation Signaling

Abstract

Blocking Probability serves as a key metric for assessing optical fiber efficiency in Dense Wavelength Division Multiplexing (DWDM) networks, especially under conditions of high traffic and complex network topologies. This research examines the limitations of Wavelength Division Multiplexing (WDM) and demonstrates how DWDM supports transmission over more than 40 wavelengths, achieves capacities up to 1 terabit per second, and accommodates unpredictable traffic growth by increasing channel counts and reducing channel spacing. The simulation performs route and wavelength assignment (RWA) in the DWDM network using automated routing methods. The receiving node selects the shortest and lowest-cost route from a set of precomputed options. Route selection is guided by PROB packets, which communicate wavelength availability. When all wavelengths in a specific lightpath are occupied, establishing a new route on that lightpath is not feasible. The simulation utilizes a mesh topology, runs for 120 seconds, and activates all network links simultaneously. Breadth-First Search (BFS) is implemented as the routing algorithm, and Enhanced Interior Gateway Routing Protocol (EIGRP) is applied as the routing protocol. Performance is measured using blocking probability at the levels of offered load, fiber, and wavelength. The results demonstrate that backward reservation signaling in DWDM networks decreases traffic blocking and improves Quality of Service (QoS).

Access to Document

Other files and links

• Link to publication in Scopus

Fingerprint