Virtual router-oriented multi-forwarding table compression and search method and system

Abstract

The invention relates to a virtual router-oriented multi-forwarding table compression and search method and system, and the method comprises the following steps: giving an IP address addr to be searched and a specified virtual router instance number vid, and starting from a root node of a fusion prefix tree, reading a bit of the addr in sequence to determine a next branch; before pointer information of a current entering unit moves to a next node, reading a state number sid stored in the unit, and forming a sid: vid word together with the vid; then entering a double-array dictionary tree (DAT) to carry out search verification; and if the two migrations in the DAT both exist and are legal, returning the searched next hop information as an alternative, wherein the latest record in the alternative records of the next hop of information is the search result when the search is finished. According to the method, the storage overhead is effectively compressed through efficient cooperation of the fused prefix tree and the DAT, the problem of prefix tree reconstruction during new instance insertion is avoided, and the method has good storage efficiency and expandability.

Description

Technical field [0001] The present invention relates to a storage compression and efficient lookup technique for a virtualized router multi-transfers (FIB) maintenance, in particular to a multi-transgent compression method and system for virtualized routers. Background technique [0002] On the virtualization router platform, scalability is an important challenge that has existed. Scalability is specifically reflected in two aspects: storing scalable and updated scalable. Storage Scalable refers to the number of virtual router instances when storing resource extensions increases at rates of linear or approximate linearity; while updating extensible means multiple FIB updates can efficiently process prefix updates and avoid reconstruction. In order to address the size of the FIB in the Japanese drama, the storage compression technology for the multi-FIB maintenance of the virtualization router is more important. Among them, Triemerging shows a novel and efficient idea that not onl...

AI Technical Summary

Problems solved by technology

[0003] However, although TrieMerging greatly compresses the storage occupancy of Trie tree nodes by introducing prefix bitmaps, because the size of its tree nodes is related to the number of virtual router instances, it will continue to grow linearly with the increase in the number of FIBs

TrieMerging's storage is not very scalable

On the other hand, when a new instance is inserted, the bitmap of the tree node must be expanded, so its tree structure must be reconstructed, and the next hop array (Next Hop Array [NHA]) has similar problems and more disadvantages significantly

Images