Most of the Spanning Tree Algorithm(STA) failures occur due to the excessive loss of BPDUs causing the blocked ports to transition to forwarding mode.
大多的生成树算法（STA）失败发生由于过多的丢失BPDU导致阻塞端口转换为转发模式。
The algorithm applies on-demand procedures to dynamically refresh routes and build multicast forwarding group.
算法采用按需路由发现过程，动态更新路由信息和建立多播转发组。
Routing lookup plays a key part of packet forwarding, so fast IP address lookup algorithm is the significant part of high speed packet forwarding.
查找路由表以给出下一跳地址是路由器中分组转发的核心步骤，因此快速的路由查表算法是实现高速分组转发的关键。
This algorithm can be used to drop the priority of the mark to assure forwarding packets in DiffServ network.
该算法能在区分服务环境下对确保传输的分组丢弃优先级进行标记。
At a fixed interval of time the algorithm USES classification information to calculate the load of nodes, and forwards the request in accordance with the forwarding probability within the group.
算法在固定间隔时间点利用分类信息进行节点的负载计算，并且在转发请求时按照组内的转发概率进行转发。
Aiming at this insufficiency, we propose a new physical Network topology discovery algorithm based on address forwarding table.
针对这个不足提出一种改进的基于地址转发表的物理网络拓扑发现算法。
The details of the algorithm are given. Furthermore, the strategy proposed is compared with the basic mobility management strategy and the pointer forwarding strategy.
给出了具体的算法，并对这一策略与基本的移动性管理策略及普通的“指针推进策略”的代价进行对比。
In the Internet, active queue management algorithm provides congestion avoidance and control mechanisms for Internet traffic as an important module in packet-forwarding devices.
主动队列管理算法提供因特网中网络拥塞规避和控制机制，是因特网中分组转发设备的重要功能模块。
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地址转发表算法的基础上，提出一种新的基于生成树协议的拓扑发现算法。
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.
算法的主要特点是在交换机地址转发表不完整的情况下，有效地实现正确的拓扑推理。
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.
算法的主要特点是在交换机地址转发表不完整的情况下，有效地实现正确的拓扑推理。
应用推荐