转发表

针对分布式路由器，设计了组播转发表优化分布式存储及组播报文两级转发方案提高性能。

Aiming at distributed router , we design the optimized distributed storage of multicast forwarding table , and two level forwarding project for multicast datagram .

论文详细阐述了交换机转发表、过滤警管、总线模块的设计和实现。

Based on the project , this thesis mainly elaborates the design and implementation of forwarding table , filtering , policing and the bus module of the switch .

在分析原有基于MAC地址转发表算法的基础上，提出一种新的基于生成树协议的拓扑发现算法。

Based on the analysis of the existing algorithm of MAC address forwarding table , it presents a kind of new physical topology discovery algorithm depended on spanning tree protocol .

在激光信令交互阶段，水声网络是多跳式的，通过建立相邻节点位置表和MAC地址转发表，利用三次查表的机制实现信令的中继转发。

The stage of signaling interaction is a multi-hop network based on blue-green laser . A three look-up mechanisms is performed to achieve laser signaling forwarding with the established of both adjacent node table and the MAC address forwarding table .

同时提出：采用多个路由转发表，使用RIO算法管理队列，使用结合优先级的DRR算法进行调度，可以最大限度地保证高QoS要求数据传输的需要

On the other hand , the thesis consider that if the new route method , RIO and priority-based DRR are used at one time in a network , the transmission requirements of data with high QoS demand can be satisfied well

对现有使用ICMP协议、FDB地址转发表进行网络拓扑发现的算法进行分析，提出了一种基于SNMP协议并适合校园网环境的网络层拓扑发现和链路层拓扑发现算法。

Based on the analysis of currently used network topology discovery methods using ICMP protocol and FDB , which stands for Forwarding Database , a SNMP-based topology discovery algorithm is brought up in this paper .

一方面，利用生成树协议STP来进行拓扑发现；另一方面，通过地址转发表信息来辅助确定子网中交换机与共享网段、不可网管交换机之间的连接关系。

On the one hand , the algorithm uses the spanning tree protocol ( STP ) to discover topology ; On the other hand , it determines the connection among the switches , sharing network segment , and non-managerial switches with the FDB .

通过获取交换机上与生成树相关MIB变量的值来找出交换机之间的连接关系，利用交换机端口的地址转发表信息所对应MIB变量值得出终端设备与交换机之间的连接关系；

We conclude the connection among switches by getting the value of MIB variables , which are relative to Spanning Tree . And we can use the Address Forwarding Table information of the switch ports to find the connection among terminal devices and switches .

一次查找仅需3步搜索、转发表无需排序、表项更新快、查找速率高且连续性好，满足IPv4/IPv6双栈核心路由器OC-768（40Gbit/s）端口的线速率转发。

Its lookup speed is high , entry updating completes fast , and lookup continuity was enhanced . It achieves OC-768 ( 40Gbit / s ) ports ' wire-speed forwarding and satisfies IPv4 / IPv6 dual-stack core routers .

实验表明，对128K前缀的真实转发表算法仅约需3.7M字节，平均每次查找仅需约1.1次访存，而且路由更新时间较小。

The experiment demonstrates that it needs less than 3.7 M bytes for the real route tables of 128K prefixes , and averagely it needs only 1.1 memory accesses for each lookup and few memory accesses for each update .

路由模块经过路由计算和优选以后，会下发转发表。

Routing module will produce Forward table after routing calculation and optimization .

本文介绍了一种用于高速路由查找的转发表数据结构。

This paper presents a forwarding table data structure designed for quick routing lookups .

目前，路由模块还没有实现，转发表的维护通过命令行实现。

At present , the routing module has not yet realized , Forward table can be maintained by command .

本课题会实现添加、删除转发表项，以及查找和显示转发表项的功能。

This article will be achieved to add , delete forwarding entries , and search and display functions of forwarding entries .

在路由表查找设计中，我们从新设计了路由转发表结构，简化了路由表的查表流程。

In the design of the routing table lookup we simplify the process of look-up with a new structure of forwarding table .

进而设计了转发表的格式、转发表的更新机制以及从转发到主控的数据驱动报文实现形式。

Especially , the designs of forwarding table , forwarding table update and transferring data-driven message from forwarding engine to main controller are given .

路由表的实现是路由器软件的核心，而硬件转发表的维护则是硬件高速转发的关键。

An implementation of routing table is the core of a router 's software , and maintenance of hardware forwarding table is the key to hardware high-speed forwarding .

突出特点是转发表不需排序、查找速率高、表项更新快、查表连续性好。

Its outstanding advantages include that no entry sorting is needed , lookup speed is high , entry updating completes fast with pipelining , and lookup continuity is enhanced .

算法的主要特点是在交换机地址转发表不完整的情况下，有效地实现正确的拓扑推理。

An important feature of the algorithm is that it can infer the network physical topology correctly on the lack of the integrality of the forwarding database of switches .

根据交换机通用地址转发表信息，提出了一种适应存在共享网段的物理网络拓扑发现算法，证明了该算法的正确性。

In this article , based on the general address forwarding table , a topology discovery algorithm which is adaptable to physical topology with shared segment is defined and the correctness of it is proved .

该方案根据组播树上分支路由器的位置和个数，动态调整组播转发表项中各个接口的格式，进一步减少了转发状态占用的存储空间。

A new forwarding state reduction scheme is proposed , which reduces storage requirement of multicast forwarding state by dynamically modifying the format of each interface in the multicast forwarding table entries according to the location and number of branching points on the multicast tree .

该算法利用邻节点之间的关系，生成邻节点的转发路由表。

The algorithm generated neighboring nodes routing tables by analyzing the neighboring relations .

当大量组播组并存于网络时，数量庞大的转发状态表占用了大量内存资源并且减缓了组播地址查询过程。

When there are large numbers of multicast groups in the network , large forwarding tables induce large memory requirements and slow down the address look-up process .

在该方法中，每个节点维护2跳以内的邻居信息，相互传送转发节点表，由此降低冗余搜索包的产生。

In this scheme , every node maintains neighbor nodes ' information within 2 hops , such as the node ' forwarding tables . By using this scheme , the number of ponderous packets can be reduced .

并且为了提高转发时查表的速度用TCAM作为转发表的存储介质。

In order to increase the speed of looking up table when forwarding packets , TCAM is used as the memory medium of forwarding table .