通信网络宏观可靠性指标的全代数化算法

为了更全面和客观地评价宽带大容量通信网络的可靠性能,引入宏观可靠性指标--总容量归一化加权可靠性指标概念,它是把通信容量和链路可靠性参数有机地综合在一起的指标.解决该指标全代数化计算的关键问题是寻找能够算出网络各节点之间全部路由的代数化路由算法.研究出一种逻辑代数化网络路由算法,n个节点的网络只需n次矩阵变换运算,就能得到任意节点之间的全部路由.基于新路由算法研究出网络可靠性指标的全代数化算法,它易于编写程序,利用计算机可以很方便地算出通信网络的可靠性指标,解决了总容量归一化加权可靠性指标计算困难问题,且达到实用化程度.利用算例验证了算法的正确性,并对算法的各计算过程进行了详细说明.     

通信网节点间路由及可靠性指标全代数化算法

为了精确地计算通信网可靠性指标，需采用布尔代数算法，路由寻找是该算法必须要解决的关键问题。研究出一种新的路由算法，按照逻辑代数运算规则，采用关联矩阵变换方式计算，适合计算各种拓扑形式的通信网络两节点间的全部可能路由，且不会出现闭环路由现象，完全符合通信传输规则。基于该路由算法，叉解决了端到端通信网可靠性指标全代数化计算问题，且可靠性指标是综合了通信链路和节点两方面的因素而定义的，从而弥补了以往可靠性计算只注重链路失效而忽视节点失效的不足。通过算例详细地说明各算法的计算过程．并验证了算法的正确性。     

一种多约束服务质量路由算法

下一代网络服务质量要求解决多约束服务质量路由问题.在分析了服务质量路由特点及相关工作的基础上,提出服务质量路由新计算方法.方法基于路径计算,首先计算最少跳路径,然后利用非线性花费函数进行求解并判断约束路径,最后求出优化多约束路径.通过对网络拓扑状态仿真结果表明,该算法能快速求解在多约束条件下优化路径,约束参数扩展性好.     

基于保证QoS的片上网络路由算法

为了解决满足多个约束条件的片上网络服务质量,提出了一种基于区域的路由算法,该算法根据数据包所在的节点将整个网络按照X维分为两个部分,正面部分采用东最后路由,负面部分采用西优先路由.仿真结果表明,区域路由算法比传统的维序算法和奇偶转向模型能够很好地保证片上网络的服务质量.     

多约束路由的分层计算方法

针对多约束参数限制下服务质量路由的寻找问题,提出一种分层式计算思想。设想把路由计算方式分为两层,第一层工作是计算源与目的节点间的可达路径集,第二层则是在路径集中寻找满足条件的路由。研究出一种可达路径集计算方法,在此基础上推出了具体的分层式路由计算方法,采用由少到多逐一增加串联链路和节点数量递进方式进行,一旦寻找到满足条件的路由,则给出结果,退出计算。通过算例详细介绍了路径集与路由寻找的计算方法,并论证了路径集算法的正确性,阐明了路由新算法的时间复杂性及诸多优点,提出了适应多约束参数传输的状态信息交换协议改进建议。通过仿真实验验证了路由新算法的正确性,同时也说明新算法完全能够满足实际需要。     

中国铁通开展MPLS VPN业务的分析

MPLS VPN是一种基于MPLS技术的IP虚拟专用网络(IPVPN),是在网络路由和交换设备上应用MPLS技术,简化核心路由器的路由选择方式,利用结合传统路由技术的标记交换实现的IP虚拟专用网络,可用来构造宽带的Intranet及Extranet,满足灵活的业务需求。     

一种改进的多约束条件的路由算法

基于多约束条件的满足服务质量(QoS)路由选择问题是当前通信网络中的一个重要问题,满足一个或多个约束条件的路由问题都是非确定多项式的完全问题(NPC),因此解决此类问题通常是很困难的。文中针对此类问题提出一种改进的启发式算法,快速、准确地解决多约束条件的路由选择问题。     

高级量测电气信息流多服务质量传输约束路由算法

智能微电网是实现可再生能源高效利用的有效途径,系统要求具有鲁棒自愈性。高级量测和可靠通信技术是实现以上目标的核心支持技术。基于流量工程理论和分布式代理技术,该文提出一种应用于智能微电网高级量测(AMI)系统的电气信息流传输多服务质量(QoS)保证路由算法(EIF-MQC)。首先设计了基于IEC61850电气标准的信息分形差分服务代码点(DSCP)映射模型,实现异构电气参量数据整形标记。并通过电气信息流多服务质量传输约束路由算法(EIF-MQC)选择满足流量QoS需求的最优路由。理论证明算法计算传输路径是有效最短路径。仿真实验采用电气可靠性技术解决方案联合会(CERTS)微网系统结构进行算法性能评价,在轻度和重度通信负载条件下,算法均具有较好带宽利用率,并比基于链路状态路由协议(OSPF)和负载均衡最短路径路由协议(LB-SPR)配置路径传输延迟低且丢包率小,从而有效避免网络拥塞,提升AMI系统传输性能。     

NoC中的基于蜂群算法的QoS路由

为了解决满足多个约束条件的片上网络服务质量,本文提出了基于蜂群算法的一种QoS路由,该算法使用代理来更新路由信息,并综合考虑历史信息和当前网络状态的路由策略。采用最短路由,最大程度开放路由的自由度,使用基于软件的死锁恢复机制来检测和恢复死锁。仿真结果表明,蜂群算法比维序算法和奇偶转向模型能够更好的保证片上网络的服务质量。     

浅析计算机网络路由优化及其优化算法

计算机网络路由可以实现互联网络端口的连接,并能够有效满足不同网络之间的信息传送,在科学技术日益提升的今天,计算机网络的应用越来越普遍,使用计算机网络的人数也在逐年增加,大规模化的计算机网络覆盖也给我国当前的计算机网络路由工作带来了更大的压力与挑战。对计算机网络路由进行优化的同时也能够进一步提高计算机网络资源的有效利用,改善计算机网络对于用户的服务质量。本文以网络路由及多样性种类为切入点,为如何加强计算机网络路由的服务功能、进一步提高计算机网络信息传输的稳定性与安全性等问题提出计算机网络路由优化及其优化算法。     

IP/ MPLS over WDM网中考虑QoS的VPN业务设计

本文研究了在IP／MPLS over WDM网络中支持不同QoS要求的VPN业务的逻辑拓扑设计问题。对于给定的网络物理拓扑和业务需求矩阵，本文提出，基于不同时延要求的VPN业务逻辑拓扑设计可以运用两种方法加以解决。一为基于迭代的线性规划方法，适合于规模较小的网络。另一个为启发式算法，可运用于网络规模较大的环境。对比仿真结果表明，启发式算法不但较好地解决了不同QoS要求的VPN业务的选路和波长分配问题，还较好地降低了链路的最大负载。     

An overview of quality of service routing for next-generationhigh-speed networks: problems and solutions

The upcoming gigabit-per-second high-speed networks are expected to support a wide range of communication-intensive real-time multimedia applications. The requirement for timely delivery of digitized audio-visual information raises new challenges for next-generation integrated services broadband networks. One of the key issues is QoS routing. It selects network routes with sufficient resources for the requested QoS parameters. The goal of routing solutions is twofold: (1) satisfying the QoS requirements for every admitted connection, and (2) achieving global efficiency in resource utilization. Many unicast/multicast QoS routing algorithms have been published, and they work with a variety of QoS requirements and resource constraints. Overall, they can be partitioned into three broad classes: (1) source routing, (2) distributed routing, and (3) hierarchical routing algorithms. We give an overview of the QoS routing problem as well as the existing solutions. We present the strengths and weaknesses of different routing strategies, and outline the challenges. We also discuss the basic algorithms in each class, classify and compare them, and point out possible future directions in the QoS routing area     

A differentiated optical services model for WDM networks

This article addresses the issues of scalable end-to-end QoS in metropolitan DWDM networks serving as transit networks for IP access networks. DWDM offering a few wavelengths has been deployed in the past in backbone networks to upgrade point-to-point transmission where sharing is based on coarse granularity. This type of DWDM backbone network, offering a few light-paths, provides no support for QoS services traversing the network. As DWDM networks with larger numbers of wavelengths penetrate the data-centric metro environment, specific IP service requirements such as priority restoration, scalability, dynamic provisioning of capacity and routes, and support for coarse-grain QoS capabilities will have to be addressed in the optical domain in order to achieve end-to-end QoS over a DWDM network. We propose a QoS service model in the optical domain called differentiated optical services (DoS) based on a set of optical parameters that captures the quality and reliability of the optical lightpath     

Multi‐constrained Shortest Disjoint Paths for Reliable QoS Routing

Finding link‐disjoint or node‐disjoint paths under multiple constraints is an effective way to improve network QoS ability, reliability, and so on. However, existing algorithms for such scheme cannot ensure a feasible solution for arbitrary networks. We propose design principles of an algorithm to fill this gap, which we arrive at by analyzing the properties of optimal solutions for the multi‐constrained link‐disjoint path pair problem. Based on this, we propose the link‐disjoint optimal multi‐constrained paths algorithm (LIDOMPA), to find the shortest link‐disjoint path pair for any network. Three concepts, namely, the candidate optimal solution, the contractive constraint vector, and structure‐aware non‐dominance, are introduced to reduce its search space without loss of exactness. Extensive simulations show that LIDOMPA outperforms existing schemes and achieves acceptable complexity. Moreover, LIDOMPA is extended to the node‐disjoint optimal multi‐constrained paths algorithm (NODOMPA) for the multi‐constrained node‐disjoint path pair problem.     

基于安全隔离度的5G专网部署模式

运营商在5G时代需要提供差异化的定制网络来满足行业用户多元化的业务场景,首先对5G无线专网市场需求进行分析,随后介绍了5G无线专网频谱资源的三种分配方式,并分析了5G无线专网的部署应考虑到业务场景对安全隔离度的需求,最后总结得出,不同安全隔离度的专网部署模式以及网络架构都各有优缺点,也没有一种网络架构完全适合所有的情况,因此需要运营商根据行业用户对网络Qos的差异化需求以及业务特性进行精细化定制。     

Application-Oriented Flow Control: Fundamentals, Algorithms and Fairness

This paper is concerned with flow control and resource allocation problems in computer networks in which real-time applications may have hard quality of service (QoS) requirements. Recent optimal flow control approaches are unable to deal with these problems since QoS utility functions generally do not satisfy the strict concavity condition in real-time applications. For elastic traffic, we show that bandwidth allocations using the existing optimal flow control strategy can be quite unfair. If we consider different QoS requirements among network users, it may be undesirable to allocate bandwidth simply according to the traditional max-min fairness or proportional fairness. Instead, a network should have the ability to allocate bandwidth resources to various users, addressing their real utility requirements. For these reasons, this paper proposes a new distributed flow control algorithm for multiservice networks, where the application's utility is only assumed to be continuously increasing over the available bandwidth. In this, we show that the algorithm converges, and that at convergence, the utility achieved by each application is well balanced in a proportionally (or max-min) fair manner     

服务质量约束下的IP组播通信可靠性评估方法

In order to estimate the reliability performance of multicast communication under multiple constraint conditions, the weight of service rate and the reliability index are defined, accompanying the calculation method. Firstly, according to the Quality of Service requirements, the appropriate routings between the central node and target nodes that meet the requirements are calculated using the iterative method in the weighted internet. Then, the disjoint set of network state and the coefficients of weighted service rate are calculated by decomposition and merge methods. Lastly, the formula for calculating the service rate is obtained based on the disjoint set of network state and the calculation of the reliability index will be completed. The simulation result shows that the reliability of multicast communication can be appropriately reflected by the weight of service rate and the calculation method, which can provide the theoretical basis for the reliability evaluation of multicast communication.     

Virtual Topology Design and Reconfiguration of Virtual Private Networks (VPNs) over All-Optical WDM Networks

This paper studies the virtual topology design and reconfiguration problem of virtual private networks (VPNs) over all-optical WDM networks. To support VPN service, a set of lightpaths must be established over the underlying WDM network to meet the VPN traffic demands and this set of lightpaths must also be dynamically reconfigurable in response to changing VPN traffic. To achieve good network performance and meet the service requirements of optical virtual private networks (oVPNs), we formulate the problem as an integer programming problem with multi-objectives and present a general formulation of the problem. In the formulation, we take into account the average propagation delay over a lightpath, the maximum link load, and the reconfiguration cost with objectives to minimize the three metrics simultaneously. The formulated problem is NP-hard and is therefore not practical to have exact solutions. For this reason, we use heuristics to obtain approximate optimal solutions and propose a balanced alternate routing algorithm (BARA) based on a genetic algorithm. To make the problem computationally tractable, we approximately divide BARA into two independent stages: route computing and path routing. At the route computing stage, a set of alternate routes is computed for each pair of source and destination nodes in the physical topology. At the path routing stage, an optimal route is decided from a set of alternative routes for each of the lightpaths between a pair of source and destination nodes. A decision is subject to the constraints and objectives in the formulation. To improve the computational efficiency, we use a genetic algorithm in BARA. Through simulation experiments, we show the effectiveness of BARA and the evolution process of the best solution in a population of solutions produced by the genetic algorithm. We also investigate the impact of the number of alternative routes between each pair of source and destination nodes on the optimized solutions.     

虚拟网的资源管理

随着因特网的迅速发展,各种实时多媒体应用如远程教育、分布式仿真和网络游戏等得到了普通地应用,这些应用对网络系统有服务质量提出了较高的要求。如何通过网络资源的合理分配来满足不同应用之间的服务质量要求,是一个很重要的问题。本文利用虚拟网的概念来实现对网络资源的逻辑映射和统一管理,允许网络服务供应商和大公司客户实现灵活的可配置化管理,同时提高网络资源的复用效率。