Please use this identifier to cite or link to this item:
DC FieldValueLanguage
dc.contributor.advisorInaty, Elieen_US
dc.contributor.authorBitar, Abir Elen_US
dc.descriptionIncludes bibliographical references (p. 26).en_US
dc.descriptionSupervised by Dr. Elie Inati.en_US
dc.description.abstractThe 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.en_US
dc.description.statementofresponsibilityby Abir El Bitaren_US
dc.format.extentix, 26 p. :ill., tables ;30 cmen_US
dc.rightsThis 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 holderen_US
dc.subject.lcshRouters (Computer Science)en_US
dc.subject.lcshOptical communicationsen_US
dc.titleA heuristic algorithm in static routing and wavelength assigment [sic] assignmenten_US
dc.title.alternativeA heuristic algorithm in static routing & wavelength assigment [sic] assignmenten_US
dc.contributor.departmentDepartment of Computer Engineeringen_US
dc.contributor.facultyFaculty of Engineeringen_US
dc.contributor.institutionUniversity of Balamanden_US
dc.description.degreeMS in Computer Engineeringen_US
Appears in Collections:UOB Theses and Projects
Show simple item record

Record view(s)

checked on Sep 24, 2021

Google ScholarTM


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