An Efficient Key Generator for SVRF Series Forwarding Algorithm

With the development of communication technology in recent years, many new industries such as big data and cloud computing have been born, and the scale of the Internet is constantly expanding. The original IPV4 address pool is on the verge of depletion, and a new IPV6 address pool has to be activated, which proves the huge amount of data flow. Multicast is a method that is ideally suited to the transmission of information on a large scale, but it has been unable to achieve the desired forwarding effect on the large-scale Internet due to a number of drawbacks, including difficulties in deployment. Previous researchers have proposed the SVRF series architecture of forwarding algorithms for routers/switches which have proven to be very efficient in carrier-grade networks, but they also suffer from excessive space consumption and long processing times. The architecture proposed in this paper is a front-end component capable of optimizing all SVRF series architectures. The framework operates several prime hash functions to generate an ordered set of prime key values as the key element to build the scalar pair of SVRF series algorithm, combining the distribution law of prime numbers, as well as re-hashing and other theoretical basis to improve the original SVRF architecture may bring hash collision and other problems. The proposed architecture enables less overall space resource consumption, faster operation of forwarding algorithms, and more efficient table lookup and forwarding of forwarding entries throughout the forwarding engine.