一种新型文档防火墙的设计

本文介绍了一种新的防火墙设计方案,在基于文件过滤驱动与网络过滤驱动的基础上,进行文件访问与网络访问的数据搜集,把搜集到的数据从内核层上传到应用层进行分析上报。在实际应用中,系统的性能取得了很大突破。     

基于不对称加密的网络信息安全对策研究

本文对SSL VPN的原理与连接过程及优势作了详细的分析,通过SSL VPN客户端经过安全的身份验证和加密,从而有效保障了网络资源的安全性,并使用了一个实例H3C SSL VPN。     

基于等级保护的网络改造方法及异常情况分析与处理

本文介绍了在电力企业信息网中基于等级保护的网络安全防护改造方法。在具体案例中,针对网络改造过程中遇到的网络异常情况,技术人员通过逐一分析、排查,最终恢复正常网络,达到企业信息网络二级域改造的目的。网络安全防护改造方法以及异常情况分析排查案例对同类型企业在网络改造及异常排查工作中具有一定借鉴和指导意义。     

PKI技术及其在校园网中的应用研究

将PKI技术引入校园网络,构建基于PKI技术的数字认证中心,既保证了校园网络的安全性,实现安全文件传输,又解决了校园网络用户身份认证的问题,推进高校信息化的同时提高校园网的安全性。     

基于图书馆内部网络的信息安全技术与管理研究

随着计算机技术的不断发展,网络技术的应用日益广泛,网络安全成为日益严重的现实问题,而内部网络的安全问题更是愈加凸显,已经严重的威胁并影响着网络的正常使用,必须通过对用户和设备的身份管理、数据管理、权限管理、过程管理、客户系统管理以及制度管理几个方面,将技术与制度的有机结合,以确保图书馆内部网络能够安全、高效的运行。     

网络法律浅析

随着当今网络技术的迅猛发展,人们的行为和生活越来越受到其影响,发生着改变,故调整其行为规范的网络相关法律法规也越来越受到人们的关注。从法理学角度出发对网络法律进行构建与研究,在此基础上规范其基本理念和适用原则,对于建立完善网络法律体系尤为重要。本文从法理学角度出发,对网络法律的基本理念和原则进行了简要探析。     

军队信息安全面临严峻形势

信息网络技术在我军各个领域得到广泛应用。本文分析了军队信息安全面临的严峻形势,提出了军队信息安全的应对策略。     

结构化对等网络特性及关键技术分析

本文简述了对等网络的概念及分类,分析了结构化对等网络特性、存在问题和关键技术,指出结构化对等网络的发展前景。     

Performance and cost trade-off in Tracking Area reconfiguration: A Pareto-optimization approach

Tracking Area (TA) design is one of the key tasks in location management of Long Term Evolution (LTE) networks. TA enables to trace and page User Equipments (UEs). As UEs distribution and mobility patterns change over time, TA design may have to undergo revisions. For revising the TA design, the cells to be reconfigured typically have to be temporary torn down. Consequently, this will result in service interruption and “cost”. There is always a trade-off between the performance in terms of the overall signaling overhead of the network and the reconfiguration cost. In this paper, we model this trade-off as a bi-objective optimization problem to which the solutions are characterized by Pareto-optimality. Solving the problem delivers a host of potential trade-offs among which the selection can be based on the preferences of a decision maker. An integer programming model has been developed and applied to the problem. Solving the integer programming model for various cost budget levels leads to an exact scheme for Pareto-optimization. In order to deliver Pareto-optimal solutions for large networks in one single run, a Genetic Algorithm (GA) embedded with Local Search (LS) is applied. Unlike many commonly adopted approaches in multi-objective optimization, our algorithm does not consider any weighted combination of the objectives. Comprehensive numerical results are presented in this study, using large-scale realistic or real-life network scenarios. The experiments demonstrate the effectiveness of the proposed approach.     

Distributed match-making

In many distributed computing environments, processes are concurrently executed by nodes in a store- and-forward communication network. Distributed control issues as diverse as name server, mutual exclusion, and replicated data management involve making matches between such processes. We propose a formal problem called distributed match-making as the generic paradigm. Algorithms for distributed match-making are developed and the complexity is investigated in terms of messages and in terms of storage needed. Lower bounds on the complexity of distributed match-making are established. Optimal algorithms, or nearly optimal algorithms, are given for particular network topologies.The work of the second author was supported in part by the Office of Naval Research under Contract N00014-85-K-0168, by the Office of Army Research under Contract DAAG29-84-K-0058, by the National Science Foundation under Grant DCR-83-02391, and by the Defence Advanced Research Projects Agency (DARPA) under Contract N00014-83-K-0125. Current address of both authors: CWI, Kruislaan 413, 1098 SJ Amsterdam, The Netherlands.