Quantifying optimal mesh and ring design costs

During the last decade telecommunication operators have been deploying WDM (Wavelength Division Multiplexing) technology to satisfy the exponential growth in global communication. While facilitating the advanced information society of today, this has also led to a higher dependency on the networks, and furthermore the high capacity utilization of optical fibers means that a single link failure will influence many users and enterprises. For these reasons, protection of network connections has become a major competitive parameter for the operators. Currently, the most popular protection method is ring protection, due to its simplicity, requiring only basic management functionality and operating with local restoration control. While many optical rings have been deployed, little work has been published on exactly what the cost of ring networks are, compared to general mesh networks. In this article we perform a quantitative comparison between ring protection and mesh protection, using real world network data and realistic prices for network components. Extending classic LP flow models to take rings and node costs into account, and using a link‐path based mesh network LP model, we are able to perform a total cost comparison of the two architectures, and of manual ring network design. The results suggest that the price of mesh network components must be reduced significantly to be competitive with ring based networks, and also that manual network design does not necessarily lead to the most cost‐efficient designs. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2005     

军事通信网节点重要度评估方法

针对军事通信网的应用环境和业务流传输的特殊性，考虑节点类型以及节点之间的相互关系，将节点按功能分为侦察节点、处理节点、指控节点、行动节点、传输节点五类节点。根据军事通信网信息流传输的特点，改进了传统的网络介数基本概念，定义了符合军事通信网特征的节点和链路重要度的新指标。最后，通过实例对军事通信网的节点重要度进行仿真计算，画出了所有节点重要度柱状分布图。     

信息知识库中的数据可用性恢复策略

信息知识库在工业生产中能够提高生产效率、降低资源消耗,但数据失效频率高。针对多节点失效重构的纠删码策略较少,且未充分考虑失效数据重构时各参与节点间的链路关系,导致重构效率较低。针对信息知识库数据失效,提出一种新的重构策略。根据节点的数据处理能力,选取数据处理能力最高的新生节点为路由节点;依据路由节点与候选供应节点及剩余空闲节点的链路带宽,确定供应节点及新生节点,从而构建数据重构网络拓扑,提高失效数据重构效率。实验结果证实,与传统纠删码策略性能比较,该方法有较短的重构时间和较高的重构成功率。     

基于动态流能量高效的无线传感网路由算法

针对无线传感网中结点能量受限,提出了一种基于动态流能量高效的路由算法DFEERA(Dynamic Flow-based Energy-Efficient Routing Algorithm)。该算法通过在无线传感网内设置多个基站收集区域内传感器结点的数据流拓扑结构建立数据传输能量消耗模型,将该模型转换为最大流问题求解最优传输路径,作为某时期内结点数据传输路径。随着结点能量的消耗,动态调整该能量消耗模型重新规划路径,作为新的传输路径,从而平衡结点间的能量消耗,提高网络结点的存活率。仿真结果表明,与其他典型的路由算法相比,DFEERA能够更好地平衡结点的能耗,获得更高的能量消耗率和更长的网络生存期。     

The network redesign problem for access telecommunications networks

The network redesign problem attempts to design an optimal network that serves both existing and new demands. In addition to using spare capacity on existing network facilities and deploying new facilities, the model allows for rearrangement of existing demand units. As rearrangements mean reassigning existing demand units, at a cost, to different facilities, they may lead to disconnecting of uneconomical existing facilities, resulting in significant savings. The model is applied to an access network, where the demands from many sources need to be routed to a single destination, using either low‐capacity or high‐capacity facilities. Demand from any location can be routed to the destination either directly or through one other demand location. Low‐capacity facilities can be used between any pair of locations, whereas high‐capacity facilities are used only between demand locations and the destination. We present a new modeling approach to such problems. The model is described as a network flow problem, where each demand location is represented by multiple nodes associated with demands, low‐capacity and high‐capacity facilities, and rearrangements. Each link has a capacity and a cost per unit flow parameters. Some of the links also have a fixed‐charge cost. The resulting network flow model is formulated as a mixed integer program, and solved by a heuristic and a commercially available software. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 487–506, 1999     

大容量数据下基于DTN的链路中断优化传输技术

激光或GHz以上的高频链路的应用将导致DTN(Delay Tolerant Network)网络链路数据容量的增大,大容量数据链路的间歇性中断将严重影响数据的传输效率。针对DTN网络中大容量数据链路频繁中断和节点的剩余缓存空间剧烈变化的问题,提出在DTN路由算法上增加拥塞状态预测机制和易中断链路判定机制,根据节点的拥塞程度定义惩罚函数,缓解链路中断和节点资源受限导致的拥塞。仿真结果表明,该机制可以有效提高DTN网络的传输性能。     

基于FC-AE-1553B通信协议的网络仿真

对于FC-AE-155B通信协议与光纤通道(FC)技术的应用进行了研究.针对航空电子设备的通信要求进行了独立的建模,验证了FC-AE-1553B协议在航电系统中的传输能力.实验搭建了对立的FC仲裁网络并按照FC-AE-1553B协议制定了包模型,建立了节点模型、链路模型.按照协议要求制作了进程模型设计了有限状态机.在OPNET仿真环境下对航电设备的FC网络进行了构建,测评了基于FC网络的FC-AE-1553通信协议的应用能力.     

多媒体传感器网络中基于ACO的QoS路由协议

针对目前无线多媒体传感器网络QoS路由协议算法复杂、能耗较大等缺点,提出将蚁群优化算法用于改进无线多媒体传感器网络的路由选择.首先,抽象出多媒体传感器网络QoS 路由模型,进而,利用蚁群算法设计了一个运用带网络约束条件的权值去更新信息素浓度增量的路由算法--AntWMSN算法,AntWMSN算法利用正向蚂蚁F_(ant)收集链路带宽、时延、丢包率等参数,结合精华蚂蚁系统更新本地节点的网络状态模型以及每个访问过的节点上的信息素,从而找到满足多约束QoS条件下的最佳路由.仿真结果表明,该算法具有分布式全局优化网络路由选择的特性,比传统的QoS路由协议具有更好的收敛性,并且在满足网络对QoS参数需求的前提下,有效地提高了网络的生命周期.     

基于作战环路的指挥信息系统抗毁性建模与分析

在指挥信息系统抗毁性研究中,网络节点异质性和作战机理的表征与分析不足.针对该问题,基于指挥信息系统主导的观察、判断、决策和行动作战环路,区分网络中信息、指控、打击和通信4类节点,提出作战信息链的概念来反映指挥信息系统运行机理;采用平均时延来刻画作战信息链的时效性,通过转化为经过指定点的最短路径问题给出计算方法;采用链路贯通率来刻画全系统内信息节点和打击节点之间形成有效链路的程度.结合"预先规划+随遇接入"生成的指挥信息系统网络模型,进行了抗毁性仿真分析,验证了方法的有效性.仿真结果进一步表明,指挥信息系统网络在随机攻击和度优先攻击下抗毁性表现出了复杂网络的共性,但其抗毁性结果的异常变化也具有一定的特殊性,从而证实了节点异质性和系统作战机理的影响.     

带概率因子的最小费用流经济性分析模型研究

装备跨越式更新换代,传统的备件维修保障模式已难适应装备的发展。针对备件维修级别经济性问题,在备件及其维修网络结构分析的基础上,分析各种维修费用,并借助故障树理论,设定四类模型节点:源节点、修理决策节点、转移概率节点和结束节点;分析建立带概率因子的最小费用流经济性分析的模型网络图,结合概率因子分析各种维修费用,由此建立最小费用流的经济性分析模型,并实例论证了该模型的可行性,为解决备件维修级别问题提供了一种新的思路。     

战术移动Ad Hoc网络下的分布式位置辅助功率控制算法

针对战术移动自组(AdHoc)网络提出一种分布式位置辅助的功率控制算法(LAPCA),它通过位置预测来推算节点的邻节点数目,进而调整信号发射功率,以保持最佳的网络连通性,由此提高整个网络的有效流量。该算法作为一个独立模块可以方便地与已有的移动自组网络路由协议相结合。采用较为适合战术环境的参考点群组移动(RPGM)模型来产生网络仿真场景,从仿真实验结果来看,几乎在所有的RPGM场景下采用该算法后的网络有效流量相对于纯粹的AODV路由协议都得到了提高。     

网络中心环境下的军事通信超网络结构模型

网络中心环境下的军事通信网络是一个多重边异构的人工功能网络。为了分析、设计和构建网络中心环境下的军事通信网络,通过扩展、综合Jeff的作战网络模型和Hans的网络兵力参考模型,提出了一种能够清晰描述网络节点功能和链路传输类型的军事通信超网络结构模型,给出了模型的数学描述,并说明基于它可将军事通信网络分解为多个具有军事特征的功能子网或专业通信网。最后通过分析某联合作战部队通信的超网络结构特征,验证了模型的有效性。     

Optimal multicommodity network flows with resource allocation

The problem of determining multicommodity flows over a capacitated network subject to resource constraints may be solved by linear programming; however, the number of potential vectors in most applications is such that the standard arc-chain formulation becomes impractical. This paper describes an approach—an extension of the column generation technique used in the multicommodity network flow problem—that simultaneously considers network chain selection and resource allocation, thus making the problem both manageable and optimal. The flow attained is constrained by resource availability and network capacity. A minimum-cost formulation is described and an extension to permit the substitution of resources is developed. Computational experience with the model is discussed.     

分布式网络化测试系统设计

以某大型复杂装备远程测试系统为例,给出了基于DCOM的分布式网络化虚拟仪器测试系统的体系结构.该网络化测试系统体系结构采用DS技术作为客户端和测试端连接的中间件,并采用C/S、B/S混合模式使系统各COM/DCOM组件通过网络实现"无缝"连接.DCOM技术的应用使得各网络测试节点成为服务的本体,可以响应不同客户的测试需求,实现了良好的数据传输、安全管理和远程仪器控制.DS技术的使用进一步简化了计算机和测试应用之间的数据交换,达到了良好的实时传输效果.     

作战体系超网络模型及应用

作战体系是由实体节点、各节点之间的物理、逻辑关系,以及实体节点之间的“流”交互、输送、聚集、融合所构成的复杂系统,基于单一要素的网络模型不能反映作战体系的复杂构成和整体结构。本文从军事需求出发,提出了社会任务—指挥控制—物理资源多层超网络模型,用以反映作战体系的复杂构成及结构形态。并通过形式化描述对网络之间的相互交互与映射关系进行规范,接着对模型应用中的关键技术作了初步探讨,模型为研究军事组织指挥、控制问题提供了一种新的工具和思路。     

基于强化学习的移动自组织网络分步路由算法*

移动自组织网络是一种无基础设施、由移动通信节点组成的无线网络,具有高度的动态特性。传统的路由协议并不能适应节点移动性带来的频繁拓扑变化,简单的洪泛路由也会因开销过大降低网络的性能。针对如何在移动自组织网络中自适应地进行路由选择,提出了一种基于强化学习的分步路由选择算法。该算法以最小链路总往返时延为目标,基于强化学习进行路由搜寻,在筛选出符合目标需求节点集合的基础上,结合置信度选择路由。在链路变得不可靠时,数据包被广播给筛选出的邻居节点集来提升路由可靠性并降低开销。对提出的算法在分组到达率和路由开销等主要性能指标进行数值仿真分析,仿真结果表明,提出的分步路由算法相比于基于强化学习的智能鲁棒路由,在降低开销的同时,保持着相当的吞吐率。     

Equitable bandwidth allocation in content distribution networks

Applications for content distribution over networks, such as Video‐on‐Demand (VOD), are expected to grow significantly over time. Effective bandwidth allocation schemes that can be repeatedly executed must be deployed since new programs are often installed at various servers while other are deleted. We present a model for bandwidth allocation in a content distribution network that consists of multiple trees, where the root of each tree has a server that broadcasts multiple programs throughout the tree. Each network link has limited capacity and may be used by one or more of these trees. The model is formulated as an equitable resource allocation problem with a lexicographic maximin objective function that attempts to provide equitable service performance for all requested programs at the various nodes. The constraints include link capacity constraints and tree‐like ordering constraints imposed on each of the programs. We present an algorithm that provides an equitable solution in polynomial time for certain performance functions. At each iteration, the algorithm solves single‐link maximin optimization problems while relaxing the ordering constraints. The algorithm selects a bottleneck link, fixes various variables at their lexicographic optimal solution while enforcing the ordering constraints, and proceeds with the next iteration. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

WSN中基于虚拟锚节点的AD定位算法研究

确定事件发生的位置是无线传感器网络最基本的功能之一,对WSN应用的有效性起着关键性作用。提出了一种基于虚拟锚节点的主动分布式定位算法,该算法可以使待定位节点主动发送定位请求给虚拟锚节点,周期性地接收定位信标,并分布在各个节点上执行定位算法,从而得到节点的预估位置。实验表明,本算法可以有效地提高待定位节点的定位精度和减少残余待定位节点数量。     

Time minimizing flows in directed networks

An important class of network flow problems is that class for which the objective is to minimize the cost of the most expensive unit of flow while obtaining a desired total flow through the network. Two special cases of this problem have been solved, namely, the bottleneck assignment problem and time-minimizing transportation problem. This paper addresses the more general case which we shall refer to as the time-minimizing network flow problem. Associated with each arc is an arc capacity (static) and a transferral time. The objective is to find a maximal flow for which the length (in time) of the longest path carrying flow is minimized. The character of the problem is discussed and a solution algorithm is presented.     

网络节点双机容错系统中的重构算法

提出了一种网络节点双机容错系统中的重构算法,详细叙述了重构时序和内存数据的一致性,并给出了算法流程。