Algorithms for Dynamic Routing in All-Optical Networks

In this paper, we have studied a number of algorithms for routing in all-optical wavelength routed networks. We have considered situations where a lightpath is dynamically created in response to a request for communication and the WDM channels constituting the lightpath are reclaimed when the communication is over. We have looked at two schemes for dynamic wavelength allocation. In the first scheme we have assumed the existence of a central agent to maintain a database of existing lightpaths where the central agent attempts to generate a new lightpath in response to a request for communication. In the second scheme, we attempt to generate a new lightpath using a distributed algorithm. In the first scheme we have exploited the existence of multiple paths between any pair of nodes in a network in order to reduce the blocking probability. For the second scheme, we have proposed three distributed strategies to determine, if possible, a lightpath when there is a request for communication. Each of these strategies have their advantages and disadvantages in terms of the expected blocking probability and the set-up time. We have studied the performances of both the schemes using Monte Carlo simulation.     

有限秘密下指派秘密共享方案的构造

针对有限个秘密要分享的情况，提出了一种具有指派功能秘密共享方案的新实现方法。为了说明这一方法，给出了两个实现方案：第一个方案通过引入碎片向量的概念来实现；第二个方案通过引入秘密偏移量的概念来对第一个方案进行优化，能够达到对分享着资源的充分利用。和以往的方案相比．这些方案要求更低的通讯和计算成本；且更加合理和容易实施。     

高压变频器PID控制压力分时赋值功能的现场应用

为响应国家节能降耗的要求,城市供水系统采用变频调速方案,不仅可以收到很好的节能效果,而且能够确保城市供水管网的运行安全。本文以吉林某市水务集团为例,结合新风光变频器的PID控制原理,详细介绍了风光变频压力分时赋值功能在城市供水系统中的应用。     

全光网静态路由选择和波长分配的分层图算法

文章提出一种将路由选择和波长分配结合起来的启发式的路由选择和波长分配(RWA)算法．通过这种新的分层图算法和限制光跳距的加权系数来优化全光网的静态路由选择和波长分配，使建立光连接时所需的波长数达到最少．最后对实际的ARPANet等5种光网络进行了计算机仿真，证明了本算法比以前的算法有更好的性能．     

陆军战斗集群作战火力分配及效能评估研究

研究陆军战斗集群作战火力分配和效能评估问题。建立了面向火力分配方案的目标整体打击效能评估模型。基于临界集理论,提出了一种新颖的优化火力分配的求解算法。该算法缩小了求解搜索范围,能够有效地提高求解效率。结合某战斗集群的实例进行了求解计算及分析,验证了模型和算法的有效性和正确性。     

认知Mesh网络的动态分层图路由模型及路由策略

该文提出了在认知无线电Mesh网络环境下的动态分层图路由模型,该模型将节点感知范围内的信道可用性用两状态离散时间马尔可夫链建模,建立认知无线电Mesh网络拓扑和连通性的动态模型。基于该模型提出了一种跨层设计的动态接口分配方案。仿真结果表明,动态分层图模型在适应接入频谱的动态变化和描述认知无线电Mesh网络的拓扑结构方面,表现出比静态分层图模型更加优异的性能。     

Performance analysis of microcell/macrocell with reuse partitioning in TDMA‐based cellular systems

System capacity and grade of service (GoS) are both important for the rapid growth of cellular communication services. In this paper, we propose a two‐tier TDMA‐based cellular system with macrocell overlaid on microcell clusters by implementing fixed channel assignment (FCA) scheme and fixed reuse partitioning (FRP) scheme in microcell layer and macrocell layer, respectively, named FCA–FRP overlay scheme. Improvement can be achieved in both system capacity and GoS. Theoretical analysis based on the overlay scheme without overflow and with overflow is first presented. It shows that the simulation results are agreed with the analytical results. Then, simulation results, obtained from the overlay scheme with and without overflow, show that the performance in terms of the call blocking probability, the call dropping probability and system capacity of such a system can be greatly improved compared with a conventional one‐tier cellular system deployed with FCA or FRP scheme. Copyright © 2008 John Wiley & Sons, Ltd.     

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.

稀疏波长变换网络性能分析与研究

文章对动态业务模型下的稀疏波长变换网络性能进行了分析与研究，对波分复用（WDM）网络中引入波长变换器后的网络性能进行了系统的仿真，分析了波长变换器数量、波长变换器位置、波长变换范围以及路由波长算法等因素对网络性能的影响。     

协同项目多目标任务分配优化算法

在协同项目中，伙伴企业间的任务分配问题直接影响到项目的整体获益。针对这一问题，以费用最小和承担企业数最少为目标，并充分考虑了任务之间的紧密关联关系，提出了一个有效的任务分配启发式算法，并进行了实例验证，给出了对算法的评价。