Please use this identifier to cite or link to this item: https://scholarbank.nus.edu.sg/handle/10635/16033
DC FieldValue
dc.titleMulticast routing in WDM networks
dc.contributor.authorLAHLOU KITANE DRISS
dc.date.accessioned2010-04-08T11:00:15Z
dc.date.available2010-04-08T11:00:15Z
dc.date.issued2009-02-26
dc.identifier.citationLAHLOU KITANE DRISS (2009-02-26). Multicast routing in WDM networks. ScholarBank@NUS Repository.
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/16033
dc.description.abstractInterrest for multicast routing in optical networks problem has been growing the past years regarding the WDM technology development and the increasing use of point-to-multi-point applications such as video on demand, video conferencing and distributed games. The present study deals with the cited problem adopting for this purpose a mathematical approach. An ILP is first proposed to model the problem. The problem is then divided in several subproblems including the Delay constrained Shortest Path Problem (DCSPP) and the delay-constrained Steiner Tree Problem (DCSTP). The main contribution of this research is new cutting planes and separation algorithms dealing remarkably with the (DCSPP). Promising results are also demonstrated for the (DCSTP). A heuristic is finally proposed for the routing problem.
dc.language.isoen
dc.subjectMulticast routing, constrained shortest path problem, linear programming
dc.typeThesis
dc.contributor.departmentINDUSTRIAL & SYSTEMS ENGINEERING
dc.contributor.supervisorNG KIEN MING
dc.contributor.supervisorHUANG HUEI CHUEN
dc.description.degreeMaster's
dc.description.degreeconferredMASTER OF ENGINEERING
dc.identifier.isiutNOT_IN_WOS
Appears in Collections:Master's Theses (Open)

Show simple item record
Files in This Item:
File Description SizeFormatAccess SettingsVersion 
LahlouKD.pdf551.99 kBAdobe PDF

OPEN

NoneView/Download

Page view(s)

248
checked on May 23, 2019

Download(s)

150
checked on May 23, 2019

Google ScholarTM

Check


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