基于蚁群优化算法的Ad Hoc网络路由协议研究

路由协议的研究是Ad Hoc网络的重点和难点。文章在分析已有Ad Hoc网络路由协议的基础上,结合蚁群算法的原理,首次提出了根据蚂蚁释放有效信息素的比率,引入服务代理来减少蚂蚁代理开销的路由协议。在网络仿真平台NS-2上进行了算法仿真实现,并与现有的典型协议在不同的实验场景下进行性能分析比较,仿真结果表明新的基于蚁群优化算法的Ad Hoc网路由算法具有比其它算法更好的性能。     

MPLS网络中基于关键度的蚂蚁路由算法

文章将MPLS网络中传统的路由集中计算与具有分布式特点的蚂蚁路由计算结合起来，并引入了关键链路的概念和提出了关键度的计算方法，定义了状态转移规则、信息素浓度局部刷新规则和信息素浓度全局刷新规则。在此基础上提出了MPLS网络中基于关键度的蚂蚁路由算法，并进行了NS2仿真。仿真结果表明：本算法具有较高的路由成功率(接受率)，在网络处于拥塞的情况下，路由的成功率以及网络资源的利用率方面相对于普通的SWP算法优势更为明显。     

基于精英蚂蚁算法的动态路由和波长分配研究

为了更有效地解决密集波分复用光网络中动态路由和波长分配问题,提高光网络中资源利用率,该文提出了一种基于精英策略蚂蚁系统算法的动态路由和波长分配问题的解决方法。在仿真中通过将精英策略蚂蚁算法应用到经典的美国国家科学基金会网络中,动态地完成路由和波长的分配。仿真结果表明,精英策略蚂蚁算法能够降低网络阻塞率,有效提高密集波分复用光网络的带宽资源利用率,并且随着波长数目或者网络负载的不断增加,这种优势更加明显。     

一种PTN网络路由调度方法

针对现有技术方案无法解决复杂业务约束路由调度问题的现状，提出一种PTN网络路由调度方法，通过将路由调度问题转换成节点遍历问题，结合改进后的Dijkstra算法和带变异策略的最大最小蚂蚁算法求解经过起点、终点及各必经点的较优路由。改进后的算法在计算时间复杂度和空间复杂度都有不同程度提升，达到快速、精准计算PTN网络路由的目的。同时，该方法考虑已有路由方案和个性化需求，减少人工干预工作量，具有一定的通用性。     

基于蚁群优化算法的路由协议的研究

生物仿真学群集算法在路由中有广泛的的应用,为了充分利用网络资源,降低拥塞程度,提出了一种基于蚁群优化算法的Ad Hoc网络负载均衡路由算法Pro-antnet,通过对蚂蚁收集到的网络信息所对应的参数赋予不同加权值的方法对路由表进行控制,有效地缓解了网络的拥塞问题。该算法具有良好的分布式特性,能为网络提供多条备用路径,增强网络的抗毁性。     

Hadoop平台下一种改进蚂蚁算法的QoS路由研究

随着未来云计算的发展,各种云服务的应用将需要更高的网络性能。链路拥塞导致的数据包传输时延或数据包丢弃使得网络无法保障业务的QoS。目前普遍使用的链路状态路由算法不具有拥塞响应机制。本文通过在拥塞节点间发送连接蚂蚁寻找新路由来解决拥塞问题。NS2仿真结果表明,该算法能加快新的路由搜索,满足QoS的需求,并有效控制丢包率,时延等性能。     

基于蚂蚁算法的多约束QOS组播路由选择

描述了多约束QoS组播路由问题的网络模型,提出了一种解决该问题的改进的蚂蚁算法.该算法对网络进行预处理,生成初始解,并转化为网络的初始信息素分布,利用蚂蚁算法的正反馈特性调整信息量的分配,使之迅速收敛到问题的最优解.仿真表明,算法可以稳定地获得优于现有启发式算法的解,是一种有效的组播路由算法.     

基于蚂蚁算法的时延受限分布式多播路由研究

本文探讨了在高速包交换计算机网络中,具有端到端时延限制的多播路由问题。提出了一种新颖的基于蚂蚁算法的多播路由优化算法,该算法是完全分布式的。仿真实验表明,用该算法产生的多播路由树的费用比已存在的主要算法更好,并且适应于多播成员数的变化。     

智能蚂蚁算法及其在电信网动态路由优化中的应用

本文介绍一种新的、启发式的、具有自组织能力的智能蚂蚁算法；并针对我国电信网的具体情况，提出借助这种智能蚂蚁算法，用分散控制的方式实现电信网动态路由优化的一种方案，目的是提高网络资源的利用率，网络运行的效率和可靠性。     

基于蚂蚁算法的QoS路由调度方法

为了有效地解决QoS受限路由问题,本文提出了一种新颖的具有全局优化能力的蚂蚁算法,它是基于蚂蚁具有找到蚁巢与食物之间的最短路径原理工作的。 仿真实验表明,该方法能够有效地解决QoS受限路由问题。     

Multicast routing, load balancing, and wavelength assignment ontree of rings

There are two steps to establish a multicast connection in WDM networks: routing and wavelength assignment. The shortest path tree (SPT) and minimum spanning tree (MST) are the two widely used multicast routing methods. The SPT method minimizes the delay from the source to every destination along a routing tree, and the MST method is often used to minimize the network cost of the tree. Load balancing is an important objective in multicast routing, which minimizes the maximal link load in the system. The objective of wavelength assignment is to minimize the number of wavelengths used in the system. This paper analyzes the performance of the shortest path tree (SPT) and minimum spanning tree (MST) methods in the tree of ring networks, regarding the performance criteria such as the delay and network cost of the generated routing trees, load balancing, and the number of wavelengths required in the system. We prove that SPT and MST methods can not only produce routing trees with low network costs and short delays, but also have good competitive ratios for the load balancing problem (LBP) and wavelength assignment problem (WAP), respectively     

Adaptive load distribution approach based on congestion control scheme in ad-hoc networks

The ‘load distribution’ proposition in mobile ad-hoc networks (MANETs) is accomplishing great stimulation. This is because of the phenomenal facets it possesses including advanced network resilience, reliability and performance. Though there are other leading network layer routing protocols, but they radically utilise single-path communication paradigm, which is why they fail in achieving efficient load distribution in a network. Via this paper, we propose an efficient cross-layer adaptive load distribution approach to capitalise network’s channel utilisation and to rapidly adapt to dynamic wireless channel characteristic changes. The proposed method modifies the load balanced congestion adaptive routing (LBCAR) protocol and is developed using dynamic load distribution technique, by pioneering (i) novel parameters, which report for the availability of route pertaining to minimum traffic load and better link lifetime and also adapt according to varying available network resources; (ii) an absolute dynamic method to lessen the redundant route oscillations which further reduces the routing instabilities. The simulation results demonstrate the usefulness of the proposed method and yields better results in comparison to LBCAR and standard instead of dynamic ource outing, it is dynamic source routing (DSR) protocol.     

多光纤波分复用网的一种新的备用路由算法

基于经典的LLR算法,研究了波分复用光网络的路由问题,提出了一种用于多光纤网的新算法—LLHR,该算法综合考虑了链路负载和路由跳数两个因素。文章深入研究了网络光纤数、备用路由数和网络负载对算法性能的影响。计算机仿真结果表明,与LLR算法相比,该算法能有效降低网络的阻塞率,提高网络的性能。     

WDM 光网络中一种新的备用路由算法

文章基于负载均衡和禁忌搜索提出一种新的备用路由算法,实现了优化解搜索及对链路负载方差和拥塞的优化.路由选择后,采用首次命中按长通道优先原则为各光通道分配波长.在环网和网状网静态业务模式下对不同路由算法进行了仿真,仿真结果表明,新算法能充分利用网络资源安排最佳路由,有效降低了对波长的需求.     

Minimum cost load balanced multipath routing protocol for low power and lossy networks

Conventional shortest path routing mechanisms in low power and lossy networks (LLNs) impose excessive traffic load on some nodes and cause their early battery depletion. Load balancing via multipath routing is a promising solution to increase lifetime. This idea is practised by some algorithms, mostly through limited number of disjoint paths, to reduce inter-path interference. In this paper a proactive multipath routing algorithm called MRPL is proposed, based on the recent standard routing protocol for LLNs. The algorithm tries to distribute the traffic load through a set of braided paths, with the objective of maximizing the network lifetime and minimizing total transmission cost. The traffic distribution mechanism is formulated by a linear program and a heuristic method is proposed to implement it in a distributed manner. Simulation results provide enough evidence for energy and cost efficiency of the proposed routing mechanism.     

移动Ad Hoc网络中的负载均衡路由算法

移动Ad Hoe网络(MANET)中的路由算法应尽量使网络负载均衡,不均衡不仅导致正在通信的路由由于过度拥塞而引起数据包延时过大、吞吐量下降,而且会使拥塞节点的能量提前耗尽,从而加剧网络拓扑结构的变化及节点之间的不公平性。本文对目前提出的一些负载均衡路由算法进行了简要比较和分析,在此基础上,指出了目前负载均衡路由算法中存在的一些问题,并提出了一个实现负载均衡路由算法的一般模型。基于该模型,文中提出了一种简单的负载均衡路由算法。仿真结果表明,负载均衡路由算法比未考虑负载均衡的路由算法具有更高的数据包投递率和更低的数据包传输延时。     

Le millefeuille: Algorithme de routage pour réseau en mode paquet et réseau en mode connecté

We present in this paper an innovating routing method on constrained capacity based on the actual link load ratio. This method is used during the data network or switching network design step. Its goal is to use all the free capacity of the network, by splitting the flow along several paths, and lowering the maximal link load on the network. We present a routing method and a non additive metric on the network components for the computation of the paths. We compare this multi-routings method to disjoint multi-routing methods and show the interest of this method. It provides the network higher resistance to flow increase, and higher resistance to single link failure.     

一种结构化P2P协议中的负载均衡方法

提出一种适合于路由表大小为O(logN) 的结构化P2P协议的负载均衡方法,该方法采用负载感知的被动式路由表维护算法和路由算法提高轻载结点作为路由中继结点的概率,并通过一种缓存机制来降低承载热点文件的结点的请求负载.实验结果表明,在用户查询服从Zipf分布的环境下,该负载均衡方法可使系统达到较好的负载均衡.     

On‐demand flow regulated routing for ad hoc wireless networks

In this paper, we present an on‐demand flow regulated routing algorithm (OFRA) for ad hoc wireless networks. The OFRA consists of two parts: an intermediate node load evaluation process and a routing path selection process. The intermediate node load evaluation process evaluates the load efficiency of the intermediate nodes according to bandwidth, data packets and computing capability. The routing path selection process selects the routing path with lower flow and fewer intermediate nodes. The OFRA can prevent intermediate nodes to be overcrowded and distribute traffic load over routing paths more evenly. The simulation result shows that the percentage of blocked routing paths is reduced and the total flow is more balanced and distributed. Copyright © 2006 John Wiley & Sons, Ltd.     

一种Ad Hoc网络中路由软切换策略的研究

提出了一种新的Ad Hoc网络中对路由的维护方法,即基于局部多路径路由维护的路由软切换技术。在当前路由中某段或某几段链路出现问题时,通过建立局部的多路径路由,分担问题链路中的负载,维护网络保持通信连接不被中断;当路由稳定时,从局部多路径路由中寻找一条满足当前主路由通信需要的子路径,并且将数据传输切换到此子路径上,达到路由抢先维护和软切换的目的。该方法能够缩短路由重建的时间,延长单路径路由的寿命,使用多路径维护,避免了网络拥塞出现造成路由中断,能够很好地提高网络性能。