MPLS网络中保证服务质量的多径路由选择策略

本文提出了一种在多协议标签交换(MPLS, Multiple Protocol Label Switching) 网络中保证服务质量 (QoS,Quality-of-Service) 的多径路由选择策略,其核心思想是引入多路径分散业务量机制,在保证用户服务质量要求的同时达到增加网络呼叫接受率和平衡网络负载的目的.文中着重讨论了用户端对端服务质量要求的多路分解和分配问题,在此基础上提出了多径路由的分支路径选择策略,并研究了策略中的关键参数K对该策略性能的影响.数值结果显示出多路径分散业务量在网络负载均衡方面的重要意义,并且表明用户的要求相对网络资源越高使用多径传输的优势越明显.     

LEO multi-service routing algorithm based on multi-objective decision making

In low earth orbit(LEO) satellite networks,in view of the unbalanced link resource,it's difficult to meet differentiated quality of service(QoS) requirements and easily lead to reduce the efficiency of the whole network.A routing algorithm based on multi-objective decision making was proposed which defined LEO satellite network transmission service as the delay sensitive,sensitive bandwidth and reliability sensitive three categories.It used the eigenvector method to calculate service weights,and used the consistency ratio to determine whether it can be accepted.Based on the multi-objective decision making theory,it combined with the actual state of satellite network nodes and links and the specific requirements of the business,calculating the path that meets the QoS requirements of the service,so as to realize the LEO satellite network multi objective dynamic routing optimization.Established simulation platform based on the iridium network system simulated network delay,the uncertain characteristics like the residual bandwidth and packet error rate,route planning for the randomly generated three classes of business.The simulation results show that,the algorithm not only satisfies the QoS constrain while balancing the traffic load of the satellite link effectively,but also improves the performance on the throughput.     

A hierarchical multilayer QoS routing system with dynamic SLAmanagement

This paper proposes a hierarchical multilayer QoS routing system with dynamic SLA management for large-scale IP networks. Previously, the promising approach to provide QoS in large-scale IP networks using a mixture of DiffServ-based QoS management and MPLS-based traffic engineering has been actively discussed. However, the introduction of QoS exacerbates the already existing scalability problems of the standard IP routing protocols. In order to address this issue, we propose a new scalable routing framework based on hierarchical QoS-aware path computation. We augment the existing OSPF and CR-LDP protocols to support hierarchical QoS routing, QoS aggregation, and QoS reservation in our MPLS-DiffServ-based hierarchical routing network. In order to provide additional flexibility and cost-efficiency, we augment the network with a policy server which is capable of dynamically handling SLAs between the networks and providing load balancing management within the network. We implement a prototype of the proposed framework and study its performance with a virtual network simulator and specially designed QoS routing algorithm simulator. In our simulations, we evaluate both the implementation complexity and algorithms performance; the results demonstrate the efficiency of the framework and its advantages over the existing proposals     

基于动态规划法的无线Mesh网络QoS路由算法和性能评价

该文针对时延敏感的多媒体业务吞吐率和传输可靠性的考虑,在无线Mesh网络中,引入动态规划和跨层设计方法设计QoS路由算法。在假设的网络模型上,提出了一个新的基于MAC层信息的综合凸规划路由准则,以及基于此实现的路由算法CPRMQS,详细给出了利用动态规划法解决路由优化问题的算法流程和样例分析。最后通过仿真验证了该算法的可行性,并给出了基于DSR扩展协议的性能评价,其中包括吞吐率和延时等性能。     

Performance of Adaptive Routing in Wavelength-Routed Networks with Wavelength Conversion Capability

This paper concerns itself with the performance of adaptive routing in wavelength-routed networks with wavelength conversion capability. Exploiting the concept of load balancing, we propose an adaptive weighted-shortest-cost-path (WSCP) routing strategy. The salient feature of WSCP is that it seeks the path that minimizes the resource cost while simultaneously maintaining the traffic load among the links as balanced as possible. In our simulation, we compare the blocking probability, average hops and link utilization of WSCP with traditional shortest-cost-path (SCP) strategy, fixed routing and alternate routing. The numerical results show that WSCP can enhance blocking performance and just lengthen hop distances a little longer. The improvement is more significant in denser networks or with more wavelengths. We also develop an analytical model to estimate blocking performance of WSCP and compare analyses with simulations. Because of the benefit from load balancing, the proposed WSCP strategy can be used as a path selection algorithm in traffic engineering.     

A topology and application‐aware relay path allocation scheme in multipath transport system based on application‐level relay

The ever‐increasing transmission requirements of quality of service (QoS)‐sensitive applications, especially real‐time multimedia applications, can hardly be met by the single path routing protocols. Multipath transmission mechanism is a feasible approach to provide QoS for various applications. On the basis of the general framework of multipath transport system based on application‐level relay, we present a relay path allocation scheme, whose goal is to select suitable relay paths, while balancing the overlay traffic among the different domains and relayers. With the application‐layer traffic optimization service under the standardization within the Internet Engineering Task Force (IETF), the controller has the topology‐aware ability to allocate relay paths with excellent routing performance. To further develop the universality of our method, the controller perceives transmission performance of relay overlay network through relayers' performance detection processes and, thus, has the application‐aware ability to allocate relay paths with excellent transmission performance for different applications by consulting application‐specific transmission metrics. Simulation results demonstrate that the proposed relay path allocation algorithm performs well in allocating superior relay paths and can balance the distribution of overlay traffic across domains in different network situations.     

一种智慧协同网络多参数的多路径路由算法

多路径路由技术采用多条路径同时传输,作为优化资源配置和负载均衡的重要技术,在路由可靠性、QoS路由、传输效率等多方面比单路径传输具有优势.现有互联网网络资源配置和路由机制相对静态和僵化,导致多路径技术的发展存在发展的局限性.现有多路径技术考虑在路由层面不利于多路径路由选择和计算,难以保证传输性能,降低网络传输效率.智慧协同网络能够动态感知网络需求,灵活适配网络资源,更好的支持路由可扩展性.本文在智慧协同网络架构下提出了一种智慧协同网络多参数的多路径路由算法.该算法制定了智慧协同网络多参数的多路径路由协议,对网络性能参数CPU占用率、往返时延(RTT)、带宽进行加权计算得到路径权重值,根据权重值进行流量分配.采用图论理论对网络流量分配及模型进行了分析.并在Mini-Net平台上进行了开发和实验,结果表明,该算法能够优化网络配置,减小往返时延,提高网络吞吐量,从而提高网络性能,实现负载均衡.     

面向确定性网络的按需智能路由技术

确定性网络需要保证不同应用在时延、丢包率、抖动、吞吐量和可靠性等方面的确定性传输需求。针对应用的差异化、确定性的网络传输需求,提出了一种面向确定性网络的按需智能路由学习框架 OdR,在OdR框架下提出一种基于深度强化学习的按需智能路由算法OdR-TD3,OdR-TD3算法可以根据应用流量的确定性QoS需求生成路由策略,以满足确定性网络应用的需求。通过网络仿真实验评估,在确定性应用的QoS需求达成率上,OdR-TD3算法相较DV算法和SPF算法,具有显著的优势。     

一种在MPLS网络中支持QoS的流量工程算法

该文提出了一种改善QoS的队列调谐算法(QueueTuningAlgorithm:QTA),该算法应用于多协议标签交换(MPLS)流量工程。该算法通过把不同类别的业务,如传统的尽力而为(Best-Effort)业务和具有QoS需求的业务,映射到不同队列,然后根据链路的状况以及业务的QoS需求来进行队列调谐。QTA在实现负载均衡的同时又支持业务流的QoS,优化网络资源的利用。仿真表明该算法在MPLS网络中运行良好。     

VoIP traffic in wireless mesh networks: a MOS‐based routing scheme

Support of Voice over Internet Protocol (VoIP) services in wireless mesh networks requires implementation of efficient policies to support low‐delay data delivery. Multipath routing is typically supported in wireless mesh networks at the network level to provide high fault tolerance and load balancing because links in the proximity of the wireless mesh gateways can be very stressed and overloaded, thus causing scarce performance. As a consequence of using multipath solutions, lower delay and higher throughput can be supported also when a given path is broken because of mobility or bad channel conditions, and alternative routes are available. This can be a relevant improvement especially when assuming that real‐time traffic, such as VoIP, travels into the network. In this paper, we address the problem of Quality of Service (QoS) support in wireless mesh networks and propose a multipath routing strategy that exploits the Mean Opinion Score (MOS) metric to select the most suitable paths for supporting VoIP applications and performing adaptive load balancing among the available paths to equalize network traffic. Performance results assess the effectiveness of the proposed approach when compared with other existing methodologies. Copyright © 2015 John Wiley & Sons, Ltd.     

Multipath Cognitive Routing in Integrated Multicast Satellite-HAP System Structures

A new multilayered inter satellite-high altitude platform(HAP)system routing algorithm is proposed,which is mainly based on multipath routing to ensure the network reliability.The proposed multipath routing scheme principally relies on splitting the traffic between different paths to make the best utilization of multiple routes.Linear programming is the main method used for multipath selection.The major constraints to the quality of service(QoS)(delay and link utilization)have been taken into account to meet the criteria of the advanced multimedia applications.Due to the effect of link utilization,the system encounters traffic flow oscillation between paths over time,which affects the system performance.Hence,to fix this issue,we propose a cognitive routing algorithm which reacts to the long-term changes of the traffic loads rather than short-term ones.The performance of the proposed routing techniques has been evaluated using appropriate simulation models and implemented by Matlab.     

Addressing self-similarity in optical switching networks by means of ant colony optimization

In this work, we propose the use of an Ant Colony Optimization (ACO) algorithm to mitigate packet loss in an optical packet switching network that carries self-similar traffic, which is known to have a great impact in the buffer performance in terms of loss probability as exemplified in this work. By adaptively routing the packets and balancing the network load, we demonstrate by some simulations the effectiveness of this approach when compared with a shortest-path routing scheme, achieving a performance that is comparable to the Poisson traffic scenario in some cases. The proposed algorithm can be used as a viable alternative to traffic shaping techniques.     

基于蚁群系统的QoS单播路由算法

针对QoS路由算法中的QoS要求、资源的优化利用和负载均衡3方面问题,对原有的算法模型进行了改进,提出了相应的启发式信息和链路代价计算公式。对基本算法中的步骤进行改进,使算法能准确、迅速地找到全局最优解。实验结果表明,算法能在整网性能,尤其是网络负载均衡方面大幅优化了传统QoS单播路由算法。     

Adaptive load-balancing in WDM mesh networks with performance guarantees

In nowadays, wavelength-division multiplexing (WDM) networks, on the one hand, increasingly more users expect the network to provide high-priority QoS services demanding no congestion and low latency. On the other hand, it is significantly more difficult for network operators to forecast future traffic demands, as the packet traffic running over WDM networks fluctuates over time for a variety of reasons. Confronted with a rough understanding of traffic patterns as well as the increasing number of time-sensitive applications, most networks today are grossly over-provisioned. Thus, designing cost-effective WDM networks in an uncertain traffic environment, which includes network planning and robust routing, is both an important and a challenging task. In this paper, we explore adaptive load-balancing to investigate the problems of network planning and robust routing for WDM mesh networks under varying traffic matrices. We first propose an efficient heuristic algorithm called Maximizing Network Capability (MNC) to provision congestion-free and cost-effective WDM networks based on load-balancing to deal with traffic uncertainty. Then, a novel traffic grooming algorithm called Adding Direct Traffic (ADT) is proposed to implement robust routing with partial traffic information. Finally, we demonstrate by simulation that MNC consumes less resources than previous methods and performs quite close to the optimal solution, while ADT achieves the desirable performance in delay, jitter (delay variation), and throughput compared with existing robust routing and traffic grooming algorithms.     

一种软件定义无线网络负载均衡架构及算法

软件定义网络( SDN)为实现异构无线网络中的负载均衡提供了新的思路。设计了一种软件定义的无线网络负载均衡架构,并提出对应算法。首先,根据接收信号强度构建候选网络列表;其次,根据各候选网络的可用负载比率标准差进行负载差异分级;再次,将服务质量匹配度函数和负载均衡指数线性组合成联合优化函数,并根据负载差异分级对联合优化的权重进行动态调整,合理设置门限进行接纳控制。与传统算法相比,所提算法一方面可使各类业务阻塞率明显降低大约20%,另一方面使不同网络的归一化负载更加接近。该算法在进行网络负载均衡的同时,能够有效降低业务阻塞率,从而有效提升异构无线网络的整体性能。     

一种能量有效的多径Ad Hoc网路由算法

这里研究了一种能满足服务质量(QoS,Quality of Service)需求的能量有效的多路径多速率路由算法EAMM,该算法能结合节点地理位置、延迟时间、丢包率和剩余能量信息,选择符合要求的若干条路径,满足数据传输的可靠性和实时性要求,为不同应用的数据提供不同等级的可靠性和实时性传输质量。仿真结果显示,该算法不仅能保证各等级可靠性和实时性的数据传输,还能均衡网络的能量消耗,延长了网络的生存时间。     

Protection approaches for dynamic traffic in IP/MPLS-over-WDM networks

Due to the explosive growth of data-related traffic driven by the Internet, network reliability becomes an important issue. We investigate various protection approaches to handle failures for dynamic traffic demands in IP/MPLS-over-WDM networks. An LSP can be protected at either the IP/MPLS layer or the optical layer. In IP/MPLS layer protection, an LSP is protected by providing a link-disjoint backup LSP between its end nodes. In optical layer protection, an LSP is protected by the backup lightpath of each lightpath traversed by the LSP. We present two integrated routing algorithms: hop-based integrated routing algorithm and bandwidth-based integrated routing algorithm (BIRA) to set up the restorable bandwidth-guaranteed paths efficiently. Then we present a multilayer protection scheme for multiclass traffic in such networks. This scheme takes into account the different QoS and recovery requirements of the traffic to provide protection capability either at the MPLS layer or at the optical layer in a cost-effective manner. We use the connection blocking probability and number of optical-electrical-optical conversions as performance metrics to compare various protection approaches.     

Domain load balancing routing for multi-gateway wireless mesh networks

As Wireless Mesh Networks (WMNs) are typically used for Internet access, most traffic is routed through the gateways which connect WMN to the wired network. As a result, the gateways tend to get congested and balancing of the traffic load of gateways is critical. In this paper, we consider applications that require continuous provision of a certain bandwidth to a server located at the wired network. If a path that satisfies the bandwidth request cannot be found, the request will be rejected, so that load imbalance will result underutilization of the network capacity. We present a novel load balancing routing algorithm for maximizing the network utilization (i.e., accommodating service requests as many as possible) for multi-gateway WMNs. In the proposed scheme, a WMN is divided into domains. Each domain is served by one gateway, so that all traffic of a domain is served by the corresponding gateway. Our scheme determines routing to balance the traffic load among domains, and then performs load balancing routing within each domain. Simulation results show that in square grid topologies, our intra-domain routing achieves near optimal performance with about 70% less overhead than the existing schemes. Our inter-domain load balancing scheme outperforms the existing heuristics by up to 25% while achieving about 80% performance of the optimal solution.     

Jitter‐minimized reliability‐maximized management of networks

We propose a joint optimization network management framework for quality‐of‐service (QoS) routing with resource allocation. Our joint optimization framework provides a convenient way of maximizing the reliability or minimizing the jitter delay of paths. Data traffic is sensitive to droppage at buffers, while it can tolerate jitter delay. On the other hand, multimedia traffic can tolerate loss but it is very sensitive to jitter delay. Depending on the type of data, our scheme provides a convenient way of selecting the parameters which result in either reliability maximization or jitter minimization. We solve the optimization problem for a GPS network and provide the optimal solutions. We find the values of control parameters which control the type of optimization performed. We use our analytical results in a multi‐objective QoS routing algorithm. Finally, we provide insights into our optimization framework using simulations. Copyright © 2011 John Wiley & Sons, Ltd.     

DraLCD:一种新的数据中心流量工程方法

流量均衡是为了避免网络拥塞而作为流量工程中的路由优化目标提出来的,由于数据中心网络的流量特性,使得传统IP网络的流量工程方法不一定适合.为此,本文在SDN(Software Defined Network)的框架下,提出了一种基于链路关键度的自适应负载均衡流量工程方法:DraLCD(Dynamic Routing Algorithm based on Link Critical Degree).该方法通过对全局视图的网络管控,并充分利用了网络中存在的冗余路径,在完成细粒度流量均衡的同时,能够降低控制器的计算开销以及与交换机之间的通信开销,最终完成路由优化的目标.最后,基于DraLCD设计的原型系统,通过在Mininet仿真平台中部署并进行仿真实验,与现有的等开销多路径路由算法ECMP(Equal-Cost Multi-Path)以及GFF(Global First Fit)路由算法相比较,能够明显地提升网络性能.