Please use this identifier to cite or link to this item:
|Title:||A heuristic algorithm in static routing and wavelength assigment [sic] assignment||Other Titles:||A heuristic algorithm in static routing & wavelength assigment [sic] assignment||Authors:||Bitar, Abir El||Advisors:||Inaty, Elie||Subjects:||Routers (Computer Science)
The exponential increasing demands of bandwidth in the optical network were solved by a new technology named wavelength division multiplexing (WDM). In WDM networks, many users can communicate at the same time by sharing the same physical link, when each connection is referred to as a lightpath. This technique faces a problem, which is, how to set up a lightpath by routing and how to assign a wavelength (channel, color) to each connection. This problem is called routing and wavelength assignment (RWA). A heuristic algorithm is considered in this project to solve a static routing problem. This algorithm solve the problem of routing by trying to find the good routes with minimum congestion, and solve the problem of wavelength assignment using graph coloring algorithm.
Includes bibliographical references (p. 26).
Supervised by Dr. Elie Inati.
|URI:||https://scholarhub.balamand.edu.lb/handle/uob/3170||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:||Project|
|Appears in Collections:||UOB Theses and Projects|
Show full item record
checked on Oct 18, 2021
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.