摘要
目前PTN网络数据大规模增长,不合理的路由规则造成数据传输中路径选择的时延过长的问题,提出一种基于交叉遗传优化最小堆的Dijkstra的PTN传输路由算法。在备选节点的优先队列中,按照交叉遗传优化后的权值进行最小堆排序,每次路由选择中取最小堆的顶节点与邻节点的集合进行遍历对比,对比后的节点不断更新并且加入到备选集中,直到所有的节点经过最小堆的排序比较,形成路由。实验证明这种方法的时间复杂度较传统的PTN路由算法降低20%,具有很强的可行性。
At present the network data PTN mass growth,not reasonable routing rules cause data transmission path choice of delay long problems,a kind of based on cross genetic optimization of the minimum pile Dijkstra PTN transmission routing algorithm is proposed,the optional node in the priority queue according to cross genetic optimization of the right value of the minimum order,every time routing in the top of the heap take minimum set of nodes and adjacent node traverse contrast,after comparing the node constantly update and added to the optional focused until all the node after the minimum pile of sequence comparison,forming routing,the experiment proved that this method is superior to the conventional time complexity of PTN routing algorithm is reduced by 20%,with strong feasibility.
出处
《科学技术与工程》
北大核心
2013年第21期6243-6246,6251,共5页
Science Technology and Engineering
