Invention Grant
US09331942B2 Apparatus and method for processing alternately configured longest prefix match tables
有权
用于处理交替配置的最长前缀匹配表的装置和方法
- Patent Title: Apparatus and method for processing alternately configured longest prefix match tables
- Patent Title (中): 用于处理交替配置的最长前缀匹配表的装置和方法
-
Application No.: US14194567Application Date: 2014-02-28
-
Publication No.: US09331942B2Publication Date: 2016-05-03
- Inventor: Weihuang Wang , Mohan Balan , Nimalan Siva , Zubin Shah
- Applicant: Xpliant, Inc.
- Applicant Address: US CA San Jose
- Assignee: Xpliant, Inc.
- Current Assignee: Xpliant, Inc.
- Current Assignee Address: US CA San Jose
- Agency: Cooley LLP
- Main IPC: H04L12/28
- IPC: H04L12/28 ; H04L12/745 ; H04L12/753

Abstract:
A network switch includes a memory configurable to store alternate table representations of an individual trie in a hierarchy of tries. A prefix table processor accesses in parallel, using an input network address, the alternate table representations of the individual trie and searches for a longest prefix match in each alternate table representation to obtain local prefix matches. The longest prefix match from the local prefix matches is selected. The longest prefix match has an associated next hop index base address and offset value. A next hop index processor accesses a next hop index table in the memory utilizing the next hop index base address and offset value to obtain a next hop table pointer. A next hop processor accesses a next hop table in the memory using the next hop table pointer to obtain a destination network address.
Public/Granted literature
- US20140269723A1 Apparatus and Method for Processing Alternately Configured Longest Prefix Match Tables Public/Granted day:2014-09-18
Information query