使用MSTP实现冗余备份负载均衡的组网方案

随着计算机网络的普及以及国家信息化的推进,各个企事业单位和个人对计算机网络通信的需求与依赖越来越深入。很多重要的数据、资源和业务都通过网络来完成。本文通过分析和比较几种常用的生成树协议,介绍了在企业网络组建中使用多生成树协议MSTP,即提供了链路的冗余备份,又实现了负载均衡,使之合理最大化利用网络资源的网络规划方案。     

利用VRRP和MSTP技术提升企业网络可靠性设计

文章提出了一种利用VRRP和MSTP技术支持企业网络核心设备冗余备份和负载均衡的设计方案,从而提升网络的稳定性和可靠性,为用户提供良好的上网体验。     

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

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

基于流分类的数据中心网络负载均衡机制

为充分利用数据中心网络的多路径带宽,现有研究多采用基于链路感知的负载均衡算法,在动态获取全局链路拥塞信息后选取最优路径对流量进行转发.然而这些研究未考虑数据中心网络流量大小分布不均匀的特性,难以在选路成本和转发效率上取得平衡.为此,设计一种基于流分类的数据中心网络负载均衡机制(ULFC,Utilization-aware Load balancing based on Flow Classification),在实现拥塞感知的基础上进行流量特征分析,采用不同的策略为大、小流分配路径,实现网络流量特征与选路方法优势的最佳匹配.实验结果表明,相比于现有方案,ULFC的平均流处理效率提高了1.3倍至1.6倍,路由成本降低了50％以上.     

基于链路共享度的网络编码多播路由算法

针对网络编码中最小编码子图的构造问题,提出了一种基于链路共享度的网络编码多播路由算法.该算法利用各条链路的共享度不同,依次选择共享度最大的链路加入到多播传输路径中.实验仿真结果表明,该算法与传统的最短路径多播树算法相比,可节省网络资源约6%～15%,能更好地均衡网络负载,结合随机网络编码算法,能够有效提升多播传输的性能...     

SSTP——对MSTP扩展的一种协议的实现

随着城域网的发展,MSTP被广泛应用,但是MSTP需要人工配置MST域,使得网络不具备良好的可扩展性,SSTP可以很好地弥补MSTP这方面的缺陷。SSTP通过改进MSTP报文格式,减少网桥之间发送配置/TCN报文(Config/TCNBPDU)的频率,让网络更快地收敛。同时提供了数据转发的多个冗余路径,在数据转发过程中实现VLAN数据的负载均衡,能够用于城域网或者更大型的网络中。而且兼容STP、RSTP和MSTP,目前所有以太网交换机都在遵循STP,所以SSTP有很广阔的应用价值。     

基于拓扑聚集的多级选路策略

本文介绍了一种用于ＡＴＭ网络的基于拓扑聚集的多级选路策略,该选路策略应用一种基于生成树的拓扑聚集方法对拓扑信息进行了压缩。进行分析,得到了该选路策略的路由质量的上限。     

基于下一跳可用带宽和链路利用率的路径选择算法

路径选择算法的优劣直接影响着网络性能。基于最大可用带宽选路的ESG算法在下一跳链路带宽不同时,存在次优选路决策问题。本文提出一种ESG的改进算法——IESG,该算法将下一跳链路的可用带宽和链路利用率统一考虑,生成反映下一跳链路传输能力的链路传输能力因子,以其作为路径选择决策的依据。仿真结果表明,IESG算法克服ESG算法的不足,具有较高的选路成功概率且执行复杂度相当。     

Ad Hoc网络负载均衡路由协议研究

网络负载是影响Ad Hoc网络性能的重要因素,网络负荷比较重时,局部的拥塞将导致网络性能的下降,分析研究现有负载均衡路由协议,并利用链路层信息,结合原Ad Hoc路由协议AODV提出了一种跨层负载均衡的路由协议方案,在选路过程中引入负载均衡机制,均衡网络流量,以提高网络时延、分组到达率等性能.最后用NS2软件仿真证明了改进路由算法的优越性.     

针对MPLS网络流量工程的链路关键性路由算法

该文针对多协议标签交换(MPLS)网络流量工程提出了一种链路关键性路由算法(LCRA),该算法通过定义链路的平均期望负载来确定链路的关键性,进而映射为链路的权值来决定路由的选择。该算法的目的是使网络快捷地建立尽可能多的有带宽保证的路由,并且使这些路由均衡通过网络,实现网络负载均衡。与其他算法相比,该算法在路由拒绝率和重路由性能方面有很好的表现,并且路由的建立时间相当快捷。     

Multicast routing, load balancing, and wavelength assignment ontree of rings

There are two steps to establish a multicast connection in WDM networks: routing and wavelength assignment. The shortest path tree (SPT) and minimum spanning tree (MST) are the two widely used multicast routing methods. The SPT method minimizes the delay from the source to every destination along a routing tree, and the MST method is often used to minimize the network cost of the tree. Load balancing is an important objective in multicast routing, which minimizes the maximal link load in the system. The objective of wavelength assignment is to minimize the number of wavelengths used in the system. This paper analyzes the performance of the shortest path tree (SPT) and minimum spanning tree (MST) methods in the tree of ring networks, regarding the performance criteria such as the delay and network cost of the generated routing trees, load balancing, and the number of wavelengths required in the system. We prove that SPT and MST methods can not only produce routing trees with low network costs and short delays, but also have good competitive ratios for the load balancing problem (LBP) and wavelength assignment problem (WAP), respectively     

A bi-criteria minimum spanning tree routing model for MPLS/overlay networks

The MPLS platform enables the implementation of advanced multipath and multicast routing schemes. This work develops and analyses the performance of a new bi-criteria minimum spanning tree model intended for routing broadcast messages in MPLS networks or constructing tree-based overlay networks. The aim of the model is to obtain spanning trees which are compromise solutions with respect to two important traffic engineering metrics: load balancing cost and average delay bound. An exact solution to the formulated bi-criteria optimization problem is presented, which is based on an algorithm that enables the computation of the set of supported non-dominated spanning trees. An application model and a set of experiments on randomly generated Internet type topologies will also be presented. Finally a network performance analysis of the model considering three network performance metrics will be shown.     

SNMP‐based enterprise IP network topology discovery

Precise network topology information is required to perform management activities such as fault detection, root cause analysis, performance monitoring, and load balancing in enterprise networks. To accomplish these management tasks, both network discovery and connectivity information are essential. This paper examines various problems with the existing topology discovery mechanisms and proposes an SNMP‐based approach to discover physical as well as logical topology. We present algorithms for identifying network device types and discovering connectivity among them. The connectivity of end host and management information base (MIB)‐enabled devices with switches and routers is discussed and evaluated. We also present an algorithm for discovering logical topology, such as VLAN and subnet connectivity. Finally, we present a combination of graph and tree layouts, to visualize connectivity information. Copyright © 2010 John Wiley & Sons, Ltd.     

基于非对称有向网络的拓扑抽象算法研究

网络规模的扩大导致了路由可扩展性的下降,因此未来的网络将向着分层多域的层次路由体系结构发展.在层次路由中,每个路由域通过拓扑抽象算法对内部拓扑进行汇聚并广播给外部节点,拓扑抽象算法将直接影响到网络的路由性能.本文提出了一种用于非对称有向网络的新型拓扑抽象算法——SHEF算法,该算法结合了面向源的拓扑抽象方法和最小生成树的概念,基于重边优先的准则对非对称的有向网络进行拓扑抽象和汇聚.仿真结果证明,该算法的权值偏差比传统方法减少了75%,较好地解决了路由信息复杂度和准确性之间的矛盾,具有良好的路由性能.     

基于等概率路由模型的传感器网络负载均衡研究

无线传感器网络的能耗效率与流量负载分布密切相关。论文从微观角度研究了无线传感器网络的负载均衡问题。基于等概率路由模型,分析了拓扑传输结构对于感知数据流量的分流作用。根据分析结果,提出了多对一传输模式下任意节点负载密度的定义和算法。分析了节点的负载密度与传感器网络生命期的关系,进一步论证了在多对一的多跳传感器网络中不能实现完全的负载均衡,但是通过设计合理的拓扑结构可以实现准负载均衡。仿真结果说明,从微观角度得到的节点负载密度可以准确描述无线传感器网络的流量负载分布,由此得到的准负载均衡条件也能实现绝大多数节点的负载均衡。     

智慧协同网络中基于流量矩阵的负载均衡路由机制

智慧协同网络具有能够实时准确测算流量矩阵的特点。将流量矩阵作为约束,对负载均衡路由优化问题进行建模,利用拉格朗日对偶方法,将原问题转化为优化目标易实现的对偶问题。为实现对偶问题优化目标,提出一种基于流量矩阵的负载均衡路由 (TM-LB,traffic matrix based load balancing) 算法,供控制层根据实时网络情况为后续流规划传输路径。利用OMNET++仿真器在NFSnet拓扑结构上进行仿真实验,结果表明TM-LB相比传统路径规划机制能有效避免拥塞,实现负载均衡。最后,搭建原型系统对TM-LB算法的开销进行测试。     

3D-VANET中基于模糊逻辑和Q学习的拓扑感知路由协议

城市三维车载自组网（Three-Dimensional Vehicular Ad-hoc Network,3D-VANET）中往往存在多种道路形式,每种道路网络拓扑变化特点各异,平面路由协议不能根据道路特点动态调整选路策略,不宜直接用于3D-VANET,为此设计了一种基于模糊逻辑和Q学习的拓扑感知路由协议。该协议通过模糊逻辑方法感知网络拓扑变化与网络负载情况动态调整信标间隔,以平衡邻节点信息准确性与控制开销成本。在此基础上,采用Q学习算法对网络建模,根据链路质量以及链路质量变化调整Q学习算法参数,以灵活选择下一跳转发节点,更好适应网络拓扑的频繁变化。仿真结果表明,与对比协议相比,该协议有利于降低控制开销,同时提高包投递率和减少平均端到端时延。     

A Virtual Topology Based Routing Protocol for Multihop Dynamic Wireless Networks

In this paper, a new hierarchical multihop routing algorithm and its performance evaluation is presented for fully dynamic wireless networks. The routing algorithm operates on a virtual topology obtained by partitioning the routing information for mobile terminals and mobile base stations into a hierarchical, distributed database. Based on the virtual topology, each mobile base station stores a fraction of the routing information to balance the complexity of the location-update and the path-finding operations. Mobility of the network entities changes the load distribution and causes processing and memory bottlenecks in some parts of the network. However, since the network routing elements are also mobile, their movement can be used to distribute the load. Thus, new load balancing schemes are intoduced to distribute the routing overhead uniformly among the mobile base stations. The performance of the hierarchical multihop routing algorithm is investigated through simulations. It is shown that the routing protocol can cope with high mobility and deliver packets to the destinations successfully.     

一种无线自组织网络动态路由协议

介绍了一种基于稀疏树的无线自组织网络动态路由协议,该协议采用了稀疏树路径生成算法来减少路由更新的数据量并减少网络链路的冗余,采用增量更新来降低路由协议开销并降低对传输带宽的占用,支持单向信道,采用快速路径查找算法消除网络拓扑动态变化过程中的环路与无穷计数问题。仿真结果显示它具有收敛快,开销小等特性,能够较好地适应窄带无线通信环境的需要。     

Dynamic routing network algorithm of low voltage based on link quality

Power distribution network is a dedicated transmission network for power. If you want to use it as communication network, the network traffic will become very complicated. Low voltage distribution network topology is very complex and quite different in different distribution network; and different load leave or input power line will cause a strong performance of channel variability. It is because of these features of low voltage distribution network that it difficult to networking and the network is easily destroyed. This paper presents a dynamic routing algorithm, based on link quality, to improve the reliability of low voltage distribution networks. The algorithm can eventually form an 8-layer structure of the tree topology, and can achieve network self-healing capabilities when the link is broken. The algorithm is suitable for a variety of network physical topology, and finally be able to form a tree structure, thus effectively improving the reliability and system flexibility of communication network. Through the simulation on NS2, we can see the feasibility and network self-healing of the algorithm.