基于antnet的qos单播路由算法研究与实现-通信与信息系统专业论文.docxVIP

华南理』=人学硕士学位论文Abstract 华南理』=人学硕士学位论文 Abstract With the development of Internet，there are more and more multimedia Services， such as video conference．The mechanism of“Best—Effort”which is adopted by the traditional IP network can not satisfy the users’needs now．Such real—time services have a strong requirement of throughput of touters，SO that we can provide QoS guarantee tO the services． Under QoS constrains，QoS routing should find a way to send the packet to the target node．Some researches indicate that QoS routing has multi-QoS constrains，that is tO say，QoS routing is a NP complete problem．That makes it differentiate from the traditional routing problem．So we can not use the classic Shortest Path First Algorithm to solve the problem．Because of The high computation complexity of the algorithms，they can not fit in practical problems． In this paper，we use a QoS routing algorithm based on AntNet algorithm to solve such problems．This algorithm simulate the ant colonies in the natural world，using pheromone as the key to find the finest path，SO that it can efficiently search and get the finest solution of the problem． In this paper，first we introduce the QoS models of IP network．Then，we introduce some rudiments of QoS routing problem and the research situation of this problem at home and abroad．Then，as the reference of Ant Colony Algorithm，we have a brief introduction of Genetic Algorithm and its appliance on QoS routing problem．After that，we give an introduction to the Ant Colony Optimization Algorithm，and introduce a QoS routing algorithm based on AntNet to satisfy the bandwidth and delay constrains．In order tO overcome the disadvantages of this AntNet algorithm，and improve its convergence speed，we introduce“ant—meet’’ algorithm as an improved algorithm of AntNet．At last，we give a brief introduction of the software OPNET，and construct a network model under the platform．Then，we simulate the Genetic Algorithm，AntNet and“ant—meet”algorithm in OPNET，and compare the results o