基于鲁棒性的链路权重规划算法

在IP网络中,链路权重规划是流量工程中的重要问题。为了优化网络流量并实现负载均衡,针对业务量矩阵的不确定性,依据鲁棒性理论提出一个链路权重规划的MIP模型。该模型使用Γ模型描述业务量矩阵的不确定集,通过表示扰动程度的参数Γ实现了对鲁棒性的调节,在此基础上求得不确定集中最差情况下的最优解。实验结果表明,与传统的链路权重规划方法以及新出现的MRC规划模型相比较,该算法可降低最大链路利用率,分别达到了40%和20%。     

基于层间信息路由的多层业务量疏导算法研究

研究在网络资源一定的情况下如何提高网络利用率问题.利用业务量疏导技术,在相同业务量情况下,以最小化网络资源为目标,为了优化网络的性能,提出了一种基于层间信息路由的多层业务量疏导的启发式算法CLIR-MLTG.采用基本权重作为虚链路扩展光路的惩罚权重,使业务尽可能路由对下层资源影响最少的虚链路上,避免了本来不需要在下层保护的光路变得需要在下层被保护.通过仿真实验,结果表明采用上述算法减少了对物理资源的占用,同时运行速度更快,有效解决了大型MPLS over WDM可生存性业务量疏导问题.     

对WDM网络中一种路由算法的改进

路由问题始终是WDM全光网络中的一个核心问题。原有的一些WDM网络动态业务路由算法,在对链路赋权求最短路时,用链路上已使用波长数对链路直接赋权,或者链路权值与链路上已使用波长数成倍数关系。这种策略在一定程度上可以均衡各条链路的使用率,但缺乏对建立连接所用跳数的考虑,特别是在多优先级业务网络中,没有体现对不同优先级业务的区别;同时,链路的权值和已用波长数成线性关系,对“瓶颈”链路的禁用力度不够。新算法对原算法做了改进,将链路的使用率与路由的跳数结合起来对链路进行赋权。新算法可根据业务的属性、优先级别等灵活地调整链路权值,使得连接尽量建立在链路使用率较低,且跳数较少的路由上。     

一种适于业务量工程的动态路由算法

在网络中实施业务量工程非常重要,其目的是使网络中的资源利用更加平衡。据此提出了一种动态路由算法,引入“网络负载平衡度”的概念,用来描述网络中各条链路上的剩余带宽可用率相对于其平均值的偏离程度,并作为实施路由选择的一个关键性指标。仿真结果表明,相对于传统的最短路径优先路由算法,当网络重载工作时,该算法可以增加网络吞吐量,延缓阻塞的发生。     

热备份路由及负载均衡在VLAN中的实现

随着新的应用不断出现业务量的增大,许多企业(政务)网的网络核心部分及主干链路数据流量和处理强度较大,保证关键LAN段可靠性和可用性很重要,应用热备份路由协议(HSRP)和链路聚合技术,实现基于虚拟局域网(VLAN)的热备份路由、负载均衡及干道的链路容错,并提出了相应的实现方案。     

多跳分组无线网路由协议研究

对于多跳分组无线网来说，路由协议非常重要。而传统的主动式路由、按需路由和混合路由由于自身的缺陷，都不能保证多跳分组无线网传输的可靠性。为了适应网络拓扑不断变化的客观环境，提高数据通信的可靠性，提出了一种相邻矩阵路由协议。这种协议根据无线电台本地广播的特点，采用紧凑的相邻矩阵形式来替代通常的距离矢量或链路状态形式描述网络拓扑．大大提高了多跳分组无线网的链路性能。     

移动自组织网络基于极端预测的节能路由算法

在移动自组织网络中,减少移动节点电池能量消耗,延长网络生存时间,是路由协议性能优劣的一个重要指标.针对这一问题,提出了一种基于极端预测的路由算法,根据门限值划分节点稳定域,计算链路有效性,以最大最小路径有效性原则选路.同时,节点根据下一跳节点的位置自动调整发射功率,以达到节能的目的.仿真结果表明该算法与DSR相比能有效...     

一种改进的分簇路由算法

多跳分簇低功耗路由协议(MHLeach,Multi-Hop Low Energy Adaptive Clustering Hierarchy)是一种用于数据汇聚的路由协议,它为传感器节点提供一种自组织、自适应的分簇组网方法。MHLeach将网络分割成若干个小簇,使簇内传感器节点按星型拓扑方式汇聚消息到簇首,而把簇间的簇首连接成具有多个分支的树形网络来组网。为提高MHLeach的可靠传输能力,本文提出基于链路质量估计的能量均衡路由协议ELQECHE,ELQECHE协议讨论链路质量对传输可靠性的影响,它将簇首间的链路质量作为一个重要指标,根据该链路质量来评估网络传输可靠性的高低,最后从邻居中选出传输可靠性较高的簇首作为转发节点。     

三角网格模型的基本群分割

提出一种有效的三角网格模型分割方法。用Dijkstra算法求出三角网格模型上任意给定一个基点到其余顶点的最短路径树;求出该模型对偶图的最大生成树,且对偶图的边与该最短路径树的边不相交;找出该模型上所有既不属于最短路径树也不和最大生成树相交的边,这些边分别与最短路径树组成的最短环集合就是给定基点处的基本群,沿着这些最短环就可以把网格分割成一个拓扑同胚于圆盘的区域。实验结果表明,该分割方法可以快速、有效地实现网格的分割。     

求不相交QoS路由的一种整数线性规划方法

提出求解不相交QoS路由问题的一种整数线性规划方法.首先,利用一个0-1变量集合来表示不相交路由和路由的QoS需求;然后,通过拉格朗日乘子将集合中的复杂约束引入所导出的整数线性规划问题的目标函数中.因为约束系数矩阵是全幺模矩阵,所以这类整数线性规划问题能用单纯形法容易地求解,从而可在求解线性规划问题的迭代过程中求出不相交QoS路由.数值实验结果表明了所提出方法的有效性.     

基于人工免疫的工业认知无线网络路由机制

工业互联网（industrial Internet）已成为第四次工业革命的代表技术.根据工业网络数据传输服务的需求,以及针对工业无线网络拓扑相对稳定、流量规律变化等特点,提出了一种基于人工免疫系统（artificial immune system,简称AIS）的工业认知无线网络路由机制,包含基于链路质量的域内静态路由算法和基于多路径的域间动态路由算法,以实现工业网络的可靠路由.根据人工免疫系统特点,将工业网络的拓扑结构进行区域划分：提出了基于链路质量的域内静态路由算法,采用软硬件结合的方式监视网络链路,并根据移动窗口指数加权平均法计算链路丢包率;提出了基于多路径的域间动态路由算法,根据模式距离对节点的流量周期进行预测,防止节点因流量过大而导致丢包.基于OMNET++仿真平台进行仿真实验,结果表明,所提出的路由机制在应对突发流量时与组合定向地理路由算法相比,丢包率及网络开销分别降低1倍;应对链路失效的情况时与图路由算法相比丢包率降低4倍.     

最小割多路径路由算法

在最小割理论基础上提出了最小割多路径(min-cut multi-path,简称MCMP)路由算法,为流量请求选取少量关键路径,并在这些路径间均衡流量,在获得方法易实现性的同时能够有效地控制网络瓶颈链路拥塞通过实际流量数据在北美和欧洲骨干网络中的实验,对比常用的OSPF(open shortest path first)路由算法和模型中的多路径路由算法,MCMP路由算法可降低拥塞链路负载分别达到41％和20％以上.     

无线Mesh网中QoS流量均衡策略研究

由于现有的无线Mesh网路由研究多寻求当前时刻的最优路径,缺少流量均衡机制,影响了网络资源的使用效益。针对这一问题,提出基于QoS的流量均衡策略。通过研究蚁群算法,重新定义启发信息和信息素更新规则,将节点和链路负载加入到路径选择的权衡因素中;同时,考虑到Mesh节点到骨干网的通信,提出针对网关节点的流量均衡机制。改进算法以业务QoS要求作为约束条件,使路径规划倾向于负载度低的链路和节点,为后续业务的路由选择提供良好的网络环境。实验结果表明,随着数据量的增多,该算法始终可以保证业务QoS,实现了严格的QoS约束,并且能有效提高链路利用率,在路由质量方面优于中心节点法和改进信息素法。     

Energy-aware traffic engineering: A routing-based distributed solution for connection-oriented IP networks

The present paper deals with energy saving in IP networks and proposes a distributed energy-aware traffic engineering solution, named DAISIES, for switching off network links according to traffic variations. DAISIES works in a connection-oriented network, e.g. an IP/MPLS network, and follows a routing-based approach, i.e. it acts on the routing algorithm whilst link switch-off/on are consequence of routing decisions. The basic idea is to re-compute the path of each traffic demand when its requested capacity changes. A specific cost function is used to compute link weights into the shortest path routing algorithm with the goal of keeping unused as many links as possible. The main advantages of DAISIES can be summarized as follows: (i) no changes are required to current routing and signaling protocols, (ii) packet loss is completely avoided, (iii) both traffic decreasing and increasing and changing network conditions are automatically managed, and (iv) link switch-off/on take place transparently to the routing protocol and to other nodes. The performance of the proposed solution is evaluated in terms of energy saving relative to a static network optimized to support the peak traffic. Results show that DAISIES is able to save about 30% of energy in several traffic conditions. Moreover, it is shown that it is possible keeping the additional complexity low and still reaching high energy efficiency.     

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.     

DORA: Efficient Routing for MPLS Traffic Engineering

This paper introduces DORA, a dynamic online routing algorithm for construction of bandwidth guaranteed paths in MPLS-enabled networks. The main objective of DORA is to place paths with reserved bandwidth evenly across the network in order to allow more future paths to be accepted into the network and to balance the traffic load. During path computation, the key operation in DORA is to avoid routing over links that (1) have high potential to be part of any other path, and (2) have low residual bandwidth available. Our simulation results based on unsuccessful path-setup ratio and successful path-reroutes upon link failure, show that DORA offers better performance than some sophisticated algorithms, while at the same time being less computationally expensive.     

一种基于AODV改进的城市车载自组网路由协议研究

针对城市环境下车载自组网的特点及AODV协议广播式路由探测的不足,采用贪婪转发的单播式路由探测和经典AODV协议的广播式路由探测相结合的路由探测方式,并且单播路由探测在选择下一跳转发节点时同时考虑贪婪转发和链路稳定两个因素,减少了广播帧的发送,提高了路由的稳定性。仿真实验表明,改进后AODV协议比经典AODV协议更加适合城市车载自组网。     

基于MPLS流量工程的约束路由的研究

约束路由的使用促进了基于MPLS的流量工程的发展和实现.简单介绍了MPLS流量工程中约束路由的技术框架,提出了在支持Diff-Serv的MPLSTE环境下实施约束路由的一种算法,使得在保证使用有效链路的同时也保证了链路的QoS.     

The Price of Selfish Routing

We study the problem of routing traffic through a congested network. We focus on the simplest caseof a network consisting of m parallel links. We assume a collection of n network users; each user employs a mixed strategy, which is a probability distribution over links, to control the shipping of its own assigned traffic. Given a capacity for each link specifying the rate at which the link processes traffic, the objective is to route traffic so that the maximum (over all links) latency is minimized. We consider both uniform and arbitrary link capacities. How much decrease in global performace is necessary due to the absence of some central authority to regulate network traffic and implement an optimal assignment of traffic to links? We investigate this fundamental question in the context of Nash equilibria for such a system, where each network user selfishly routes its traffic only on those links available to it that minimize its expected latency cost, given the network congestion caused by the other users. We use the Coordination Ratio, originally defined by Koutsoupias and Papadimitriou, as a measure of the cost of lack of coordination among the users; roughly speaking, the Coordination Ratio is the ratio of the expectation of the maximum (over all links) latency in the worst possible Nash equilibrium, over the least possible maximum latency had global regulation been available. Our chief instrument is a set of combinatorial Minimum Expected Latency Cost Equations, one per user, that characterize the Nash equilibria of this system. These are linear equations in the minimum expected latency costs, involving the user traffics, the link capacities, and the routing pattern determined by the mixed strategies. In turn, we solve these equations in the case of fully mixed strategies, where each user assigns its traffic with a strictly positive probability to every link, to derive the firstexistence and uniqueness results for fully mixed Nash equilibria in this setting. Through a thorough analysisand characterization of fully mixed Nash equilibria, we obtain tight upper bounds of no worse than O(ln n/ln ln n) on the Coordination Ratio for (i) the case of uniform capacities and arbitrary traffics and (ii) the case of arbitrary capacities and identical traffics.     

Agent-based load balancing routing for LEO satellite networks

To ensure an intelligent engineering of traffic over entire satellite networks, a distributed routing scheme for low-earth orbit (LEO) satellite networks, agent-based load balancing routing (ALBR), is presented. Two kinds of agents are used. Mobile agents migrate autonomously to explore the path connecting source and destination, to gather inter-satellite link (ISL) cost, identifier and latitude of visited satellites. Meanwhile, stationary agents employ exponential forgetting function to estimate ISL queueing delay, calculate ISL cost using the sum of propagation and queueing delays; evaluate path cost considering satellite geographical position as well as ISL cost, finally update routing items. Through simulations on a Courier-like system, the proposed scheme is shown to achieve better load balancing, and can especially decrease packet loss ratio efficiently, guarantee better throughput and end-to-end delay bound in case of high traffic load. Furthermore, results from the implementation complexity analysis demonstrate that with the aid of agent technology, ALBR has lower on-board computation, storage, signaling requirements than other on-board routing schemes.