Estimated and exact system reliabilities of a maintainable computer network

This paper presents an algorithm to evaluate estimated and exact system reliabilities for a computer network in the cloud computing environment. From the quality of service (QOS) viewpoint, the computer network should be maintained when falling to a specific state such that it cannot afford enough capacity to satisfy demand. Moreover, the transmission time should be concerned as well. Thus, the data can be sent through several disjoint minimal paths simultaneously to shorten the transmission time. Under the maintenance budget B and time constraint T, we evaluate the system reliability that d units of data can be sent from the cloud to the client through multiple paths. Two procedures are integrated in the proposed algorithm-an estimation procedure for estimated system reliability and an adjusting procedure utilizing the branch-and-bound approach for exact system reliability. Subsequently, the estimated system reliability with lower bound and upper bound, and exact system reliability are computed by applying the recursive sum of disjoint products (RSDP) algorithm.     

Capacitated stochastic coloured Petri net-based approach for computing two-terminal reliability of multi-state network

Classical network reliability problems assume both networks and components have only binary states,fully working or fully failed states.But many actual networks are multi-state,such as communication networks and transportation networks.The nodes and arcs in the networks may be in intermediate states which are not fully working either fully failed.A simulation approach for computing the two-terminal reliability of a multi-state network is described.Two-terminal reliability is defined as the probability that d units of demand can be supplied from the source to sink nodes under the time threshold T.The capacities of arcs may be in a stochastic state following any discrete or continuous distribution.The transmission time of each arc is also not a fixed number but stochastic according to its current capacity and demand.To solve this problem,a capacitated stochastic coloured Petri net is proposed for modelling the system behaviour.Places and transitions respectively stand for the nodes and arcs of a network.Capacitated transition and self-modified token colour with route information are defined to describe the multi-state network.By the simulation,the two-terminal reliability and node importance can be estimated and the optimal route whose reliability is highest can also be given.Finally,two examples of different kinds of multistate networks are given.     

矿井通风网络最小独立路集不交化可靠度的计算

运用可靠性工程理论及不交型积之和定律 ,在大型网络系统可靠度计算的基础上 ,提出了矿井通风网络系统最大线性无关最小独立路集予以真子集涤除的不交化可靠度计算的实现方法 .根据不交化可靠度计算法 ,当最小独立路集按所含网络分支的多少进行升序排列时 ,还可进一步减少中间过程的计算量 ,从而达到最佳不交化简化计算的效果 .实例分析表明 :采用升序排列的最小独立路集并按不交型积之和定理予以真子集涤除的不交化处理后 ,不仅计算值等同于一般网络分析中用全概率公式计算的矿井通风网络系统可靠度 ,而且 ,计算工作量大为简化 .     

贝叶斯网络在可靠性分析中的应用

针对故障树分析方法在可靠性分析中的局限性,研究了贝叶斯网络在可靠性分析中的应用,给出了故障树向贝叶斯网络转化的方法,以及基于贝叶斯网络求解顶事件发生概率、最小路集、最小割集和底事件重要度的算法.最后对大亚湾核电站紧急停堆失效进行了分析,并与故障树分析的结果进行了比较,结果表明,基于贝叶斯网络的建模分析方法可以得到更丰富的信息.     

New SRLG-diverse path selection algorithm in survivable GMPLS networks

In conventional shared risk link group (SRLG)-diverse path selection (CSPS) algorithm in survivable GMPLS networks, SRLG is taken into account when selecting the backup paths, while the primary path selection method is the same as the algorithms without SRLG constraint. A problem of CSPS algorithm is that, after a primary path is selected, the success probability to select an SRLG-diverse backup path for it is low. If SRLG is taken into account when computing the primary path, then the probability to successfully select an SRLG-diverse backup path will be much increased. Based on this idea, an active SRLG-diverse path selection (ASPS) algorithm is proposed. To actively avoid selecting those SRLG links, when computing the primary path, a link that share risk with more links is assigned a larger link cost. To improve the resource utilization ratio, it is permitted that the bandwidth resources are shared among backup paths. What is more, differentiated reliability (DiR) requirements of different customers are considered in ASPS algorithm. The simulation results show that, compared with CSPS algorithm, ASPS algorithm not only increases successful protection probability but also improves resource utilization ratio.     

大型网络系统可靠度计算新方法

在大型网络系统可靠度的不交最小路集算法基础上,提出大型网络系统可靠度的不交最小路集算法的实现新方法。由于直接采用两节点之间弧表示逻辑运算,编程实现过程直观而简便,根据需要可以提供网络系统的全部最小路集、全部最小割集和系统可靠度,并且采用Fortran90语言和C＋＋语言编程,为大网络系统的可靠度和不可靠度分析提供了计算模块。     

基于有效状态空间的多状态网络可靠性评估

鉴于应用d-最小割(路)集计算多状态网络可靠度精确值的算法中基于最小割(路)集求解d-最小割(路)集及容斥原理的复杂性,提出一种不需要d-最小割(路)集计算网络可靠度精确值的算法.该算法按一定规则分割状态空间,在此基础上生成有效状态空间,通过迭代计算直接获得可靠度精确值;同时通过删除边的无效状态、对最小割集进行分组,有效减小计算量;通过有序树执行该算法简单、易操作.实例表明算法的计算结果是正确的,且计算量较小,证明了其正确性和有效性,但同时也表明算法所需存储空间较大.     

基于改进射线追踪和三维可视化的UWB信道仿真

结合几何光学和一致性劈绕射理论,实现超宽带确定性信道的仿真。应用类似矢量网络分析仪的原理,计算超宽带信道的时域响应和信道损耗。在应用基于镜像的射线追踪方法进行路径计算时,引入了一种控制仿真深度的方法。该方法在构建镜像树时预测每个子节点可产生的最小衰减值,并将其与期望衰减阈值进行比较的,以达到控制镜像树规模的目的。与以反射和绕射阶数控制仿真深度的方法相比,该方法在保证同样精确度的条件下能够有效地减少计算时间。为了增强仿真结果的表现形式,仿真借用3D游戏平台,实现了信道损耗的立体可视化。

Abstract：

A deterministic Ultra-Wide Band （UWB） channel simulation in a complex indoor environment was performed using GO/UTD （Geometrical Optics/Unified Theory of Diffraction） method.The time domain response and path loss of UWB channel were computed on the principle which is similar with VNA （Vector Network Analyzer）.When image-based ray tracing method was used to compute the propagation paths,an algorithm of controlling the depth of image tree was introduced to improve the simulation performance.It limits the scale of image tree by predicting the potential minimum attenuation,which may be caused by a ray propagating from root node to child node,and comparing the predicted value with an expected maximal attenuation threshold when image tree is being constructed.Compared with simply using reflection or diffraction orders to control the scale of image tree,using this method can effectively reduce the computing time in the same accuracy condition.In order to enhance the representation of the simulation result,the visualization of path loss distribution was implemented by a 3D game platform.     

大型复杂系统平均寿命评定的Monte Carlo方法

随着现代武器系统和工程系统的大型化与复杂化趋势，大型复杂系统可靠性评定是急待解决的问题，工程中常用可靠性指标有可靠度和平均寿命，平均寿命指标由于直观、物理概念清晰，使用更加方便。基于可靠性框图建模，采用最小路集计算分析，提出了大型复杂系统平均寿命评定的Monte Carlo方法。解决了有限样本条件下，大型复杂系统平均寿命评定问题，对工程中大型复杂系统平均寿命评定具有重要应用价值。     

基于区域不相交的无线传感网任播路由算法

在无线传感器网络(wireless sensor networks, WSN)中采用任播技术可以均衡数据流及能耗。传统算法常采用节点不相交路由策略,但隐终端问题仍会造成任播路径间的传递碰撞。针对该问题,提出基于区域不相交策略的WSN任播路由算法。该算法采用扇形通道技术和基于不同时隙的区域不相交发送策略以减少任播路径传递碰撞问题。仿真实验数据表明,相比较节点不相交路由策略和最短路径优先区域不相交路由策略,本文算法在分组投递成功率和节点平均能耗上具有较好的性能优势,从而提高网络生存期。     

Algorithmof communication network reliability combining links,nodes and capacity

1 .INTRODUCTIONWhen communication networkis studied macroscopi-cally,exchange nodes ,links and transmission capaci-ty are the most i mportant parameters .If all these pa-rameters are consideredtogether ,the performancein-dex of communication network can be objectivelyshown.In Refs .[1 ,2] the reliabilityindex of a com-munication network whichintegrates the capacity andthe connection reliability of the links is defined.InRef .[1] ,the reliabilityindexis defined as the trans-mission probab…     

覆盖网对域间路由可靠性的影响研究

覆盖网可以利用终端间的多路径路由提升Internet路由的性能和可靠性。如何选取高质量的覆盖网路径,并且准确地对其进行性能评估是有待解决的核心问题。对此,首先提出一种对覆盖网路由的评估方法,该方法从路由可靠性角度进行分析,运用可靠度(RD)这一指标,从多条覆盖网路径的分离度、长度、质量等方面进行综合评估。在此基础上,提出基于广度优先遍历队列(BFSQ)的分布式的启发式算法优化覆盖网多路径的选择。仿真结果表明该算法可以通过少量底层拓扑信息的获取,达到有效提升多路径覆盖网路由可靠性及性能的目的。     

利用极小割计算随机流网络可靠度的一种算法

对随机流网络可靠度的计算问题进行了研究.提出了网络元件(边和结点)容量下确界的概念,在求基于每个极小割集的每个元件的容量向量时,对其满足的约束条件进行了改进,使其可行解集合大大减小.同时给出了两个引理,根据这两个引理,使得求基于极小割集的所有d-上界点变得非常简单,从而得到了一个计算随机流网络最大流量不少于给定需求流量d+1的可靠度的有效算法.最后,通过实例验证了该方法的有效性.     

Dynamic shared segment protection algorithm with differentiated reliability in GMPLS networks

To improve the resource utilization ratio and shorten the recovery time of the shared path protection with differentiated reliability (SPP-DiR) algorithm, an algorithm called dynamic shared segment protection with differentiated reliability (DSSP-DiR) is proposed for survivable GMPLS networks. In the proposed algorithm, a primary path is dynamically divided into several segments according to the differentiated reliability requirements of the customers. In the SPP-DiR algorithm, the whole primary path should be protected, while in the DSSP-DiR algorithm, only partial segments on the primary path need to be protected, which can reduce more backup bandwidths than that in the SPP-DiR algorithm. Simulation results show that the DSSP-DiR algorithm achieves higher resource utilization ratio, lower protection failure probability, and shorter recovery time than the SPP-DiR algorithm.     

Path problem simplification with desired bounded lengths in acyclic networks

Path determination is a fundamental problem of operations research.Current solutions mainly focus on the shortest and longest paths.We consider a more generalized problem;specifically,we consider the path problem with desired bounded lengths(DBL path problem).This problem has extensive applications;however,this problem is much harder,especially for large-scale problems.An effective approach to this problem is equivalent simplification.We focus on simplifying the problem in acyclic networks and creating a path length model that simplifies relationships between various path lengths.Based on this model,we design polynomial algorithms to compute the shortest,longest,second shortest,and second longest paths that traverse any arc.Furthermore,we design a polynomial algorithm for the equivalent simplification of the DBL path problem.The complexity of the algorithm is 0(m),where m is the number of arcs.     

On the Tractability of Shortest Path Problems in Weighted Edge-Coloured Graphs

A weighted edge-coloured graph is a graph for which each edge is assigned both a positive weight and a discrete colour, and can be used to model transportation and computer networks in which there are multiple transportation modes. In such a graph paths are compared by their total weight in each colour, resulting in a Pareto set of minimal paths from one vertex to another. This paper will give a tight upper bound on the cardinality of a minimal set of paths for any weighted edge-coloured graph. Additionally, a bound is presented on the expected number of minimal paths in weighted edge–bicoloured graphs. These bounds indicate that despite weighted edge-coloured graphs are theoretically intractable, amenability to computation is typically found in practice.     

网络规划中一般路线的算法

网络规划是一类广泛应用的定量管理技术。在处理各类实际问题时，不仅要计算关键路线，而且还要兼顾其它的非关键路线，其中包含次关键路线。非关键路线算法研究被长期忽视了。本文从网络时间的一般性质入手，给出了判别路线长度的工序总时差和工序单时差的若干性质，然后给出了所有不少于预定长度的路线的算法，并且结合实例进行了计算，最后对本文算法进行了若干讨论。     

Graphical-based reliability evaluation of multiple distinct production lines

This paper proposes a graphical-based methodology to evaluate the performance of a manufacturing system in terms of network model.We focus on a manufacturing system which consists of multiple distinct production lines.A transformation technique is developed to build the manufacturing system as a manufacturing network.In such a manufacturing network,the capacity of each machine is multistate due to failure,partial failure,or maintenance.Thus,this manufacturing network is also regarded as a multistate network.We evaluate the probability that the manufacturing network can meet a given demand,where the probability is referred to as the system reliability.A simple algorithm integrating decomposition technique is proposed to generate the minimal capacity vectors that machines should provide to eventually satisfy demand.The system reliability is derived in terms of such capacity vectors afterwards.A practical application in the context of IC card manufacturing system is utilized to demonstrate the performance evaluation procedure.     

基于单源最优路径的NOMA中继选择与协作传输

目前,在非正交多址接入(non-orthogonal multiple access,NOMA)中继通信的研究中,中继用户的选择是随机的,并没有考虑中继节点之间信道条件的差异.为了得到信道条件较好的中继用户,提出一种基于单源最优路径的中继选择策略,从基站广播信号以用户为节点,设定信道参数,寻找最佳传输通路.当信号到达目...     

计算机网络系统正常工作模式和故障模式分析

提出了考虑网络节点可靠性时,计算机网络系统正常工作模式和故障模式分析方法.通过比较不考虑节点可靠性和考虑节点可靠性条件下,计算机网络系统正常工作模式和故障模式变化,说明在计算机网络系统可靠性与安全性分析时,考虑节点可靠性的必要性.