Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Method and device for solving Hash collision

A first-in-first-out queue and idle address technology, applied in the field of solving Hash conflicts, can solve problems such as long search time and Hash conflicts, and achieve the effect of solving Hash conflicts, saving bandwidth, and realizing wire-speed forwarding

Inactive Publication Date: 2009-10-14
BEIJING HUAWEI DIGITAL TECH
View PDF4 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0013] In order to solve the problems of Hash conflicts, long search time and no maintenance of conflicting addresses in the prior art, the present invention provides a method and device for solving Hash conflicts

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Method and device for solving Hash collision
  • Method and device for solving Hash collision
  • Method and device for solving Hash collision

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0049] join Figure 4 , a method for adding a linked list, the method includes the following steps:

[0050] Step 101: Perform a hash operation on the information to be stored, look up the hash table according to the operation result, and find the head of the linked list corresponding to the operation result. The hash table here is composed of a linked list head, a pointer and a linked list tail.

[0051] Step 102: judge whether the head of the linked list is empty, if it is empty, execute step 103; otherwise, execute step 104;

[0052] Step 103: Fill the head of the linked list with the operation result of the information to be stored.

[0053] Step 104: Determine whether the content stored in the head of the linked list is the same as the operation result of the information to be stored, if they are the same, go to step 105; otherwise, go to step 106.

[0054] Step 105: Do not process the operation results of the information to be stored.

[0055] Step 106: Determine whe...

Embodiment 2

[0072] see Figure 5 , a method for deleting an entry in a linked list, the method specifically includes:

[0073] Step 201: When there is information to be deleted, perform a hash operation on the information to obtain the operation result, find the corresponding entry in the hash table according to the operation result, and release the entry, that is, the content in the entry delete;

[0074] Step 202: Determine whether there is a pointer pointing to the next entry in the current entry, if yes, execute step 203, otherwise, execute step 204.

[0075] Step 203: Modify the pointer of the previous entry of the current entry to the pointer stored in the current entry, if the current entry is the head of the linked list, put the content of the next entry pointed to by the pointer into the head of the linked list;

[0076] Step 204: delete the pointer of the previous entry of the current entry;

[0077] Step 205: Write the address of the current entry into the write FIFO module ...

Embodiment 3

[0082] see Figure 6 , to the maintenance method of the conflict (idle) address in the Hash table structure, this method applies image 3 The modules in the schematic diagram provided are carried out, and the specific steps are as follows:

[0083] Step 301: Initialize the free address pool, and write the conflicting address into the corresponding offset address.

[0084] In this embodiment, two 16×13bit FIFO reset signals are first pulled high, and the FIFO is reset for 8 time periods, and then pulled low, mainly because the FIFO has certain requirements for the length of the reset signal.

[0085] A preset value is set for the number of conflicting addresses in the read FIFO module and the write FIFO module. The preset value can be set according to experience, and this embodiment takes 4.

[0086] Then send an application to the downstream ZBT (Zero-Bus Turnaround, zero bus delay), and write the 8k conflict addresses into the corresponding offset addresses in sequence. Afte...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

This invention provides one method and device to solve Hash collision in network communication field, wherein the method comprises the following steps: processing Hash computation on memory data information; finding relative list items according to computation results; then storing the information computation results into list and setting index list in Hash list. This invention provides one device to solve Hash collision composed of Hash computation module, judgment module, address requirement module and information memory module and index set module.

Description

technical field [0001] The invention relates to the field of network communication, in particular to a method and device for resolving Hash conflicts. Background technique [0002] In Ethernet, the MAC address often needs to automatically learn the aging technology. Since the MAC address has 48 bits, it is impossible to allocate an entry for each address in the actual use process. Therefore, in specific applications, it is often implemented through the Hash algorithm, that is, according to According to certain rules, the 48-bit MAC address is converted into a low-order address of more than a dozen bits, and then the actual content to be forwarded is stored in the memory corresponding to the low-order address. [0003] The Hash algorithm is a high-speed table lookup algorithm. It establishes the mapping from the keyword set to the Hash index through the Hash function. Under ideal conditions, it can achieve a lookup performance with a complexity of 0(1). The advantages of the...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Patents(China)
IPC IPC(8): H04L12/56H04L29/06
CPCG06F17/30949H04L45/745G06F16/9014
Inventor 叶锦华孙浩张磊
Owner BEIJING HUAWEI DIGITAL TECH
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com