IP over WDM网络中可恢复的路由选择策略与算法

研究了IP over WDM网络中各层备用资源的分配问题,提出了一种新的IP over WDM网络中可恢复的路由选择策略以及应用于其中的备用路由选择算法.该策略通过层间备用资源共享,能够完全利用网络中为恢复光层故障所预留的资源来进行IP层故障恢复,从而大大提高了网络的资源利用率.对所提出的策略进行了性能分析,并给出了相应的性能指标.     

可生存LR-PON中基于连接可用性的成本有效规划方法(英文)

聚焦长距离无源光网络生存性机制研究,针对单共享风险链路组故障提出一种基于连接可用性的成本有效规划方法.首先,设计了一种基于故障概率的连接可用性模型,计算每个光网络单元的连接可用性.对于不满足连接可用性要求的每个工作光网络单元,为其分配备用光网络单元,其中每个备用光网络单元需要为工作光网络单元预留备用容量.然后,在不同光网络单元之间部署备用光纤,确保每对工作和备用光网络单元之间至少存在一条备用光路径.当一个工作光网络单元因为光纤链路故障而遭遇连接中断时,可将其业务通过备用光路径转移到备用光网络单元承载.通过仿真对所提方法在备用光纤部署成本方面的性能进行了分析.结果表明,该方法能实现比传统邻居保护方法更低的备用光纤部署成本,可解决备用容量分配和备用光纤部署的联合优化问题,在满足连接可用性要求的前提下,通过最小的备用光纤部署成本实现所有业务完全保护.     

基于多核点共享树的多源光组播路由方法

通过网络编码方法优化多核点选择和组播信息传输,本文提出一种基于多核点共享树和网络编码的光组播路由构造和波长分配方法、减少波长资源消耗和提高网络的负载平衡性能.首先,删除产生源点迂回回路的网络编码备选核点集合,采用启发式矩阵运算方法确定多源共享树的网络编码核点,实现多源共享树以最少的核点覆盖最多的源节点;然后,为减少波长信道消耗数目,在确定的核点到目的节点间加入网络编码方法传输信息;最后,讨论了多核点共享树的波长分配方法和目的节点成功解码的边分离路径方法.仿真结果表明:与单核共享树、基于网络编码的单核共享树相比,基于网络编码的多核点共享树组播路由方法需求最少的波长数目和获得最好的网络负载平衡性能.     

一种求解虚波长路径光网络波长资源优化问题的启发式算法

本文提出了一种虚波长路径光网络的启发式路由选择算法,它可以用来解决以最小化网络所需波长数目为目标的资源优化问题.该算法应用了基于最大概率路径的选路优化策略.对一个样例网络的数值分析结果表明该算法是有效的.     

全光网络的路由扩展方法

本文主要讨论了通信网络的路由创建方法,提出了一种使用节点的相邻关系来创建新路由的原理和操作步骤.在网络连接度满足一定要求后,可以重复用该方法来获得网络节点之间的所有可能路由.文章最后讨论了路由扩展方法在通信网络创建路由时的使用方法.     

最小代价最大节点度数的稀疏光疏导方法

疏导可以增加多播业务请求成功传输概率并提高光纤链路带宽利用率,但波分复用光网络中所有节点具有疏导能力则会增加网络造价和复杂度.本文研究了稀疏疏导网络中疏导节点选择策略,提出基于最小代价最大节点度数的疏导节点选择策略;根据疏导节点和非疏导节点功能差别,改进了稀疏疏导网络中多播请求的疏导传输方法.结合最小代价最大度数疏导节点选择策略和多播业务稀疏疏导传输方法,提出一种根据网络业务阻塞率限定值指标实现多播请求所需最少数目疏导节点的稀疏路由方法.仿真结果表明:在网络给定波长数和光收发器端口数目情况下,所提策略能够节约所需疏导节点数目并优化疏导节点位置,降低网络节点构造造价.     

复杂网络的一种加权路由策略研究

复杂网络的传输能力是其功能正常运转的重要保障,提高网络的吞吐量有着重要意义.提出一种新的高效路由策略,以提高复杂网络的传输能力,称之为加权路由策略.即对网络的每一条边加权,权值与该边的两端节点的度相关,然后数据包按照这个加权网络的最短路径路由.这样的路径可以更均匀地经过各个节点,发挥它们的传输能力,极大地提高网络的吞吐量.可以避免数据包集中地通过个别度大的节点,在这些节点发生拥塞.仿真显示,该策略比传统的最短路径策略优越,对很多结构的网络,可以提高几十倍的吞吐量. 关键词： 复杂网络 路由策略 吞吐量 拥塞     

基于节能的绿色光网络路由算法的研究

在传统的网络路由算法中,一般采用最短路径算法进行路由选路,最短路径算法以节点间的距离为权重,计算一条由源节点至目的节点的权重最小的路径以完成路由。最短路径算法虽然最小化了距离长度代价,却没有考虑能耗问题,所以使用最短路径算法所得出路径的能耗并不一定是最小的。针对这一问题,提出一种新型的综合性绿色路由算法,设定能耗作为节点间的权重,融合光旁路及业务量疏导,同时考虑路由和波长分配(RWA)问题,将完成每个业务所需要的能耗最小化,实现节能。仿真结果表明,与最短路径算法相比,绿色路由算法在较大规模网络中能够节省约40%的能耗,节能效果相当显著。     

波长重用-扩大基于单纤连接节点的WDM星形单跳网容量

针对可利用的有限信道波长数对基于单纤连接节点的WDM星形单跳网容量限制问题,本文提出了一种有效的解决方案-波长重用.根据该方案,在信道波长数一定的条件下,至少可使网络所支持的节点数-网络容量扩大一倍;在网络节点数不变时,则可大大减少网络节点的排队时延,缓和网络中各通信节点对数据信道波长使用权的竞争矛盾,使网络吞吐量增加1～3倍,有效地改善网络性能.本文首先论述了该基于单纤连接节点的波长重用WDM星形单跳网结构,接着分析了网络的波长重用特性,进而对所要求的光放大器增益和输出功率进行了计算;最后计算了网络的最大节点数和最大信道波长数.     

基于波长路由的光真延时模块

设计并制作了一种全集成的基于波长路由的光真延时(OTTD)模块。该模块由两个相同的通道间隔为1.6nm的16×16阵列波导光栅路由器(AWGR)与一组波导延时线阵级联而成。测试结果表明该模块性能优异,工作波长通道间串扰小于-27dB,光纤端到端峰值波长的插入损耗约为12dB。采用矢量网络分析仪测试得到延时线阵提供的光延时步长为(6.24±0.4)ps。该模块中两个阵列波导光栅路由器及延时线阵均被集成在一块硅基片之上,并且都由二氧化硅(SiO_2)波导制作而成,整个器件尺寸为3.5cm×3.5cm。     

一种改进的基于信息传播率的复杂网络影响力评估算法

评价网络中节点的信息传播影响力对于理解网络结构与网络功能具有重要意义.目前,许多基于最短路径的指标,如接近中心性、介数中心性以及半局部(SP)指标等相继用于评价节点传播影响力.最短路径表示节点间信息传播途径始终选择最优方式,然而实际上网络间的信息传播过程更类似于随机游走,信息的传播途径可以是节点间的任一可达路径,在集聚系数高的网络中,节点的局部高聚簇性有利于信息的有效扩散,若只考虑信息按最优传播方式即最短路径传播,则会低估节点信息传播的能力,从而降低节点影响力的排序精度.综合考虑节点与三步内邻居间的有效可达路径以及信息传播率,提出了一种SP指标的改进算法,即ASP算法.在多个经典的实际网络和人工网络上利用SIR模型对传播过程进行仿真,结果表明ASP指标与度指标、核数指标、接近中心性指标、介数中心性指标以及SP指标相比,可以更精确地对节点传播影响力进行排序.     

Wavelength assignment for all-to-all broadcast in bidirectional WDM optical ring with limited drops

All-to-all broadcast is to disseminate a unique message from each node to every other node in a network. This problem is significant in the context of control plane design as it relates to status information dissemination. In this paper, a wavelength assignment method to reduce the number of wavelengths is proposed to establish all-to-all broadcast in a bidirectional WDM ring network. The network model is an all-optical network, in which a message from source node can be dropped (or split) only at a limited number of destination nodes along a light path due to power loss of dropping optical signals. An expression for the upper bound on the number of wavelengths required to support all-to-all broadcast is derived for certain cases of WDM ring while for other cases, an attractive algorithm is given to identify the lengths of connection sets that can be grouped together with suitable wavelength assignment strategies. Numerical results are computed to show that the results obtained are close to the lower bound.     

A self-organizing shortest path finding strategy on complex networks

The shortcomings of traditional methods to find the shortest path are revealed, and a strategy of finding the self-organizing shortest path based on thermal flux diffusion on complex networks is presented. In our method, the shortest paths between the source node and the other nodes are found to be self-organized by comparing node temperatures. The computation complexity of the method scales linearly with the number of edges on underlying networks. The effects of the method on several networks, including a regular network proposed by Ravasz and Barabási which is called the RB network, a real network, a random network proposed by Ravasz and Barabási which is called the ER network and a scale-free network, are also demonstrated. Analytic and simulation results show that the method has a higher accuracy and lower computational complexity than the conventional methods.     

Fast restoration scheme for MPLS-TP enabled optical multicast

To improve the restoration performance of a multicast service of multi-protocol label switching transport profile （MPLS-TP） enabled optical network,this letter proposes a local-node initiated fast restoration （LNIFR） scheme for MPLS-TP optical multicast service.The proposed scheme allows the local node to establish a segment of fast loopback label switch path by the local node along the upstream of the failed node or link to the nearest downstream node.The fast restoration of optical multicast trees is realized through this part restoration,which focuses on failed node or link.Simulation analysis and results demonstrate that the new scheme outperforms the other schemes in terms of restoration time and success rate.     

Routing and wavelength assignment algorithms for multiclass WDM optical networks

In this paper dynamic routing and wavelength assignment strategies have been proposed for multiclass WDM optical networks. Multiclass optical networks provide multiple classes of services to the subscriber according to the requirement, which in turn increase operational profitability. Each class of service could be characterized by parameters like number of wavelengths, expected call holding time and average arrival rate of request. The proposed strategies have been analyzed and compared with existing strategies on the basis of blocking probabilities for multiclass traffic scenarios. Simulation results on different network topologies demonstrate that the performance of proposed strategies “Fixed shortest/alternate shortest path routing with wavelength reservation (FSASWR)” and “Fixed alternate shortest path routing with least priority wavelength assignment (FASPL)” are much better as compared to existing strategies. Proposed strategies minimize blocking probability of the multiclass network using limited number of wavelengths.     

Application of WDM holographic devices in access and metro networks

In this paper, a design of a generic multipurpose device is described. It can operate, in its basic structure, as a tunable wavelength filter, wavelength multiplexer or λ router; by using a more complex structure, the device works as an optical add drop multiplexer (OADM) or/and optical switch (OS). It can be used in both coarse and dense wavelength division multiplexing technology (CWDM/DWDM) according to the network application. Performance parameters of the device, like switching time, losses, crosstalk or polarization insensitivity are analyzed and compared with other switching technologies. Some applications of the holographic WDM multifunction device in METRO networks are described, such as the utilization of OADMs in optical path protection/reconfiguration between nodes (1 + 1 configuration) and the use of optical switches to interconnect nodes of the METRO–access network with the METRO-Core or long haul networks in a reconfigurable topology. Other applications in Access networks are possible, like the use of the OADMs in optical path protection between the optical line termination (OLT) at the central office (CO) and the remote node (RN) in a fiber to the office passive-optical network (FTTO-PON) or, in some specific cases, the utilization as tuneable holographic filters in a FTTO application, at the Business ONT (BONT), to select the assigned optical wavelength according to the services provided to the customer.     

Efficient and robust routing on scale-free networks

Information routing is one of the most important problems in large communication networks. In this paper we propose a novel routing strategy in which the optimal paths between all pairs of nodes are chosen according to a cost function that incorporates degrees of nodes in paths. Results on large scale-free networks demonstrate that our routing strategy is more efficient than the shortest path algorithm and the efficient routing strategy proposed by Yan et al. [Phys. Rev. E 73, 046108 (2006)]. Furthermore our routing strategy has strong robustness against cascading failure attacks on networks.     

面向成本-收益好的无标度耦合网络构建方法

较大平均路径长度的网络会带来较大的网络延迟, 难以支持时间敏感业务与应用. 通过增加连接可以降低源和目的节点之间的跳数, 进而降低网络平均延迟, 使得更加快速地传播信息, 但是增加连接的同时也增加了网络构建成本. 分层网络是研究网络耦合的一个有效方法, 但目前网络构建过程中将每层网络分别处理并认为每层网络之间没有强相关性. 本文提出了一种面向成本-收益的无标度网络动态构建方法. 此方法将网络分为多层, 基于连续论在高层网络中添加连接, 使得网络演化为无标度网络. 此连续过程包括节点度增加过程和局部网络半径增长两个连续过程, 在增加连接的过程中引入表征网络构建成本和收益的成本-收益指标. 模拟结果表明引入成本-收益指标的无标度耦合网络构建方法能够在合理范围内有效降低网络平均路径长度, 提升网络性能, 并且本文给出了耦合网络的动态业务性能, 通过调整高层网络避免网络拥塞.