In the paper , we discuss the multi - objective optimization anycast routing algorithm , the model of differentiated service and genetic algorithm based on the predecessors . at last , we will propose some new methods and ideas 本文在总结、分析前人研究的基础上,围绕选播路由问题,对多目标最优化选播路由、区分服务模型、遗传算法等多个方面进行研究,提出了一些新方法和新思路。
Secondly , aiming at the improving of the ratio of internet resource and optimization of internet scheme , we propose multi - objective optimization anycast routing algorithm based on the differentiated service , which can provide different quality transmission services for different users . the model adopts the method that the direction of service data is used to the objective function and the direction of request is used to the restricted condition 本文在分析和对比两种常见的qos服务模型? ?综合服务模型和区分服务模型的基础上,考虑到在实际的应用中,服务数据服务质量比请求数据服务质量更加重要的特点,采用下行数据的服务质量作为最优化目标函数,上行数据的服务质量作为约束条件的方法,提出了基于区分服务模型的多目标最优化选播路由算法。
Basing on the study of the current routing algorithm , it proposes a new sd - anycast routing protocol algorithm . according to the character of this protocol , it implements this new protocol by adding additional packet header , routing maintaining and node dealing modules . lastly , according to creating prototype system and designing four comparing experiments , it gets the experiment statistical data , and makes a conclusion that this routing protocol algorithm has a better performance on one way delay , output , load balance and etc 本文首先介绍了anycast服务的概念、特点以及研究现状;在分析了路由协议的一些相关知识和当今anycast路由协议的研究现状的基础上,深入研究了当前的路由协议算法,提出了一个sd - anycast协议算法,并在网络仿真软件ns2设计平台中根据该协议的特点,通过设计数据包报头、路由表维护和节点处理等功能模块,实现了该协议算法;最后通过建立原型系统并设计四个对比实验,得出实验统计数据,定量地测定了该路由协议算法在单程路径延迟、吞吐量和负载平衡等方面所具有的优越性。
The first one aim at small - scale networks , which adopts genetic algorithm and general search , it based on any - cast routing , first , create all the anthology routines ; then , acquire the general best resolution through evolution . the second one aim at large - scale networks , which is a localized anycast routing algorithm after some advancement is made , the node does n ' t need store the network topology . the next node extends its evolution genes and anthology routines based on the exchange of information 第一种选播路由算法针对较小规模的网络，是基于遗传算法的全局搜索算法，算法以选播路由为基础，在生成全局候选路径的前提下，通过演化，得到全局最优解；第二种选播路由算法针对规模较大的网络，算法做了相应的改进，是一个利用局部信息的选播路由算法，算法确定路由时无需源节点具有全网拓扑，每个节点只需同邻接节点交换信息就可进行路由计算，下一节点的演化基因及候选路径做相应的延伸，候选路径的生成与演化同时进行，以较短的时延达到局部最优，并可节省大量的内存。
So anycast is a multi - objective optimization problem in its essence . analysis of the traditional single objective optimization anycast routing algorithm problems , we proposed multi - objective optimization anycast routing algorithms according to increase the target function of the way . it can optimize a number of objects synchronously which makes anycast satisfy more application 本文在分析了传统的单目标最优化选播路由算法存在问题的基础上,提出了多目标最优化的选播路由算法,可以同时对多个最优化选播目标进行优化,使选播能满足更多应用的需求。
