Adaptive QoS routing in dynamic wavelength-routed optical networks

Abstract

In transparent DWDM (Dense Wavelength Division Multiplexing) networks, high blocking rate of lightpaths due to unsatisfactory BERs (Bit Error Rates) can become a major traffic bottleneck. Most of the existing routing schemes have focused on reducing the call rejection rate that is caused by wavelength exhaustion on the assigned routes, without considering the inferior network BER performance that these schemes often produce. In this paper, we propose a dynamic AQoS (Adaptive Quality of Service) routing algorithm, which assigns routes based on real-time Q factor measurements collected from devices. Not only is it BER-friendly, the incorporated CLC (Constrained Least Congested) approach in route selection makes our algorithm wavelength-efficient as well. AQoS routing can work seamlessly with variable data rates and heterogeneous device characteristics. More importantly, it handles non-uniform networks and state changes in a much more flexible way than traditional schemes. Simulation results show that our routing algorithm gives the best overall performance in all tested scenarios.

Effective Heuristic Algorithm for Dynamic Routing and Bandwidth Management Under Quality of Service Constraints in Multistage Interconnection Networks

“…These requirements pertain to: (i) bandwidth-multimedia streams use bandwidth for long periods of time in a continuous fashion, while data traffic is bursty (ii) multipoint communications-multimedia streams are expected to make heavy use of multicasting, while data Science Publications AJAS traffic uses it only occasionally and (iii) low latency, required by interactive communications. Deng and Subramaniam (2005) in their study stated that the present optical network resource provisioning mechanisms are based on the best-effort paradigm is unlikely to provide satisfactory end-to-end performance for services required in the real time applications. Provisioning of a transport network refers to assigning network resources to a static traffic demand Munoz et al (2009).…”

Advanced routing mechanisms in ASON/GMPLS networks

“…Hence, different proposals can be found in the literature depending on the selected architectural solution (centralized or distributed) and the protocol to be extended. For example, [DS05] evaluates by simulation two centralized adaptive routing algorithms assuming OSPF-TE to disseminate Q-factor information. Conversely, [LHDF07], [PH06], and [SYS + 09] propose OSPF-TE extensions for impairment-aware route computation in a distributed control plane.…”