CN103001878B - The determination method and device of MAC Address hash-collision - Google Patents
The determination method and device of MAC Address hash-collision Download PDFInfo
- Publication number
- CN103001878B CN103001878B CN201210485348.5A CN201210485348A CN103001878B CN 103001878 B CN103001878 B CN 103001878B CN 201210485348 A CN201210485348 A CN 201210485348A CN 103001878 B CN103001878 B CN 103001878B
- Authority
- CN
- China
- Prior art keywords
- hash
- collision
- mac
- key assignments
- present
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Abstract
The invention provides a kind of determination method and device of media access control (MAC) Address-Hash conflict, wherein, this method includes：N times Hash is done to key assignments, obtains N number of cryptographic Hash, N is the integer more than 2；Corresponded respectively using M cryptographic Hash and search M Hash table, obtain M hash table, the M is less than the N；Traversal comparison is carried out using the cryptographic Hash in (N M) individual cryptographic Hash in N number of cryptographic Hash in addition to the M cryptographic Hash and the M hash table, searches and/or learn the MAC Address that hash-collision be present.The embodiment of the present invention effectively reduces the probability of hash-collision, so as to greatly reduce the occupancy to TCAM spaces by doing multiple Hash to key assignments.
Description
Technical field
The present invention relates to field of computer technology, more particularly to a kind of media access control (MAC) Address-Hash conflict
Determine method and device.
Background technology
Hash table (Hash table, also cry hash table) is remembered by the way that key value is mapped to a position in table to access
Record.This mapping function is called hash function, and the array for depositing record is called Hash table.Different keywords is likely to be obtained together
One hash address, i.e. Key1 ≠ Key2, and f (Key1)=f (Key2), this phenomenon claim hash-collision.Hash table lookup method
The advantages of, is to look for quick, and memory space utilization rate is high.Shortcoming is to look for the time and not fixed, and more lookup times that conflict are longer.
MAC (Media Access Control, media access control) address is the mark for identifying LAN node,
It is global unique.MAC Address is 48, is represented with 12 hexadecimal numbers, wherein, first 24 by IEEE (Institute of
Electrical and Electronics Engineers, American Institute of Electrical and Electronics Engineers) distribution, for identifying net
Network equipment vendors, OUI (OrganizationalUnique Identifier, organizing unique identifier) is formed, latter 24 by net
Network equipment vendors voluntarily specify.
In ethernet networks, two layers of forwarding are needed to MAC+VSID (Virtual Switching InstanceDoman, void
Intend exchanging example domains) carry out forwarding lookup and learn to search, because MAC Address has 48, general 16 of VSID, MAC+VSID is common
64, can not possibly be that a list item is distributed in each address in practice, therefore typically realized by Hash table.
Fig. 1 is that a kind of MAC searches flow chart in the prior art, first looks for Hash table, if there is hash-collision, is continued
Search Conflict solving table；Fig. 2 is that another MAC searches flow chart in the prior art, first looks for Conflict solving table, if not
Match somebody with somebody, continue to search for Hash table.Both are Hash table and the sequencing of Conflict solving table search at difference.One successful Hash
Table scheme should go to search Conflict solving table as few as possible, reduce the occupancy to memory where Conflict solving table, conflict
Solution table is generally placed upon in TCAM (Ternary Content Addressable Memory, three-state content addressing memory).
In the prior art, as long as there is hash-collision, list item write-in hash-collision is just solved into table, hash-collision is bigger,
More to TCAM resource occupation, increase TCAM capacity again can be by the restriction that TCAM power consumptions are big and cost is high.
The content of the invention
The embodiments of the invention provide a kind of determination method and device of MAC Address hash-collision, to reduce hash-collision
Probability, and then greatly reduce the occupancy to TCAM spaces.
The embodiments of the invention provide a kind of determination method of media access control (MAC) Address-Hash conflict, this method
Including：
N times Hash is done to key assignments, obtains N number of cryptographic Hash, N is the integer more than 2；
Corresponded respectively using M cryptographic Hash and search M Hash table, obtain M hash table, the M is less than described
N；
Use (N-M) individual cryptographic Hash in N number of cryptographic Hash in addition to the M cryptographic Hash and the M Hash table
Cryptographic Hash in carries out traversal comparison, searches and/or learn the MAC Address that hash-collision be present.
Preferably, the MAC Address that hash-collision be present of searching includes：
If equal entry after having traveled through be present, MAC table address, MAC table corresponding to lookup, with the MAC are calculated
Key field in table is compared with the key assignments, if the two is equal, it is determined that with finding the MAC that hash-collision be present
Location.
Preferably, after the key field with the MAC table is compared with the key assignments, in addition to：
If the two is unequal, it is determined that in the absence of the MAC Address of hash-collision.
Preferably, the MAC Address for learning to have hash-collision includes：
If equal entry after having traveled through be present, it is determined that hash-collision be present, Conflict solving is arrived into key assignments study
In table；
If equal entry is not present after having traveled through, the Empty Entry number in the M hash table is calculated, if institute
The Empty Entry number stated in M hash table is zero, then by key assignments study into the Conflict solving table；If the M
Empty Entry number in hash table is not all zero, then searches hash-collision corresponding to the hash table that Empty Entry number is not zero
It is equal to the entry of any cryptographic Hash in described (N-M) individual cryptographic Hash in table with the presence or absence of cryptographic Hash, if it is present by the key assignments
Learn into the Conflict solving table, if it does not exist, then judging whether conflict list item is full in the hash-collision table, if
It is full, then by key assignments study into the Conflict solving table.
Preferably, after whether the list item that judges to conflict in the hash-collision table is full, in addition to：
If less than (N-M) individual cryptographic Hash is write in the hash-collision table by described in, MAC table address is calculated, by this
Key assignments learns into the MAC table.
The embodiment of the present invention additionally provides a kind of determining device of media access control (MAC) Address-Hash conflict, application
In network processing unit, the device includes：
Hash module, for doing n times Hash to key assignments, N number of cryptographic Hash is obtained, N is the integer more than 2；
Searching modul, M Hash table is searched for using M cryptographic Hash to correspond respectively, obtains M hash table,
The M is less than the N；
Processing module, for using (N-M) individual cryptographic Hash in N number of cryptographic Hash in addition to the M cryptographic Hash and
Cryptographic Hash in the M hash table carries out traversal comparison, searches and/or learn the MAC Address that hash-collision be present.
Preferably, the processing module, is specifically used for：If equal entry after having traveled through be present, with calculating MAC table
Location, MAC table corresponding to lookup, with the key field in the MAC table compared with the key assignments, if the two is equal, really
Surely the MAC Address that hash-collision be present is found.
Preferably, the processing module, is additionally operable to：If the two is unequal, it is determined that in the absence of the MAC of hash-collision
Location.
Preferably, the processing module, is specifically used for：
If equal entry after having traveled through be present, it is determined that hash-collision be present, Conflict solving is arrived into key assignments study
In table；
If equal entry is not present after having traveled through, the Empty Entry number in the M hash table is calculated, if institute
The Empty Entry number stated in M hash table is zero, then by key assignments study into the Conflict solving table；If the M
Empty Entry number in hash table is not all zero, then searches hash-collision corresponding to the hash table that Empty Entry number is not zero
It is equal to the entry of any cryptographic Hash in described (N-M) individual cryptographic Hash in table with the presence or absence of cryptographic Hash, if it is present by the key assignments
Learn into the Conflict solving table, if it does not exist, then judging whether conflict list item is full in the hash-collision table, if
It is full, then by key assignments study into the Conflict solving table.
Preferably, the processing module, is additionally operable to：If less than (N-M) individual cryptographic Hash writes the Hash by described in
In collision table, MAC table address is calculated, by key assignments study into the MAC table.
The embodiment of the present invention effectively reduces the probability of hash-collision, so as to greatly reduce by doing multiple Hash to key assignments
To the occupancy in TCAM spaces.
Brief description of the drawings
Fig. 1 is that a kind of MAC of the prior art searches flow chart；
Fig. 2 is that another MAC of the prior art searches flow chart；
Fig. 3 is the schematic diagram of double Hash lookup table embodiments used in the present invention；
Relation schematic diagram between list item when Fig. 4 is the embodiment of the present invention pair Hash lookup；
Fig. 5 is the flow chart of the double Hash lookup processes of the embodiment of the present invention；
Hash-collision schematic diagram when Fig. 6 is mac learning of the embodiment of the present invention；
Fig. 7 is Hash collision table schematic diagram in mac learning of the embodiment of the present invention；
Fig. 8 is the flow chart of mac learning process of the embodiment of the present invention；
Fig. 9 is the structural representation of the determining device of MAC Address hash-collision of the embodiment of the present invention.
Embodiment
For the object, technical solutions and advantages of the present invention are more clearly understood, below in conjunction with accompanying drawing to the present invention
Embodiment be described in detail.It should be noted that in the case where not conflicting, in the embodiment and embodiment in the application
Feature can mutually be combined.
Hash-collision in the embodiment of the present invention is primarily present in following two situations：
1) when MAC is searched, find key value and not yet learn into list item, but and learnt to generate Kazakhstan into the key assignments of list item
Uncommon conflict, finds same MAC table list item, therefore, it is desirable to compared with finding key value with Compare fields in table result,
Judge whether it is the corresponding list item that finds key value；
2) hash-collision during mac learning.
For above two hash-collision, the embodiments of the invention provide a kind of media access control (MAC) Address-Hash
The determination method of conflict, this method include：
N times Hash is done to key assignments, obtains N number of cryptographic Hash, N is the integer more than 2；
Corresponded respectively using M cryptographic Hash and search M Hash table, obtain M hash table, the M is less than described
N；
Use (N-M) individual cryptographic Hash in N number of cryptographic Hash in addition to the M cryptographic Hash and the M Hash table
Cryptographic Hash in carries out traversal comparison, searches and/or learn the MAC Address that hash-collision be present.
Above-mentioned M is preferably N-1, such as N is 3, M 2, and certainly, N can also be 4, M 3, in addition, M can also be 2, etc.
Deng.
Wherein, hash-collision when being searched for MAC, using following processing scheme：
As shown in figure 3, being the schematic diagram of double Hash lookup table embodiments used in the present invention, can be learnt by the figure
The list item definition of double Hash lookup tables：
Hash table is defined as n Hash list item (List), and each Hash List (abbreviation HL) include m Hash entry,
Valid positions represent whether entry is effective, and Hash fields are that the cryptographic Hash after Hash is done to key assignments.
MAC table capacity is n*m list item, and each list item includes two parts, and Compare (abbreviation Comp) field is original key
Value, hash-collision is judged during for searching, this hash-collision Producing reason is：Key assignments during lookup not yet learns to list item
In, but and the key assignments that has learnt into list item generate hash-collision, find same MAC table list item, therefore, it is desirable to looking into
Look for key assignments to be compared with Compare fields in table result, judge whether it is the corresponding list item that finds key value.MAC result (MAC
Result) it is used to deposit MAC forwarding informations.
As shown in figure 4, relation schematic diagram between list item when being double Hash lookup of the embodiment of the present invention, in this embodiment,
Hash three times is done to key assignments, produces three cryptographic Hash：HashA、HashB、HashC；Hash table is searched respectively with HashA, HashB
A, Hash table B, lookup result are Hash entry A, Hash entry B, i.e. Hash List described in Fig. 3；Then HashC and Hash is used
Hash value in List A, Hash ListB compares, if not finding equal entry, then it represents that do not matched in double Hash lookups
To entry；If finding equal entry, MAC table is continued to search for, with the Compare fields in MAC table compared with finding key value,
If equal, expression finds matching entry；If unequal, expression does not find matching entry.
As shown in figure 5, being the flow chart of the double Hash lookup processes of the embodiment of the present invention, the process includes：
Step 101, Hash three times is done to finding key value, obtain three cryptographic Hash：HashA、HashB、HashC；
Step 102, Hash table A, Hash table B are correspondingly searched with HashA, HashB, obtain Hash entry Hash List A
With Hash List B；
Step 103, (first travel through Hash compared with being traveled through with HashC with the hash value in Hash List A, Hash List B
List A, if without occurrence, then travel through Hash List B), if equal entry is not present after having traveled through all entries,
Then represent that double Hash tables do not match entry；
Step 104, if there is equal entry and valid positions 1, address corresponding to record matching list item HashList
For RamAddr, it is index to record and skew corresponding to entry is matched in HashList；
Step 105, calculate MAC table address：RamAddr*m+index, search MAC table；
Step 106, with the Compare fields in MAC table compared with finding key value, if equal, expression find matching
Entry；If unequal, expression does not find matching entry.
Hash-collision when wherein, for mac learning, using following processing scheme：
As shown in fig. 6, hash-collision schematic diagram when being mac learning of the embodiment of the present invention, in the embodiment, Key1 passes through
Hash twice, Hash List j in Hash List i and Hash table B are corresponded in Hash table A respectively；It is idle according to preferential write-in
Hash table this principle more than entry, it is assumed that at this moment Hash table B Hash Listj Empty Entries are more than Hash table A Hash
List i, therefore Key1 write-in Hash tables B Hash Listj；
When learning Key2, Hash twice is done to Key2, is corresponded to respectively in Hash table A in Hash List i and Hash table B
Hash List k, i.e. Key2 and Key1 HashA values are identical, generate hash-collision；Assuming that at this moment Hash table A Hash
List i Empty Entries are more than Hash table B Hash List k, therefore Key2 write-in Hash tables A Hash List i, at this moment
If Key2 and Key1 HashC values are identical, hash-collision is generated, because Key1 write-in Hash tables A Hash List i,
Key1 can match this entry in Hash table A Hash List i, cause error hiding when searching.
Condition existing for this hash-collision is：Key1 and Key2 HashA, HashB has one to produce hash-collision (ratio
Such as the HashA in Fig. 6), the key assignments added afterwards will write produce hash-collision Hash table in (such as Fig. 6 show in Hash table
A), and HashC produces hash-collision.
In order to solve this hash-collision, a hash-collision table is defined.
As shown in fig. 7, being Hash collision table schematic diagram in mac learning of the embodiment of the present invention, hash-collision table is defined as n
Conflict list item (Collision List, CL), and each Collision List list items include k Hash entry, and (hash-collision is deep
Spend for k), valid positions represent whether entry is effective.
As shown in figure 8, being the flow chart of mac learning process of the embodiment of the present invention, the process includes：
Step 201, Hash three times is done to key assignments, obtain three cryptographic Hash：HashA、HashB、HashC；
Step 202, with HashA, HashB Hash table A, Hash table B are searched, obtain Hash List A, Hash List B；
Step 203, (first travel through Hash compared with being traveled through with HashC with the hash value in Hash List A, Hash List B
List A, if without occurrence, then travel through Hash List B).If occurrence, and there is Hash in valid positions 1, expression
Conflict, Conflict solving table is arrived into key assignments study；
Step 204, if there is no equal entry, calculate idle bar in Hash table A and Hash table B list items HashList
Mesh number, the hash table address recorded more than Empty Entry number is RamAddr, and another hash table address is designated as RamAddrOther；
If Empty Entry is not present in Hash table A and Hash table B list items HashList, Conflict solving table is arrived into key assignments study；
If step 205, Hash table A or Hash table B list items HashList have Empty Entry, hash-collision table is searched
(Collision Table, CT), in traversal conflict list item (Collision List) with the presence or absence of hash values equal to HashC and
Valid=1 entry, if it does, key assignments study is arrived into Conflict solving table；
If hash values etc. are not present in step 206, hash-collision table (CollisionTable) Collision List
In HashC and valid=1 entry, judge whether Collision List are full, if CollisionList is full, by this
Conflict solving table is arrived in key assignments study；
If step 207, Collision List by HashC less than writing Hash table；Writing address is RamAddr+
index；
HashTable [RamAddr] [index] .hash=HashC
HashTable [RamAddr] [index] .valid=1
If step 208, Collision List are less than writing hash-collision table by HashC, learn for new key assignments
When judge conflict；Writing address is RamAddrOther+index；
CollisionTabel [RamAddrOther] [index] .hash=HashC
CollisionTabel [RamAddrOther] [index] .valid=1
Step 209, by the key assignments study arrive MAC table, writing address RamAddr*m+index.
The embodiment of the present invention effectively reduces the probability of hash-collision, so as to greatly reduce by doing multiple Hash to key assignments
To the occupancy in TCAM spaces.
As shown in figure 9, be the structural representation of the determining device of MAC Address hash-collision of the embodiment of the present invention, the determination
Device is applied in network processing unit, and the device includes hash module 11, searching modul 12 and processing module 13, wherein：
Hash module, for doing n times Hash to key assignments, N number of cryptographic Hash is obtained, N is the integer more than 2；
Searching modul, M Hash table is searched for using M cryptographic Hash to correspond respectively, obtains M hash table,
The M is less than the N；
Processing module, for using (N-M) individual cryptographic Hash in N number of cryptographic Hash in addition to the M cryptographic Hash and
Cryptographic Hash in the M hash table carries out traversal comparison, searches and/or learn the MAC Address that hash-collision be present.
Wherein, the processing module, is specifically used for：If equal entry after having traveled through be present, with calculating MAC table
Location, MAC table corresponding to lookup, with the key field in the MAC table compared with the key assignments, if the two is equal, really
Surely the MAC Address that hash-collision be present is found.In addition, the processing module, is additionally operable to：If the two is unequal, it is determined that no
The MAC Address of hash-collision be present.Concrete processing procedure can be found in Fig. 5.
Similarly, the processing module, is specifically used for：If equal entry after having traveled through be present, it is determined that Kazakhstan be present
Uncommon conflict, by key assignments study into Conflict solving table；If equal entry is not present after having traveled through, the M are calculated
Empty Entry number in hash table, if the Empty Entry number in the M hash table is zero, key assignments study is arrived
In the Conflict solving table；If the Empty Entry number in the M hash table is not all zero, searching Empty Entry number is not
It is equal to any cryptographic Hash in described (N-M) individual cryptographic Hash with the presence or absence of cryptographic Hash in hash-collision table corresponding to zero hash table
Entry, if it is present by the key assignments study into the Conflict solving table, if it does not exist, then judging the hash-collision
Whether the list item that conflicts in table is full, if full, by key assignments study into the Conflict solving table.In addition, the processing
Module, it is additionally operable to：If less than, (N-M) individual cryptographic Hash is write in the hash-collision table by described in, calculates MAC table address,
By key assignments study into the MAC table.Concrete processing procedure can be found in Fig. 8.
Above-mentioned determining device can effectively reduce the probability of hash-collision by doing multiple Hash to key assignments, so as to subtract significantly
Few occupancy to TCAM spaces.
One of ordinary skill in the art will appreciate that all or part of step in the above method can be instructed by program
Related hardware is completed, and said procedure can be stored in computer-readable recording medium, such as read-only storage, disk or CD
Deng.Alternatively, all or part of step of above-described embodiment can also be realized using one or more integrated circuits.Accordingly
Ground, each module/unit in above-described embodiment can be realized in the form of hardware, can also use the shape of software function module
Formula is realized.The present invention is not restricted to the combination of the hardware and software of any particular form.
The above embodiments are merely illustrative of the technical solutions of the present invention and it is unrestricted, reference only to preferred embodiment to this hair
It is bright to be described in detail.It will be understood by those within the art that technical scheme can be modified
Or equivalent substitution, without departing from the spirit and scope of technical solution of the present invention, the claim model in the present invention all should be covered
Among enclosing.
Claims (8)
- A kind of 1. determination method of MAC address hash-collision, it is characterised in that this method includes：N times Hash is done to key assignments, obtains N number of cryptographic Hash, N is the integer more than 2；Corresponded respectively using M cryptographic Hash and search M Hash table, obtain M hash table, the M is less than the N；Using in N-M cryptographic Hash in N number of cryptographic Hash in addition to the M cryptographic Hash and the M hash table Cryptographic Hash carries out traversal comparison, searches and learn the MAC Address that hash-collision be present；Wherein, M is N-1 integer；The MAC Address for learning to have hash-collision includes：If equal entry after having traveled through be present, it is determined that hash-collision be present, by key assignments study into Conflict solving table；If equal entry is not present after having traveled through, the Empty Entry number in the M hash table is calculated, if the M Empty Entry number in individual hash table is zero, then by key assignments study into the Conflict solving table；If the M Hash Empty Entry number in list item is not all zero, then searches in hash-collision table corresponding to the hash table that Empty Entry number is not zero It is equal to the entry of any cryptographic Hash in the N-M cryptographic Hash with the presence or absence of cryptographic Hash, if it is present key assignments study is arrived In the Conflict solving table, if it does not exist, then judge whether conflict list item is full in the hash-collision table, if full, By key assignments study into the Conflict solving table.
- 2. according to the method for claim 1, it is characterised in that：The MAC Address that hash-collision be present of searching includes：If equal entry after having traveled through be present, MAC table address, MAC table corresponding to lookup, with the MAC table are calculated Key field compared with the key assignments, if the two is equal, it is determined that find the MAC Address that hash-collision be present.
- 3. according to the method for claim 2, it is characterised in that：After the key field with the MAC table is compared with the key assignments, in addition to：If the two is unequal, it is determined that in the absence of the MAC Address of hash-collision.
- 4. according to the method for claim 1, it is characterised in that：After whether the list item that judges to conflict in the hash-collision table is full, in addition to：If less than the N-M cryptographic Hash is write in the hash-collision table, MAC table address is calculated, by the key assignments Practise in the MAC table.
- 5. a kind of determining device of MAC address hash-collision, it is characterised in that applied to network processing unit In, the device includes：Hash module, for doing n times Hash to key assignments, N number of cryptographic Hash is obtained, N is the integer more than 2；Searching modul, M Hash table is searched for using M cryptographic Hash to correspond respectively, obtains M hash table, the M Less than the N；Processing module, for using N-M cryptographic Hash in N number of cryptographic Hash in addition to the M cryptographic Hash and the M Cryptographic Hash in hash table carries out traversal comparison, searches and learn the MAC Address that hash-collision be present；Wherein, M is N-1 integer；The processing module, is specifically used for：If equal entry after having traveled through be present, it is determined that hash-collision be present, by key assignments study into Conflict solving table；If equal entry is not present after having traveled through, the Empty Entry number in the M hash table is calculated, if the M Empty Entry number in individual hash table is zero, then by key assignments study into the Conflict solving table；If the M Hash Empty Entry number in list item is not all zero, then searches in hash-collision table corresponding to the hash table that Empty Entry number is not zero It is equal to the entry of any cryptographic Hash in the N-M cryptographic Hash with the presence or absence of cryptographic Hash, if it is present key assignments study is arrived In the Conflict solving table, if it does not exist, then judge whether conflict list item is full in the hash-collision table, if full, By key assignments study into the Conflict solving table.
- 6. device according to claim 5, it is characterised in that：The processing module, is specifically used for：If equal entry after having traveled through be present, MAC table address is calculated, is searched corresponding MAC table, with the key field in the MAC table compared with the key assignments, if the two is equal, it is determined that find presence The MAC Address of hash-collision.
- 7. device according to claim 6, it is characterised in that：The processing module, is additionally operable to：If the two is unequal, it is determined that in the absence of the MAC Address of hash-collision.
- 8. device according to claim 5, it is characterised in that：The processing module, is additionally operable to：If less than the N-M cryptographic Hash is write in the hash-collision table, calculated MAC table address, by key assignments study into the MAC table.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210485348.5A CN103001878B (en) | 2012-11-26 | 2012-11-26 | The determination method and device of MAC Address hash-collision |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210485348.5A CN103001878B (en) | 2012-11-26 | 2012-11-26 | The determination method and device of MAC Address hash-collision |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103001878A CN103001878A (en) | 2013-03-27 |
| CN103001878B true CN103001878B (en) | 2018-02-16 |
Family
ID=47930031
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201210485348.5A Active CN103001878B (en) | 2012-11-26 | 2012-11-26 | The determination method and device of MAC Address hash-collision |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103001878B (en) |
Families Citing this family (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP5954236B2 (en) * | 2013-03-28 | 2016-07-20 | 日立金属株式会社 | Network relay device |
| CN103581024A (en) * | 2013-11-21 | 2014-02-12 | 盛科网络（苏州）有限公司 | Learning method and device combining MAC address hardware and software |
| CN105700859A (en) * | 2014-11-25 | 2016-06-22 | 中兴通讯股份有限公司 | Network-processor-based hardware table traversal method and apparatus |
| CN105955971B (en) * | 2015-11-30 | 2019-09-17 | 中国银联股份有限公司 | A kind of implementation method and device of key assignments caching |
| CN106095770B (en) * | 2016-05-05 | 2019-10-11 | 邦彦技术股份有限公司 | Data quick searching device, searching method, adding method and deleting method |
| CN108664518B (en) * | 2017-03-31 | 2021-12-07 | 深圳市中兴微电子技术有限公司 | Method and device for realizing table look-up processing |
| CN108848034B (en) * | 2018-07-17 | 2021-04-27 | 新华三技术有限公司 | Network equipment and table entry learning method |
| CN112637379B (en) * | 2020-12-25 | 2022-11-15 | 北京天融信网络安全技术有限公司 | mac address hash operation method, device, equipment and storage medium |
| CN114422478A (en) * | 2021-12-21 | 2022-04-29 | 福建星网智慧科技有限公司 | Method for mapping GEMPORT ID and MAC address and storage device |
| CN115576954B (en) * | 2022-11-24 | 2023-04-07 | 恒生电子股份有限公司 | Hash table determining method and device |
Citations (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6697873B1 (en) * | 1999-12-20 | 2004-02-24 | Zarlink Semiconductor V.N., Inc. | High speed MAC address search engine |
| CN1932818A (en) * | 2006-09-20 | 2007-03-21 | 华为技术有限公司 | Data bank system and method for controlling data bank data |
| CN101140592A (en) * | 2007-09-30 | 2008-03-12 | 华为技术有限公司 | Keywords storing and researching method and apparatus |
| CN101232444A (en) * | 2008-01-22 | 2008-07-30 | 杭州华三通信技术有限公司 | Apparatus and method for solving hash collision and exchange equipment with the same |
| CN101692651A (en) * | 2009-09-27 | 2010-04-07 | 中兴通讯股份有限公司 | Method and device for Hash lookup table |
| CN102073733A (en) * | 2011-01-19 | 2011-05-25 | 中兴通讯股份有限公司 | Method and device for managing Hash table |
| CN102232219A (en) * | 2010-01-26 | 2011-11-02 | 华为技术有限公司 | Method and device for storing and searching keyword |
| CN102346735A (en) * | 2010-07-29 | 2012-02-08 | 高通创锐讯通讯科技(上海)有限公司 | Hash search method capable of reducing hash collision |
| CN102682116A (en) * | 2012-05-14 | 2012-09-19 | 中兴通讯股份有限公司 | Method and device for processing table items based on Hash table |
| CN102710813A (en) * | 2012-06-21 | 2012-10-03 | 杭州华三通信技术有限公司 | MAC address table entry access method and equipment |
| CN102724106A (en) * | 2011-03-30 | 2012-10-10 | 华为技术有限公司 | Learning method for MAC addresses, network side equipment, and system |
-
2012
- 2012-11-26 CN CN201210485348.5A patent/CN103001878B/en active Active
Patent Citations (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6697873B1 (en) * | 1999-12-20 | 2004-02-24 | Zarlink Semiconductor V.N., Inc. | High speed MAC address search engine |
| CN1932818A (en) * | 2006-09-20 | 2007-03-21 | 华为技术有限公司 | Data bank system and method for controlling data bank data |
| CN101140592A (en) * | 2007-09-30 | 2008-03-12 | 华为技术有限公司 | Keywords storing and researching method and apparatus |
| CN101232444A (en) * | 2008-01-22 | 2008-07-30 | 杭州华三通信技术有限公司 | Apparatus and method for solving hash collision and exchange equipment with the same |
| CN101692651A (en) * | 2009-09-27 | 2010-04-07 | 中兴通讯股份有限公司 | Method and device for Hash lookup table |
| CN102232219A (en) * | 2010-01-26 | 2011-11-02 | 华为技术有限公司 | Method and device for storing and searching keyword |
| CN102346735A (en) * | 2010-07-29 | 2012-02-08 | 高通创锐讯通讯科技(上海)有限公司 | Hash search method capable of reducing hash collision |
| CN102073733A (en) * | 2011-01-19 | 2011-05-25 | 中兴通讯股份有限公司 | Method and device for managing Hash table |
| CN102724106A (en) * | 2011-03-30 | 2012-10-10 | 华为技术有限公司 | Learning method for MAC addresses, network side equipment, and system |
| CN102682116A (en) * | 2012-05-14 | 2012-09-19 | 中兴通讯股份有限公司 | Method and device for processing table items based on Hash table |
| CN102710813A (en) * | 2012-06-21 | 2012-10-03 | 杭州华三通信技术有限公司 | MAC address table entry access method and equipment |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103001878A (en) | 2013-03-27 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103001878B (en) | The determination method and device of MAC Address hash-collision | |
| US11102120B2 (en) | Storing keys with variable sizes in a multi-bank database | |
| EP3113036B1 (en) | Data matching method and apparatus and computer storage medium | |
| US9871727B2 (en) | Routing lookup method and device and method for constructing B-tree structure | |
| CN102243660B (en) | A kind of data access method and equipment | |
| US20150227570A1 (en) | Dynamic updates to a semantic database using fine-grain locking | |
| CN109992786B (en) | Semantic sensitive RDF knowledge graph approximate query method | |
| US20140188885A1 (en) | Utilization and Power Efficient Hashing | |
| US20090132474A1 (en) | Method and Apparatus for Optimizing Queries over Vertically Stored Database | |
| US10318587B1 (en) | Algorithmic TCAM based ternary lookup | |
| US9240959B2 (en) | Method for packet classification and device therefor | |
| WO2016201930A1 (en) | Traffic classification method and device, and storage medium | |
| WO2015043254A1 (en) | Method and apparatus for searching for packet classification rule | |
| Rahman et al. | Efficient computation of subspace skyline over categorical domains | |
| CN110851616A (en) | RDF knowledge graph storage and management method based on domain subgraphs | |
| CN108134739A (en) | A kind of method for searching route and device based on index trie | |
| Bentley | Heuristics for partial-match retrieval data base design | |
| CN106789727B (en) | Message classification method and device | |
| CN104391935B (en) | A kind of implementation method and device of scope lock | |
| CN112148738A (en) | Hash collision processing method and system | |
| CN110866276A (en) | Privacy protection method for data in hybrid cloud environment | |
| Du et al. | Efficient hashing technique based on bloom filter for high-speed network | |
| CN106776366B (en) | Address access method and device | |
| CN109688126A (en) | A kind of data processing method, the network equipment and computer readable storage medium | |
| CN106934033A (en) | A kind of bent plate robot data indexing means and device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |