p-Cycle Design in Survivable WDM Networks with Shared Risk Link Groups (SRLGs)

p-Cycle survivable network design under the single link failure assumption has been studied extensively. Shared risk link group (SRLG) is a concept that better reflects the nature of network failures. An SRLG is a set of links that may fail simultaneously because of a common risk they share. The capability of dealing with SRLG failures is essential to network survivability. In this paper, we extend the p-cycle survivable network design from the single link failure model to the single SRLG failure model. An integer linear programming (ILP) formulation that minimizes spare capacity requirement is provided. To avoid enumerating all cycles of a network, we also provide a polynomial-time algorithm to generate a basic candidate p-cycle set that guarantees 100% restorability in case of any single SRLG failure given enough spare capacities. Moreover, we present the SRLG failure detection problem that prevents fast restoration upon an SRLG failure. To solve this problem, we introduce the concept of SRLG-independent restorability, which enables the restoration of each link in a failed SRLG to start immediately without knowing which SRLG has failed. We present an approach to optimal p-cycle design with SRLG-independent restorability and show that it is NP-hard to generate a candidate p-cycle set such that each link can be SRLG-independently restored by at least one cycle in the set.     

单源多径路由网络拥塞链路识别

针对多径路由带来的端到端测量路径不确定性以及布尔模型不能很好地解决多拥塞链路的问题,该文在识别端到端测量路径的基础上,提出一种基于扩展状态空间的网络拥塞链路识别算法。首先基于探测流时延相关性进行自适应聚类,进而得到各路径与探测流之间的映射关系。其次采用多门限的方式,将具有不同丢包程度的拥塞路径赋予不同的拥塞状态。最后将拥塞链路识别问题转化为一个约束最优化问题,并提出基于扩展状态空间的拥塞链路识别算法(ESSCLI)算法求解该问题。仿真结果表明,ESSCLI算法能够在多种不同网络场景下取得比当前算法更高的拥塞链路检测率。     

光网络中基于SRLG约束的动态RWA算法

在IPoverWDM光网络中,需要为每条工作光路提供光通路保护,即提供一条保护光路。光网络中引入了共享风险链路组(SRLG)的概念,要求工作光路与保护光路不共享风险链路组。不考虑波长分配提出一种新的启发式算法,该算法同时计算两条SRLG分离且总费用低;在此算法基础上利用分层图的思想,提出WDM网络中的一种在SRLG约束条件下的动态选路波长分配算法。     

一种低时延的短波自组网优化链路状态路由协议

优化链路状态路由(Optimized Link State Routing,OLSR)协议是一种先验式路由协议,网络中的所有节点通过周期性地发送控制消息来计算全网路由信息。在短波自组织网络中,节点周期性地发送控制消息会占据大量的信道资源,大幅增加网络的控制开销,浪费短波有限的带宽资源,导致网络通信性能急剧下降。其次,受到地形地貌、天线方向和接收性能的个体差异等影响,造成无线链路不稳定,导致网络中存在非对称链路,增加了通信端到端时延。为此,提出了一种低时延的短波自组网OLSR协议。该协议在执行MPR(Multipoint Relay)选择算法时综合考虑了节点的连接度和链路可靠性,在优化MPR节点个数的同时选择链路可靠性较大的节点作为MPR节点,在进行路由选择时能够利用网络中的非对称链路。仿真结果表明,该协议能优化数据包投递成功率、吞吐量、端到端时延和网络控制开销等性能指标。     

一种不共享风险的双路径选路算法

光网络中,为一个连接请求建立连接时,从光路保护方面来说,不仅需要为其寻找到一条工作路由,而且需要提供一条备份路由,并要求这两条路径物理分离,对于光网络还提出了共享风险链路组的概念。该文提出一种新的启发式算法,完成两条路径共享风险链路组分离,同时总费用尽量低,并对算法进行了分析与仿真。     

Shared partial path protection in WDM networks with shared risk link groups

For 100% shared risk link group (SRLG) failure protection, conventional full path protection has to satisfy SRLG-disjoint constraints, i.e., its working path and backup path cannot go though the same SRLG. With the increase of size and number of SRLGs, capacity efficiency of conventional shared full path protection becomes poorer due to SRLG-disjoint constraints and the blocking probability becomes much higher due to severe traps. To solve these problems, we present a partial path protection scheme where SRLG-disjoint backup paths may only cover part of the working path. Full path protection becomes a special case of partial path protection, in which the backup path covers the full working path. By choosing the most survivable partial backup path as backup path, we can make the impact of SRLG failures as low as possible and accept as many as possible connection requests. Assuming every SRLG has the same probability to fail, we present a heuristic algorithm to find the most survivable partial backup path by choosing full path protection first, iteratively computing partial backup paths and choosing the most survivable one. The benefit of this heuristic algorithm is that it can find the optimal results within less iteration. Analytical and simulation results show that, compared to conventional full path protection, our proposed scheme can significantly reduce blocking probability with little sacrifice on survivability. The proposed scheme is very useful particularly when the network contains a lot of SRLGs and the blocking probability of conventional full path protection becomes too high.

Cross-Layer Design Based Optimized Link State Routing Protocol for Wireless Mesh Networks

A proactive routing protocol CL-OLSR (cross-layer based optimized link state routing) by using a brand-new routing metric CLM (cross-layer metric) is proposed. CL-OLSR takes into account four link quality impact factors in route calculation through the cross-layer operation mechanism: the node available bandwidth, the node load, the link delivery rate, and the link interference, and thus the effect of route selection is optimized greatly. The simulation results show that the proposed CL-OLSR protocol can not only improve the network throughput to a large extent, but also reduce the end-to-end delay, while achieving load balance route results.     

Performance of Adaptive Routing in Wavelength-Routed Networks with Wavelength Conversion Capability

This paper concerns itself with the performance of adaptive routing in wavelength-routed networks with wavelength conversion capability. Exploiting the concept of load balancing, we propose an adaptive weighted-shortest-cost-path (WSCP) routing strategy. The salient feature of WSCP is that it seeks the path that minimizes the resource cost while simultaneously maintaining the traffic load among the links as balanced as possible. In our simulation, we compare the blocking probability, average hops and link utilization of WSCP with traditional shortest-cost-path (SCP) strategy, fixed routing and alternate routing. The numerical results show that WSCP can enhance blocking performance and just lengthen hop distances a little longer. The improvement is more significant in denser networks or with more wavelengths. We also develop an analytical model to estimate blocking performance of WSCP and compare analyses with simulations. Because of the benefit from load balancing, the proposed WSCP strategy can be used as a path selection algorithm in traffic engineering.     

基于概率可通链路的无线传感器网络栅格路由

该文基于一种通用的概率可通链路模型,分析了相邻栅格可通概率和路径可通概率,研究了节点密度和栅格大小对它们的影响,分别给出了以能量效率和网络平均分组递交率为目标的最佳栅格大小,并提出了将二者结合的最佳栅格选择标准,在满足用户需求的前提下网络寿命达到最大。最后对其性能进行了仿真分析,结果表明在考虑了概率可通链路后的最佳栅格大小与分析结果非常接近,且分组递交率和能量效率相结合的栅格大小选择标准能够很好的延长网络寿命。     

三层卫星光网络链路性能分析

分析了三层卫星光网络的链路类型、时延和网络稳定性等参数，结果表明与单层卫星光网络比较，三层卫星光网络吞吐量大、鲁棒性强。同时由于其结构复杂导致网络中链路负载加重、路由表计算量和阻塞概率增大。这为今后卫星光通信组网技术研究和空间光通信协议的拟定提供了参考。     

虚拟化路由交换平台中的链路虚拟化技术

传统网络难以满足各种新型应用,催生了对网络虚拟化的技术需求,而路由交换平台的虚拟化技术是实现虚拟化网络的一个重要技术途径。现仅从虚拟化路由交换平台的链路层角度出发,来分析链路的虚拟化实现技术、即链路聚合技术和链路的通道虚拟化技术,最后在链路的虚拟化技术基础上结合路由交换节点的其他虚拟化技术给出了一个网络虚拟化的应用实例。     

WDM网基于混合共享和SRLG约束的通路保护

研究了网状波分复用（WDM）网中动态生存性路由配备问题，提出了一种新颖的基于共享风险链路组（SRLG）束的混合共享通路保护（MSPP）方案。MSPP为每个业务请求分配丁作通路和SRLG分离的保护通路，因此能完全保护单SRLG故障。与传统的共享通路保护（SPP）方案不同，在满足某些约束条件下，MSPP允许部分工作通路和保护通路共享资源。仿真结果表明，MSPP性能优于SPP。     

基于拓扑优化和链路感知的无线体域网路由协议

为解决无线体域网(Wireless Body Area Networks,WBAN)在人体运动过程中网络拓扑结构频繁变化导致链路质量和WBAN性能下降等问题,首先根据人体结构对WBAN网络拓扑进行优化,通过添加中继节点建立WBAN主干网,提供节点和hub之间相对稳定的链接,然后提出了适用于WBAN拓扑优化后的路由策略(Routing Protocol Based on Topology Optimization and Link Awareness,R-TOLA)。R-TOLA综合了链路质量感知和代价函数,通过调整主干网中继和节点中继获得最优化路径。仿真实验表明,基于拓扑结构优化和链路感知的R-TOLA协议和其他路由协议相比,在人体拓扑网络结构频繁变化的环境下具有网络生存时间更长、吞吐量更大等优势。     

Routing Mechanisms Employing Adaptive Weight Functions for Shortest Path Routing in Optical WDM Networks

Optical dense wavelength division multiplexed (DWDM) networks are an attractive candidate for the next generation Internet and beyond. In this paper, we consider routing and wavelength assignment in a wide area wavelength routed backbone network that employs circuit-switching. When a session request is received by the network, the routing and wavelength assignment (RWA) task is to establish a lightpath between the source and destination. That is, determine a suitable path and assign a set of wavelengths for the links on this path. We consider a link state protocol approach and use Dijkstras shortest path algorithm, suitably modified for DWDM networks, for computing the shortest paths. In [1] we proposed WDM aware weight functions that included factors such as available wavelengths per link, total wavelengths per link. In this paper, we present new weight functions that exploit the strong correlation between blocking probability and number of hops involved in connection setup to increase the performance of the network. We also consider alternate path routing that computes the alternate paths based on WDM aware weight functions. The impact of the weight functions on the blocking probability and delay is studied through discrete event simulation. The system parameters varied include number of network nodes, wavelengths, degree of wavelength conversion, and load. The results show that the weight function that incorporates both hop count and available wavelength provides the best performance in terms of blocking probability.     

Hybrid protection in WDM networks with shared risk link groups

In wavelength-division multiplexing net- works with shared-risk link groups (SRLGs), it remains as a challenge to provide network protections with low-blocking probabilities and short average protection-swi- tching time. Based on the observation that in networks with SRLGs, link protection frequently helps avoid over-long backup routes and traps, we propose a novel hybrid protection scheme, with the objective of combining the high-average capacity efficiency of shared-path protection with the fast recovery and simple trap avoidance of shared-link protection. Extensive simulation results show that the proposed scheme steadily achieves lower blocking probabilities than both the shared-path and the shared-link protections, while the average protection-switching time is shortened as well. Meanwhile, the signaling and control procedures of the proposed scheme are kept with reasonable complexities.A short summarized version of this paper was presented at ECOC’2005, Sept. 2005, Glasgow, UK.     

LSCR:一种Mobile Ad hoc网络链路状态分组路由算法

本文提出了一种Mobile Ad hoc网络(Manet)链路状态分组路由算法(Link State-hased Cluster Routing Algo-rithm-LSCR)，该算法对Manet节点进行动态分组，每一组选举出一个具有最大度数的头结点(CH-Cluster Header)，该cH负责本组信息的管理、组内结点与组外结点之间的通信以及与其他组的CH之间交换链路状态信息等工作．本算法将改进的链路状态协议与分组路由协议有机结合，有效提高了Manet网络的路由效率．分析和实验结果表明，这种算法具有路由收敛速度快、维护成本相对较低，数据包发送成功率高，发送等待时间短等特点。     

Sparse Wavelength Conversion in Wavelength-Routed WDM Optical Networks*

A wavelength-routed optical network can suffer inefficiencies due to the wavelength-continuity constraint (under which a signal has to remain on the same wavelength from the source to the destination). In order to eliminate or reduce the effects of this constraint, a device called a wavelength converter may be utilized. Due to the high cost of these wavelength converters, many studies have attempted to determine the exact benefits of wavelength conversion. However, most of these studies have focused on optical networks that implement full wavelength conversion capabilities. An alternative to full wavelength conversion is to employ only a sparse number of wavelength converters throughout the network, thereby reducing network costs. This study will focus on different versions of sparse wavelength conversion--namely, sparse nodal conversion, sparse switch-output conversion, and sparse (or limited) range conversion--to determine if most of the benefits of full conversion can be obtained using only sparse conversion. Simulation and analytical results on these three different classes of sparse wavelength conversion will be presented. In addition, this study will present heuristic techniques for the placement of sparse conversion facilities within an optical network.     

移动Ad hoc网络基于链路质量和拓扑质量的路由协议

移动Ad hoc网络中节点的移动性使得频繁的路由失效与路由发现,路由发现中的控制开销是影响路由性能的一个重要的因素。传统的按需路由协议多采用洪泛的方式进行路由发现,并选取最小跳数路由。每个中间节点盲目的转发收到的路由请求包,不仅没有考虑链路质量,而且会引起广播风暴问题。本文提出一种基于链路质量和拓扑质量的路由协议,该协议根据相邻节点之间剩余链路生存期作为链路质量指标,同时根据中间节点与源-目的节点连线的距离关系作为拓扑质量指标。结合两个指标设置转发概率,不仅能避免频繁的路径断开,而且限制了路由请求包的传播范围。模拟结果显示,本文提出的方法在显著地降低路由控制开销的同时,还能够提高分组投递率并降低端到端延迟,从而提高了路由性能。     

WDM格型光网络中的动态组播共享保护算法

该文针对WDM格型网络中单链路失效的情况,提出了一种保护动态组播业务的基于路径的优化共享保护(PB-OSPM)算法。该算法在基于最优路径对的共享不相交路径(OPP-SDP)算法的基础上,通过引入保护波长使用情况矩阵和波长预留矩阵记录预留波长资源的使用情况,允许不发生冲突的不同组播的保护路径间共享预留波长资源。研究采用欧洲光网络(EON)的拓扑对PB-OSPM算法和OPP-SDP算法在增性网络负载情况下的网络冗余度和同波长资源配置和网络负载情况下动态网络负载的网络连接阻塞率做了仿真。结果表明,相同条件下,PB-OSPM算法比OPP-SDP算法有更低的连接阻塞率。组播业务间波长资源的共享是提高波长资源利用率的有效方法。