MPLS网络中基于约束路由机制实现流量工程的研究

传统内部网关协议(IGP)容易造成网络资源使用的不均衡,引起网络拥塞,导致网络性能下降,服务质量无法保证。流量工程是解决这一问题的有力工具,它可以为网络用户提供各种QoS保证,同时提高网络性能、优化网络资源的使用。多协议标签交换(MPLS)为流量工程的实施提供了便利,其核心技术就是基于约束的路由机制。论文对基于约束的路由机制进行了重点论述,为其建立了数学规划模型,并给出了常用的优化算法。     

一种保证时延的关键流路由调整算法

互联网中流量分布的不均衡会导致网络拥塞、网络资源得不到有效利用.而为了负载均衡,现有算法调整路由又会造成新路径过长,服务质量降低.提出了一种路由调整算法LCBA(length-constrained most balanced algorithm),在保证时延的基础上降低网络最大带宽利用率.基于Abilene2 网络拓扑和真实流量的实验结果表明,LCBA 算法能够有效缓解骨干网拥塞,最多可以降低最大带宽利用率近50%.仿真实验结果显示:与现有算法相比,该算法能够同时满足关键流路径长度和最大带宽利用率两方面     

一种改进路由算法的设计与仿真

研究网络资源提高调度效率问题,在网络资源的利用率上,尽量避免数据过大,引起资源不均衡。当网络中接入大量数据,流量变大的时候,数据流量的突变性增大会造成通信链路拥塞,导致网络不能有效调度,网络资源利用率下降的问题。为了解决大量数据接入可能会导致的链路拥塞的问题,提出一种改进的多路径流量分配路由算法,通过提高计算链路在网络中承载的关键性,以链路的关键性为主要指标,把链路关键性和网络剩余容量转化为网络传输成本,以最小化网络传输成本为目标函数来设计解决网络拥塞问题。仿真结果表明,改进后的算法能更有效提高网络的负载均衡性和资源利用率,避免网络拥塞。     

MPLS流量工程提升IP网络QoS性能的研究

MPLS流量工程通过优化IP网络资源的使用以提高网络性能,并通过结合约束路由和面向连接的标记交换路径提供了端到端的QoS保障。该文在总结现有IPQoS主要技术的基础上,进一步论述了MPLS流量工程的主要体系结构和实现机制。并通过实验对比分析了MPLS流量工程相对于传统IGP在优化网络资源和支持显式路由LSP的优势并测试了对IP网络QoS的提升。     

覆盖网络中一种具有全局优化的路由策略

互联网中流量分布不均引起网络资源得不到有效利用、网络拥塞。采用Wardrop均衡作为理论基础,结合多下一跳路由机制,给出了一种基于系统最优的负载均衡路由算法。仿真实验结果表明,该算法能够满足关键路径流长度和网络最大带宽利用率等方面的要求。     

一种面向关键节点的多路径路由算法

提出了一种发现关键节点并分流的多路径路由算法(KNMRA),该算法就传统的有线传输网络会出现的由极个别的区域发生拥塞导致整个网络性能下降的问题,突破了现有的网络路由框架,为网络运行提供了一个全新的路由工作模式。该机制支持多下一跳并行转发,它可以大大改善甚至消除网络传输中的局部拥塞现象,使得网络资源利用趋向均衡。     

一种MPLS流量工程中的动态路由算法

提出了一种MPLS流量工程中新的保证带宽的动态路由算法。传统的算法如SPF(Shortest Path First)算法、WSP算法（Widest Shortest Path）等都没有利用业务分布或入出路由器对（Ingress-Egress Pairs）的信息,可能导致严重的网络资源使用不充分的问题。该方法分两步：①离线路由,基于业务分布和日常统计的静态研究;该阶段能充分利用网络资源,有助于在线路由阶段动态路径的选择及避免拥塞;②根据第①步的结论及实际的网络状态,在线路由。重点针对在线路由提出了一种新的动     

一种用于MPLS流量工程的邻域负载均衡算法

对于传统的路由算法易于导致网络中某些链路由于负载过重而拥塞的问题,提出了一种新算法,称为邻域负载均衡,用于在MPLS网络中实现流量工程的路径选择。通过网络模拟仿真,显示该算法具有减小网络拥塞、提高网络性能的目的。     

MPLS流量工程仿真

在通信网络中,负载不均衡或部分网络失效常常会引起网络拥塞问题,导致业务的服务质量下降.相对于传统的动态路由协议解决此类问题所具有的局限性,MPLS流量工程是解决问题的一种有效途径.在计算机网络仿真平台上,设计了动态路由协议和MPLS流量工程仿真实例,通过运行仿真,获取了它们的网络性能及业务服务质量数据.通过对仿真结果进行比较和分析,可以看出,MPLS流量工程通过更为灵活的方式在多条链路上实现负载分担,可以改进网络资源利用率,当链路或节点失效时,能够提供快速的恢复机制.     

基于主动网络的多路径流量均衡模型研究

现有网络中到达某一目的地址的流量一般集中在最优路径上,这使得网络资源利用不均衡,拥塞不可避免,而传统网络体系结构很难实现流量均衡。利用主动网络节点的协作分布式计算能力给出了一种多路径的流量均衡模型,该模型包括多路径输出流量优化分配、输入带宽优化分配、拥塞抑制等算法,实现了流量与资源的均衡配置。实验证明该模型提高了网络链路的利用率,避免或减少了网络拥塞的发生,整个网络性能得到了提高。     

Traffic Engineering of Management Flows by Link Augmentations on Confluent Trees

Service providers rely on the management systems housed in their Network Operations Centers (NOCs) to remotely operate, monitor and provision their data networks. Lately there has been a tremendous increase in management traffic due to the growing complexity and size of the data networks and the services provisioned on them. Traffic engineering for management flows is essential for the smooth functioning of these networks to avoid congestion, which can result in loss of critical data such as billing records, network alarms, etc. As is the case with most intra-domain routing protocols, the management flows in many of these networks are routed on shortest paths connecting the NOC with the service provider’s POPs (points of presence). This collection of paths thus forms a “confluent” tree rooted at the gateway router connected to the NOC. The links close to the gateway router may form a bottleneck in this tree resulting in congestion. Typically this congestion is alleviated by adding layer two tunnels (virtual links) that offload the traffic from some links of this tree by routing it directly to the gateway router. The traffic engineering problem is then to minimize the number of virtual links needed for alleviating congestion. In this paper we formulate a traffic engineering problem motivated by the above mentioned applications. We show that the general versions of this problem are hard to solve. However, for some simpler cases in which the underlying network is a tree, we design efficient algorithms. In particular, we design fully polynomial-time approximate schemes (FPTAS) for different variants of this problem on trees. We use these algorithms as the basis for designing efficient heuristics for alleviating congestion in general (non-tree) service provider network topologies.     

TMP-TIE:基于流量迁移预测的域间出口选择算法

出口选择算法是域间路由策略的直接体现,并具备流量工程能力。针对可调域间路由出口选择算法引起的大幅流量迁移问题,以控制与转发分离的网络架构为背景,提出了基于流量迁移预测的出口选择算法TMP-TIE。该算法在TIE算法的基础上加入对流量迁移的预测和判定,避免出口变化引起的大幅流量迁移,降低对域间流量传输的影响。通过模拟实验比较了热土豆、TIE和TMP-TIE的性能,实验结果说明,TMP-TIE具有最小的路由敏感性和流量敏感性,能降低故障条件下的网络代价和网络拥塞的概率,有利于实现域间流量工程。     

Fuzzy-based Adaptive Routing Algorithm for Networks-on-Chip

In this paper, we propose two adaptive routing algorithms to alleviate congestion in the network. In the first algorithm, the routing decision is assisted by the number of occupied buffer slots at the corresponding input buffer of the next router and the congestion level of that router. Although this algorithm performs better than the conventional method, DyXY, in some cases the proposed algorithm leads to non-optimal decisions. Fuzzy controllers compensate for ambiguities in the data by giving a level of confidence rather than declaring the data simply true or false. To make a better routing decision, we propose an adaptive routing algorithm based on fuzzy logic for Networks-on-chip where the routing path is determined based on the current condition of the network. The proposed algorithm avoids congestion by distributing traffic over the routers that are less congested or have a spare capacity. The output of the fuzzy controller is the congestion level, so that at each router, the neighboring router with the lowest congestion value is chosen for routing a packet. To evaluate the proposed routing method, we use two multimedia applications and two synthetic traffic profiles. The experimental results show that the fuzzy-based routing scheme improves the performance over the DyXY routing algorithm by up to 25% with a negligible hardware overhead.     

Applications of meta‐heuristics to traffic engineering in IP networks

Intra‐domain routing protocols are based on shortest path first (SPF) routing, where shortest paths are calculated between each pair of nodes (routers) using pre‐assigned link weights, also referred to as link metric. These link weights can be modified by network administrators in accordance with the routing policies of the network operator. The operator's objective is usually to minimize traffic congestion or minimize total routing cost subject to the traffic demands and the protocol constraints. However, determining a link weights combination that best suits the network operator's requirements is a difficult task. This paper provides a survey of meta‐heuristic approaches to traffic engineering, focusing on local search approaches and extensions to the basic problem taking into account changing demands and robustness issues with respect to network failures.     

Balancing buffer utilization in meshes using a "restricted area" concept

Adaptive routing and virtual channels are used to increase routing adaptivity in wormhole-routed two-dimensional meshes. But increasing channel buffer utilization without considering even distribution of the traffic loads tends to cause congestion in the most adaptive routing area. To avoid such traffic congestion, a concept of the restricted area is proposed. The proposed restricted area, defined to be a part of the network where message transmission concentrates, can be located following the region of adaptivity. By properly guiding message routing inside and outside the area, we are able to achieve more balanced buffer utilization and to reduce traffic congestion accordingly. The performance of several routing algorithms with or without using the restricted area is simulated and evaluated under various traffic loads and distribution patterns. The results indicate that routing algorithms with the restricted areas yield constantly larger throughput and smaller latency than routing algorithms without using the concept.     

Bi-LCQ: A low-weight clustering-based Q-learning approach for NoCs

Network congestion has a negative impact on the performance of on-chip networks due to the increased packet latency. Many congestion-aware routing algorithms have been developed to alleviate traffic congestion over the network. In this paper, we propose a congestion-aware routing algorithm based on the Q-learning approach for avoiding congested areas in the network. By using the learning method, local and global congestion information of the network is provided for each switch. This information can be dynamically updated, when a switch receives a packet. However, Q-learning approach suffers from high area overhead in NoCs due to the need for a large routing table in each switch. In order to reduce the area overhead, we also present a clustering approach that decreases the number of routing tables by the factor of 4. Results show that the proposed approach achieves a significant performance improvement over the traditional Q-learning, C-routing, DBAR and Dynamic XY algorithms.     

Price-based congestion control and local channel-link assignment for multi-radio wireless mesh networks

In multi-radio multi-channel wireless mesh networks, engineering the network capacity requires a complex cross-layer design. In this paper, in order to make the complex problem implementable in a distributed manner, we make a decoupling approach that breaks down the entire design space into routing and initial channel assignment, and distributed congestion control and local channel reassignment. We propose a unified priced-based framework for distributed congestion control and localized channel-link assignment algorithms. We demonstrate the convergence of the proposed algorithms with respect to different fairness objectives (i.e., proportional fairness and max–min fairness) via simulation on both grid and random topologies. The proposed algorithms achieve faster convergence with less overhead in the control and forwarding plane than previous multi-path based algorithms.     

Towards low-complexity Internet traffic engineering: The Adaptive Multi-Path algorithm

In this paper, we describe a novel algorithm for dynamic traffic engineering in the Internet called Adaptive Multi-Path routing (AMP). The main objective of AMP is to distribute load within a network domain in a continuous manner by offloading congested links in real-time. The algorithm’s recursive signaling structure represents one of our central contributions, as it restricts information exchange to neighboring nodes while still maintaining global propagation of congestion information. This paper starts with a comprehensive survey of related literature, before we introduce AMP in depth and present our exhaustive performance evaluation which is carried out using full implementations of the algorithm both in packet-level and flow-level simulation environments. The investigated state-of-the-art topologies and traffic models provide a detailed insight into the behavior of AMP in realistic operators’ networks of substantial size and complexity, whereas our results demonstrate both the traffic engineering efficiency and the stability of AMP. Finally, we present important areas of application for AMP in emerging networking architectures and conclude the paper with an outlook on future research.