网络存活系统工程研究进展

论文分析综述网络存活系统工程的研究内容和进展,主要介绍基于信息系统工程的可存活网络分析方法;满足系统存活条件的流服务质量开发周期中相关的服务、入侵跟踪、评估模型及信息保障;考虑有入侵时系统设计中的攻击模式和攻击树结构;相关应急响应策略或算法设计思路;采用商用COTS组件构造系统时,满足存活需要的若干考虑因素;并介绍一种网络存活系统工程开发工具。     

可生存系统的两类研究方法

现有安全技术己经不足以对抗日趋严重的计算机系统及网络的安全问题,根据对可生存系统技术的需求,给出了目前生存技术的两类研究方法：可生存设计和入侵响应。以文件系统为例,阐述可生存设计的思想和方法;重点以可生存数据库为对象,描述入侵响应的3种具体实现方案：入侵恢复,隔离和围堵。另外,针对每一个方案,提出并描述了实现的模型。     

IP网络生存性研究综述

随着交互式应用和各种实时业务的增长对网络生存性要求的提高,IP网络的生存性研究受到了越来越多的关注。本文首先对IP网络生存性面临的问题以及影响因素作了概括,并且对目前有关纯IP网络生存性、MPLS网络生存性、IP网络与底层的生存性协调研究作了归纳总结,尤其对纯IP网络的生存性研究现状从多方面进行了比较详细的介绍,最后指出IP网络的快速重路由机制具有很好的实际应用潜力,保护恢复能力和服务质量在MPLS网络中的结合、动态多层保护则是未来IP骨干网生存性维护的发展方向。     

A concurrent two-layer restoration scheme for GMPLS WDM networks

Next generation backbone networks will likely consist of IP routers as well as optical cross connects (OXCs) and will deploy an optical control plane protocol. Generalized Multi Protocol Label Switching (GMPLS) has been proposed as the candidate of choice for the control plane. Optical fibers may carry large volumes of traffic and therefore adequate mechanisms must exist to enable the network to automatically recover from failures of fiber. In mission critical networks survivability becomes very important. We investigate the problem of autonomous recovery in such networks. The literature contains work in this area that investigates the problem of multilayer recovery. Such recovery had only been sequential in the sense that the published work recovers first in the optical domain, assuming the availability of redundant resources, and then proceeds to recover packet label switched paths. We report a recovery procedure for recovering packet label switch paths (packet LSPs) and lambda label switch paths (λLSP) concurrently. We have conducted an OPNET-based simulation study that compares the performance of the concurrent scheme with the previously published sequential two-layer recovery scheme. The study shows that the concurrent two-layer recovery scheme performs as much as forty-four percent faster than the sequential two-layer recovery scheme.     

Survivability evaluation of SIGMA and mobile IP

Mobile IP has been developed by IETF to handle mobility of Internet hosts at the network layer. Mobile IP suffers from a number of drawbacks, including low survivability due to single-point failure of Home Agents. Recently, Seamless IP diversity based Generalized Mobility Architecture (SIGMA) was proposed to support low latency, low packet loss mobility of IP hosts. In this paper, we show that the location management scheme used in SIGMA enhances the survivability of the SIGMA-based mobile network. We develop an analytical model to evaluate and compare the survivability of SIGMA with that of Mobile IP. Numerical results show the improvement in system response time and service blocking probability of SIGMA over Mobile IP in the presence of hardware failures and Distributed Denial of Service (DDoS) attacks. The research reported in this paper was funded by NASA Grants NAG3-2922 and NNX06AE44G     

A GRASP with path-relinking heuristic for the survivable IP/MPLS-over-WSON multi-layer network optimization problem

In this paper we deal with the survivable internet protocol (IP)/multi-protocol label switching (MPLS)-over-wavelength switched optical network (WSON) multi-layer network optimization problem (SIMNO). This problem entails planning an IP/MPLS network layer over a photonic mesh infrastructure whilst, at the same time, ensuring the highest availability of services and minimizing the capital expenditures (CAPEX) investments. Such a problem is currently identified as an open issue among network operators, and hence, its solution is of great interest. To tackle SIMNO, we first provide an integer linear programming (ILP) formulation which provides an insight into the complexity of its managing. Then, a greedy randomized adaptive search procedure (GRASP) with path-relinking (PR) together with a biased random-key genetic algorithm (BRKGA) are specifically developed to help solve the problem. The performance of both heuristics is exhaustively tested and compared making use of various network and traffic instances. Numerical experiments show the benefits of using GRASP instead of BRKGA when dealing with highly complex network scenarios. Moreover, we verified that the use of GRASP with PR remarkably improves the basic GRASP algorithm, particularly in real-sized, complex scenarios such as those proposed in this paper.     

武装直升机抗坠毁设计研究

介绍了武装直升机抗坠毁的概念设计原理 ,提出了抗坠毁设计中的一些关键问题 ,为武装直升机抗坠毁设计提供理论指导。     

关于我国坦克生存力研究的几个问题

随着反坦克武器数量的增多、威力的增大，使坦克防护的内函由原来的装甲防护演变成了坦克生存力。这一变化反映了西方对坦克防护的重视。与国际先进水平相比，我国在坦克生存力研究方面还存在着明显的差距。急需采取有效措施，迅速提高我国坦克的防护水平。该文对上述几个问题进行了论述。     

静态P-Cycles双链路故障保护策略的研究

p-Cycles应用在WDM格网中可以得到高的容量利用率和快速保护倒换时间,本文给出了一种格网生存性有关容量问题的 研究方法,即孤立节点分析法,提出了p-Cycles在双链路故障情况下的保护策略,并建立了以保护容量需求作为优化目 标的p-Cycles优化设计模型。     

Physical layer performance benchmarking of two metropolitan area network configurations

This paper investigates the problem of dynamic survivable lightpath provisioning against single-node/link failures in optical mesh networks employing wavelength-division multiplexing (WDM).We unify various forms of segment protection into generalized segment protection (GSP). In GSP, the working path of a lightpath is divided into multiple overlapping working segments, each of which is protected by a node-/link-disjoint backup segment. We design an efficient heuristic which, upon the arrival of a lightpath request, dynamically divides a judiciously selected working path into multiple overlapping working segments and computes a backup segment for each working segment while accommodating backup sharing. Compared to the widely considered shared-path protection scheme, GSP achieves much lower blocking probability and shorter protection-switching time for a small sacrifice in control and management overhead.On the basis of generalized segment protection, we present a new approach to provisioning lightpath requests according to their differentiated quality-of-protection (QoP) requirements. We focus on one of the most important QoP parameters—namely, protection-switching time—since lightpath requests may have differentiated protection-switching-time requirements. For example, lightpaths carrying voice traffic may require 50 ms protection-switching time while lightpaths carrying data traffic may have a wide range of protection-switching-time requirements. Numerical results show that our approach achieves significant performance gain which leads to a remarkable reduction in blocking probability.While our focus is on the optical WDM network, the basic ideas of our approaches can be applied to multi-protocol label switching (MPLS) networks with appropriate adjustments, e.g., differentiated bandwidth granularities.