Font Size: a A A

Research On Qos Routing Constraint Problems Based On GA_ACO Algorithm

Posted on:2012-08-08Degree:MasterType:Thesis
Country:ChinaCandidate:H WangFull Text:PDF
GTID:2178330332995819Subject:Computer application technology
Abstract/Summary:PDF Full Text Request
Along with the development of the Internet ,Video vod and remote video teaching system appeared in large numbers. They have one thing in common :they must pass the information from the source node to the destination node completely and efficiently,Especially in treating such as file transfer FTP or HTTP business which needs highly sensitive。To ensure these requirements,information data must meet some special parameters during the transmission process,it involves Qos constraint problems。Qos problem is a NP complete problem actually,but the traditional Internet routing protocol,such as OSPF and RIP,Only provide "best-effort" service, but can not provide for Qos guaranteed,the computational complexity of these traditional algorithm is higher which lead to solve the problem is low efficiency,so we need provide a algorithm which can satisfy with multiple constraint conditions。This paper puts forward a new routing choose algorithm - genetic algorithm of ant colony algorithm which satisfies the multiple constraints。With combining traditional routing algorithm,we do research in road choose optimization in network。...
Keywords/Search Tags:NP-Complete problem, GA_algorithm, ACO_algorithm, Qos
PDF Full Text Request
Related items