机动干线通信网抗毁评估方法

机动干线通信网具有机动、灵活、多变性,对网络的抗毁性、可靠性、生存性有着特殊的要求。针对机动干线通信网的特点,提出一种快速评价网络整体抗毁性的方法,给出抗毁性定量计算的数学解析式,同时给出网络中各节点、链路对网络抗毁能力的贡献量度。建立合理、有效的抗毁量度指标对机动干线通信网络优化、网络调整以及网络评估都有着重要意义。     

A linear‐based trunk reservation routing algorithm for ATM networks

In this paper a practical routing algorithm is proposed that increases the network throughput irrespective of the network traffic load. Its effectiveness is based on an efficient cost function which achieves a successful trade‐off between the use of the minimum‐hop routes and the application of the load‐balancing concept. Moreover, it employs the known Trunk Reservation notion according to a probability that increases linearly with the traffic load. This results in an effective compromise of the performance of the algorithm between light and heavy traffic loads. Finally, its simplicity and its suitability for a real‐time application render it as an efficient routing algorithm for ATM networks. Copyright © 1999 John Wiley & Sons, Ltd.     

取代羧酸pKa的分子树拓扑研究

基于非氢原子i的酸性点价(δai)建构分子树拓扑指数(mT)及其分支指数(mTC)和叶指数(mTx),并提出表征诱导效应的叶指数(mT′x).通过最佳变量子集算法获得38种羧酸的pKa与0TC、1TC、0T′x的回归方程:pKa=3.0352-1.25700T′x-0.15540TC+0.07811TC,R=0.9766.通过Jackknife法检验,该模型具有总体稳健性.优于文献的七元最佳回归模型(R=0.957),与其分子力学方法(CoMFA)结果(R=0.988)较为接近.结果表明,所建拓扑指数是合理的,具有科学性基础.     

浅析纯3G室内分布式系统的造价模型

本文从室内分布系统的主要组成出发,分成主干、平层、电梯、干放的需求分析4大部分,从设计理念上分析各自相应的设计方案,并在此基础上建立纯3G室内分布系统的造价模型.工程实践表明,该模型在站点信息准确的情况下,误差很小.     

邮件实行集装容器化运输方案的探讨

介绍了邮件实行集装容器化运输的意义、实施原则及其步骤。提出了集装容器化运输对集装容器、运输车辆、装卸机具和邮件收寄封发的要求,以及集装容器化过程中信息处理和运输调度的方法。     

本地光缆网中继及主干层规划

本文论述了当前电信本地光缆网存在的问题,提出了本地光缆网中继及主干层的规划思路及发展策略,重点阐述了主干层的规划思路,充分论证了主干层应该作为以后本地光缆网建设的重点,为电信转型及实现FTTH做好充分准备。     

莆田市涵江区HFC网络升级改造技术方案

从分析涵江区有线电视网络的建设与发展状况和存在的主要技术问题入手，介绍了HFC网络升级的技术方案和实施办法，主要介绍了HFC网络升级改造的指导思想、总体规划思路、基本功能和特点、网络拓扑结构、光链路设计和系统技术要求。     

光纤传输远泵浦EDFA通信线路的设计

介绍一种用远泵浦掺铒光纤放大器组建无中继、长距离光纤通信线路的设计方法 ;给出了速率为 2 .5Gb、距离 40 0 km无中继海底光缆传输线路设计结果 ;讨论了这种线路的优点及其应用前景。     

影响有线电视网络光链路指标的综合因素

在有线电视光缆干线系统中，影响C／N，CSO，CTB等主要技术指标有多种因素。以1310nm光纤传输系统为例分析了各种因素对光链路指标的影响。     

Individual Overflow and Freed Carried Traffics for a Link with Trunk Reservation

Two traffic streams Φ₁, Φ₂ are offered a link. The calls of Φ_i require exponential holding times with parameter μ and are accepted if less than C_i trunks are occupied. Approximating the Φ_i by appropriate renewal processes meeting their first two moments, defined as the moments of the numbers of calls in virtual links of infinite capacity to which the traffic streams as freed traffics are virtually directed and where the calls get fresh exponential i.i.d. holding times with parameter μ, stable recursive algorithms of complexity O(max (C₁,C₂)) are derived for the first two defined as above moments of the individual overflow and freed carried traffics. The results offer a unified handling of both overflow and carried traffics in circuit switched networks with trunk reservation, providing a basis for new two-moment network dimensioning algorithms.This work was supported by a grant from the Siemens AG.