遗传算法在网络优化中的应用

通讯网络中存在许多设计和优化问题,且相当一部分属于NP-hard类型,传统的解法由于计算复杂度过大而失效。近年来,将遗传算法(GeneticAlgorithm:GA)用于网络优化正逐步成为一个研究热点,本文以网络中的优化问题为线索,对GA在其中的应用做了初步探讨,列举了相关GA算法的特点,特别是路由方面,做了较为详细的分析。     

量子进化组播路由算法

近年来,时延受限的代价最小组播树问题备受关注。作为全局优化算法,遗传算法（GA）越来越多的用于解决组播路由问题。GA拥有比经典算法更强的搜索能力,但是它容易陷入＂早熟＂,很难得到最优组播树。基于量子计算的机理和特性并结合进化计算,提出了一种新颖的量子进化组播路由算法（QEA）,有效地解决了遗传组播路由算法中的＂早熟＂问题,并且在每代个体更新中采用量子旋转门策略加速了算法的收敛速度。算法实现简单,控制灵活。仿真结果表明QEA算法性能优于改进的进化算法即克隆多播路由算法（CS）和传统的遗传算法（GA）。     

基于遗传算法优化的QoS组播路由算法

QoS组播路由技术作为网络多媒体信息传输的一种核心技术,下一代网络中的QoS组播路由的优化算法已经成为目前研究的一个热点。针对QoS组播的网络模型,提出一种适用于下一代网络的组播路由算法能够更好的满足下一代网络的QoS组播需求显得尤为重要。本文讨论了遗传算法优化的QoS组播路由算法,最后探讨了下一代网络QoS组播路由算法的研究方向。     

NoC中的基于蜂群算法的QoS路由

为了解决满足多个约束条件的片上网络服务质量,本文提出了基于蜂群算法的一种QoS路由,该算法使用代理来更新路由信息,并综合考虑历史信息和当前网络状态的路由策略。采用最短路由,最大程度开放路由的自由度,使用基于软件的死锁恢复机制来检测和恢复死锁。仿真结果表明,蜂群算法比维序算法和奇偶转向模型能够更好的保证片上网络的服务质量。     

无线网络中基于网络编码的路由算法

网络编码为无线网络带来了更高的可靠性,二者的结合已经引起了很多研究学者的关注,无线网络中基于网络编码的路由算法更是值得探讨和研究的问题,本文在网络编码的基础上分别对网络编码的多路径路由算法和编码感知的路由算法进行了分析和研究,以期实现提高无线传输效率的目标。     

一种基于改进遗传算法的波长路由算法

WDM(波分复用)光网络中基于GA(遗传算法)的RWA(路由与波长分配)算法是目前最常见的算法,为了提高网络资源利用率并进一步降低阻塞率,提出了一种动态的、基于改进GA的DCMA-GA(双交叉变异自适应遗传算法),通过引入自适应交叉与变异概率机制来减少GA的复杂度并应用于波长分配子算法中。仿真结果表明,与经典算法Dijkstra+FF(首次命中)相比,新算法最大能降低50%的阻塞率,在波长分配方面可提高10%的性能,验证了新算法的有效性。     

基于非对称有向网络的拓扑抽象算法研究

网络规模的扩大导致了路由可扩展性的下降,因此未来的网络将向着分层多域的层次路由体系结构发展.在层次路由中,每个路由域通过拓扑抽象算法对内部拓扑进行汇聚并广播给外部节点,拓扑抽象算法将直接影响到网络的路由性能.本文提出了一种用于非对称有向网络的新型拓扑抽象算法——SHEF算法,该算法结合了面向源的拓扑抽象方法和最小生成树的概念,基于重边优先的准则对非对称的有向网络进行拓扑抽象和汇聚.仿真结果证明,该算法的权值偏差比传统方法减少了75%,较好地解决了路由信息复杂度和准确性之间的矛盾,具有良好的路由性能.     

无线传感网络路由协议现状研究

文中介绍了无线传感网络与传统无线网络的差异,从设计传感网络路由的基本思路和传感网络路由安全问题两个方面对传感网络路由算法进行了研究。概括了传感网络路由协议的目前研究的现状,分析了无线传感网络路由算法常见的安全攻击,在此基础上给出了相应攻击可能会影响到的经典传感网络路由协议,最后对无线传感网络路由算法的发展现状进行了总结,对无线传感网络路由算法的发展方向做了展望。     

一种安全网络路由算法研究

路由算法是路由协议中的重要组成部分,采用何种算法往往决定了最终寻径结果的优劣。路由算法除了能够对信息进行正确路由外还应使路由器具有抵抗恶意攻击的能力。文章在介绍了安全的网络路由算法的设计目标以及几种采用加密技术的安全网络路由算法的基础上,提出了一种安全网络路由算法,该算法通过公开密钥机制,保证了Internet网络中扩散路由算法的安全性。     

基于带宽和跳数的流量工程动态路由选择算法研究

随着网络规模和网络硬件的快速发展,支持流量工程的路由器解决方案已经成为一种趋势,而流量工程动态路由选择算法则是流量工程方案的一个重要组成部分.本文分析了流量工程路由算法的研究现状,提出了以跳数和带宽作为量度的流量工程路由算法数学模型,并给出了路由算法规则.最后,通过计算机仿真验证了该算法的可行性和相对于只采用现行最短路径优先路由选择算法的优越性.     

A hybrid approach for the optimization of quality of service metrics of WSN

The core objective behind this research paper is to implement a hybrid optimization technique along with proactive routing algorithm to enhance the network lifetime of wireless sensor networks (WSN). The combination of two soft computing techniques viz. genetic algorithm (GA) and bacteria foraging optimization (BFO) techniques are applied individually on destination sequence distance vector (DSDV) routing protocol and after that the hybridization of GA and BFO is applied on the same routing protocol. The various simulation parameters used in the research are: throughput, end to end delay, congestion, packet delivery ratio, bit error rate and routing overhead. The bits are processed at a data rate of 512 bytes/s. The packet size for data transmission is 100 bytes. The data transmission time taken by the packets is 200 s i.e. the simulation time for each simulation scenario. Network is composed of 60 nodes. Simulation results clearly demonstrates that the hybrid approach along with DSDV outperforms over ordinary DSDV routing protocol and it is best suitable under smaller size of WSN.

     

NOC基于2D MESH的路由算法的比较

NOC设计的目的就是从体系结构上解决片上通信的瓶颈问题和时钟问题,片上网络的每条传输路径都包含若干路由器,经过每个路由器都要消耗数个时钟周期,当网络拥塞时,包传输会产生更大的延时,因此采用合适的路由算法来达到延时、吞吐率等的平衡是关键。本文使用NIRGAM仿真器对XY和OE两种算法在4×4的MESH拓扑上进行算法研究,结果显示OE算法的吞吐率和包延时的比值是2.5358,比XY路由算法的比值2.1126大,因此OE路由算法更适用于Mesh拓扑。     

时延和时延抖动约束的低费用多播路由算法

为了有效支持交互式实时组播业务,不仅要考虑时延约束,而且要考虑时延抖动约束,同时还需高效管理网络资源,以降低多播费用。本文提出了一种新的时延和时延抖动约束的低费用我播路由启发式算法,仿真结果表明该算法复杂度较低,时延抖动较小,又降低了网络费用,是一种快速有效的多播路由算法。     

Joint multi-QoS and energy saving routing for LEO satellite network

Low earth orbit(LEO) satellite network provides global coverage and supports a wide range of services. However, due to the rapid changes and energy-limitation of satellites, how to meet the demand of the quality of service(QoS) from ground traffic and prolong the lifetime of LEO satellite network is the research emphasis of the investigator. Hence, a routing algorithm which takes into account the multi-QoS requirements and satellite energy consumption(QER) of LEO satellite network is proposed. Firstly, the satellite intimacy degree(SID) and the path health degree(PHD) are introduced to obtain the path evaluation function according to the energy consumption and queue state of the satellite. Then, the distributed routing QER is established through the path evaluation function and the idea of genetic algorithm(GA), which enables each satellite to adjust traffic and realizes the network load balancing. Simulation results show that QER performs well in terms of end-to-end delay, delay jitter, and system throughput.     

有时延及时延差别约束的最小代价组播路由问题

本文把有时延、时延差别约束的组播路由问题提到优化的层次上,提出了有时延、时延差别约束的最小代价组播路由优化问题,并证明此问题是NP－complete问题。继而提出了一种基于动态罚函数法的启发式遗传算法以及解该问题,并分析了算法的复杂度。仿真表明,本文算法是有效的、稳定的。在满足两种约束的情况下,能够使网络代价优化。     

Information routing and reliability issues in distributed sensornetworks

Communication issues and problems in information routing in distributed sensor networks (DSNs) are considered. Two important communication constraints, viz., the delay constraint and the reliability constraint, are identified, and their impact on information routing is discussed. It is shown that the maximum end-to-end delay in a network depends on the diameter of the network, and efficient distributed algorithms are presented to determine the diameter of asynchronous networks. A distributed algorithm that determines the diameter of an asynchronous tree network when an arbitrary node in the network initiates the algorithm is introduced. An efficient algorithm for determining the diameter when multiple nodes initiate the algorithm is presented. An algorithm to determine the diameter of arbitrary networks is presented, and its message complexity is shown. Effects of link/node failures on network delay are studied, and important network structure design criterion are discussed. The distributed, dynamic routing algorithms are reviewed, and their adaptation to DSN environments is discussed     

Stability-Based RREQ Forwarding Game for Stability-Oriented Route Discovery in MANETs

In traditional stability-oriented route discovery of mobile ad hoc networks, in-between nodes need to rebroadcast identical route request (RREQ) packets, which contain same source node ID and broadcast sequence number, to discover more stable route, yet it increases routing overhead and data transmission delay obviously. Therefore, a stability-oriented route discovery algorithm is proposed to limit routing overhead and decrease transmission delay. In this algorithm, all neighbor nodes of some node will play a mix strategy game named stability-based RREQ forwarding game after receiving an identical RREQ, and independently determine the RREQ forwarding probability based on Nash equilibrium, respectively. The simulation results show that the proposed stability-oriented route discovery algorithm not only reduces routing overhead and transmission delay effectively, but also improve other routing performance.     

A new metric for dynamic routing algorithms

A dynamic routing algorithm that has as its goal the control of congestion in a packet switching network is presented. The algorithm is based in part on the ARPANET SPF algorithm. However, instead of employing a delay metric, the authors make use of a combination of link and buffer utilizations. A detailed simulation model of the ARPANET was constructed to compare the performance of the congestion-based algorithm to the traditional delay-based (SPF) routing algorithm. The results indicate a substantial improvement in the delay and throughput of the network with the congestion-based routing algorithm     

A Minimum Delay Routing Algorithm Using Distributed Computation

An algorithm is defined for establishing routing tables in the individual nodes of a data network. The routing table at a nodeispecifies, for each other nodej, what fraction of the traffic destined for nodejshould leave nodeion each of the links emanating from nodei. The algorithm is applied independently at each node and successively updates the routing table at that node based on information communicated between adjacent nodes about the marginal delay to each destination. For stationary input traffic statistics, the average delay per message through the network converges, with successive updates of the routing tables, to the minimum average delay over all routing assignments. The algorithm has the additional property that the traffic to each destination is guaranteed to be loop free at each iteration of the algorithm. In addition, a new global convergence theorem for noncontinuous iteration algorithms is developed.     

A distributed algorithm of delay-bounded multicast routing formultimedia applications in wide area networks

Multicast routing is to find a tree which is rooted from a source node and contains all multicast destinations. There are two requirements of multicast routing in many multimedia applications: optimal network cost and bounded delay. The network cost of a tree is defined as the sum of the cost of all links in the tree. The bounded delay of a routing tree refers to the feature that the accumulated delay from the source to any destination along the tree shall not exceed a prespecified bound. This paper presents a distributed heuristic algorithm which generates routing trees having a suboptimal network cost under the delay bound constraint. The proposed algorithm is fully distributed, efficient in terms of the number of messages and convergence time, and flexible in dynamic membership changes. A large amount of simulations have been done to show the network cost of the routing trees generated by our algorithm is similar to, or even better than, other existing algorithms