A method for reading and writing forwarding information table and network processor

Abstract

Embodiments of the present invention provide a method for reading and writing a forwarding information table and a network processor, which relate to the field of communication technology and can solve the problem that in the prior art, commands sent to Cache cannot return responses sequentially, so that non-leaf nodes and corresponding leaf nodes cannot The problem of route lookup error caused by synchronous modification. The specific scheme is: the network processor receives the write AD request for modifying the AD, and the write Key request for modifying the corresponding Key of the AD. Before the write AD request and the write Key request pass through the buffer, when any When the node area includes the Key, the row address in the write AD request is transformed into the same row address as the row address of the node block where the Key is located. When any node area to be read and written does not include the Key, it is written The row address and the row address in the write Key request are transformed into the same row address in any node area, and then read and write any node area according to the same row address. The embodiment of the present invention is used for reading and writing the forwarding information table.

Description

technical field [0001] The invention relates to the technical field of communication, in particular to a method for reading and writing a forwarding information table and a network processor. Background technique [0002] The Forward Information Base (FIB) is an information table that provides network devices (such as bridges, switches or routers, etc.) in data communication to forward data packets to the destination address, and is stored in the network processor (Network Processor) of the network hardware. , NP), its structural schematic diagram can be found in figure 1 , the FIB table adopts a binary search tree (Binary Search Tree, Btree) structure, and each non-empty node corresponds to a FIB entry. In the Btree structure, the nodes of other layers except the last layer (Branch) nodes can be called non-leaf nodes, which are used to store keywords (Key) such as Internet Protocol (Internet Protocol, IP) addresses, and the nodes of the last layer can be called As a leaf ...

AI Technical Summary

Problems solved by technology

[0007] Embodiments of the present invention provide a method for reading and writing forwarding information tables and a network processor, which can solve the problem that the commands sent to the Cache in the prior art cannot return responses sequentially, so that non-leaf nodes and corresponding leaf nodes cannot be modified synchronously, resulting in The problem of routing lookup error

Images