DSpace Repository

Weight Based Edge Disjoint Path Routing and Wavelength Assignment (WEDP-RWA) Algorithm for WDM Networks

Show simple item record

dc.contributor.author Shekhawat, Virendra Singh
dc.contributor.author Chaubey, V.K.
dc.date.accessioned 2023-01-04T04:28:37Z
dc.date.available 2023-01-04T04:28:37Z
dc.date.issued 2008
dc.identifier.uri https://ieeexplore.ieee.org/document/4798409
dc.identifier.uri http://dspace.bits-pilani.ac.in:8080/xmlui/handle/123456789/8282
dc.description.abstract In this paper the problem of routing and wavelength assignment (RWA) in optical wavelength division multiplexing (WDM) networks has been addressed and a new weight based edge disjoint path (EDP) algorithm for RWA has been proposed to optimize the wavelength resources in a wavelength routed WDM networks. The simulation results reveal that the network topology characteristics and link utilization factor have a significant impact on light path selection for traffic routing to minimize the required number of wavelengths. The weight based RWA solution reports significant improvement in wavelength utilization in particular for large network with increase in the call request for a source destination pair. en_US
dc.language.iso en en_US
dc.publisher IEEE en_US
dc.subject Computer Science en_US
dc.subject Routing and Wavelength Assignment (RWA) en_US
dc.subject Wavelength Converter en_US
dc.subject Edge Disjoint Paths (EDPs) en_US
dc.subject Wavelength continuity constraint en_US
dc.title Weight Based Edge Disjoint Path Routing and Wavelength Assignment (WEDP-RWA) Algorithm for WDM Networks en_US
dc.type Article en_US


Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record

Search DSpace


Advanced Search

Browse

My Account