CN101146038B - Tree traversal method and device - Google Patents
Tree traversal method and device Download PDFInfo
- Publication number
- CN101146038B CN101146038B CN2007101239611A CN200710123961A CN101146038B CN 101146038 B CN101146038 B CN 101146038B CN 2007101239611 A CN2007101239611 A CN 2007101239611A CN 200710123961 A CN200710123961 A CN 200710123961A CN 101146038 B CN101146038 B CN 101146038B
- Authority
- CN
- China
- Prior art keywords
- list item
- tree table
- tree
- table list
- flag bit
- 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.)
- Expired - Fee Related
Links
Images
Abstract
The invention relates to a method of traversing tree table entries, which preset a tree table entries mapping table of a pre-traversing tree table. In traversing the tree table entries, firstly inquire the preset tree table entries mapping table and obtain a valid tree table entries address therefrom; and then process the valid tree table entries in the tree table, according to the acquired valid tree table entries. The invention also relates to a device traversing the tree table entries. The invention greatly improves the traversal efficiency of the tree table entries and can effectively avoid traversal processing overtime and guarantee the normal operation of business.
Description
Technical field
The present invention relates to VPLS (Virtual Private LAN service is called for short VPLS), more particularly, relate to method of traversing tree table entries and device among a kind of VPLS.
Background technology
At present; two layers, the three layers forwarding unit of VPLS adopt network processing unit (Network Processor more; be called for short NP) as the forwarding module of bottom; upper layer module such as Routing Protocol and user management mainly informs by list item how NP E-Packets; therefore NP regular meeting when E-Packeting relates to the traversal processing of list item, just to user's list item, forwarding-table item etc. delete, wear out, processing such as interpolation.
When these list items are static entry, issue effective index by upper layer module and travel through, easy to operate.
When these list items are the tree table list item, the inventor finds in implementing process of the present invention, can't direct index for the tree table list item, need search by the key value.Yet if issue the processing that the key value is come a rule by upper layer module, it is very low to travel through efficient; And the upper layer module of the tree table list item that has does not have respective index, can only be processed by NP.The traversal processing of tree table list item adopts NP directly to travel through all tree table list items and checks the mode which list item is effectively then handled effective list item at present, as shown in Figure 1.This mode is because in the less situation of effective list item, NP also will intactly travel through all tree table list items, so the traversal inefficiency.Further, when the tree table list item of big specification is allocated in the low speed internal memory, this traversal mode tend to cause to list item process overtime.
For example, in two layers or three layers of forwarding unit, the medium access control of VPLS (Media AccessControl is called for short MAC) source MAC of list item recorded message and the relation of port.This MAC address entries is the tree table list item, and is created by the microcode among the NP (pico code), and upper layer module does not have respective index and key value.Therefore operation such as aging, the deletion of this MAC address entries is by the microcode traversal, judges that whether effectively and handle list item.In effective MAC address entries situation seldom, NP still needs to travel through all MAC address entries and wears out or deletion action, and efficient is extremely low.Particularly, when restarting the VPLS business, need all MAC address entries of deletion, at this moment because the processing time can cause overtimely than length, upper layer module will repeat to issue delete command, makes former deletion also not dispose, receive new delete command again, thereby the generation vicious circle causes message channel to stop up, and service exception occurs.
Summary of the invention
The technical problem that the embodiment of the invention will solve is, for the prior art above shortcomings, provides a kind of method and device of efficient tree traversal, can avoid traversal processing overtime, and the assurance business is normally carried out.
The embodiment of the invention solves the technical scheme that its technical problem adopts: a kind of network processing unit method of traversing tree table entries is provided, may further comprise the steps:
(1) inquires about the in advance tree table list item mapping table of the tree table of foundation, the address that from this tree table list item mapping table, obtains effective tree table list item; With the tree table list item of the described tree table corresponding flag bit that arranges one by one, whether the tree table list item that described each flag bit of each flag bit sign is corresponding is effective in the described tree table list item mapping table; Described network processing unit is by the address of effective tree table list item corresponding to the position acquisition described flag bit of the effective flag bit of tree table list item in described tree table list item mapping table corresponding in described each flag bit; (2) according to the address of the effective tree table list item that obtains, process in the described tree table effective tree table list item that should the address;
(3) judge whether described tree table list item mapping table is inquired about and finish, as yet inquiry do not finish, then return step (1), continue next flag bit in the query tree table list item mapping table; Inquired about as mapping table and to have finished, then finished traversal.
The flag bit of described tree table list item mapping table and the tree table list item of described tree table one by one corresponding, set gradually, wherein the skew of each flag bit in described tree table list item mapping table is identical with the skew of the corresponding tree table list item of described each flag bit in described tree table; Described network processing unit is according to skew and the list item plot of the described tree table address that obtain this correspondence effective tree table list item of the effective flag bit of tree table list item corresponding in described each flag bit in described tree table list item mapping table.
Described step (1) comprising:
Inquire about described tree table list item mapping table, judge that current mark bit identifies whether its corresponding tree table list item is effectively in this mapping table, if the corresponding tree table of its sign list item is invalid, then skip, it is effective to learn that up to judgement current mark bit identifies its corresponding tree table list item;
Learn that in judgement current mark bit identifies its corresponding tree table list item when effective, obtain the corresponding effectively address of tree table list item according to the skew of this flag bit in described tree table list item mapping table and the list item plot sum of described tree table.
Described network processing unit is when adding or delete the tree table list item, and correspondence is revised the flag bit in described tree table list item mapping table corresponding to this tree table list item.
Described tree table list item mapping table is deposited in the high-speed internal memory of described network processing unit.
The medium access control list item that described tree table list item is VPLS.
The embodiment of the invention also provides a kind of device of tree traversal, comprising:
Storage device, the tree table list item mapping table of storage tree table and this tree table;
The inquiry deriving means is inquired about the tree table list item mapping table of the tree table of storing in the described storage device, the address that obtains effective tree table list item from this tree table list item mapping table; With the tree table list item of the described tree table corresponding flag bit that arranges one by one, whether the tree table list item that described each flag bit of each flag bit sign is corresponding is effective in the described tree table list item mapping table; Described inquiry deriving means by the position acquisition of the effective flag bit of tree table list item in described tree table list item mapping table corresponding in described each flag bit should the effective tree table list item of correspondence the address;
Treating apparatus according to the address of the effective tree table list item that obtains, is processed in the described tree table effective tree table list item that should the address;
Judge indicating device, judge whether described tree table list item mapping table is inquired about to finish, when judged result finishes for inquiring about, indicate described inquiry deriving means to finish to inquire about; Otherwise indication inquiry deriving means continues inquiry.
The flag bit of described tree table list item mapping table and the tree table list item of described tree table one by one corresponding, set gradually, wherein the skew of each flag bit in described tree table list item mapping table is identical with the skew of the corresponding tree table list item of described each flag bit in described tree table; Described inquiry deriving means is according to skew and the list item plot of the described tree table address that obtain this correspondence effective tree table list item of the effective flag bit of tree table list item corresponding in described each flag bit in described tree table list item mapping table.
Described inquiry deriving means comprises:
Judging unit judges that current mark bit identifies whether its corresponding tree table list item is effective in the tree table list item mapping table of being inquired about;
Acquiring unit learns that in described judgment unit judges current mark bit identifies its corresponding tree table list item when effective, obtains the corresponding effectively address of tree table list item according to the skew of this flag bit in described tree table list item mapping table and the list item plot sum of described tree table.
Described processing unit adds or deletes when tree is shown list item in the described tree table, the flag bit in the described tree table list item mapping table of this tree table list item correspondence of storing in the described storage device of corresponding modification.
Described storage device comprises high-speed internal memory, and described tree table list item mapping table is deposited in this high-speed internal memory.
The medium access control list item that described tree table list item is VPLS.
The device of described tree traversal is network processing unit.
The embodiment of the invention travels through for the tree table list item, adopt mapping table sign tree table list item whether effective, only effective tree table list item is carried out traversal processing, and need not to travel through all tree table list items, thereby greatly improved the traversal efficient to the list item of the directly effective index of this nothing of tree table list item, can effectively avoid traversal processing overtime, the assurance business be normally carried out.
Embodiments of the present invention is further illustrated below in conjunction with drawings and Examples.
Description of drawings
Fig. 1 is the schematic diagram of existing method of traversing tree table entries.
Fig. 2 is the flow chart of embodiment of the invention network processing unit method of traversing tree table entries.
Fig. 3 is the schematic diagram of embodiment of the invention network processing unit method of traversing tree table entries.
Fig. 4 is the structural representation of embodiment of the invention network processing unit.
Embodiment
The method of embodiment of the invention network processing unit tree traversal, in network processing unit, set up in advance the tree table list item mapping table of pre-traverse tree table, in this mapping table with the tree table list item of the tree table corresponding flag bit that arranges one by one, whether effectively (for example each flag bit identifies its corresponding tree table list item, flag bit is that 1 its corresponding tree table list item of expression is effective, be that 0 its corresponding tree table list item of expression is invalid), namely identify its corresponding tree table list item and be effective tree table list item or be invalid tree table list item; Network processing unit is by the address of position acquisition this effective tree table list item of the sign effective flag bit of its corresponding tree table list item in described tree table list item mapping table.
In the present embodiment, it is corresponding one by one and set gradually that the flag bit of tree table list item mapping table and the tree of tree table are shown list item, wherein the skew of each flag bit in tree table list item mapping table is identical with its corresponding tree table list item skew in pre-traverse tree table, that is to say, in the tree table list item mapping table, effective tree table list item in identifying the effective flag bit of its corresponding tree table list item and tree being shown is corresponding one by one, and its skew in mapping table is identical with the skew of corresponding effectively tree table list item in tree table internal memory, i.e. the effectively skew of tree table list item address=its respective flag position+tree table list item plot.Therefore, network processing unit can according to the effective flag bit of its corresponding tree table list item of sign in described tree table list item mapping table skew and the list item plot of tree table obtain the effectively address of tree table list item of this correspondence.Certainly the tree table list item of the flag bit of tree table list item mapping table and tree table also can be by the corresponding setting of certain arrangement regulation, can be by the address of the effective tree table list item of position acquisition of flag bit in described tree table list item mapping table as long as satisfy network processing unit.This tree table list item mapping table can be deposited in the high-speed internal memory of network processing unit such as SRAM, the sheet in the internal memory etc. to improve inquiry velocity, and this tree table list item mapping table also can be placed in the common memory in addition.
Shown in Fig. 2,3, during embodiment of the invention tree traversal, at first at step S301, the tree of inquiry foundation is in advance shown the list item mapping table in order, whether the correspondence tree table list item of judging current mark bit sign in this mapping table is effective (whether flag bit is 1), if its sign tree table list item invalid (flag bit is 0) is then skipped, continue inquiry, up to obtaining the effective flag bit of its corresponding tree table list item of sign; After getting access to the effective flag bit of its corresponding tree table list item of sign, at step S302, the address that its pairing effective tree table list item is obtained in skew in tree table list item mapping table according to this flag bit, particularly, this flag bit is shown the skew in the list item mapping table and is set the list item plot sum of showing in tree, is the address of effective tree table list item of its correspondence; So,, can handle corresponding effectively tree table list item in the tree table according to the address of resulting effective tree table list item at step S303; After corresponding effective tree table list item handled,, judge whether mapping table is inquired about to finish then at step S304, do not finish as inquiring about as yet, then return step 301, continue query tree table list item mapping table, get next flag bit in the mapping table, judge whether its correspondence tree that identifies table list item is effective; As mapping table poll-final, then finish this time traversal.
When adding or delete the tree table list item, revise corresponding flag bit in the mapping table: at first deduct tree table list item plot according to the address of the tree table list item that will add or delete and obtain this skew of tree table list item in the tree table internal memory, then in mapping table, will be offset mark position 1 (interpolation tree table list item) or clear 0 (the deleting the tree table list item) of correspondence position.As in the process of tree traversal, needing modification such as the effective tree table list item in interpolation or the deletion tree table, then in step S303, flag bit (putting 1 or clear 0) corresponding in the corresponding modify mapping table.
The MAC table of VPLS is set up the MAC address entries mapping table as example in the high-speed internal memory of network processing unit in two layers or the three layers of forwarding unit, and the MAC address entries in the MAC table is successively one by one corresponding with the flag bit in the mapping table.When setting up mapping table, the flag bit that this skew correspondence position in the mapping table is set according to the skew in tree table internal memory of the address of effective MAC address entries is 1, it is effective for the flag bit of " 1 " identifies with one for each effective MAC address entries, and other invalid MAC address entries are that the flag bit of " 0 " identifies that it is invalid with one respectively then.During network processing unit traversal MAC table, as described above, inquire about earlier the MAC address entries mapping table of storing in its high-speed internal memory in order, when the flag bit of being inquired about is " 1 ", skew in the MAC address entries mapping table adds MAC table list item plot according to this flag bit, obtains the address of corresponding effective MAC address entries; According to the address of the effective MAC address entries that obtains, handle corresponding M AC list item in the MAC table again; Up to the inquiry whole M AC list item mapping table that finishes.As the effective tree table list item in interpolation or the Deltree table, corresponding as the need modification with mark position 1 or clear 0 corresponding in the mapping table.
As shown in Figure 4, the network processing unit in the embodiment of the invention can comprise storage device, inquiry deriving means, processing unit and judge indicating device.
Wherein storage device is used to store the tree table list item mapping table of tree table and this tree table.The flag bit of this tree table list item mapping table and the tree of tree table show list item corresponding one by one, set gradually, wherein the skew of each flag bit in tree table list item mapping table is identical with its corresponding tree table list item skew in the tree table, that is to say, in the tree table list item mapping table, effective tree table list item in identifying the effective flag bit of its corresponding tree table list item and tree being shown is corresponding one by one, and its skew in mapping table is identical with the skew of corresponding effectively tree table list item in tree table internal memory, i.e. the effectively skew of tree table list item address=its respective flag position+tree table list item plot.This storage device can comprise high-speed internal memory, and tree table list item mapping table is deposited in this high-speed internal memory.
The inquiry deriving means is used for inquiring about the tree table list item mapping table of the tree table that described storage device stores, the address that obtains effective tree table list item from this tree table list item mapping table.This inquiry deriving means comprises judging unit and acquiring unit, wherein in the tree table list item mapping table inquired about of judgment unit judges current mark bit whether identify its corresponding tree table list item be effective, if it is invalid that it identifies corresponding tree table list item, then skip, until judge that to learn that current mark bit identifies its corresponding tree table list item effective; Acquiring unit learns that in judgment unit judges current mark bit identifies its corresponding tree table list item when effective, obtains the corresponding effectively address of tree table list item according to the skew of this flag bit in tree table list item mapping table and the list item plot sum of tree table.
Treating apparatus is used for the address according to the effective tree table list item that obtains, and processes in the tree table effective tree table list item that should the address.This processing unit is adding or the Deltree table list item while, the flag bit in the tree table list item mapping table of this tree table list item correspondence of storing in the corresponding modification storage device.Just, earlier deduct tree table list item plot and obtain this skew of tree table list item in tree table internal memory, then in mapping table, will be offset the mark position 1 (interpolation is set and shown list item) or clear 0 (the Deltree table list item) of correspondence position according to the address of the tree table list item that will add or delete.
Judge indicating device, be used for treating apparatus with tree table a pair of should the address effective tree table list item process after, whether judgement is complete for the inquiry of tree table list item mapping table, when judged result is complete for inquiring about, indicates described inquiry deriving means to finish inquiry; Otherwise indication inquiry deriving means continues the next flag bit of inquiry.
Whether the embodiment of the invention adopts mapping table sign list item effective for tree table list item traversal, only effective list item is carried out traversal processing, thereby has greatly improved the traversal efficient to the list item of the directly effective index of this nothing of tree table list item.Take the MA5200G BAS Broadband Access Server as example, need 80ms at a 32K VPLS of this equipment complete traversal of test MAC address entries, if when traversal, process then can be greater than 80ms.In the prior art, no matter effectively how many MAC address entries has, and all needs the so long time, and after adopting the embodiment of the invention, just travels through according to the effective list item number of reality, and efficient improves greatly.
The embodiment of the invention can be arranged in the network processing unit and use, and also can be incorporated in the computer-readable recording medium with software form, sells or uses as product independently.
Claims (13)
1. a network processing unit method of traversing tree table entries is characterized in that, may further comprise the steps:
(1) inquires about the in advance tree table list item mapping table of the tree table of foundation, the address that from this tree table list item mapping table, obtains effective tree table list item; With the tree table list item of the described tree table corresponding flag bit that arranges one by one, whether the tree table list item that described each flag bit of each flag bit sign is corresponding is effective in the described tree table list item mapping table; Described network processing unit is by the address of effective tree table list item corresponding to the position acquisition described flag bit of the effective flag bit of tree table list item in described tree table list item mapping table corresponding in described each flag bit;
(2) according to the address of the effective tree table list item that obtains, process in the described tree table effective tree table list item that should the address;
(3) judge whether described tree table list item mapping table is inquired about and finish, as yet inquiry do not finish, then return step (1), continue next flag bit in the query tree table list item mapping table; Inquired about as mapping table and to have finished, then finished traversal.
2. network processing unit method of traversing tree table entries according to claim 1, it is characterized in that, the flag bit of described tree table list item mapping table is corresponding one by one with the tree table list item of described tree table, set gradually, wherein the skew of each flag bit in described tree table list item mapping table and the pairing tree of described each flag bit to show the skew of list item in described tree is shown identical; Described network processing unit according to the effective flag bit of tree table list item corresponding in described each flag bit in described tree table list item mapping table skew and the list item plot of described tree table obtain the effectively address of tree table list item of this correspondence.
3. network processing unit method of traversing tree table entries according to claim 2 is characterized in that, described step (1) comprising:
Inquire about described tree table list item mapping table, judge that current mark bit identifies whether its corresponding tree table list item is effective in this mapping table;
Learn that in judgement current mark bit identifies its corresponding tree table list item when effective, obtain the corresponding effectively address of tree table list item according to the skew of this flag bit in described tree table list item mapping table and the list item plot sum of described tree table.
4. according to the method for claim 1 or 2 or 3 described network processing unit tree traversals, it is characterized in that described network processing unit is when adding or delete the tree table list item, correspondence is revised the flag bit in described tree table list item mapping table corresponding to this tree table list item.
5. according to arbitrary described network processing unit method of traversing tree table entries among the claim 1-3, it is characterized in that described tree table list item mapping table is deposited in the high-speed internal memory of described network processing unit.
6. according to arbitrary described network processing unit method of traversing tree table entries among the claim 1-3, it is characterized in that described tree table list item is the medium access control list item of VPLS.
7. the device of a tree traversal is characterized in that, comprising:
Storage device, the tree table list item mapping table of storage tree table and this tree table;
The inquiry deriving means is inquired about the tree table list item mapping table of the tree table of storing in the described storage device, the address that obtains effective tree table list item from this tree table list item mapping table; With the tree table list item of the described tree table corresponding flag bit that arranges one by one, whether the tree table list item that described each flag bit of each flag bit sign is corresponding is effective in the described tree table list item mapping table; Described inquiry deriving means by the position acquisition of the effective flag bit of tree table list item in described tree table list item mapping table corresponding in described each flag bit should the effective tree table list item of correspondence the address;
Treating apparatus according to the address of the effective tree table list item that obtains, is processed in the described tree table effective tree table list item that should the address;
Judge indicating device, judge whether described tree table list item mapping table is inquired about to finish, when judged result finishes for inquiring about, indicate described inquiry deriving means to finish to inquire about; Otherwise indication inquiry deriving means continues inquiry.
8. the device of tree traversal according to claim 7, it is characterized in that, the flag bit of described tree table list item mapping table and the tree table list item of described tree table one by one corresponding, set gradually, wherein the skew of each flag bit in described tree table list item mapping table is identical with the skew of the corresponding tree table list item of described each flag bit in described tree table; Described inquiry deriving means is according to skew and the list item plot of the described tree table address that obtain this correspondence effective tree table list item of the effective flag bit of tree table list item corresponding in described each flag bit in described tree table list item mapping table.
9. the device of tree traversal according to claim 8 is characterized in that, described inquiry deriving means comprises:
Judging unit judges that current mark bit identifies whether its corresponding tree table list item is effective in the tree table list item mapping table of being inquired about;
Acquiring unit learns that in described judgment unit judges current mark bit identifies its corresponding tree table list item when effective, obtains the corresponding effectively address of tree table list item according to the skew of this flag bit in described tree table list item mapping table and the list item plot sum of described tree table.
10. according to the device of claim 9 or 8 or 7 described tree traversals, it is characterized in that, described processing unit adds or deletes when tree is shown list item in the described tree table, the flag bit in the described tree table list item mapping table of this tree table list item correspondence of storing in the described storage device of corresponding modification.
11. the device according to arbitrary described tree traversal among the claim 7-9 is characterized in that described storage device comprises high-speed internal memory, described tree table list item mapping table is deposited in this high-speed internal memory.
12. the device according to arbitrary described tree traversal among the claim 7-9 is characterized in that, described tree table list item is the medium access control list item of VPLS.
13. the device according to arbitrary described tree traversal among the claim 7-9 is characterized in that, the device of described tree traversal is a network processing unit.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2007101239611A CN101146038B (en) | 2007-10-16 | 2007-10-16 | Tree traversal method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2007101239611A CN101146038B (en) | 2007-10-16 | 2007-10-16 | Tree traversal method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101146038A CN101146038A (en) | 2008-03-19 |
| CN101146038B true CN101146038B (en) | 2010-08-04 |
Family
ID=39208338
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2007101239611A Expired - Fee Related CN101146038B (en) | 2007-10-16 | 2007-10-16 | Tree traversal method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101146038B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106201351A (en) * | 2016-07-07 | 2016-12-07 | 乐视控股（北京）有限公司 | A kind of storage method based on object storage and server |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1538662A (en) * | 2003-04-14 | 2004-10-20 | 华为技术有限公司 | Method of realizing static table item and address binding |
| CN1859208A (en) * | 2006-03-29 | 2006-11-08 | 华为技术有限公司 | Method and system for managing TCAM route list |
| CN1983976A (en) * | 2006-05-31 | 2007-06-20 | 华为技术有限公司 | Method and device for storing converting route |
| CN101043428A (en) * | 2006-05-30 | 2007-09-26 | 华为技术有限公司 | Routing retransmitting method and system |
-
2007
- 2007-10-16 CN CN2007101239611A patent/CN101146038B/en not_active Expired - Fee Related
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1538662A (en) * | 2003-04-14 | 2004-10-20 | 华为技术有限公司 | Method of realizing static table item and address binding |
| CN1859208A (en) * | 2006-03-29 | 2006-11-08 | 华为技术有限公司 | Method and system for managing TCAM route list |
| CN101043428A (en) * | 2006-05-30 | 2007-09-26 | 华为技术有限公司 | Routing retransmitting method and system |
| CN1983976A (en) * | 2006-05-31 | 2007-06-20 | 华为技术有限公司 | Method and device for storing converting route |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101146038A (en) | 2008-03-19 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104462549B (en) | A kind of data processing method and device | |
| CN101197754B (en) | Distributed system, distributed service processing method and correlated device | |
| CN104184664B (en) | Route forwarding table items generation method and device | |
| CN100477671C (en) | Network address converting method for supporting multi-dialogue application-layer protocol under PAT mode | |
| CN101030919B (en) | Method for converting duplexing interface board address realtime network address | |
| CN103312836B (en) | A kind of large-scale local network ip address management method | |
| CN103095758B (en) | A kind of method processing file data in distributed file system and this system | |
| CN109614226A (en) | A kind of stateful application memory management method based on Kubernetes | |
| CN103441932B (en) | A kind of Host routes list item generates method and apparatus | |
| CN109981493B (en) | Method and device for configuring virtual machine network | |
| CN108063837A (en) | Dynamic IP addressing distribution method and device | |
| CN103546380B (en) | A kind of message forwarding method based on policybased routing and device | |
| CN110505621B (en) | Terminal migration processing method and device | |
| CN102857414A (en) | Forwarding table writing method and device and message forwarding method and device | |
| CN103581022B (en) | MAC address finding and transmitting method and device | |
| CN105591997A (en) | URL (uniform resource locator) classification and filtering method and device | |
| CN101800690A (en) | Method and device for realizing source address conversion by using address pool | |
| CN104956341A (en) | Data migration method, device and processor | |
| CN101540730A (en) | Address searching method, switch and network system | |
| CN102325077B (en) | Communication method among branches and egress routers of branches | |
| CN106470171B (en) | The delivery method and device of multicast forwarding list item | |
| CN100553222C (en) | A kind of method and device that ensures that message hardware is transmitted | |
| CN106713130A (en) | Routing table updating method, EVPN control equipment and EVPN system | |
| CN101146038B (en) | Tree traversal method and device | |
| CN106027356A (en) | Tunnel identifier conversion method 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 | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20100804 Termination date: 20151016 |
|
| EXPY | Termination of patent right or utility model |