A Delay Constraint OptimalPat Algorithor Ad Hoc MPLS Networks
Zhangs Tao · 2006
Multiple con:straints optimalpath(MCOP) problem isakeyproblem ofAdHocMPLSNetworks. Forthe restricted computing and memorycapability ofAd Hoc networks nodeequipments, theMCOP problem ofAd Hoc MPLS Networks ismoredifficult thanthecurrent networks. In thispaper, anovel AdHocnetworks delay constraint optimal path(ADCOP) algorithm isproposed. Byreduced thesearch region ofthealgorithm, theefficiency ofalgorithm canbe improved effectively andanoptimal loop-less pathcanbegotten. Theself-adapting parameter design isadopted inthisalgorithm toimprove theadaptability onthenetwork scale. Using extensive simulations on randomgraphsandrandomassigned link weights, thehugeimprovement incomplexity ofthenew algorithm istested. Thetest also indicates thatthealgorithm has moreadaptability andmorepracticability. Keords:AdHocnetworks; MPLS;DelayConstrained; QoSRouting