无线Mesh网络可靠多播路由

无线Mesh网络多播路由是无线路由必须解决的关键技术。部分研究者对网络资源和服务质量（QoS）进行研究,提出了建立最短路径树、最小开销树、负载感知、信道分配多播等多播算法;有的算法考虑链路可靠性,建立备用路径。将结合网络资源和可靠性对多播路由算法进行研究,提出了建立可靠多播树（RT,Reliable Tree）的多播路由算法：可靠多播树是一个多树结构,由一棵首选多播树和一棵多径树构成,多径树提供可靠多路径,以提高网络吞吐量。     

改进的可靠信道路由算法在认知无线电Ad-hoc网络中的应用

针对认知无线电网络中传统路由可靠性较低的问题,提出了一种改进的可靠信道路由算法(Improved reliable channel routing,IRCR)。算法根据认知无线电网络频谱的动态性,利用相邻节点间信道利用率,选择可靠邻节点,并根据可靠邻节点建立可靠路由。仿真结果表明,与传统频谱感知按需路由协议(spectrumaware on-demand routing protocol,SORP)相比,IRCR具有较高的数据包投递率和较低平均时延。     

基于混合递阶遗传算法的判决反馈RBF网络信道均衡器设计

针对判决反馈RBF网络信道均衡器的结构特点,提出了一种混合递阶遗传算法,对网络隐层结构以及径向基函数中心和宽度采用递阶结构联合编码并分层次进行遗传操作,不仅可以确定隐层节点参数,同时也可以确定隐层节点数, 解决了网络拓扑结构的优化设计问题;将网络参数空间划分为线性空间和非线性空间分别进行优化训练,简化了递阶遗传操作空间,加速算法收敛。     

车载自组织网络中基于贪婪算法能地理位置路由

车载自组织网络（VANET）技术发展迅速,但由于其特殊的节点类型和信道特性,采用传统AdHoc网络路由协议无法取得满意的性能。实现高速可靠的数据传输速率,需要研究新兴的路由算法。基于贪婪算法的地理位置辅助路由是目前VANET路由的主流思路。文章认为基于这类思路的协议利用车载GPS装置、电子地图和下一代网络导航技术,能使路由发现和建立的时间大大缩短;结合已知的道路拓扑结构,选择多跳传输的最优路径,能避免路边建筑物的屏蔽效应,改善信道条件;动态评估道路上的车流密度,选择可靠性最高的传输路径,能很好地降低传输时延,提高网络吞吐能力。     

认知Ad-Hoc网络基于信道信息的路由算法

由于认知网络中信道具有动态时变特性,路由选择和信道分配成为认知Ad-Hoc网络亟待解决的问题。为此提出一种基于信道信息的改进路由算法,结合节点的信道共用度和最小条数作为路由度量,通过选取较稳定的节点,增强链路的稳定性。仿真结果表明,对于信道变化波动较大的环境,改进的路由算法具有很好的路径稳定性和链路修复能力。     

基于模糊推理的认知无线Mesh网络路由算法

认知无线Mesh网络中的节点能动态接入空闲频谱,然而,频谱空穴的频繁变化将导致网络路径的破坏,使得网络性能下降.提出了基于模糊推理的认知无线Mesh网络路由算法,该算法利用模糊Petri网的推理机制计算可行路径的可靠度,最终选择可靠度最高的路径和信道.仿真结果表明,认知无线Mesh网络使用推理机制的路由算法能够增加所选路由的可靠度,减少网络路径破坏数,提高网络吞吐量.     

光无线混合接入网中风险感知节能路由算法

研究了光无线混合接入网中具有抗毁能力的节能路由问题,结合光网络单元(ONU)休眠控制和风险备用路由表维护机制,提出一种有效的可靠绿色路由算法。该算法为每个无线路由器维护一个风险表,以记录网络中路径是否可用以及ONU活跃与否的状态信息,通过鼓励选择ONU活跃的可用路径来传输数据,可降低全网丢包率和能耗。仿真结果表明:该算法能够在稳定丢包率的同时更好地节省能量。     

一种基于缓存技术的改进型AODV路由协议

AODV路由协议是ad hoc网络中一种典型的按需路由协议,但是当网络节点具有高移动性,网络拓扑变化频繁使得路由链路断开频繁时,按需路由协议包括AODV算法都缺乏鲁棒性,各个移动节点在发送数据包时需要不断发起路由请求.文章对AODV算法进行了详细分析,并利用路由缓存技术对AODV算法进行了改进.在缓存中建立了两条备用路由,当活动路由链路断开时,选取一条较好的备用路由作为活动路由.NS2仿真结果表明,这种带缓存功能的AODV算法能降低丢包率、时延,提高路由的稳健性,从而适应网络拓扑结构的频繁变化.     

基于Ka/Ku相控阵天线的空基自组网协议设计

针对空基自组织网络的大容量通信需求,首先提出了基于频分复用的定向MAC协议,在邻居发现过程中将测距算法与多维尺度变换定位算法相结合得到每个节点的相对位置,并设计了双预约资源分配算法,完成定向数据传输;然后提出了定向路由协议,解决了次佳路由问题和路由应答风暴,并加入相邻搜索、链路质量评估和备用路由,降低了协议开销。空基自组网基于Ka/Ku相控阵天线的定向传播特性以及Ka/Ku频段频谱资源丰富的特点,使用频分复用、空分复用技术实现多个信道的高速并行传输,从而极大地提高网络的吞吐量。     

多光纤波分复用网的一种新的备用路由算法

基于经典的LLR算法,研究了波分复用光网络的路由问题,提出了一种用于多光纤网的新算法—LLHR,该算法综合考虑了链路负载和路由跳数两个因素。文章深入研究了网络光纤数、备用路由数和网络负载对算法性能的影响。计算机仿真结果表明,与LLR算法相比,该算法能有效降低网络的阻塞率,提高网络的性能。     

WDM疏导网络的共享子通路保护算法

研究了WDM疏导网络中的生存性问题,提出一种支持多粒度业务的共享子通路保护算法(GSSP)。GSSP首先根据网络当前状态动态调整链路权值,在此基础上选择一条最短路作为工作通路;然后将该通路分为互不重叠的等长子通路,分别找出它们的保护通路,并且允许共享保护资源。GSSP可以保证业务连接的可靠性,又允许网络管理者根据不同的优化策略调整子通路长度,可以在恢复时间和资源利用率之间进行折中。最后对GSSP进行了仿真研究,给出了仿真结果。     

Efficient algorithms for routing dependable connections in WDMoptical networks

We consider the problem of establishing dependable connections in WDM networks with dynamic traffic demands. We call a connection with fault-tolerant requirements a dependable connection (D-connection). We consider the single-link failure model in our study and recommend the use of a proactive approach, wherein a D-connection is identified with the establishment of the primary lightpath and a backup lightpath at the time of honouring the connection request. We develop algorithms to select routes and wavelengths to establish D-connections with improved blocking performance. The algorithms use the backup multiplexing technique to efficiently utilize the wavelength channels. To further improve channel utilization, we propose a new multiplexing technique called primary-backup multiplexing. Here, a connection may not have its backup lightpath readily available throughout its existence. We develop algorithms based on this technique to route D-connections with a specified restoration guarantee. We present an efficient and computationally simple heuristic to estimate the average number of connections per link that do not have backup lightpaths readily available upon a link failure. We conduct extensive simulation experiments on different networks to study the performance of the proposed algorithms     

Shared Sub-Path Protection Algorithm in Traffic-Grooming WDM Mesh Networks

In this paper, we investigate the problem of dynamically establishing dependable connections in wavelength division multiplexing (WDM) mesh networks with traffic-grooming capabilities. We first develop a new wavelength-plane graph (WPG) to represent the current state of the network. We then propose a dynamic shared sub-path protection (SSPP) scheme based on this WPG. To establish a dependable connection, SSPP first searches a primary path for each connection request, and then it segments the found path into several equal-length sub-paths, and computes their corresponding backup paths, respectively. If two sub-paths in SSPP are fiber-disjoint then their backup paths can share backup resources to obtain optimal spare capacity. Based on dynamic traffic with different load, the performance of SSPP has been investigated via simulations. The results show that SSPP can make the tradeoffs between resource utilization and restoration time.     

An efficient primary-segmented backup scheme for dependable real-time communication in multihop networks

Several distributed real-time applications (e.g., medical imaging, air traffic control, video conferencing) demand hard guarantees on the message delivery latency and the recovery delay from component failures. As these demands cannot be met in traditional datagram services, special schemes have been proposed to provide timely recovery for real-time communications in multihop networks. These schemes reserve additional network resources (spare resources) a priori along a backup channel that is disjoint with the primary. Upon a failure in the primary channel, its backup is activated, making the real-time connection dependable. We propose a new backup method, called segmented backups, in which backup paths are provided for partial segments of the primary path rather than for its entire length, as is done in the existing schemes. We show that our method offers: 1) improved network resource utilization; 2) higher average call acceptance rate; 3) better quality-of-service guarantees on propagation delays and failure-recovery times; 4) increased flexibility to control the level of fault tolerance of each connection separately. We provide an algorithm for routing the segmented backups and prove its optimality with respect to spare resource reservation. We detail necessary extensions to resource reservation protocol (RSVP) to support our scheme and argue that they increase the implementation complexity of RSVP minimally. Our simulation studies on various network topologies demonstrate that spare resource aggregation methods, such as backup multiplexing, are more effective when applied to our scheme than to earlier schemes.     

Multiple link failure recovery in survivable optical networks

Survivability is of critical importance in high-speed optical communication networks. A typical approach to the design of survivable networks is through a protection scheme that pre-determines and reserves backup bandwidth considering single/double link failure scenarios. In this article, a greedy algorithm is presented to reserve backup bandwidth considering multiple (F > 2) link (SRLG) failure scenarios. A bandwidth-saving joint selection scheme of working and protection paths is presented for protection against random multiple-link failures under dynamic traffic. Simulation shows that the algorithm can achieve maximum sharing of backup bandwidth for protection against random multiple-link failure with significant amount of bandwidth saving.     

Hierarchical Protection Tree Scheme for Failure Recovery in Mesh Networks

This paper presents a novel technique for link protection in mesh networks based on the use of hierarchical trees. The hierarchical protection tree (or p-tree) provides hierarchical layering of the network. The straddling links that are not located in the tree are protected through tree branches to higher-layer Parent nodes. The links in the tree are protected by links to backup parent nodes. This scheme offers several advantages such as scalability, failure impact restriction, and distributed processing. We provide a mathematical analysis to compute performance measures for our link protection scheme, and perform restorability analysis for several real and arbitrary long haul networks to compare our scheme to other link protection proposals. Our results demonstrate the applicability of hierarchical p-tree link protection schemes in real long-haul networks.     

Quality-of-Service Based Protection in MPLS Control WDM Mesh Networks

Intelligent methods for automatic protection and restoration are critical in optical transport mesh networks. This paper discusses the problem of quality-of-service (QoS)-based protection in terms of the protection-switching time and availability for end-to-end lightpaths in a WDM mesh network. We analyze the backup lightpath-sharing problem in such networks and study the correlation of the working lightpaths and the impact of the correlation on the sharing of the backup lightpaths. We present a multi-protocol-label-switching (MPLS) control-based fully distributed algorithm to solve the protection problem. The proposed algorithm includes intelligent and automatic procedures to set up, take down, activate, restore, and manage backup lightpaths. It greatly reduces the required resources for protection by allowing the sharing of network resources by multiple backup lightpaths. At the same time, it guarantees, if possible, to satisfy the availability requirement even with resource sharing by taking the correlation of working lightpaths into consideration. A simple analysis of the proposed algorithm in terms of computation time and message complexity indicates that the implementation of the algorithm is practical. The illustrative studies that compare the performance of 1:1, unlimited sharing, and QoS-based backup sharing algorithms indicate that QoS-based sharing achieves comparable performance as unlimited sharing, which is much better than the 1:1 backup scheme in terms of connection blocking probability, average number of connections in the network for a given offered load, and network resource utilization.     

Extending the IEEE 802.1 MAC Bridge standard to remote bridges

The IEEE 802.1 MAC Bridge specification describes transparent local bridges, called spanning tree bridges, that interconnect 802-type local area networks (LANs). The author discusses experience with adapting the spanning tree algorithm to the remote bridge environment, including the addition of a distributed algorithm for utilizing backbone networks while they are configured as backup paths by the spanning tree. This results in local and remote bridge configurations that automatically detect and recover from all failures/restorals in a deterministic way. Once the support of the same spanning tree algorithm is pervasive, it is also possible to add distributed algorithms that allow spanning tree backup paths to be utilized     

Optimized design and availability analysis of large-scale shared backup path protected networks

Traditional integer linear programming model for shared backup path networks allows only one working route and one backup route per demand and does not scale well. By introducing multiple working routes and backup routes, the traditional multi-flow model solves in a faster manner. This paper seeks improvements on the traditional multi-flow model and develops an algorithm to assess availability for multi-flow shared backup path protection models. Experiments on 165 networks testify that the newly proposed model is 51% faster on average with similar total cost and overall network availability, compared with the traditional multi-flow model. All the networks in this paper are designed to be 100% single-failure restorable, and major findings regarding these networks include: (1) total cost of assigning backup capacity to each span dwindles away with increasing network average nodal degree; (2) network availability first rises then falls as network average nodal degree increases; and (3) when network scale increases, network availability decreases with fluctuations. The results found are explained with two case studies in this paper.     

An adaptive survivability admission control algorithm using backup path for high‐speed networks

In this paper, we propose an adaptive survivability admission control algorithm using a backup path for high‐speed networks. For each call request, the proposed algorithm selects a combination of working path and backup path. Two BP selection methods, min‐cost and min‐expectation, are suggested. Computational experiments indicate that the proposed algorithm significantly reduces the consumption of backup capacity while still maintaining 100% survivability upon a single link failure and near 80% survivability upon double link failures. Copyright © 2003 John Wiley & Sons, Ltd.