通信网语音质量综合评估系统设计

针对移动语音通信网在通话质量及网络优化方面所存在的问题，给出了一种通信网语音质量综合评估系统的设计方法。新系统能够在保证语音通信质量的同时，提供通信网的小区位置和信号强度等网络监测数据，从而为分析语音质量缺陷的成因和网络优化方案提供更佳数据基础。     

基于全终端可靠度的网络扩充问题的研究

分析了计算机通信主干网络的扩充设计问题,建立了一个在网络全终端可靠度约束下,使扩充网络所投入成本极小化的优化模型,利用混合遗传算法对其进行了优化求解。通过实例分析,能够得到较为满意的结果,表明文中的研究方法可以应用在实际网络中。     

基于系统集成思想的通信网网络规划研究

近年来通信业迅猛发展,市场竞争日益激烈,行内关系错综复杂。通信网网络的发展迫切需要有效地协调和使用各种资源,降低发展和运营成本,提高效率,采用科学的和系统的方法和手段对通信网网络规划势在必行。通信网络规划作为新兴类型的专项规划,没有成熟的经验可以借鉴。本文针对通信网网络规划问题的现状和特点,提出了基于系统集成思想的通信网网络规划。     

SDH网络规划与设计需考虑的几个问题

我国长途通信网由PDH过渡到SDH所涉及到干线系统的规模容量、网络的生存性以及网络管理等问题,从规划与设计的角度提出一些建议.     

网间互连互通技术研究

就目前某通信系统内的公用电话通信网、移动通信网和专用通信网等网络间互通总体技术进行研究。多种通信网并存的局面使得网络互通问题变得重要。     

Internet多媒体通信网网络容量预测

针对目前的Ｉｎｔｅｒｎｅｔ（国际互联网）多媒体通信网的网络设计容量作了预测计算，为网络的设计提供重要的参考数据。     

自治愈安全可靠通信网络设计

简要分析时下通信现状,切入安全可靠通信的主题,叙述时下的一些安全技术。重点阐述自治愈网络设计和面向容忍入侵网络设计的思想、原理、算法等相关问题,并以此为基础在传统已有通信网上实现自治愈的网络设计,实现增强网络安全可靠的目的。     

基于网络冗余技术的配电通信网组网方案研究与实现

本文对配电通信网的架构与现有组网方式进行了分析,并结合工程实践,认为随着配电通信网规模的增长,存在网络冗余与稳定性的问题。为了解决该问题,提出了基于VRRP、MSTP网络冗余技术的配电通信网组网方案,并对方案进行了实际应用与验证。该方案为配电通信网的大规模规划和建设提供了参考。     

基于OPNET的军事通信网网络性能仿真

为了在高技术条件下的局部战争中把握战场的主动权,充分发挥军事通信网的保障作用,文章基于OPNET仿真平台,对军事通信网进行了建模、实现了对军事通信网相关网络性能的仿真。通过对仿真数据分析。对网络的实时性、可靠性、稳定性等性能进行了评估,从而对军事通信网的设计及使用提供技术上的参考。     

四川省数字集群移动通信网的网络规划

本文介绍了四川省数字集群移动通信网，结合成都市数字集群通信网的设计，分别对数字集群的话务量、频率配置和网络互联方式进行了讨论。     

An Optimized Supply Chain Network Model Based on Modified Genetic Algorithm

For complex multi-source, multi-product, multi-stage Supply chain network (SCN) design problem, we propose an optimization supply chain network model. We consider cash conversion cycle as an objective to this model and utilize a modified genetic algorithm to solve the problem. To describe the structure of supply chain network, we propose a new encoding method and a ge-netic algorithm with modified genetic operators. We use the Pareto approach to obtain the set of Pareto-optimal solutions. In order to evaluate the performance of the mod-ified genetic algorithm and validate the model, we conduct comparisons with standard genetic algorithm and the sim-ulated annealing genetic algorithm. Experimental results show that the modified genetic algorithm achieved better CPU time and the accuracy of the Pareto-optimal solu-tions than the alternative algorithms and the model was effective.     

遗传算法在计算机网络优化设计中的应用

计算机网络优化是一个多约束条件的非线性 0— 1问题。针对该问题的特点 ,建立了该问题的数学模型 ,给出了一个解决此问题的遗传寻优算法。通过计算机网络优化设计实例的计算结果表明 ,该方法能快速求出问题的全局近似最优解 ,且具有较高的计算精度     

基于可靠性约束的网络多目标满意优化

利用满意优化方法综合考虑网络可靠性和网络费用,以此来建立网络拓扑结构设计的数学模型,并描述了用遗传算法求解该问题的方法。满意优化与遗传算法相结合成功解决了网络高可靠性和低费用之间的矛盾。最后,通过与一般优化方法结果相比较来说明算法的有效性,给出其仿真的结果。     

基于遗传算法的网络优化设计

文中通过分析通信网设计中的网络优化问题,抽象出其数学模型,并用遗传算法来对其进行求解.最后通过验证得出用遗传算法求解该问题明显优于一些传统的方法,算法能在较短的时间内找到一个最优解,具有快速收敛寻优的特点,在求解的效率和解的质量方面都达到了令人满意的效果.     

基于遗传算法的天线匹配网络研究

遗传算法是模拟生物进化过程而发展起来的一种优化和搜索求解极值问题的自组织、自适应的人工智能技术,其通过对一组编码进行简单的遗传操作和优胜劣汰来指导学习和确定进化的方向.遗传算法提供了一种求解非线性、多模型、多目标等复杂系统优化问题的通用框架.利用遗传算法针对天线匹配网络的设计进行研究,并利用安捷伦科技有限公司的ADS软件针对同一天线设计匹配网络,通过仿真结果证明利用遗传算法设计天线匹配网络的可行性与可靠性.     

Some approaches to solving a multihour broadband network capacity design problem with single-path routing

In this paper, we consider solution approaches to a multihour combined capacity design and routing problem which arises in the design of dynamically reconfigurable broadband communication networks that uses the virtual path concept. We present a comparative evaluation of four approaches, namely: a genetic algorithm, a Lagrangian relaxation based subgradient optimization method, a generalized proximal point algorithm with subgradient optimization, and, finally, a hybrid approach where the subgradient based method is combined with a genetic algorithm. Our computational experience on a set of test problems of varying network sizes services) shows that the hybrid approach often is the desirable choice in obtaining the minimum cost network while the genetic algorithm based approach has the most difficulty in solving large scale problems. This revised version was published online in June 2006 with corrections to the Cover Date.     

An Evolutionary Design Algorithm for Ring-based SDH optical core networks

This paper presents a ring-based SDH optical core network design problem with multiple constraints. A novel evolutionary algorithm (EA) is developed to successfully find near-optimal solutions for a realistic case study. Compared to a genetic algorithm, this EA is demonstrated to be more efficient and effective by experimental simulation results, and shows promise for tackling ring-based network design problems. This revised version was published online in July 2006 with corrections to the Cover Date.     

Topology design and bandwidth allocation of embedded ATM networksusing genetic algorithm

A genetic algorithm (GA) is proposed for the design of an asynchronous transfer mode (ATM) network embedded in a digital cross connect network. This highly constrained optimization problem is shown to be better solved using GA. Improved results, both in network performance and computation speed, are obtained when comparing with the existing heuristic approach. A similar methodology can be applied for the design of other communication networks     

一类0-1背包问题的启发式网络策略模型与算法

针对遗传算法(GA)易陷入局部最优解、搜索精度低等缺点,提出了网络启发式策略的遗传算法(NSHGA),并将其成功地应用于0-1背包问题的求解。该算法采用网络节点关联策略,使算法具有良好的全局寻优能力。同时引入网络节点矩阵优化,利用其精细的局部遍历搜索性能,使算法具有较高地搜索精度。实例仿真结果表明,NSHGA算法可有效避免基本GA算法的早熟收敛,且具有寻优能力强、搜索精度高等特点。此外,与基本遗传算法仿真相比,可明显提高0-1背包问题求解的精度。     

Telecommunications network design with multiple technologies

In this paper we consider a telecommunications network design problem allowing for multiple technologies. The problem arises in wide-area network and metro-area network design for which a combination of technologies may be necessary due to high traffic volumes, long-distance transmission, and design restrictions. The network design problem builds the best network to channel traffic between a set of origins and destinations, which requires selecting links, equipping them with fiber, deciding on the type of technology, and locating switches. The goal is to minimize the total cost of the network, which accounts for the flow cost, the fiber and technology costs, and the switch-location cost. We model the problem using a multicommodity network design formulation with side constraints. We apply Benders decomposition to the problem and develop a two-phase solution method that uses a number of improvements over the basic Benders algorithm. We present promising results on randomly generated test problems.