Automated network management and configuration using Probabilistic Trans-Algorithmic Search

Online configuration of large-scale systems such as networks requires parameter optimization within a limited amount of time, especially when configuration is needed as a response to recover from a failure in the system. To quickly configure such systems in an online manner, we propose a Probabilistic Trans-Algorithmic Search (PTAS) framework which leverages multiple optimization search algorithms in an iterative manner. PTAS applies a search algorithm to determine how to best distribute available experiment budget among multiple optimization search algorithms. It allocates an experiment budget to each available search algorithm and observes its performance on the system-at-hand. PTAS then probabilistically reallocates the experiment budget for the next round proportional to each algorithm’s performance relative to the rest of the algorithms. This “roulette wheel” approach probabilistically favors the more successful algorithm in the next round. Following each round, the PTAS framework “transfers” the best result(s) among the individual algorithms, making our framework a trans-algorithmic one. PTAS thus aims to systematize how to “search for the best search” and hybridize a set of search algorithms to attain a better search. We use three individual search algorithms, i.e., Recursive Random Search (RRS) (Ye and Kalyanaraman, 2004), Simulated Annealing (SA) (Laarhoven and Aarts, 1987), and Genetic Algorithm (GA) (Goldberg, 1989), and compare PTAS against the performance of RRS, GA, and SA. We show the performance of PTAS on well-known benchmark objective functions including scenarios where the objective function changes in the middle of the optimization process. To illustrate applicability of our framework to automated network management, we apply PTAS on the problem of optimizing link weights of an intra-domain routing protocol on three different topologies obtained from the Rocketfuel dataset. We also apply PTAS on the problem of optimizing aggregate throughput of a wireless ad hoc network by tuning datarates of traffic sources. Our experiments show that PTAS successfully picks the best performing algorithm, RRS or GA, and allocates the time wisely. Further, our results show that PTAS’ performance is not transient and steadily improves as more time is available for search.     

在协议集成测试系统上开展路由协议测试

在分析路由协议的特性及其测试需求的基础上，提出利用窗口黑盒来描述被测协议，利用多通道测试方法扩展对被测实现的控制和观察，通过扩充参考实现增强系统的测试能力。将这些理论，技术应用于系统中，对路由协议开展了有效的测试活动，为国产高性能路由器的开发提供了有力的支持，也进一步增强了PITS系统的功能和适用性。     

信令网的核心--下一代信令转接点

本文在讨论了下一代信令转接点在满足传统信令网络功能的基础上，着重介绍了下一代的信令转接点上实现的号码携带、灵活路由等新业务，并如何实现传统STP面向下一代网络的平滑过渡。     

Routine Highway Bridge Inspection Condition Documentation Accuracy and Reliability

Routine inspection is the most common form of highway bridge inspection to satisfy the requirements of the National Bridge Inspection Standards. The accuracy and reliability of documentation generated during these inspections are critical to the allocation of Department of Transportation construction, maintenance, and rehabilitation resources. Routine inspections are typically completed using only the visual inspection technique and rely heavily on subjective assessments made by bridge inspectors. In light of this, and given the fact that visual inspection may have other limitations that influence its reliability, the Federal Highway Administration initiated an investigation to examine the reliability of visual inspection as it is currently applied to bridges in the United States. This paper will summarize results from this study related to the accuracy and reliability of routine inspection documentation. A number of important conclusions were developed from the experimental study. Generally, it was found that all structural condition documentation is collected with significant variability. Specifically, 95% of primary element condition ratings for individual bridge components will vary within two rating points of the average and only 68% will vary within one point. Documentation generally collected to support condition ratings also has significant variability as exemplified by the number and types of field notes and photographs taken by inspectors. With respect to the use of element-level inspections, it was found that element usage was generally consistent with the Commonly Recognized Element Guide. However, there is significant variability in the condition state assignments of those elements and in some cases the condition states are not applied correctly to particular elements.     

浅析两种分布式路由选择算法

本文介绍及分析了两种基本的动态路由选择算法.     

Electronic protection and routing optimization of MANETs operating in an electronic warfare environment

Domination of the electromagnetic spectrum is a crucial component of the 21st century warfare. In the harsh electromagnetic environment of the modern battlefield, it is of the utmost importance to deny the opposing force the opportunity to attack or exploit the detection/interception of friendly communications assets through the deployment of electronic protection (EP) measures in order to attain low probability of detection (LPD), low probability of interception (LPI) and anti-jam (A/J). Given that directional antennas are a suitable means to achieve both extended range and LPD/LPI, this paper proposes mechanisms to optimize the trade-off between these capabilities, minimizing the number of hops and end-to-end delay when routing packets in a multi-hop ad-hoc network, while taking into account stealth requirements. The novel scheme is based on a variant of Fisheye State Routing, coupled with a power control algorithm to guarantee a LPD/LPI beyond the zone covered by the omni-directional radiation footprint of the network. The performance of the proposed scheme is evaluated through computer simulation.     

地域通信网中基于业务量的动态路由研究

本文从地域通信网的特点出发，分析了以前所使用的路由选择方法的优缺点，提出了网控支持的基于业务量的动态中币管理方法，并描述了该路由管理方法的分层结构和在地域网网络管理系统中的具体实现。     

多芯片组件的布线

布线是多芯片组件（ＭＣＭ）ＣＡＤ中的一个关键步骤，由于ＭＣＭ的封装密度很高，因此，因此，其布线问题也较传统的ＩＣ或ＰＣＢ布线更为困难，指出了ＭＣＭ布线中存在的问题，介绍了当前用于ＭＣＭ布线的几种方法，着重讨论了ＳＬＩＣＥ布线法和４通孔布线法，对这几种方法进行了比较，４通孔布线法可直接产生详细布线结果，有利于节省成本和提高布线效率。     

对DECnet路由选择参数COST.HOP的分析与应用

本文通过实例，对ＤＥＣｎｅｔ路由选择参数ＣＯＳＴ和ＨＯＰ的数值进行了计算，分析了两个参数在选择网络接口中的作用。提出了保证网络畅通的方法。     

基于减聚类优化算法的无线传感网络分簇路由协议研究

无线传感网络是当前无线网络研究的热点领域,分簇路由协议作为降低网络能耗、提高网络生存时间的核心技术而备受关注。在深入分析已有算法存在诸多不足的基础上,本文提出了一种基于减聚类优化的分簇路由算法。本文首先建立一阶能耗模型,确定网络最优簇首数量;然后建立减聚类优化数学模型,确定可供选择的分簇方案;最后以最小化最大簇内距离方差作为评价指标,确定最优的分簇结果。仿真结果表明:相比经典的LEACH分簇路由协议,该算法划分的网络能够有效地降低网络能耗、提高网络生存时间,弥补已有算法的不足之处。