用于MPLS流量工程的最小延时和最小干扰路由算法

借鉴最小干扰路由算法(MIRA)的思想,提出一种最小延时和最小干扰路由算法MDMI,以实现用于多协议标签交换(MPLS)流量工程的服务质量(QoS)路由方案。该算法首先选择k条最小时延备选路由,然后通过网络流计算避开关键链路选路。该算法在实现负载均衡、提高网络资源利用效率的同时提供了一种延时控制方式。仿真结果表明,该算法以k倍时间复杂度提升为代价,在满足标签转发路径(LSP)请求和资源利用率方面能达到较好的性能。     

基于MPLS的多类路由选择机制研究

多协议标签交换(MPLS)网络层协议结合了异步交换模式(ATM)的交换技术和IP协议的路由技术,被认为是未来网络的关键协议.在分析了多协议标签交换(MPLS)技术的基础上,重点对基于MPLS的多类路由选择机制做了研究,说明了单路由选择和多类路由选择机制特点,分析了基于MPLS的多类路由选择机制对IP-QoS的影响.     

路由交换原型系统关键技术的研究和实现

探讨了基于多QoS约束的路由交换原型系统及其关键技术的设计和实现。通过分析传统路由交换体系中路由协议和交换机制的局限性,提出支持多QoS约束的QOSPF路由协议,并在此基础上结合多协议标记交换技术,实现了基于多QoS约束的路由交换原型系统,它能为数据流建立满足多QoS约束的标记交换路径,不仅满足了数据流的多QoS需求,并能提高分组交换效率。最后通过实验验证了原型系统的有效性和可行性。     

基于距离矢量的多下一跳路由信息协议

针对传统单下一跳路由协议总是选择最优路径进行路由,容易导致网络拥塞的问题,提出多下一跳路由信息协议。在邻居节点之间交换最优路由信息并构建路由有向图,为节点建立多下一跳路由表,以实现无环并行传输。基于扩展SSFNet的仿真结果表明,该协议可以降低网络拥塞风险。     

基于WAPG动态路由与波长分配的优化算法

多粒度交换能减少交换节点中的交换矩阵规模及复用器和解复用器的数目,很大程度降低了网络成本,但使得光纤网络路由与波长分配问题变得更加复杂.通过分析多粒度光网络交换节点的结构和动态路由与波长分配的特点,定义5种不同的逻辑链路权重标注方法,提出一种基于路径图波带分配的路由与波长分配模型,达到减少波长碎片的目的.模拟结果表明,该方法能有效地减少多粒度光网络中的波长转换数和降低网络成本.     

MPLS-VPN技术及市场

一、什么是MPLS-VPN MPLS-VPN是一种基于MPLS（Multiprotocol Label Switching,多协议标记交换）技术的IP-VPn,是在网络路由和交换设备上应用MPLS技术,简化核心路由器的路由选择方式,利用结合传统路由技术的标记交换实现的IP虚拟专用网络（IP-VPN）,可用来构造宽带的Intranet、Extranet,满足多种灵活的业务需求.     

群组集线器多级多平面自路由交换模型

基于多级多平面交换通用架构,提出一种群组集线器Banyan类多级多平面自路由交换模型。采用单元状态描述分路器、合路器和交换单元,群组集线器下的Banyan类网络描述单个交换平面,比特置换描述级间互连,导向传输描述自路由特性。基于该模型推导多种Banyan类交换网络的导向传输特性和阻塞率迭代算法。对该模型进行仿真实验,结果表明该模型在低负载强度的情况下,时延低于BG-CRRD调度算法,在高负载强度的情况下,其阻塞率高于10–2,导致时延的增加。     

k-匿名隐私保护模型中k值的优化选择算法

k-匿名隐私保护模型中,k取值同时影响着k-匿名表的隐私保护程度和数据质量,因此,如何选择k值以达到隐私保护和数据质量的共赢具有重要意义.在对k取值和隐私保护、数据质量关系分析和证明的基础上,根据不同情况下的k-匿名表隐私泄露概率公式,对满足隐私保护要求的k取值范围进行了分析;根据k-匿名表的数据质量公式对满足数据质量要求的k取值范围进行了分析.根据满足隐私保护和数据质量要求的k取值之间的关系,给出了k值的优化选择算法.     

一类层次环网络的构造及路由算法

讨论了一类层次环网络 HRN的构造方法、拓扑性质和路由策略 .重点讨论了 HRN网络的一个子类 ,即RP(P,k1 ,k2 )网络 ,分析了其拓扑性质 ,并和 2 D Torus,3D Torus,Hypercube和 De Bruijn Graph等拓扑结构进行了分析比较 .结果表明 ,RP(P,k1 ,k2 )网络的拓扑结构简单 ,路由策略方便 ,是一种实用的互联网络 .接着 ,讨论了RP(P,k1 ,k2 )网络上的路由问题 ,给出了点点路由、Broadcast路由、All- to- all路由和置换路由算法 ,前 3个算法分别需要 k2 / 2 k1 / 2 2 ,k2 / 2 k1 / 2 2 ,10× k1 × k2 - 4个时间步 ,置换路由需要 4 min{ k2 ,k1 } (k2 - 1)×(k1 - 1)个路由时间步 .最后 ,提出了两个参数 ,即最优节点分组和最优网络划分 ,用于评价互联网络的效率 ,并据此分析了 RP(P,k1 ,k2 ) ,2 D Torus和 Hypercube网络的性能 .     

MPLS路由机制及其仿真研究

利用多协议标记交换MPLS(Multi-Protocol Label Switch)实施流量工程是一种具有巨大技术优势的新型技术.首先对支持流量工程的路由算法进行了分析和比较,然后对网络仿真器NS2(Network Simulator,version 2)进行扩展,实现MPLS仿真器模型.在此基础上针对不同网络拓扑和路由机制进行仿真实验,根据仿真实验的结果,对MPLS网络性能进行评估.     

一种基于CICQ的动态重路由交换机制

多径路由交换机制能够通过改变到达网络交换节点的流量分布缓解交换系统的端口争用.本文深入探讨了多下一跳交换机制在核心交换网实施的可能性,提出了一种支持动态重路由的交换结构MHRS和支持多下一跳流量均衡的转发表管理结构HMFT.MHRS算法根据交换系统当前拥塞度实施交换系统内部的动态重路由,实现网络流量的实时动态均衡.HMFT对多下一跳交换节点进行QoS度量和区分,从而为不同业务需求提供不同转发路径.理论分析和仿真结果表明:以MHRS和HMFT算法为构件的网络交换系统能够获得良好的时延和吞吐量保障.     

Achieve load balancing with a dynamic re-routing CICQ switching scheme

Multi-path based routing and switching can achieve network-wide load balancing and reduce the port conflicts of switching devices.Motivated by this novel idea,in this paper,through analyzing the feasibility of implementing multi-next-hops in core switching networks comprehensively,we advance a switching scheme called MHRS(multi-next-hop re-routing switch)and a forwarding table management scheme called HMFT(hierarchical multi-stage forwarding table)to support multi-next-hop dynamical re-routing.MHRS implements dynamical re-routing in the switches according its congestion status to achieve real-time load balancing,while HMFT can provide traffic with different forwarding paths based on their QoS requirements.Theoretical analysis and simulation results show that switches equipped with HMFT and MHRS can provide good delay and throughput performance.Besides,they can reduce port conflicts significantly.     

IP Routing table compaction and sampling schemes to enhance TCAM cache performance

Routing table lookup is an important operation in packet forwarding. This operation has a significant influence on the overall performance of the network processors. Routing tables are usually stored in main memory which has a large access time. Consequently, small fast cache memories are used to improve access time. In this paper, we propose a novel routing table compaction scheme to reduce the number of entries in the routing table. The proposed scheme has three versions. This scheme takes advantage of ternary content addressable memory (TCAM) features. Two or more routing entries are compacted into one using don’t care elements in TCAM. A small compacted routing table helps to increase cache hit rate; this in turn provides fast address lookups. We have evaluated this compaction scheme through extensive simulations involving IPv4 and IPv6 routing tables and routing traces. The original routing tables have been compacted over 60% of their original sizes. The average cache hit rate has improved by up to 15% over the original tables. We have also analyzed port errors caused by caching, and developed a new sampling technique to alleviate this problem. The simulations show that sampling is an effective scheme in port error-control without degrading cache performance.     

A real-time traffic control scheme of multiple AGV systems forcollision free minimum time motion: a routing table approach

A two-staged traffic control scheme, in which sets of candidate paths are prepared off-line prior to overall motion planning process, has been widely adopted for motion planning of mobile robots, but relatively little attention has been given to the application of the two-staged scheme to multiple automated guided vehicle systems (MAGVSs). In the paper, a systematic two-staged traffic control scheme is presented to obtain collision-free minimum-time motions of AGVs along loopless paths. The overall structure of the controller is divided into two tandem modules of off-line routing table generator (RTG) and an online traffic controller (OTC). First, an induced network model is established considering the configurational restrictions of guide-paths. With this model and a modified k-shortest path algorithm, RTG finds sets of k candidate paths from each station nodes to all the other station nodes off-line and stores them in the form of routing tables. Each time a dispatch command for an AGV is issued, OTC utilizes these routing tables to generate a collision-free minimum-time motion along a loopless path. Real-time computation is guaranteed in that the time-consuming graph searching process is executed off-line by RTG, and OTC looks for the minimum time motion among the k candidate paths. The traffic control scheme proposed is suitable for practical application in centralized MAGVS with zone blocking technique     

MANET基于状态感知的多协议自适应路由设计

本文提出一种多协议自适应路由设计。该方案的网络中的节点支持多种路由协议,节点通过对网络状态的感知自动选择合适的路由协议进行路由发现和维护。文中对该多协议自适应路由的总体设计思想、网络状态感知机制的设计、路由更改策略与协议切换机制、以及其中多协议的兼容设计进行了详细阐述。仿真结果表明,该方案结合了按需和主动路由的优点,弥补了各自的不足,对网络环境的变化具有较好的适应性。     

针对无标度网络的紧凑路由方法

衡量一种路由算法优劣的两个重要指标是路由表的大小和路径的长度,但这两个方面通常是互相矛盾的.紧凑路由(compact routing)研究旨在设计路由算法在这两个指标上获得优化的平衡(tradeoff).目前,已有许多学者针对任意拓扑的网络提出了普适(universal)的紧凑路由方法(compact routing scheme).但是,真实的网络都具有特定的拓扑,普适的紧凑路由方法并没有利用真实网络呈现的特定拓扑特征,因而在这类网络上未必能取得最优的性能.最近的研究发现,许多真实网络都具有无标度特征和强聚集特征,利用这两类拓扑特征,提出了一种针对这类网络的紧凑路由方法.该路由方法将网络看成是由一个骨干树和一些捷径组成,在任意源节点和目的节点之间路由,使用路径的长度不超过它们的最短路径长度加上一个整数b.路由表大小限制在O(clog2n)比特,其中,b和c是由网络结构决定的参数.实验结果表明,在无标度网络上,b和c可以同时取较小的值.与以往的紧凑路由方法相比,该方法在平均性能上表现更好.     

针对无标度网络的紧凑路由方法

衡量一种路由算法优劣的两个重要指标是路由表的大小和路径的长度,但这两个方面通常是互相矛盾的.紧凑路由(compact routing)研究旨在设计路由算法在这两个指标上获得优化的平衡(tradeoff).目前,已有许多学者针对任意拓扑的网络提出了普适(universal)的紧凑路由方法(compact routing scheme).但是,真实的网络都具有特定的拓扑,普适的紧凑路由方法并没有利用真实网络呈现的特定拓扑特征,因而在这类网络上未必能取得最优的性能.最近的研究发现,许多真实网络都具有无标度特征和强聚集特征,利用这两类拓扑特征,提出了一种针对这类网络的紧凑路由方法.该路由方法将网络看成是由一个骨干树和一些捷径组成,在任意源节点和目的节点之间路由,使用路径的长度不超过它们的最短路径长度加上一个整数b.路由表大小限制在O(clog2n)比特,其中,b和c是由网络结构决定的参数.实验结果表明,在无标度网络上,b和c可以同时取较小的值.与以往的紧凑路由方法相比,该方法在平均性能上表现更好.     

Route manipulation aware Software-Defined Networks for effective routing in SDN controlled MANET by Disney Routing Protocol

In MANET network management, the Software-Defined Networking (SDN) plays a vital role in terms of controller plane and data plane. It is always easy to manage the data communication over the MANET because of logically centralized control on the SDN. Since the dynamic route on MANET, are controls the packets and changes the route between the source to destination alternatively. Hence the maintenance of real-time SDN analysis-based application planes is a crucial process. To maintain the effective MANET communication over the Software-Defined Network, it essential to improve the control and data plane process on the SDN controlled MANET based OpenFlow switching procedure. Nevertheless, SDN allows for route interaction against security threads. In this research article, the four stages were suggested to preserve the security measures in packet-based data transmission that are conceived in MANET. In this article, an SDN controlled MANET based OpenFlow switching scenario for effective security threading is proposed. The major part played by an SDN controlled MANET in bringing about a result of being effective without wasting time and energy on routing. The proposed Distinct Network Yarning (DISNEY) routing protocol for SDN controlled MANET overcomes the congestion communication on MANET routing. To decrease performance degradation, efficient routing is maintained by the route matrix manipulation table. This routing scheme helps to find the optimal routing with a secure and intelligent manner. The proposed result was compared to existing approaches. As a result, the proposed illustration to be improved by routing and data transmission. In comparison to the proposed method achieves a better ratio for packet transmission delay, throughput, and data transmission rate.     

Leaf-TCAM:一种并行IP路由查找方法及性能分析

分析了互联网路由表和路由更新的特征,提出了一种基于叶子节点进行路由表分区的并行IP路由查找方法Leaf-TCAM,分区子表按照流量特征在K个TCAM芯片中进行均衡分布。分析表明,该路由查找方法在引入0.1*(K-1)冗余的前提下具有K-1倍加速因子。该方法无需进行前缀扩展,90%以上的路由前缀无需排序,可以采用随机更新;同时还具有分区均匀、分区溢出代价小等特点,而功耗只有传统单片方案的12%。     

基于索引和压缩的超高速路由查找及更新算法

在下一代核心路由器的研究中．需要在规定的硬件成本和功耗限制下同时实现超高速路由表的查找和更新是目前研究的难点．论文提出了一个全新的超高速路由表查找及更新算法．该算法采用了基于索引和路由表隐式压缩的方案，不仅实现了可以在每一个SRAM的访问延时周期内输出一个路由查找结果．而且能够在两次SRAM的读写访问延时下完成路由更新．该算法功耗小，存储效率高，整个路由表的信息都可存放在容量接近于1M字节的SRAM中．