Please use this identifier to cite or link to this item: https://scholarhub.balamand.edu.lb/handle/uob/4024
Title: A new strategy for dynamic RWA in all-optical WDM networks using delay and congestion constrained optimized RWA heuristic algorithm (DCO)
Authors: Abi Raad, Yara
Advisors: Inaty, Elie 
Issue Date: 2020
Abstract: 
The dynamic routing and wavelength assignment (RWA) problem constitutes a challenge in optical Wavelength Division Multiplexing (WDM) networks. Existing research proposes many algorithms to improve the blocking probability and the channel utilization performance of WDM networks. However, current algorithms are not designed to maintain a good QoS which is a criterion of great important in dynamic RWA networks. This thesis provides an attractive approach for solving the dynamic RWA problem with wavelength continuity constraint, in which the QoS in WDM networks is considered. We introduce a new cost function based on alternate routing scheme along with constrained and weighted route hop distance and congestion. The wavelength assignment follows the first fit (FF) scheme. The delay and congestion constrained optimized (DCO) RWA heuristic algorithm achieves stringent blocking probability and enhanced channel utilization against previous RWA algorithms, while preserving good QoS in terms of packet delay. Extensive simulation results confirm the significant performance improvement of DCO.
Description: 
Includes bibliographical references (p. 63-65).

Supervised by Dr. Elie Inaty.
URI: https://scholarhub.balamand.edu.lb/handle/uob/4024
Rights: This object is protected by copyright, and is made available here for research and educational purposes. Permission to reuse, publish, or reproduce the object beyond the personal and educational use exceptions must be obtained from the copyright holder
Ezproxy URL: Link to full text
Type: Thesis
Appears in Collections:UOB Theses and Projects

Show full item record

Record view(s)

23
checked on Oct 23, 2021

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.