一种新的Ad hoc 网络中基于位置的路由协议

该文提出了一种新的恢复策略来替代基于位置的路由协议中的面遍历算法。结合贪婪的转发策略和新的恢复策略,形成一种新的基于位置的路由协议。通过NS仿真器对新的路由协议和贪婪的周边无状态路由协议(Greedy Perimeter Stateless Routing, GPSR)进行了评估。实验结果表明,新的路由协议在平均的端到端时延、吞吐量和包传送率方面优于GPSR。     

一种面向多业务恢复的路由优化算法

讨论了在WDM光传送网中完成多业务恢复时所出现的恢复路由资源竞争问题，并提出了一种基于遗传算法的面向多业务恢复的路由优化算法。该算法可以有效地解决恢复路由资源竞争问题，得到全局最优恢复路由。通过对实际网络的计算，验证了该算法在解决多业务恢复路由优化问题上所具备的优势。     

自愈网中通道型满溢算法的再路由能力

在自愈网中,分布式恢复在比集中式恢复更迅速的同时,其再路由能力如何？与最大再路由能力之间的差异如何？本文通过模拟试验和分析发现,通道型满溢算法的再路由能力一般不会大大低于最大再路由能力,若迂回路由转接次数增大,则其再路由能力增强,但同时与最大再路由能力之间的差异呈增大趋势。该研究结果对于全面了解分布式恢复的性能,合理设计链路冗余容量或迂回路由转接次数,以使满溢算法的恢复率接近集中式算法的恢复率,具有实际意义。     

光网络分布式恢复机制的恢复时间分析

针对光网络分布式恢复中动态恢复和预计算路由恢复两大类机制,就恢复时间这一至关重要的恢复参数进行了性能分析.通过比较,指出预计算路由恢复机制在快速恢复方面具有更优的性能.     

移动路由优化分析

针对三角路由讨论了一种路由优化方案,通过NS仿真比较路由优化前后数据包传输路径和平均时延,路由优化方案成功地消除了三角路由的影响,数据包平均时延降低,很大程度上提高了网络的传输效率。     

一种可部署在重路由光网络中实现有效连接管理的策略——基于分布式代理与蚁群算法

在大型骨干光网络中, 建立一条从源节点到宿节点的路由至关重要。在集中式网络管理系统体系下, 网络中动态路由信息以及故障状态信息, 通过路由的“泛洪”机制, 被传送到其他节点上实现资源信息共享,这对于连接的迅速建立, 恢复路由的快速启动将是不利的。尝试采用一种启发式算法-蚁群策略, 快速提高光网络中故障恢复的速度。该路由算法平台采用了分布式蚁群算法自动修复故障点, 解决了重路由的快速收敛问题; 依靠分布式代理机制构建管理平面和数据平面相互通信的机制, 完成诸如链路信息素的更新等功能。设计了一个网络故障的场景, 通过实验数据表明, 采用蚁群的分布式路由策略, 可以更快地实现路由信息的汇聚, 找到最佳的恢复路由。     

无线传感器网络高可靠低维护地理路由协议

无线传感器网络地理路由协议要求节点根据少量本地路由信息将数据分组传输路由到目标节点。为了消除路由环,地理路由算法通常需要将网络拓扑平面化。然而现有的平面化算法要么假设节点的通信半径是一固定值,在实际应用中不适用;要么对每一条链路都进行检测是否有交叉链路,路由维护代价很高。针对以上问题,提出一种具有高可靠性和低维护成本的地理路由协议RPR(region partitioning-based routing),其基本思想是将网络划分为规则多边形区域,并在贪心路由失败时将多边形区域内的所有节点看作一个虚拟节点进行周边路由。多边形区域间通信能够降低平均路由路径长度,从而提高了路由的可靠性。基于区域划分的网络平面化策略不需要检测和删除相交链路,因此减少了路由维护开销。模拟实验结果显示,RPR协议比现有方法的平均路由路径长度更短,路由维护开销更低。     

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

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

光网络中基于路径计算单元的路由机制研究

针对大规模多层多域光网络群故障发生时的网络受损情况,提出基于路径计算单元(PCE)架构的跨域路由算法进行快速恢复,并基于OMNet平台对多层多域路由方案进行了性能仿真分析。结果表明,基于PCE架构的路由策略在群故障发生时能够大大减少网络中的路径计算请求泛洪信息,降低路由计算收敛时间,可以提高全网剩余资源的资源利用率,为业务的快速恢复提供了路由基础。     

基于并行BP神经网络的路由查找算法

结合Bloom-filter算法和并行反向传播神经网络,提出了一种新的基于并行神经网络的路由查找算法(BFBP)。该算法满足路由查找的需求,只需学习路由条目的网络ID,且易于扩展到IPv6地址查询。研究结果表明,相比于己有的神经网络路由查找方法,该算法需要学习的条目数平均减少了520倍,提高了学习效率,为神经网络应用于路由查找创造了有利条件。     

基于缓存旁路和本地修复的多跳网络路由重建机制

该文针对多跳网络中现有AODV和AODV-BR按需路由算法的弊端,提出了基于缓存旁路和本地修复的AODV-CL路由重建机制。该机制利用空闲时间监听无线信道中传输的所有数据包和路由控制信令,用于维护有效的邻居节点列表及本地路由缓存,有效降低了周期性HELLO消息带来的信令负担,并增加了可用路由信息。中间节点在发现断链时,尝试采用局部修复,尽量避免由源节点广播RREQ消息发现路由。根据本地路由缓存及邻居节点的路由信息,实现了快速的路由发现及修复,能有效降低路由控制信令开销及丢包率。     

Way-Point Multicast Routing Framework for improving QoS in hybrid wireless mesh networks

Since internet access is used by billions of people worldwide and the number of internet user is also increasing every day, a new technology called as wireless mesh network (WMN) is becoming popular. This is because it has some desirable characteristic, but it has some limitation for multi-hop routing, bandwidth, and many more. In order to overcome these issues, we proposed Way-Point Multicast Routing Framework (WPMRF) for improving the quality of service (QoS) in Hybrid WMN. Initially, the multicast framework is established based on the minimum load factor. The route established with least load factor is considered, as it avoids any kind of congestion in the network. After that, segmentation of route is done, and the way-point nodes are selected to join the multicast session. After that, the transmission is performed using MAODV and ODMRP protocol. In addition, an estimated route disconnection parameter is used for fast route recovery process and helps to select more reliable route path. The advantage of the proposed work is that it provides more reliable routing path to increase the quality of service (QoS) with fast route recovery process.     

Local replacement for route recovery on a collaborative mobile ad hoc network

This paper presents an efficient route recovery approach for a collaborative mobile ad hoc network (MANET). In the collaborative MANET, the movement of a node can be controlled by other nodes. Based on the property of the controllable movement, each active node (each node on a route) can be protected by its neighboring nodes. When the movement of an active node causes a link breakage on a route, its neighboring nodes compete with each other to move to the original location of the moving active node. Using the movements of neighboring nodes, the proposed approach can achieve route recovery without pre‐establishing or dynamically finding backup routes. The proposed approach also has much less recovery overhead than previous approaches because of the local recovery. Finally, we perform extensive simulations to compare the proposed approach with previous approaches. The simulation results show that the proposed approach has better recovery performance under dense and sparse MANET architectures. Copyright © 2010 John Wiley & Sons, Ltd.     

Bypass routing: An on-demand local recovery protocol for ad hoc networks

On-demand routing protocols for ad hoc networks reduce the cost of routing in high mobility environments. However, route discovery in on-demand routing is typically performed via network-wide flooding, which consumes a substantial amount of bandwidth. In this paper, we present bypass routing, a local recovery protocol that aims to reduce the frequency of route request floods triggered by broken routes. Specifically, when a broken link is detected, a node patches the affected route using local information, which is acquired on-demand, and thereby bypasses the broken link. We implemented SLR (Source Routing with Local Recovery) as a prototype of our approach. Simulation studies show that SLR achieves efficient and effective local recovery while maintaining acceptable overhead.     

互联网BGP路由收敛问题研究现状的分析

文章重点分析了互联网边界网关协议(BGP)路由收敛问题,叙述了当前国际上对这个问题的几种解决方案,并指出了这几种解决方案所存在的问题.作者提出了自己的观点:BGP路由收敛问题与各路由器有不同的路由策略;各路由器BGP的数据更新时延不同;各链路连接失败和恢复的次序不同;路由更新消息的粒度与多方因素有关,应该找出一种综合的解决方法.     

A LOOP-BASED APPROACH IN CLUSTERING AND ROUTING IN MOBILE AD HOC NETWORKS

Although clustering is a convenient framework to enable traffic control and service support in Mobile Ad hoc NETworks （MANETs）, it is seldom adopted in practice due to the additional traffic overhead it leads to for the resource limited ad hoc network. In order to address this problem, we proposed a loop-based approach to combine clustering and routing. By employing loop topologies, topology information is disseminated with a loop instead of a single node, which provides better robustness, and the nature of a loop that there are two paths between each pair of nodes within a loop composed of setup procedure, regular procedure and emergent route recovering. suggests smart route recovery strategy. Our approach is recovery procedure to achieve clustering, routing and     

基于改进蚁群算法的舰船航路规划研究

舰船在障碍物环境中航行,如果采用传统的人工绘制航线的方法,不仅费时费力,并且绘制的航线非常不准确,在障碍物位置发生变更的情况下,整条航线都要重新设计和绘制;其次,人工绘制的航线图,不便于保存,应用范围非常窄。为了弥补人工绘制航线的缺陷,采用一种基于改进蚁群算法的方法规划舰船的航线,并对改进的蚁群算法进行了仿真,获得了舰船在障碍物环境下的最优航线。     

LMA initiated route optimization protocol for improving PMIP handover performance

We propose a Local Mobility Anchor (LMA) initiated route optimization protocol for a smooth transition from the old optimized path to a new optimized path after handover in Proxy Mobile IP (PMIP). The LMA initiated protocol can reduce the handover latency and achieve fast recovery of the optimized path after handover. As a result, the proposed protocol solves the out-of-sequence delivery problem during the route optimization procedure.     

Hamilton模型在智慧文旅设计中的应用研究

旅游线路优化问题是旅行规划中一个重要课题,是旅游业发展到一定阶段的必然要求。对传统Hamilton算法进行优化改进,对云南省的5A级景点线路进行了优化。并将该算法设计成程序,便于游客的线路选择。研究结果发现:使用该方法对景点的经纬度数据进行一次分配,便可获最短的旅行线路。这种算法减少了线路选择的时间,操作更加简单,展示了定量研究方法在旅游线路优化设计中的应用潜力。     

网格中基于最小连接块的启发式容错路由算法

矩形无效块模型可以用来解决网格下的容错路由问题,最小连接块(MCC)模型是它的一个改良模型.本文在MCC基础上,建立MCC 重叠图,当发现不存在曼哈顿路径的时候,给出一套算法,来计算出一条避免无效块的尽可能短的路径.模拟试验表明,通过这种算法找到的路径,与最短路径相差很小.比起花费更多的时间去找寻最短路径,这种启发式容错算法无疑是更好的选择.