资源描述：
《dynamic routing and wavelength assignment in wdm networks with ant-based agents》由会员上传分享，免费在线阅读，更多相关内容在教育资源-天天文库。
1、DynamicRoutingandWavelengthAssignmentinWDMNetworkswithAnt-BasedAgents1112Son-HongNgo,XiaohongJiang,SusumuHoriguchi,andMinyiGuo1GraduateSchoolofInformationScience,JapanAdvancedInstituteofScienceandTechnology,Japan{sonhong,jiang,hori}@jaist.ac.jp2SchoolofComputerScienceandE
2、ngineering,TheUniversityofAizu,Japanminyi@u-aizu.ac.jpAbstract.Inthispaper,weproposeanant-basedalgorithmfordynamicroutingandwavelengthassignment(RWA)inWDMopticalnetworksunderthewave-lengthcontinuityconstraint.Byadoptinganewroutingtablestructureandkeepinganumberofantsinthe
3、networktocooperativelyexplorethenetworkstatesandcontinuouslyupdatetheroutingtables,ournewantalgorithmcanef-ficientlysupporttheants’foragingtasksofrouteselectionandwavelengthas-signmentinWDMnetworks,andallowaconnectiontobesetuppromptlyonarrivalwithasmallsetuptime.Extensive
4、simulationresultsbasedonthens-2networksimulatorindicatethattheproposedalgorithmcanadaptwelltotrafficvariationsandachievesalowerblockingprobabilitythanthefixedroutingal-gorithm.1IntroductionAllopticalnetworksthatadoptwavelength-division-multiplexing(WDM)technologyhaveahuge
5、bandwidthcapacity,andtheyshowpromiseasthebackboneofthenextgenerationInternet.Inallopticalnetworks,dataareroutedinopticalchannelscalledlightpaths.TheRoutingandWavelengthAssignment(RWA)problemishowtode-terminebotharouteandwavelengthsforaconnectionrequest.Withoutwavelengthco
6、nversioncapability,alightpathmustusethesamewavelengthonallthelinksalongitsroute,whichisreferredtoasthewavelengthcontinuityconstraint.TheRWAproblemisusuallyclassifiedasthestaticRWAproblemandthedy-namicRWAproblem.InthestaticRWAproblem,theconnectionrequestsaregiveninadvance,
7、andtheproblembecomeshowtoestablishlightpathsforalltheserequestssothatthetotalnumberofwavelengthsisminimized.StaticRWAhasbeenprovedtobeanNP-completeproblem[1].InthedynamicRWAproblem,thetrafficisdynamicwithconnectionrequestsarrivingrandomly,makingitmoredifficult.Heuristical
8、go-rithmsareusuallyemployedtoresolvethisproblem.Generally,adynamicRWAal-gorithmaimstominimizethe
