基于SRLG不相关的共享保护算法的研究

通过对共享保护算法的深入分析,使用K条最短路和迭代思想的方法,提出了两种共享风险链路组不相关的共享保护算法,并在仿真平台上对两种算法的性能进行了仿真.KWFF算法借鉴了传统的K条最短路策略,并且在每一个波长平面上,都对新到业务进行了K条工作路由的计算,极大挖掘了网络中潜在的波长资源.而IFF算法由于引入了迭代的思想,避免了共享风险链路组问题中,所特别有“陷阱”问题的出现,并且利用两套权重计算公式,在计算工作路由和保护路由的时候,充分考虑了网络资源的实时变化情况.通过仿真数据可以看到,与以往算法相比,KWFF和IFF算法大大降低了网络阻塞率,并且提高了网络资源的使用效率.     

一种新的WDM光网中的共享链路保护策略

研究了WDM光网中的链路保护问题.提出了一种新的共享链路保护策略--基于SRLG的共享链路保护策略(SRLG-SLP).SRLG(共享风险链路组)定义了对一条工作光通道分配保护资源时的资源可用性的约束.它规定任意两条有着同样故障风险或者说处于同一个SRLG的工作光通道不能利用同样的保护资源.另外,还提出了一种更加符合实际的单链路故障模型,其中链路故障间隔时间和链路故障保持时间被考虑作为两个独立的变量.基于该链路故障模型,通过大量的仿真试验,比较了专用链路保护(DLP)、共享链路保护(SLP)和提出的SRLG-SLP保护策略的资源利用率、保护效率以及业务中断率.结果显示,我们提出的SRLG-SLP在保护效率和业务中断率方面的保护性能远好于DLP和SLP,但会牺牲一些资源利用率.     

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

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

适用于多粒度光网络的共享保护算法及其分析

结合多粒度光网络自身特点提出了两种适用于多粒度光网络中的共享保护算法,它们分别基于波带粒度和基于波长粒度对光层连接提供保护.仿真结果显示,提出的算法性能优于以往的专用保护算法,通过对仿真结果的分析,得出了网络参量变化对各个算法的影响.     

适用于多粒度光网络的共享保护算法及其分析

结合多粒度光网络自身特点提出了两种适用于多粒度光网络中的共享保护算法,它们分别基于波带粒度和基于波长粒度对光层连接提供保护.仿真结果显示,提出的算法性能优于以往的专用保护算法,通过对仿真结果的分析,得出了网络参量变化对各个算法的影响.     

复杂网络链路可预测性:基于特征谱视角

近年来链路预测的理论和实证研究发展迅速,大部分工作关注于提出更精确的预测算法.事实上,链路预测的前提是网络的结构本身能够被预测,这种"可被预测的程度"可以看作是网络自身的基本属性.本文拟从特征谱的视角去解释网络的链路可预测性,并刻画网络的拓扑结构信息,通过对网络特征谱进行分析,构造了复杂网络链路可预测性评价指标.通过该指标计算和分析不同网络的链路可预测性,能够在选择算法前获取目标网络能够被预测的难易程度,解决到底是网络本身难以预测还是预测算法不合适的问题,为复杂网络与链路预测算法的选择和匹配问题提供帮助.     

在WDM全光网络上构建上层网络的路由算法

在WDM全光网络上构建上层网络需要考虑上层网络的保护机制.上层网络按保护机制可分为最大故障链路数保护网和连通保护网.针对它们的不同特点给出了构建两类上层网络并使费用最低的启发式路由算法.与已有方法相比,具有算法简单,时间复杂性小,容易实用化的特点.大量的模拟计算也证明了算法的正确性.     

星地光通信地面站空间分集技术研究

通过建立星地光链路模型对地面站空间分集技术中站址的选择、站址间距离以及地面站数量进行研究,结果表明:站址的合理选择可以提高星地链路的可用性;站址间的距离在保证各站天气不相关的同时不能过大,当站址间距离与卫星高度的比值达到1时,由链路天顶角增大带来的衰减高达10 dB以上;单地面站的可用性越高,所需的地面站数也越少,当单站的可用性达到0.6时,只需3个地面站即可达到与射频链路相当的高可用性。     

WDM光网络故障的快速共享恢复方案

在网络恢复仿真实验中发现当WDM光网络中的工作通路的链路数目为2或3时, 通路恢复资源能得到较大程度的共享. 在此基础之上, 提出了一种新的WDM光网络故障的恢复方案-分段共享恢复方案(SSR). 与现有的基于通路共享恢复方案(PSR)相比, SSR的恢复时间大大下降, 同时又基本上保持了PSR高效的资源利用率. 阐述了SSR的分段规则和实现过程, 并对SSR的性能进行了理论分析和计算机仿真.     

基于谱段关联的近红外图像模拟方法

提出一种基于谱段关联的近红外图像模拟方法,分析遥感图像成像链路模型,以及卫星载荷传感器可见光多光谱谱段和全色谱段的关联性,计算得到了谱段关联系数,并基于谱段的关联系数生成模拟近红外图像.为了提高近红外模拟图像生成的速度,利用基于GPU的SIFT算法对全色图像与多光谱图像进行匹配.采用所提方法利用吉林一号光学A星的数据,生成模拟近红外图像,单景图像计算时间优于3s,该方法对合成真彩色图像和去云去雾均有较好的效果.     

Dynamic protected lightpath provisioning in mesh WDM networks

This paper investigates the problem of dynamic protected lightpath services provisioning in optical mesh networks employing wavelength division multiplexing (WDM). A variety of schemes for dynamic protected services provisioning have been proposed, supporting a range of tradeoffs among restoration speed, capacity efficiency, and scalability. In this paper, we propose a novel scheme, called p-cycles-based maximum protected working capacity envelope (PC-MPWCE), which can offer an attractive combination of fea-tures: ring-like speed, mesh-like capacity efficiency, and good scalability. To evaluate the performance of PC-MPWCE, we compare it via simulation with 1 + 1 automatic protection switching (APS) and two well-known shared backup path protection (SBPP) on NSFNET. Our simulation results show that PCMPWCE can achieve much better blocking performance than 1 + 1 APS, and perform the similar blocking performance and capacity efficiency as SBPP.     

基于数字微镜阵列光调制的激光防护系统

提出一种基于数字微镜阵列(DMD)的激光防护系统设计方案, 利用DMD的光调制作用减少强激光对光电成像设备的损坏.详细介绍了系统的工作原理、DMD及CCD的选型、投影光路和光学转换系统的设计, 运用相移莫尔法进行了图像像素的调校.模拟实验结果显示, 该系统可在不同光斑半径和光强的条件下成功识别激光光斑中心点的像素坐标和半径, 实现对光斑对应区域的微反射镜控制, 激光光强可衰减70%以上.     

Survivable routing and spectrum allocation algorithm based on p-cycle protection in elastic optical networks

With the number of large capacity applications in core network increasing, the bandwidth requirement of optical connections in conventional Wavelength Division Multiplexing (WDM) networks keeps enhancing, so that the Orthogonal Frequency Division Multiplexing (OFDM) technology is adopted to provide higher spectrum efficiency and flexibility in the future elastic optical networks. Meanwhile, survivability in the conventional WDM optical networks has been widely studied as an important issue to ensure the service continuity. However, survivability in OFDM-based elastic optical networks is more challenging than that in conventional WDM optical networks because each fiber usually carries even more connections. Therefore, it is necessary to study the new lightpath protection algorithm in elastic optical networks. Since p-cycle protection scheme has short restoration time and simple protection switching procedure, in this paper, we study the static Survivable p-Cycle Routing and Spectrum Allocation (SC-RSA) problem with providing an Integer Linear Programming (ILP) formulation. Since RSA is a NP-hard problem, we propose a new heuristic algorithm called Elastic p-Cycle Protection (ECP) to tolerate the single-fiber link failure. For each demand, ECP scheme can compute highly-efficient p-cycles to provide protection for all of the on-cycle links and the straddling links. We also consider the load balancing and choose the proper working path for each demand. Simulation results show that the proposed ECP scheme achieves better performances than traditional single-line-rate survivable schemes.     

一种带物理约束的光网络业务量疏导方法

提出了基于最大收益的捆绑疏导算法(MRA)来解决光网络中具有多种物理约束的业务量疏导问题。MRA首先在物理拓扑上逐个放置业务, 随后捆绑细粒度业务、实现管道实例化。即考虑业务的路由情况, 将其在物理拓扑上的路由都视为单跳的细粒度管道, 然后使用基于深度优先搜索的方法来检查哪些业务能够捆绑到一起形成多跳粗粒度的潜在管道, 以节省中间节点的细粒度交换容量。再从这些粗粒度的潜在管道中, 使用最大收益的方法遴选出具有最大成本收益的无冲突集合, 并加以实例化。仿真结果显示, 在处理多个物理约束时, MRA在容量和实现成本上均优于现有的算法, 并且它能处理多达百个节点以上的大网络中的业务量疏导问题。     

Parallel signaling-based fast restoration scheme in distributed optical networks

The fast parallel restoration （FPR） scheme is proposed to achieve the fast setup of restoration label switched path （LSP） in the distributed optical networks. The scheme is derived by dividing the whole restoration LSP into several segments of sub-LSP and triggering each sub-LSP along the new route to finish the signaling procedure concurrently, and subsequently merging all sub-LSPs into a whole LSP. The theoretical analysis and simulation results show that the FPR scheme outperforms the other two typical restoration schemes in terms of connection setup time.     

The Quantal Canonical Symmetries for a Singular Lagrangian System with Subsidiary Constraints

The quantization for a system containing subsidiary constraints (in configuration space) with a singular Lagrangian is studied, in certain case which can be brought into the theoretical framework of constrained Hamiltonian system. A modified Dirac-Bergmann algorithm for the calculation of all phase-space constraints in those systems is derived. The path integral quantization is formulated by using the Faddeev-Senjanovic scheme. The classical and quantum canonical symmetries (Noether theorem in canonical formalism) are established for such a system. An example is given to illustrate that the connection between the symmetry and conservation law in classical theory are not always validity in the quantum theory.     

Reduced Order Podolsky Model

We perform the canonical and path integral quantizations of a lower-order derivatives model describing Podolsky’s generalized electrodynamics. The physical content of the model shows an auxiliary massive vector field coupled to the usual electromagnetic field. The equivalence with Podolsky’s original model is studied at classical and quantum levels. Concerning the dynamical time evolution, we obtain a theory with two first-class and two second-class constraints in phase space. We calculate explicitly the corresponding Dirac brackets involving both vector fields. We use the Senjanovic procedure to implement the second-class constraints and the Batalin-Fradkin-Vilkovisky path integral quantization scheme to deal with the symmetries generated by the first-class constraints. The physical interpretation of the results turns out to be simpler due to the reduced derivatives order permeating the equations of motion, Dirac brackets and effective action.