Using Shared Risk Link Groups to enhance backup path computation

To cope quickly with all types of failure risks (link, node and Shared Risk Link Group (SRLG)), each router detecting a failure on an outgoing interface activates locally all the backup paths protecting the primary paths which traverse the failed interface. With the observation that upon a SRLG failure, some active backup paths are inoperative and do not really participate to the recovery (since they do not receive any traffic flow), we propose a new algorithm (SRLG structure exploitation algorithm or SSEA) exploiting the SRLG structures to enhance the admission control and improve the protection rate.With our algorithm, more flexibility is provided for the backup path selection since a backup path which protects against the failure of a link belonging to a SRLG does not systematically bypass all the links of that SRLG. Moreover, our algorithm permits to save more bandwidth because it does not allocate the bandwidth for the inoperative backup paths even if they are activated.Simulations show that our algorithm SSEA decreases the ratio of rejected backup paths and, it reduces in distributed environments the average number of messages sent to manage the bandwidth information necessary for the backup path computation.     

PLR-based heuristic for backup path computation in MPLS networks

To ensure service continuity in networks, local protection pre-configuring the backup paths is preferred to global protection. Under the practical hypothesis of single physical failures in the network, the backup paths which protect against different logical failure risks (node, link and shared risk link group (SRLG)) cannot be active at the same time. Thus, sharing bandwidth between such backup paths is crucial to increase the bandwidth availability.In this article, we focus on the optimal on-line distributed computation of the bandwidth-guaranteed backup paths in MPLS networks. As the requests for connection establishment and release arrive dynamically without knowledge of future arrivals, we choose to use the on-line mode to avoid LSP reconfigurations. We also selected a distributed computation to offer scalability and decrease the LSP setup time. Finally, the optimization of bandwidth utilization can be achieved thanks to the flexibility of the path choice offered by MPLS and to the bandwidth sharing.For a good bandwidth sharing, the backup path computation entities (BPCEs) require the knowledge and maintenance of a great quantity of bandwidth information (e.g. non aggregated link information or per path information) which is undesirable in distributed environments. To get around this problem, we propose here a PLR (point of local repair)-based heuristic (PLRH) which aggregates and noticeably decreases the size of the bandwidth information advertised in the network while offering a high bandwidth sharing. PLRH permits an efficient computation of backup paths. It is scalable, easy to be deployed and balances equitably computations on the network nodes.Simulations show that with the transmission of a small quantity of aggregated information per link, the ratio of rejected backup paths is low and close to the optimum.     

A new shared-risk link groups (SRLG)-disjoint path provisioning with shared protection in WDM optical networks

This paper addresses the protection problem in WDM optical networks and presents a New Shared-risk link groups (SRLG)-Disjoint Path Provisioning (NSDPP) approach with shared protection to tolerate the single-risk failure. Comparing to previous Shared-risk link groups (SRLG)-Disjoint Path Provisioning (SDPP) approach, NSDPP is able to obtain better performance, because in NSDPP some primary path and backup paths of other primary paths can share the common resources if the corresponding rules can be satisfied. Simulation results are shown to be promising.     

一种高效快速的无人机自组网网关切换算法

针对无人机自组网网关节点突然失效给网络性能和网络可靠性带来的不利影响,提出一种高效快速的无人机自组网网关切换算法。首先,设计了备份网关的选择机制,通过考虑网关节点和邻居节点之间的距离因素从而选出备份网关节点;其次,改进了网关失效识别机制,备份网关可以更快地检测出网关节点是否失效;最后,提出了高效快速的无人机自组网网关切换机制,减少了网关功能失效的时间。仿真结果表明,所提算法可以降低无人机自组网网关的失效时间,提高无人机网络的可靠性并使时延、吞吐量等性能得到了提升。     

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.     

Network coding based reliable disjoint and braided multipath routing for sensor networks

This paper presents network coding based reliable disjoint and braided multipath routing (NC-RMR ) for sensor networks, which forms multipath by hop-by-hop method and only maintains local path information of each node without establishing end-to-end paths. Neighbors of each local node are divided into groups according to their hops to sink nodes to improve the network load balancing. For further performance improvement of NC-RMR with disjoint multipath model, local nodes select their own backup nodes in neighbor nodes to form additional logical paths, which implement a braided multipath model. Security advantages of NC-RMR with multipath and network coding mechanisms are analyzed. Analytical and simulation results prove that braided multipath routing model has better performance over disjoint model, and NC-RMR protocol can reduce the required number of transmission paths, ensure load balance of sensor network system, reduce the energy consumption of nodes.     

GMPLS网络中多约束QoS路由的预计算方法

GMPLS(generalized multiprotocol label SWitching)网络中的多约束QoS路由问题是要在诸如带宽、代价和延迟的约束条件下找到一条优化的路径.这个问题通常被认为是一个NP-完全问题.在研究共享风险链路组具有的启发信息的基础上,提出了一种具有共享风险链路启发信息的多约束预计算算法.该算法包含预计算和搜索两个部分.预计算主要是能创建和更新每个节点上的路由表.而后,搜索部分则可以在层次化的结构中选择满足约束条件的优化的路径.大量仿真数据表明,相应的方法能够取得满意的结果,可以有效地解决GMPLS网络中多约束的QoS路由问题.     

基于免疫连通模型的多路径传输选择算法

为解决无线传感器网络（WSN）中节点部署不均匀造成的节点能量消耗大、数据传输可靠性低的问题,提出了一种基于免疫连通模型的多路径传输选择算法。当数据传输发生故障时,免疫机制被用来选择路径的适应度函数,从而达到优化传输路径和减少节点能耗的目的。实验从网络寿命、端到端传输延迟、覆盖率、传输可靠性、载荷分布等指标对算法进行评价。实验结果显示,所提算法可更好地平衡负载,延长网络的生命周期,以及保证数据传输的可靠性。所提算法可以应用于对能量效率、可扩展性、延长网络寿命和降低网络开销有较高要求的传感器网络设计。     

基于免疫连通模型的多路径传输选择算法

为解决无线传感器网络（WSN）中节点部署不均匀造成的节点能量消耗大、数据传输可靠性低的问题，提出了一种基于免疫连通模型的多路径传输选择算法。当数据传输发生故障时，免疫机制被用来选择路径的适应度函数，从而达到优化传输路径和减少节点能耗的目的。实验从网络寿命、端到端传输延迟、覆盖率、传输可靠性、载荷分布等指标对算法进行评价。实验结果显示，所提算法可更好地平衡负载，延长网络的生命周期，以及保证数据传输的可靠性。所提算法可以应用于对能量效率、可扩展性、延长网络寿命和降低网络开销有较高要求的传感器网络设计。     

基于多链路故障的网络切片生存性算法

为了保证当底层网络的多条物理链路发生故障时用户业务能够不间断,提出一种基于多链路故障的网络切片生存性算法。通过区分切片上承载的业务类型,当高可靠低延迟切片请求到达后,将物理节点按节点重要度排序后进行映射,再对故障链路采用多备份路径算法,选取带宽资源消耗最少的路径依次对故障链路进行重映射,当高带宽切片请求到达后,采用广度优先搜索的节点映射算法,再通过多备份路径对故障链路进行恢复。仿真结果表明,该算法能够提高切片平均映射成功率、长期平均收益开销比、物理链路利用率和故障恢复率,缩短平均故障恢复时延。     

基于历史传输效率的最小传输延迟算法设计

机会网络的数据交换不需要完整的路径,且传递数据是基于节点机会移动和机会相遇。相对于传统网络来说,达到了绿色节能的目的。但是,机会网络中节点逐跳传递数据存在较大的传输时延和大量的数据副本,造成传递过程中节点能量的过度消耗,为了取得较小的传输时延和较少的数据副本,本文提出基于历史传输效率的最小传输延迟算法MDBHE算法,根据历史的传输效率构建一条局部效率高且传输时间短的传递路径。仿真实验结果表明,MDBHE算法与传统的机会路由算法相比,缩短了传输时延,提升了机会网络的传递成功率。     

Backup path set selection in ad hoc wireless network using link expiration time

Topological changes in mobile ad hoc networks frequently render routing paths unusable. Such recurrent path failures have detrimental effects on quality of service. A suitable technique for eliminating this problem is to use multiple backup paths between the source and the destination in the network. Most of the proposed on-demand routing protocols however, build and rely on single route for each data session. Whenever there is a link disconnection on the active route, the routing protocol must perform a path recovery process. This paper proposes an effective and efficient protocol for backup and disjoint path set in an ad hoc wireless network. This protocol converges into a highly reliable path set very fast with no message exchange overhead. The paths selection according to this algorithm is beneficial for mobile ad hoc networks, since it produces a set of backup paths with much higher reliability. Simulations are conducted to evaluate the performance of our algorithm in terms of route numbers in the path set and its reliability. In order to acquire link reliability estimates, we use link expiration time (LET) between each two nodes.In another experiment, we save the LET of entire links in the ad hoc network during a specific time period, then use them as a data base for predicting the probability of proper operation of links.Links reliability obtains from LET. Prediction is done by using a multi-layer perceptron (MLP) network which is trained with error back-propagation error algorithm. Experimental results show that the MLP net can be a good choice to predict the reliability of the links between the mobile nodes with more accuracy.     

Implementation of energy efficient circuit design using A* algorithm in embedded network

In wireless sensor network, the routing path plays a prominent role in network resource utilization. Since, the nodes in network are open to physical abuse an effective routing protocol is necessary to improve data reliability in network and to overcome node data link disconnection. In this paper, we propose to implement A*EEDDP (Energy Efficient Distributed Diffusion protocol) to improve data reliability and increase network lifetime. The A* algorithm determines the shortest routing path between source node and destination node. In addition, the routing path determine with respect to parameters such as energy consumed for communication, residual energy of nodes and the time over which the nodes can support the routing path. The combined A*EEDDP implement in testbed and performance evaluate interms of network lifetime, throughput, packet delivery ratio, energy efficiency and end to end delay. The A*EEDDP performs better compared to other algorithm and achieves higher packet delivery ratio of 97%.     

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

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

Traffic recovery time constrained shared sub-path protection algorithm in survivable WDM networks

With the development of real-time applications, the traffic recovery time, which is defined as the duration between the failure occurrence on the working path and the interruptive traffic has been successfully switched to the backup path, has become the basic Quality-of-Service (QoS) requirement in survivable WDM networks. In this paper, we address the problem of shared sub-path protection with considering the constraint of traffic recovery time and propose a new heuristic algorithm called Traffic recovery time Constrained Shared Sub-Path Protection (TC_SSPP) to compute the working path and the Shared-Risk-Link-Group (SRLG)-disjoint backup sub-paths. The main target of our work is to improve the resource utilization ratio and reduce the blocking probability for dynamic network environment. By properly setting the delay parameter for each link and running the Delay Constrained Shortest Path Algorithm (DCSPA) to compute the backup sub-paths, TC_SSPP can effectively guarantee the traffic recovery time. Simulation results show that the proposed TC_SSPP can outperform the traditional algorithms.     

一种时延约束下可靠性保证的服务功能链部署方法

针对网络功能虚拟化环境中底层网络物理节点随机失效导致网络服务中断问题,提出了一种兼顾网络服务可靠性和时延约束的服务功能链部署方法以保证网络服务的可靠性。首先提出一种相邻虚拟网络功能备份实例资源共享的备份机制和单路径与多路径混合的路由策略,然后对时延约束下服务功能链可靠性部署问题建立混合整数线性规划模型,并设计了基于K最短路径扩展的服务功能链部署算法。仿真结果表明,与现有方法相比,该方法降低了节点和带宽资源开销,并提高了网络服务请求接受率。     

基于决定性能量比例的多径传输技术

多径传输有两种模式：一种是主／备模式,只有在主路径失效之后,其它路径才可以传输数据;另一种是复制模式,数据同时从所有的路径传输。在传感器网络中,这两种模式都没有很好地结合能量节约和负载均衡。本文提出了一种传感器网络中能量敏感负载均衡的多径传榆策略,数据基于决定性能量比例（DER）从源到目标沿着多径传输。这种技术不必定期计算DER,容易实现而且开销较小。本文还提出带有过载避免机制的DER技术（DEROA）,用束减少某些关键节点的过多通信量。仿真结果证明,DER可以达到有效传输的目的。     

Two Heuristics for Calculating a Shared Risk Link Group Disjoint Set of Paths of Min-Sum Cost

A shared risk link group (SRLG) is a set of links which share a common risk of failure. Routing protocols in Generalized MultiProtocol Label Switching, using distributed SRLG information, can calculate paths avoiding certain SRLGs. For single SRLG failure an end-to-end SRLG-disjoint path pair can be calculated, but to ensure connection in the event of multiple SRLG failures a set with more than two end-to-end SRLG-disjoint paths should be used. Two heuristic, the Conflicting SRLG-Exclusion Min Sum (CoSE-MS) and the Iterative Modified Suurballes’s Heuristic (IMSH), for calculating node and SRLG-disjoint path pairs, which use the Modified Suurballes’s Heuristic, are reviewed and new versions (CoSE-MScd and IMSHd) are proposed, which may improve the number of obtained optimal solutions. Moreover two new heuristics are proposed: kCoSE-MScd and kIMSHd, to calculate a set of \(k\) node and SRLG-disjoint paths, seeking to minimize its total cost. To the best of our knowledge these heuristics are a first proposal for seeking a set of \(k\, (k>2)\) node and SRLG-disjoint paths of minimal additive cost. The performance of the proposed heuristics is evaluated using a real network structure, where SRLGs were randomly defined. The number of solutions found, the percentage of optimal solutions and the relative error of the sub-optimal solutions are presented. Also the CPU time for solving the problem in a path computation element is reported.     

引入权重信息改善Ad Hoc网络路由协议的设计方法

由于Ad Hoc网络自身的特点,使其路由协议比传统的有线网络更为复杂.本文在分析了AODV路由协议及提出对其进行改善的AODV-BR路由协议的工作原理后,对AODV-BR中的备份节点从通信能力的角度,根据节点的传输速率和发包时延,引入了权重的度量标准,对AODV-BR协议进行了改善.仿真结果表明,该方法是有效的,它缩短了由于主路径断裂,目标节点接收到数据包的时刻与源接点发送数据包时刻之间的延迟,保证了通信质量.     

基于离散粒子群算法的动态网络路由重组

寻找最优路由作为动态网络研究的一个重要方面,对于提高网络资源的利用率及可靠性具有现实的应用价值,但无论在理论上还是实际的网络条件下,最优问题一直都是研究难点。针对不同的网络实际条件,提出一种改进的离散粒子群算法来寻找网络中任意两个节点间的最优路由。在以寻找最小路由总延时作为目标函数的情况下,仿真结果显示该算法能较准确地在网络拓扑结构变化的情况下较快地寻找到最优路径,且显示出了比蚁群算法更好的收敛性能,获得了较好的寻优结果。