电力光纤通信网络优化算法及其应用探讨

依据电力系统通信业务特点,改进了整数线性规划算法,用于SDH组网优化设计,并开发了相应的软件。最后以福州市区东南部的电力光纤网络为例给出了具体的优化设计方案。

一个不受常量序限制的归纳逻辑程序设计算法

文章分析了FOIL（first－orderinductivelearner）递归谓词学习算法理论上的不足以及由此导致的应用范围的局限，并通过两个例子给予详细说明．为了克服这一缺陷，文章引入了反映递归规则集R与实例空间E本质关系的实例图H（R．E）和实例序的概念，奠定了算法的理论基础．在此基础上，给出了基于实例图的FOILPlus算法．算法通过对悬例、悬弧的操作把握住实例序，自然而然地防止了病态递归规则的产生，从而保证了FOILPlus可以不受常量序限制地完成学习任务；同时，算法的时空复杂度较之FOIL算法没有增加．FOILPlus算法已经编程实现，并用它尝试了两个FOIL学习失败的递归任务，都获得了成功．

波长转换能力受限网络的路由算法研究

波长转换器的应用有效地提高了光网络的网络性能。把整数线性算法(ILP)做了相应改动并应用到所有节点均配有波长转换能力受限的波长转换器的OBS网络中,与通常采用的最短路径算法(SP)的性能进行了比较分析,同时在典型拓扑上进行了仿真。结果表明ILP算法比SP算法更有效地降低了全网丢包率。

WDM网络逻辑拓扑重构的一种方法

针对网络业务流量的动态变化,为保证网络具有良好传输性能,需对逻辑拓扑进行重构.提出了一种基于最小化网络光路变化数量准则的逻辑拓扑重构方法,给出了问题的ILP(IntegerLinearProgramming)描述,进行了数值仿真验证,结果显示该算法正确、有效.

Design of Survivable Routing with and without Wavelength-continuity Constraints in WDM Networks

The problem of routing logical links (lightpaths) on a physical topology of WDM networks in a way that the logical topology remains connected in the event of single physical link failure is called survivable routing. This paper addresses the survivable routing problem with and without wavelength-continuity constraints by proposing a new Integer Linear Programming (ILP) algorithm, which is based on a simplified necessary and sufficient condition. Numerical results are given and discussed to show that survivable routing solutions of most logical topologies can be found by the algorithm of the authors. Furthermore, comparing with other similar methods, the above algorithm can find out a survivable solution in much shorter time, and it works especially well with sparse-connected logical topologies. The impact of wavelength-continuity constraints and the other factors that influence the probability to find out a survivable solution are also discussed in the paper.