CN102843298B - Realize the method and system of exchanger chip Openflow stream table priority - Google Patents

Realize the method and system of exchanger chip Openflow stream table priority Download PDF

Info

Publication number
CN102843298B
CN102843298B CN201210335079.4A CN201210335079A CN102843298B CN 102843298 B CN102843298 B CN 102843298B CN 201210335079 A CN201210335079 A CN 201210335079A CN 102843298 B CN102843298 B CN 102843298B
Authority
CN
China
Prior art keywords
priority
value
entry
hash
new
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
Application number
CN201210335079.4A
Other languages
Chinese (zh)
Other versions
CN102843298A (en
Inventor
赵�怡
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Suzhou Centec Communications Co Ltd
Original Assignee
Centec Networks Suzhou Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Centec Networks Suzhou Co Ltd filed Critical Centec Networks Suzhou Co Ltd
Priority to CN201210335079.4A priority Critical patent/CN102843298B/en
Publication of CN102843298A publication Critical patent/CN102843298A/en
Application granted granted Critical
Publication of CN102843298B publication Critical patent/CN102843298B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Landscapes

  • Data Exchanges In Wide-Area Networks (AREA)
  • Telephonic Communication Services (AREA)

Abstract

The invention provides a kind of method and system realizing exchanger chip Openflow stream table priority, its method comprises: set up one and store the Hash table of priority value that some Openflow flow, and correspondingly sets up a sequencing table being carried out from big to small by priority values all in Hash table sorting; Each priority value is corresponding with one group of hash, and each group hash comprises somely shows corresponding entry_id value with ACL, and is stored in by described hash in an entry_id chained list; According to the order of the priority value in described sequencing table, all priority values in described Hash table are reordered; According to the Hash table after sequence, obtain the priority order of described entry_id value, and correspondingly sort according to the ACL table of described priority order to switch.The present invention utilizes the acl feature on the chip of conventional switch, realize the stream table priority feature meeting Openflow agreement, and implementation is simple.

Description

Realize the method and system of exchanger chip Openflow stream table priority
Technical field
The present invention relates to ethernet communication technology, particularly relate to a kind of method and system realizing exchanger chip Openflow stream table priority.
Background technology
Current internet development is rapid, the importance of the huge and status of its application scale, far beyond the imagination of designers, and present the Internet mainly contains following drawback: there is no in specific scope that unified management, forwarded mechanism are single with strategy, operator is difficult to optimize to greatest extent own net and conventional switch for the function that forwards and agreement many and assorted, be difficult to configuration, system such as easily to be made mistakes at the problem.For tackling above-mentioned drawback, there has been proposed Openflow switch, the message repeating in conventional switch and forwarding strategy are separated by it, adopt a special controller (controller) to be connected with switch by netting twine.Original like this message repeating function (hardware chip realization) on a switch device and the message repeating strategy (various software protocol) of coexisting just has been separated on different hardware devices.And a controller can also control multiple stage Openflow switch, thus achieve unified forwarding control end, more effectively control network.
In prior art, realize stream table by access control list (ACL) at large, and specify the priority of stream table by the entry_id of ACL.But, conventional switch chip must user specify a value (entry_id) to represent its sequence of positions (i.e. priority) in TCAM, and this value must be unique, and the priority of Openflow can have identical value, namely be not unique, therefore, adopt the entry_id in conventional switch ACL to specify the technology of the priority of stream cannot meet the protocol requirement of Openflow.
Summary of the invention
The object of the present invention is to provide a kind of method realizing exchanger chip Openflow stream table priority.
Corresponding to said method, another goal of the invention of the present invention is also to provide a kind of system realizing exchanger chip Openflow stream table priority.
For achieving the above object, technical scheme of the present invention is: a kind of method realizing exchanger chip Openflow stream table priority, and it comprises:
S1, set up one and store the Hash table of priority value that some Openflow flow, and correspondingly set up a sequencing table being carried out from big to small by priority values all in Hash table sorting;
S2, each priority value is corresponding with one group of hash, each group hash comprises somely shows corresponding entry_id value with ACL, and wherein, described entry_id value is stored in entry_id chained list;
S3, order according to the priority value in described sequencing table, reorder to all priority values in described Hash table;
S4, according to the Hash table after sequence, obtain the priority order of described entry_id value, and show correspondingly to sort to the ACL of switch according to described priority order.
As a further improvement on the present invention, the method S1 step also comprises: a newly-built priority value Priority_new; Judge whether described priority value Priority_new is present in current Hash table, does not if so, operate; If not, in described Hash table and sequencing table, this priority value Priority_new is inserted respectively.
As a further improvement on the present invention, described step S2 also specifically comprises: for described priority value Priority_new correspondence safeguards one or more entry_id value entry_id_new; Described one or more entry_id value entry_id_new is inserted in the hash corresponding to this priority value Priority_new.
As a further improvement on the present invention, in the step of described " inserting described one or more entry_id value entry_id_new in the hash corresponding to this priority value Priority_new ", described entry_id value entry_id_new is inserted in corresponding hash backmost.
As a further improvement on the present invention, described step S4 also specifically comprises: according to priority order from high to low, reads the entry_id value corresponding with each priority value one by one; The priority order of described entry_id value is obtained according to the reading sequencing of entry_id value.
Correspondingly, a kind of system realizing exchanger chip Openflow stream table priority provided by the invention, it comprises:
Unit set up by soft table, stores for setting up one the Hash table of priority value that some Openflow flow, and correspondingly sets up a sequencing table being carried out from big to small by priority values all in Hash table sorting;
Hash corresponding unit, for each priority value is corresponding with one group of hash, each group hash comprises somely shows corresponding entry_id value with ACL, and wherein, described entry_id value is stored in entry_id chained list;
Hash table sequencing unit, for the order according to the priority value in described sequencing table, reorders to all priority values in described Hash table;
ACL list sorting unit, for according to the Hash table after sequence, obtains the priority order of described entry_id value, and correspondingly sorts according to the ACL table of described priority order to switch.
As a further improvement on the present invention, described soft table sets up unit also for a newly-built priority value Priority_new; Judge whether described priority value Priority_new is present in current Hash table, does not if so, operate; If not, in described Hash table and sequencing table, this priority value Priority_new is inserted respectively.
As a further improvement on the present invention, described hash corresponding unit also for: be that described priority value Priority_new correspondence safeguards one or more entry_id value entry_id_new; Described one or more entry_id value entry_id_new is inserted in the hash corresponding to this priority value Priority_new.
As a further improvement on the present invention, in described hash corresponding unit, described entry_id value entry_id_new is inserted in corresponding hash backmost.
As a further improvement on the present invention, described ACL list sorting unit also specifically for: according to priority order from high to low, read the entry_id value corresponding with each priority value one by one; The priority order of described entry_id value is obtained according to the reading sequencing of entry_id value.
The invention has the beneficial effects as follows: technical scheme of the present invention safeguards Hash table and the sequencing table of the relation of Priority and entry_id by setting up, utilize the acl feature on the chip of conventional switch, realize the stream table priority feature meeting Openflow agreement, and implementation is simple.
Accompanying drawing explanation
Fig. 1 is the flow chart of the method realizing exchanger chip Openflow stream table priority in the specific embodiment of the invention;
Fig. 2 is the schematic diagram of unsorted Hash table in the specific embodiment of the invention, sequencing table and corresponding hash;
Fig. 3 is the schematic diagram of ordering Hash table in the specific embodiment of the invention, sequencing table and corresponding hash;
Fig. 4 is the cell schematics of the system realizing exchanger chip Openflow stream table priority in the specific embodiment of the invention.
Embodiment
Describe the present invention below with reference to embodiment shown in the drawings.But these execution modes do not limit the present invention, the structure that those of ordinary skill in the art makes according to these execution modes, method or conversion functionally are all included in protection scope of the present invention.
Shown in ginseng Fig. 1 to Fig. 3, it realizes an embodiment of the method for exchanger chip Openflow stream table priority for the present invention.In the present embodiment, it, by building the priority corresponding relation of entry_id and the Openflow stream of ACL, re-establishes putting in order of the entry_id of conventional switch ACL.As shown in Figure 1, the described method realizing exchanger chip Openflow stream table priority, comprises the steps:
S1, set up one and store the Hash table of priority value that some Openflow flow, and correspondingly set up a sequencing table being carried out from big to small by priority values all in Hash table sorting;
The present invention is the stream table priority utilizing the acl feature on the chip of conventional switch to meet completely Openflow agreement proposes, and first need to set up 2 soft tables to set up the value of entry_id and priority, its concrete data structure is as follows:
First table (Hash table, Hash shows), Hash key assignments is priority (priority), Hash data are a chained list storing entry_id, because Hash realizes principle, the priority value of Hash table is out of order, as shown in Figure 2, in figure, Hash table comprises 4 priority key assignments: 65535,2,3,100, and its sequence is not carried out according to key assignments size.
Second table (sequencing table), the sequencing table of a memory priority level value, difference is: it needs to insert relevant position according to priority value size, to make up the out of order problem of key assignments in Hash table, still shown in ginseng Fig. 2, in figure, sequencing table comprises 4 priority values, and its sequence is: 65535,100,3,2, and is be arranged in order according to order from high to low.
It is worth mentioning that, sequencing table can use " balanced binary tree " or " RBTree " structure, to accelerate sequencing production.
S2, each priority value is corresponding with one group of hash, each group hash comprises somely shows corresponding entry_id value with ACL;
As shown in Figure 2, in the present embodiment, safeguard the entry_id chained list (in figure chained list 1 ~ 11) of multiple storage entry_id value, wherein, entry_id is that in conventional switch chip, user specifies it to represent the sequence of positions of ACL table (TCAM), shown in figure, four priority value 65535,2,3,100 difference corresponding one group of hash separately, and each group hash can comprise one or more entry_id value, such as, priority value 65535 corresponds to first group of hash: chained list node 1, chained list node 2, chained list node 3, chained list node 4; Priority value 2 corresponds to second group of hash: chained list node 5, chained list node 7, chained list node 6; Priority value 3 corresponds to the 3rd group of hash: chained list node 8, chained list node 10; Priority value 100 corresponds to the 4th group of hash: chained list node 9, chained list node 11.Wherein, the entry_id value in each above-mentioned group hash is all sort according to certain order.
In the present invention, because the priority value in above-mentioned Hash table and sequencing table can constantly need search and upgrade, in order to realize the present invention better, the S1 step of said method also comprises:
A newly-built priority value Priority_new; This priority value Priority_new is searched object by as target.
Judge whether described priority value Priority_new is present in current Hash table, does not if so, operate; If not, in described Hash table and sequencing table, this priority value Priority_new is inserted respectively.
Correspondingly, in execution mode more specifically, the step S2 of said method yet comprises the steps:
For described priority value Priority_new correspondence safeguards one or more entry_id value entry_id_new;
Described one or more entry_id value entry_id_new is inserted in the hash corresponding to this priority value Priority_new.
Bright above-mentioned search procedure specifically, it is divided into two kinds of situations:
If 1 priority value newly adding stream does not all have in 2 tables, so in sequencing table, insert priority value according to priority value size, priority value is inserted in the key assignments of Hash table, correspondingly newly-built one or more entry_id chained list is shown in data at Hash, and insert one or more entry_id that user oneself specifies, wherein, the corresponding relation of entry_id and Openflow stream needs user oneself to safeguard.Attention: insert priority value in sequencing table, the order after insertion must be inverted order.As there is priority value: 65535 and 3, so new priority value 100 should be inserted in the middle of 65535 and 3, so just becomes 65535,100,3 these orders.
If 2 priority values newly adding stream have in 2 tables, so priority value need not be inserted in sequence chained list, in the key assignments of Hash table, find the priority value existed, and show to insert one or more new entry_id value in data at corresponding Hash.
It is worth mentioning that, in the step of above-mentioned " inserting described one or more entry_id value entry_id_new in the hash corresponding to this priority value Priority_new ", described entry_id value entry_id_new is inserted in corresponding hash backmost.Like this, after this entry that can only need to sort during TCAM sequence, thus height sequencing production.
S3, order according to the priority value in described sequencing table, reorder to all priority values in described Hash table; Shown in ginseng Fig. 3, it is collated Hash table schematic diagram.
S4, according to the Hash table after sequence, obtain the priority order of described entry_id value, and show correspondingly to sort to the ACL of switch according to described priority order.Wherein, described step S4 also specifically comprises: according to priority order from high to low, reads the entry_id value corresponding with each priority value one by one; The priority order of described entry_id value is obtained according to the reading sequencing of entry_id value.As shown in Figure 3, in the present embodiment, priortiy the highest from the Hash table arranged, obtain the entry_id in Hash data link table successively, then obtain the entry_id of second priority priority, until run through all data.The priority order that finally can obtain entry_id value is: 1,2,3,4,9,11,8,10,5,7,6.After this, again according to the priority order of the entry_id value obtained, we can sort ACL table (TCAM) in traditional ethernet switch again according to a step 5 li new order, just can realize the stream table order of the Openflow being with priority, thus meet the requirement in Openflow agreement.
Next, the system corresponding to said method of the present invention will be introduced.As shown in Figure 4, the described system realizing exchanger chip Openflow stream table priority, comprises as lower unit:
Unit 101 set up by soft table, stores for setting up one the Hash table of priority value that some Openflow flow, and correspondingly sets up a sequencing table being carried out from big to small by priority values all in Hash table sorting;
The present invention is the stream table priority utilizing the acl feature on the chip of conventional switch to meet completely Openflow agreement proposes, and first need to set up 2 soft tables to set up the value of entry_id and priority, its concrete data structure is as follows:
First table (Hash table, Hash shows), Hash key assignments is priority (priority), Hash data are a chained list storing entry_id, because Hash realizes principle, the priority value of Hash table is out of order, as shown in Figure 2, in figure, Hash table comprises 4 priority key assignments: 65535,2,3,100, and its sequence is not carried out according to key assignments size.
Second table (sequencing table), the sequencing table of a memory priority level value, difference is: it needs to insert relevant position according to priority value size, to make up the out of order problem of key assignments in Hash table, still shown in ginseng Fig. 2, in figure, sequencing table comprises 4 priority values, and its sequence is: 65535,100,3,2, and is be arranged in order according to order from high to low.
It is worth mentioning that, sequencing table can use " balanced binary tree " or " RBTree " structure, to accelerate sequencing production.
Hash corresponding unit 102, for each priority value is corresponding with one group of hash, each group hash comprises somely shows corresponding entry_id value with ACL;
As shown in Figure 2, in the present embodiment, safeguard the entry_id chained list (in figure chained list 1 ~ 11) of multiple storage entry_id value, wherein, entry_id is that in conventional switch chip, user specifies it to represent the sequence of positions of ACL table (TCAM), shown in figure, four priority value 65535,2,3,100 difference corresponding one group of hash separately, and each group hash can comprise one or more entry_id value, such as, priority value 65535 corresponds to first group of hash: chained list node 1, chained list node 2, chained list node 3, chained list node 4; Priority value 2 corresponds to second group of hash: chained list node 5, chained list node 7, chained list node 6; Priority value 3 corresponds to the 3rd group of hash: chained list node 8, chained list node 10; Priority value 100 corresponds to the 4th group of hash: chained list node 9, chained list node 11.Wherein, the entry_id value in each above-mentioned group hash is all sort according to certain order.
In the present invention, because the priority value in above-mentioned Hash table and sequencing table can constantly need search and upgrade, in order to realize the present invention better, above-mentioned soft table set up unit 101 also for:
A newly-built priority value Priority_new; This priority value Priority_new is searched object by as target.
Judge whether described priority value Priority_new is present in current Hash table, does not if so, operate; If not, in described Hash table and sequencing table, this priority value Priority_new is inserted respectively.
Correspondingly, in execution mode more specifically, above-mentioned hash corresponding unit 102 yet for:
For described priority value Priority_new correspondence safeguards one or more entry_id value entry_id_new;
Described one or more entry_id value entry_id_new is inserted in the hash corresponding to this priority value Priority_new.
Bright above-mentioned search procedure specifically, it is divided into two kinds of situations:
If 1 priority value newly adding stream does not all have in 2 tables, so in sequencing table, insert priority value according to priority value size, priority value is inserted in the key assignments of Hash table, correspondingly newly-built one or more entry_id chained list is shown in data at Hash, and insert one or more entry_id that user oneself specifies, wherein, the corresponding relation of entry_id and Openflow stream needs user oneself to safeguard.Attention: insert priority value in sequencing table, the order after insertion must be inverted order.As there is priority value: 65535 and 3, so new priority value 100 should be inserted in the middle of 65535 and 3, so just becomes 65535,100,3 these orders.
If 2 priority values newly adding stream have in 2 tables, so priority value need not be inserted in sequence chained list, in the key assignments of Hash table, find the priority value existed, and show to insert one or more new entry_id value in data at corresponding Hash.
It is worth mentioning that, in described hash corresponding unit, described entry_id value entry_id_new is inserted in corresponding hash backmost.Like this, after this entry that can only need to sort during TCAM sequence, thus improve sequencing production.
Hash table sequencing unit 103, for the order according to the priority value in described sequencing table, resequences to all priority values in described Hash table; Shown in ginseng Fig. 3, it is collated Hash table schematic diagram.
ACL list sorting unit 104, for according to the Hash table after sequence, obtains the priority order of described entry_id value, and correspondingly sorts according to the ACL table of described priority order to switch.Wherein, described ACL list sorting unit 104 also specifically for: according to priority order from high to low, read the entry_id value corresponding with each priority value one by one; The priority order of described entry_id value is obtained according to the reading sequencing of entry_id value.As shown in Figure 3, in the present embodiment, priortiy the highest from the Hash table arranged, obtain the entry_id in Hash data link table successively, then obtain the entry_id of second priority priority, until run through all data.The priority order that finally can obtain entry_id value is: 1,2,3,4,9,11,8,10,5,7,6.After this, again according to the priority order of the entry_id value obtained, we can sort ACL table (TCAM) in traditional ethernet switch again according to a step 5 li new order, just can realize the stream table order of the Openflow being with priority, thus meet the requirement in Openflow agreement.
Method and system described in the invention safeguard Hash table and the sequencing table of the relation of Priority and entry_id by setting up, utilize the acl feature on the chip of conventional switch, realize the stream table priority feature meeting Openflow agreement, and the Priority value of stream can be identical, and general Openflow switch acl feature can not realize completely, and technique scheme implementation is simple.
It is worth mentioning that, in the method that the present invention introduces, mentioned step number " S1 ", " S2 " ... sequencing might not be there is between " Sn " etc., hereby state.
Device embodiments described above is only schematic, the wherein said unit illustrated as separating component or can may not be and physically separates, parts as unit display can be or may not be physical location, namely can be positioned at a place, or also can be distributed in multiple network element.Some or all of module wherein can be selected according to the actual needs to realize the object of present embodiment scheme.Those of ordinary skill in the art, when not paying creative work, are namely appreciated that and implement.
Be to be understood that, although this specification is described according to execution mode, but not each execution mode only comprises an independently technical scheme, this narrating mode of specification is only for clarity sake, those skilled in the art should by specification integrally, technical scheme in each execution mode also through appropriately combined, can form other execution modes that it will be appreciated by those skilled in the art that.
A series of detailed description listed is above only illustrating for feasibility execution mode of the present invention; they are also not used to limit the scope of the invention, all do not depart from the skill of the present invention equivalent implementations done of spirit or change all should be included within protection scope of the present invention.

Claims (10)

1. realize a method for exchanger chip Openflow stream table priority, it is characterized in that, described method comprises:
S1, set up one and store the Hash table of priority value that some Openflow flow, and correspondingly set up a sequencing table being carried out from big to small by priority values all in Hash table sorting;
S2, each priority value is corresponding with one group of hash, each group hash comprises somely shows corresponding entry_id value with ACL, and wherein, described entry_id value is stored in entry_id chained list;
S3, order according to the priority value in described sequencing table, reorder to all priority values in described Hash table;
S4, according to the Hash table after sequence, obtain the priority order of described entry_id value, and show correspondingly to sort to the ACL of switch according to described priority order.
2. method according to claim 1, is characterized in that, the method S1 step also comprises:
A newly-built priority value Priority_new;
Judge whether described priority value Priority_new is present in current Hash table, does not if so, operate; If not, in described Hash table and sequencing table, this priority value Priority_new is inserted respectively.
3. method according to claim 2, is characterized in that, described step S2 also specifically comprises:
For described priority value Priority_new correspondence safeguards one or more entry_id value entry_id_new;
Described one or more entry_id value entry_id_new is inserted in the hash corresponding to this priority value Priority_new.
4. method according to claim 3, it is characterized in that, in the step of described " inserting described one or more entry_id value entry_id_new in the hash corresponding to this priority value Priority_new ", described entry_id value entry_id_new is inserted in corresponding hash backmost.
5. method according to claim 1, is characterized in that, described step S4 also specifically comprises:
According to priority order from high to low, read the entry_id value corresponding with each priority value one by one; The priority order of described entry_id value is obtained according to the reading sequencing of entry_id value.
6. realize a system for exchanger chip Openflow stream table priority, it is characterized in that, described system comprises:
Unit set up by soft table, stores for setting up one the Hash table of priority value that some Openflow flow, and correspondingly sets up a sequencing table being carried out from big to small by priority values all in Hash table sorting;
Hash corresponding unit, for each priority value is corresponding with one group of hash, each group hash comprises somely shows corresponding entry_id value with ACL, and wherein, described entry_id value is stored in entry_id chained list;
Hash table sequencing unit, for the order according to the priority value in described sequencing table, reorders to all priority values in described Hash table;
ACL list sorting unit, for according to the Hash table after sequence, obtains the priority order of described entry_id value, and correspondingly sorts according to the ACL table of described priority order to switch.
7. system according to claim 6, is characterized in that, described soft table set up unit also for:
A newly-built priority value Priority_new;
Judge whether described priority value Priority_new is present in current Hash table, does not if so, operate; If not, in described Hash table and sequencing table, this priority value Priority_new is inserted respectively.
8. system according to claim 7, is characterized in that, described hash corresponding unit also for:
For described priority value Priority_new correspondence safeguards one or more entry_id value entry_id_new;
Described one or more entry_id value entry_id_new is inserted in the hash corresponding to this priority value Priority_new.
9. system according to claim 8, is characterized in that, in described hash corresponding unit, described entry_id value entry_id_new is inserted in corresponding hash backmost.
10. system according to claim 6, is characterized in that, described ACL list sorting unit also specifically for: according to priority order from high to low, read the entry_id value corresponding with each priority value one by one; The priority order of described entry_id value is obtained according to the reading sequencing of entry_id value.
CN201210335079.4A 2012-09-12 2012-09-12 Realize the method and system of exchanger chip Openflow stream table priority Active CN102843298B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201210335079.4A CN102843298B (en) 2012-09-12 2012-09-12 Realize the method and system of exchanger chip Openflow stream table priority

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201210335079.4A CN102843298B (en) 2012-09-12 2012-09-12 Realize the method and system of exchanger chip Openflow stream table priority

Publications (2)

Publication Number Publication Date
CN102843298A CN102843298A (en) 2012-12-26
CN102843298B true CN102843298B (en) 2015-08-05

Family

ID=47370371

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201210335079.4A Active CN102843298B (en) 2012-09-12 2012-09-12 Realize the method and system of exchanger chip Openflow stream table priority

Country Status (1)

Country Link
CN (1) CN102843298B (en)

Families Citing this family (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2014205812A1 (en) * 2013-06-28 2014-12-31 华为技术有限公司 Method for adding group entry and switch
CN104426815B (en) 2013-08-27 2019-07-09 中兴通讯股份有限公司 Method and system, OF controller and the OF interchanger of flow table issuance in a kind of SDN
CN104735000A (en) * 2013-12-23 2015-06-24 中兴通讯股份有限公司 OpenFlow signaling control method and device
CN103731354B (en) * 2013-12-25 2018-01-26 江苏省未来网络创新研究院 One kind is based on self-defined multilevel flow table fast matching method
CN104954258B (en) * 2014-03-26 2019-03-01 中兴通讯股份有限公司 Data message processing method, device and open flow switch
CN105812277B (en) * 2014-12-31 2019-04-12 中国电信股份有限公司 The control method and system of access request, communication equipment
CN106034046A (en) * 2015-03-20 2016-10-19 中兴通讯股份有限公司 Method and device for sending access control list (ACL)
CN104965686B (en) * 2015-07-20 2019-01-22 北京金山安全软件有限公司 Priority queue design method and priority queue design device
CN108337172B (en) * 2018-01-30 2020-09-29 长沙理工大学 Large-scale OpenFlow flow table accelerated searching method
CN114221849B (en) * 2020-09-18 2024-03-19 芯启源(南京)半导体科技有限公司 Method for realizing intelligent network card by combining FPGA with TCAM
CN112511438B (en) * 2020-11-19 2022-12-13 锐捷网络股份有限公司 Method and device for forwarding message by using flow table and computer equipment

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101620623A (en) * 2009-08-12 2010-01-06 杭州华三通信技术有限公司 Method and device for managing list item of content addressable memory CAM
US7904642B1 (en) * 2007-02-08 2011-03-08 Netlogic Microsystems, Inc. Method for combining and storing access control lists

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2003244222A (en) * 2002-02-18 2003-08-29 Sony Corp Communication controller, communication control system and method and computer program
JP2007206942A (en) * 2006-02-01 2007-08-16 Konica Minolta Business Technologies Inc Biometric authentication device and biometric authentication method
US20090125470A1 (en) * 2007-11-09 2009-05-14 Juniper Networks, Inc. System and Method for Managing Access Control Lists

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7904642B1 (en) * 2007-02-08 2011-03-08 Netlogic Microsystems, Inc. Method for combining and storing access control lists
CN101620623A (en) * 2009-08-12 2010-01-06 杭州华三通信技术有限公司 Method and device for managing list item of content addressable memory CAM

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
韦兴军,等.openflow 交换机模型及关键技术研究与实现.《万方学位论文数据库》.2009, *

Also Published As

Publication number Publication date
CN102843298A (en) 2012-12-26

Similar Documents

Publication Publication Date Title
CN102843298B (en) Realize the method and system of exchanger chip Openflow stream table priority
CN107104824B (en) Network topology determination method and device
CN101222391B (en) Method for constructing topological tree in server/client terminal structure
CN103227778B (en) Memory pool access method, equipment and system
CN104580027A (en) OpenFlow message forwarding method and equipment
CN107463692B (en) Super large text data is synchronized to the method and system of search engine
CN102843299A (en) Method and system for realizing Openflow multi-stage flow tables on basis of ternary content addressable memory (TCAM)
CN103336782B (en) A kind of relationship type distributed data base system
US10038571B2 (en) Method for reading and writing forwarding information base, and network processor
CN101834788B (en) Storage operation method, device and equipment of media access control address table items
CN103793273A (en) Distributed type queue scheduling method and device based on Redis
CN105991478A (en) Server resource distribution method and system
CN109254839A (en) It determines the method in task triggered time, construct the method and system of task timer
CN110580734A (en) Three-dimensional scene rendering method, device and equipment and readable storage medium
CN109981464A (en) TCAM circuit structure realized in FPGA and matching method thereof
CN101369934B (en) Network analogue method and system
CN104780101A (en) FIB (Forward Information Base) table structure in named data networking forwarding plane and retrieval method thereof
CN101986282B (en) Topology adaptation method and device
CN107169100A (en) A kind of electric automobile long-distance controlling service system and method
CN102752207A (en) Reconfigurable 2D (two-dimensional) mesh on-chip network structure and reconfiguration method thereof
CN104484619B (en) It is a kind of to solve the method that client multi-logical channel accesses PKCS#15 file conflicts
CN109471837A (en) Distributed storage method of power infrastructure data
CN105005621A (en) Method for constructing distributed storage and parallel indexing system for big data
CN104578418B (en) Configuration method and system of automatic power distribution equipment based on 101 protocols, and equipment
CN206961114U (en) Pin time-sharing multiplex circuit, motherboard circuit and the electronic equipment of programmable chip

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant
CP03 Change of name, title or address
CP03 Change of name, title or address

Address after: 215000 unit 13 / 16, 4th floor, building B, No.5 Xinghan street, Suzhou Industrial Park, Jiangsu Province

Patentee after: Suzhou Shengke Communication Co.,Ltd.

Address before: 215021 unit 13 / 16, floor 4, building B, No. 5, Xinghan street, Suzhou Industrial Park, Suzhou, Jiangsu

Patentee before: CENTEC NETWORKS (SU ZHOU) Co.,Ltd.