MPLS VPN动态路径管理算法*

针对标签交换路径的设计与维护问题,提出基于故障恢复模型的MPLS VPN动态路径管理算法。该算法在备份路径设计准则的基础上,测试全连通MPLS VPN中备份路径可用性的条件,利用快速备份路径构造算法,在多故障发生时,自动地构造满足客户故障恢复需求的VPN路径,从而使VPN业务受干扰程度最小。     

基于资源共享的MPLS组播网络中的路径恢复

MPLS组播网络能快速有效地传输数据，其中的路径恢复机制确保提供持续的网络服务。该文提出了一种基于资源共享的MPLS组播网络中的路径恢复方案，该方案在每条链路的入口处保存一个链路资源使用数据库，使用基于共享资源且提供带宽保证的备份路径计算方法来预先建立备份路径，能优化网络资源的利用并减少切换时延。     

PLS流量工程故障恢复路径算法

提出一种适合MPLS保护切换和再路由--备份路径预有效恢复机制的备份路径优化算法.该算法引入故障说明,针对指定的保护对象计算恢复路径,同时,对链路的带宽进行分割,在链路可用带宽中指定备份路径可用带宽.通过算法优化,备份路径可以充分利用工作路径上的资源,降低带宽资源消耗,在保证网络提供连续服务能力的同时,提高网络资源的利用率,优化网络的运行性能.     

MPLS快速重路由多故障恢复算法的研究

传统的MPLS快速重路由技术在面对网络多故障的情况时有许多不足之处,为了更好的解决问题,提出一种新的MPLS快速重路由多故障恢复算法.算法采用Detour路径保护方式,对有不同备份路径经过的链路上的预留带宽资源进行共享管理,并为工作路径建立主、从备份路径.仿真实验结果显示,该算法能够有效减少备份路径上预留带宽资源消耗,对出现多故障的网络进行快速恢复.     

MPLS故障恢复机制及其仿真研究

对MPLS故障恢复机制进行了研究,分析了各种恢复机制在恢复时机、恢复拓扑、恢复效率、备份路径资源耗费等方面的性能.对NS2进行扩展,设计和实现了支持MPLS故障恢复机制的仿真组件,包括故障检测、故障通告和故障切换功能.故障恢复仿真组件提供了基本MPLS恢复能力,支持多种故障恢复机制,为深入研究MPLS故障恢复方法、优化MPLS恢复算法提供了试验平台.     

面向IP快速路径切换的OSPF冗余路径算法

在IP网络中,当某链路或者节点发生故障时,通过路由协议的收敛来绕开故障的链路或节点.对OSPF路由协议,这个时间至少为5秒,期间经过故障节点或链路的流量将会被丢弃,绝大多数的应用可以承受这种程度的延迟.但是,对延迟敏感的应用如VoIP而言,这种量级的延迟是很难为用户所接受的.基于现有的OSPF路由协议的最短路径树(SPT)算法,提出一种支持IP快速重路由的多冗余路径树计算算法.算法计算除最短路径外至少一条不相交无环备份路径,保证在最短路径的链路或节点故障时,通过快速切换到备份路径,以提高IP网络的故障收敛时间.     

基于MPLS的分布式快速重路由算法

在分析现有MPLS快速重路由算法基础上提出了一种分布式的MPLS快速重路由算法,并给出了算法描述.算法通过划分自治域并行预先建立备份路径,从而降低了原来算法中对整个拓扑预先建立备份路径的复杂度.仿真试验表明该算法在丢包率、重路由成功率上比现有算法有较好的性能.     

支持多故障恢复的MPLS快速重路由

分析了传统MPLS快速重路由应对多故障环境的不足,提出一种支持MPLS域并发多故障时快速恢复的重路由策略.通过有限洪泛故障信息,使本地修复的节点掌握有限范围内节点、链路的可用性信息,并通过建立主,从备份路径,保证MPLS层有效的恢复及较快的切换速度.理论分析及实验结果表明了该方法的可行性和有效性.     

基于Linux的一种MPLS故障恢复的设计与实现

目前主要存在Haskin方案和Makam方案两种不同MPLS故障恢复机制.根据对二者进行分析比较,采用Makam方案,提出在静态LSP下,检测到MPLS故障时可采用的两种实现方法:一种是通过修改IP路由表来实现保护倒换;另一种是通过修改MPLS转发表实现保护倒换.依据实际的网络环境选择后者进行设计与实现,给出了具体的处理流程、相应的数据结构和修改MPLS转发表的方法.最后,对拓扑图配置Lsp进行试验,试验显示故障发生后成功保护倒换到备份Lsp,从而证明本方法的可行性和快速性.     

基于Diffserv的MPLS多备份路径故障恢复模型

分析传统MPLS故障恢复机制的不足,提出一种新的MPLS故障恢复模型.该模型采用三种备份路径来减少丢包率.在传统MPLS故障恢复机制不考虑QoS的情况下,该模型将Diffserv、TE(Traffic Engineering)及MPLS三者相结合,来实现Diffserv网络中的QoS.仿真试验和结果分析证明了该模型的可行性和有效性.     

A backup path routing for guaranteeing bandwidth in mobile ad hoc networks for multimedia applications

This paper suggests a backup path routing scheme in ad hoc networks for multimedia applications. A data path is established in an on-demand manner when there is a need to send data. A primary and a backup path are created as a result of a route control message exchange process. Each control message has additional information for guaranteeing the service quality. A backup path is configured around the primary path in multi-hop wireless networks. After detecting a failure when sending data, a repairing procedure occurs near the failed node of the primary path. The proposed scheme exploits the route request and reply information exchanged between nodes to create a backup path. Proposed backup routing scheme uses a one-hop search method, and the rerouted path length is two-hop at maximum. The service quality as measured by the error rate and delay is considered when establishing and repairing a route by making an allowance for the required bandwidth. Simulation results show that the proposed backup path routing scheme has a better data delivery ratio and an improved end-to-end data delay while guaranteeing the requested bandwidth for multimedia application.     

Joint coverage and link utilization for fast IP local protection

To mitigate the impact of failures, many IP Fast Local Recovery (IPFLR) schemes have been proposed to reroute traffic in the events of failures. However, the existing IPFLR schemes either aimed to find the alternate backup routes to protect failures, or focused on balancing the traffic load routed on the backup routes. Furthermore, in Internet, flows are often managed by shortest path routing, and therefore purely determining the backup routing paths is not sufficient in protecting the error-prone networks. In this paper, we propose a Simulated Annealing based Load balancing and Protection (SALP) scheme to determine link weights for balancing link utilization in the non-failure state and simultaneously construct backup routing tables for protecting any single link failure in IP networks. In our proposed scheme, the two most significant issues, (1) load balancing and (2) coverage, are jointly considered to recover the network operation from single link failures. In the proposed scheme, upon a failure, only the nodes adjacent to a failure are activated to divert affected traffic to backup paths without disturbing regular traffic. Numerical results delineate that the proposed scheme achieves high coverage rate and load balancing at the expense of slightly increasing the entries of backup routing table.     

Dynamic Path Management with Resilience Constraints under Multiple Link Failures in MPLS/GMPLS Networks

Most previous research on MPLS/GMPLS recovery management has focused on efficient routing or signaling methods from single failures. However, multiple simultaneous failures may occur in large-scale complex virtual paths of MPLS/GMPLS networks. In this paper, we present a dynamic MPLS/GMPLS path management strategy in which the path recovery mechanism can rapidly find an optimal backup path which satisfies the resilience constraints under multiple link failure occurrences. We derived the conditions to test the existence of resilience-guaranteed backup path, and developed a decomposition theorem and backup path construction algorithm for the fast restoration of resilience-guaranteed backup paths, for the primary path with an arbitrary configuration. Finally, simulation results are presented to evaluate the performance of the proposed approach.     

An efficient critical protection scheme for intra-domain routing using link characteristics

In recent years, there are substantial demands to reduce packet loss on the Internet. Among the proposed schemes, finding backup paths in advance is considered to be an effective method to reduce the reaction time. Very commonly, a backup path is chosen to be the most disjoint path from the primary path, or on the network level, a backup path is computed for each link (e.g., IPFRR). The validity of this straightforward choice is based on two things. The first thing is all the links may have the equal likelihood to fail; the second thing is, facing the high protection requirement today, it just looks weird to have links not protected or to share links between the primary and backup paths. Nevertheless, many studies have confirmed that the individual vulnerability of the links on the Internet is far from being equal. In addition, we have observed that full protection schemes (In this paper, full protection schemes means schemes (1) in which backup path is a most disjoint path from the primary path; or (2) which compute backup path for each link.) may introduce high cost (e.g., computation).In this paper, we argue that such approaches may not be cost-efficient and therefore propose a novel critical protection scheme based on link failure characteristics. Firstly, we analyze the link failure characteristics based on real world traces of CERNET2 (China Education and Research NETwork 2). The analysis results clearly show that the failure probabilities of the links in CERNET2 backbone are heavy-tailed, i.e., a small set of links causing most of the failures. Based on this observation, we find out two key parameters which strongly impact link criticality and propose a critical protection scheme for both single link failure situation and multi-link failure situation. We carefully analyze the implementation details and overhead for backup path schemes of the Internet today; the problem is formulated as an optimization problem to guarantee the routing performance and minimize the backup cost. This cost is special as it involves computational overhead. Based on this, we propose a novel Critical Protection Algorithm which is fast itself for both the single link failure and the multi-link failure versions. A comprehensive set of evaluations with randomly generated topologies, real world topologies and the real traces from CERNET2, shows that our scheme gains significant achievement over full protection in both single link failure situation and multi-link failure situation. It costs only about 30–60% of the full protection cost when the network relative availability increment is 90% of the full protection scheme.     

基于可靠性WSN路由协议的设计与实现

针对某些应用的高可靠性要求,设计并实现适合无线传感器网络（WSN）应用的多路径可靠路由协议。该路由协议通过建立备份路径,并在主路径失效的情况下采用备份路径传输数据的方法来提高数据传输的可靠性。该协议主要包括节点局部拓扑信息的获取、路由请求、节点主干路径的建立、Sink或中间节点发送路径增强信息建立备份路由、主路径失效后启用备份路径发送数据过程。仿真测试结果表明,该多路径可靠协议在主干路径失效的情况下,可以有效减小路径断裂引起的丢包现象,进而提高网络整体数据传输的可靠性。     

基于拥塞及内存感知的SD-WAN故障恢复

在软件定义广域网(SD-WAN)中, 链路故障会导致大量丢包, 严重时会引起部分网络瘫痪. 现有的流量工程方法通过在数据平面提前安装备份路径能够加快故障恢复过程, 但在资源受限的情况下难以适应各种网络故障情况, 从而使恢复后的网络性能下降. 为了保证网络在故障恢复之后的性能并减少备份资源的消耗, 本文提出一种基于拥塞及内存感知的主动式故障恢复方案(CAMA), 不仅能够将受影响数据流进行快速重定向, 还能实现负载均衡避免恢复后潜在的链路拥塞. 实验结果表明, 与已有方案相比, CAMA能有效利用备份资源, 在负载均衡上有较好的性能, 且仅需少量备份规则即可覆盖所有单链路故障情况.     

基于DSR协议的备用路由机制设计和性能评价

由于Adhoc网络中无线节点的移动性及无线信道的不稳定性,已经建立起来的源和目的节点间的路由在多媒体业务传输过程中往往会失效,重新发现路由会导致较大延迟和丢包,对实时多媒体业务传输这是不能接受的,因此需要在Adhoc网络中建立一种快速路由恢复机制以减少因路由失效引起的较大端到端的延迟和丢包。将有线网络中广泛使用的备用路由机制扩充到了无线Adhoc网络DSR路由协议上,并通过实验床上进行的户外实验,分析和评价了增加了备用路由的DSR协议在减少路由失效次数和投递率方面的性能改善。     

基于逐跳转发方式的单故障路由保护方法

业界提出利用LFA（loop free alternates）方案来应对网络中频繁出现的故障,然而LFA并不能保护网络中所有可能出现的单故障情形。针对上述问题,提出了一种基于逐跳转发方式的单故障路由保护算法SFRPA（single failure routing protection algorithm based on hop by hop forwarding）。SFRPA首先提出了三个无环路备份下一跳选取规则,然后制定了优先级队列的操作规则,最后利用优先级队列和无环路备份下一跳选取规则为所有源目的节点对计算出一个最优的备份下一跳。该算法具有支持逐跳转发、支持增量部署、保护网络中所有可能的单故障情形三个特征。实验结果表明,与经典的路由保护方案LFA、DMPA、TBFH和IAC相比较,SFRPA不仅可以应对网络中所有可能的单故障情形,并且具有较小的路径拉伸度。     

一种线性时间复杂度的高效路由保护方法

如何高效快速地应对网络中的故障是设计路由协议的基本要求和主要任务。由于动态路由协议在应对网络中的故障时,在协议动态收敛的过程中将会有大量的报文被丢弃。因此,目前路由器厂商普遍采用路由保护方法来克服网络故障,在众多的路由保护方法中,DC（downstream criterion）规则是一种被普遍认可的方法。然而,已有的实现 DC规则算法的时间复杂度普遍较高,并且复杂度随着网络节点平均度的增加而迅速增加。为了应对上述问题,提出一种线性时间复杂度的高效路由保护方案ERPLR（an efficient routing protection method with linear time complexity）,该方法首先提出了备份下一跳计算规则,然后在已有最短路径树的基础上,根据备份下一跳计算规则为所有的源目的节点对计算备份下一跳。在计算备份下一跳的过程中,每个节点和其邻居最多被访问一次,因此ERPLR的时间复杂度为O（V+E）。实验结果表明,与已有的实现DC规则相比较,ERPLR在故障保护率和路径拉伸度两个度量指标结果相似的情况下,在真实网络拓扑和模拟拓扑中,ERPLR分别降低了大约74.93%和78.91%的计算开销,该方法可以极大地降低DC规则的计算开销。     

A novel recursive shared segment protection algorithm in survivable WDM networks

This paper investigates the problem of dynamic survivable routing for shared segment protection in mesh Wavelength-Division-Multiplexing (WDM) optical networks. We propose a heuristic algorithm, named Recursive Shared Segment Protection (RSSP), to introduce a more flexible way to partition the working path into segments and compute the corresponding backup segments. In RSSP, the working segments cannot be determined before the backup segments are found, we adopt a recursive process to compute the backup segments one by one and then choose an optimized way to partition the working path. The calculations of every neighbor working segment and its backup segment are connected with each other. We constrain the hop count for each backup segment to insure the short failure recovery time and control the bandwidth resource utilization. Compared with the Share Path Protection (SPP), RSSP can achieve much shorter failure recovery time with a little sacrifice in bandwidth resource utilization and RSSP can also perform better compromise between the failure recovery time and the bandwidth resource utilization than the Equal-Length Segment Protection (ELSP) algorithm. We evaluate the effectiveness of RSSP and the results are found to be promising.