This paper introduces a method for high speed IP multicast routing lookup.
介绍了一种实现组播路由快速查找的方法。
Routing lookup plays a key part of packet forwarding, so fast IP address lookup algorithm is the significant part of high speed packet forwarding.
查找路由表以给出下一跳地址是路由器中分组转发的核心步骤，因此快速的路由查表算法是实现高速分组转发的关键。
Based on their configurable property, this paper proposes two-step routing lookup algorithms based on TCAM, which reduces the consumption efficiently.
根据TCAM的可配置特性，提出了基于TCAM的二级路由查找，大大降低了TCAM的功耗。
The focus is put on the analytical comparison of routing lookup performance between RILS and the traditional IP networks and the simulation-based comparison of their scalability.
着重分析了RILS和传统IP网络的路由查找性能，并采用仿真对它们的可扩展性进行了比较。
You might also choose to externalize the routing using an endpoint lookup primitive.
您还可能通过一个端点查找原语来具体化路由。
The DatabaseRoute node is used primarily to perform routing decisions based on information it has sourced from a database lookup.
DatabaseRoute节点主要用于根据它从数据库查询中得到的信息执行路由决策。
Describe basic routing concepts (including: packet forwarding, router lookup process).
描述路由的基本改概念(包括IP数据包转发，路由查询)。
IP routing table lookup is a major bottleneck for high performance routers application.
IP路由表查找是实现高性能路由器的主要瓶颈。
A method for organization and lookup of routing table.
路由表的组织和查找方法。
It will speed up the lookup process and reduce the service delay with the expressed routing table and power sorting multicast algorithm.
通过构建加速路由表，加快发现服务的速度，降低消息转发的延时，并通过幂次序组播算法改善对超级点的依赖性。
The features of this routing structure are:(1) Combining tree and flow structure, which not only can lookup fast, but also can adapt to the dynamic node join or leave;
该路由结构的特点是：（1）结合了树结构和流结构，使该路由结构不仅能够快速查找，而且还能够适应动态的节点加入或离开；
It adopts DHT-based approach, but solves the problem of long latency and inefficient routing of lookup messages.
它基于DHT方法但是解决了其延时长和效率低等问题。
It adopts DHT-based approach, but solves the problem of long latency and inefficient routing of lookup messages.
它基于DHT方法但是解决了其延时长和效率低等问题。
应用推荐