CN101909005A - Method and device for processing forwarding table - Google Patents
Method and device for processing forwarding table Download PDFInfo
- Publication number
- CN101909005A CN101909005A CN2010102345022A CN201010234502A CN101909005A CN 101909005 A CN101909005 A CN 101909005A CN 2010102345022 A CN2010102345022 A CN 2010102345022A CN 201010234502 A CN201010234502 A CN 201010234502A CN 101909005 A CN101909005 A CN 101909005A
- Authority
- CN
- China
- Prior art keywords
- transmitting
- list item
- route
- table items
- route table
- 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.)
- Pending
Links
Images
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a method and a device for processing a forwarding table. The method comprises the following steps that: when a first routing table entry in a routing table is processed, network equipment judges whether a second routing table entry capable of aggregating the first routing table entry exists in the forwarding table or not; and if the second routing table entry exists and a next hop address of the first routing table entry is the same as that of the second routing table entry, the first routing entry is forbidden to be added into the forwarding table. The method and the device can simply and fast determine the routing table entry not to be added to the forwarding table and effectively avoid adding an unnecessary routing table entry into the forwarding table by judging whether the table entry exists in the forwarding table or not and the next hop address of the table entry so as to reduce the capacity of the forwarding table on the premise of ensuring the normal communication of a network.
Description
Technical field
The present invention relates to the communications field, relate in particular to a kind of processing method of transmitting and device.
Background technology
In present a lot of networks, network node (for example, the network equipments such as router) can be preserved routing table (Routing Information Base abbreviates RIB as).Usually, can store the path that arrives the particular network terminal in the routing table, in some cases, also can store some tolerance relevant with this path.By the routing table of preserving, can realize communication between the network node.
Along with the continuous expansion of network size, network node quantity constantly increases, and the scale of routing table also can correspondingly enlarge.Because the appearance that the enforcement of unreasonable, ISP's traffic engineering of IP address assignment and many hosts etc. use, no default route district (the Default free zone of current internet, abbreviate DFZ as) in the route scale just with ultra linear speed increment, at present, the scale of the Border Gateway Protocol of core router (Border Gateway Protocol abbreviates BGP as) routing table is near 300,000.
In the network equipment, through after the optimum route screening, can form to form according to results of screening and transmit (Forwarding Information Base abbreviates FIB as) in the routing table.The technology that the current network equipment generally adopts the control aspect to separate with forwarding plane, routing table reside in the control aspect, reside in the network processing unit that high-speed data is transmitted and transmit, and so just can effectively avoid the network equipment to preserve large-scale routing table.
In order to satisfy the bandwidth needs, core router must be carried out fast routing lookups and realize surface speed forwarding, this just require all transmit information be saved in can fast access static random incoming memory (Static Random Access Memory, abbreviate SRAM as), dynamic random incoming memory (Dynamic Random Access Memory, abbreviate DRAM as) or ternary content incoming memory (Ternary Content Access Memory abbreviates TCAM as) in.Transmit owing to directly preserve in the network equipment, therefore, how reducing the scale of transmitting is to realize the key of communication fast and efficiently in network.
In order to reduce the scale of transmitting, can carry out polymerization to transmitting.At present, main employing prefix Network Based is to transmitting the technology of carrying out polymerization, this technology is by the network prefix of each list item in the search routing table, for route table items with contiguous network prefix, reach in the contiguous network prefix under the situation of this network boundary, these route table items can be aggregated into the short list item of a network prefix, add to and transmit, reach the purpose of transmitting polymerization.
Although present aggregation scheme can reach the purpose that scale is transmitted in reduction, but the present administrative mechanism of transmitting often has complicated algorithm, can take a large amount of computational resources on the network node, cause the delay in the management process bigger, and the comparatively simple mechanism of algorithm can not effectively be reduced the scale of transmitting.
Problem at can't effectively reducing the scale of transmitting in the correlation technique does not propose effective solution at present as yet.
Summary of the invention
At the problem that can't effectively reduce the scale of transmitting in the correlation technique, the present invention proposes processing method and the device transmitted, can be simply, determine not add to route table items in transmitting apace, effectively avoid unnecessary route table items joined and transmit.
Technical scheme of the present invention is achieved in that
A kind of processing method of transmitting comprises:
When first route table items in the routing table is handled, the network equipment judge whether exist in transmitting can described first route table items of polymerization the secondary route list item;
If there is described secondary route list item, and the next hop address of described first route table items is identical with the next hop address of described secondary route list item, then forbids described first route table items is added in described the transmitting.
Further, said method also comprises:
If exist the next hop address of described secondary route list item and described first route table items different in described the transmitting, then described first route table items added in described the transmitting with the next hop address of described secondary route list item.
Wherein, the port address of described secondary route list item is identical with the next hop address of forbidden described first route table items.
And after adding to described first route table items in described the transmitting, described method further comprises:
Described first route table items corresponding state in described routing table is changed to forwarding state.
Further, said method also comprises:
Under described secondary route list item is present in situation in described the transmitting,, then adds to described first route table items in described the transmitting and from described transmitting, delete described secondary route list item if desired with described secondary route list item deletion.
Further, said method also comprises:
If there is no described secondary route list item then adds described first route table items in described the transmitting to.
Wherein, described first route table items can be meant by the polymerization of described secondary route list item: the preceding N position network prefix of described first route table items is identical with the overall network prefix of described secondary route list item, wherein, the figure place of the overall network prefix of described first route table items is greater than N.
A kind of processing unit of transmitting comprises:
Judge module, when being used for first route table items of routing table handled, judge whether exist in transmitting can described first route table items of polymerization the secondary route list item;
Processing module, be used for transmitting under the next hop address that has described secondary route list item and described first route table items situation identical, forbid described first route table items is added in described the transmitting with the next hop address of described secondary route list item described.
Further, said apparatus also comprises:
Add module, be used for transmitting when not having described secondary route list item, described first route table items is added in described the transmitting described; Also be used for having described secondary route list item, and under the next hop address of described first route table items situation different, described first route table items added in described the transmitting with the next hop address of described secondary route list item.
Further, said apparatus also comprises:
Removing module, be used for being present under the described situation about transmitting at described secondary route list item, if desired with described secondary route list item deletion, then add to described first route table items in described the transmitting and the described secondary route list item of deletion from described transmitting.
By means of technique scheme of the present invention, by whether list item is present in transmitting judgement and to the judgement of list item next hop address, can determine not add to the route table items in transmitting simply, apace, effectively avoid unnecessary route table items joined and transmit, thereby in guaranteeing network, reduced the capacity of transmitting under the normal prerequisite of communication.
Description of drawings
Fig. 1 is the flow chart according to the processing method of transmitting of the embodiment of the invention;
Fig. 2 is the structure chart of network topology;
Fig. 3 is the simple knot composition of routing tree;
Fig. 4 is the flow chart according to the concrete processing procedure of the processing method of transmitting of the embodiment of the invention;
Fig. 5 is the structured flowchart according to the processing unit of transmitting of the embodiment of the invention;
Fig. 6 is the concrete structure block diagram according to the processing unit of transmitting of the embodiment of the invention.
Embodiment
The present invention is described in detail below in conjunction with accompanying drawing.
Fig. 1 is the flow chart according to the processing method of transmitting of the embodiment of the invention, and as shown in Figure 1, this method may further comprise the steps:
Step S101, when first route table items in the routing table is handled, the network equipment judge whether exist in transmitting can polymerization first route table items the secondary route list item, wherein, first route table items can be meant by the polymerization of secondary route list item: the preceding N position network prefix of first route table items is identical with the overall network prefix of secondary route list item, wherein, the figure place of the overall network prefix of first route table items is greater than N;
Step S103, if there is the secondary route list item, and the next hop address of first route table items is identical with the next hop address of secondary route list item, then forbid first route table items added to and transmit, if exist the next hop address of the secondary route list item and first route table items different in transmitting with the next hop address of secondary route list item, then first route table items is added to and to transmit, and first route table items corresponding state in routing table is changed to forwarding state; If there is no secondary route list item then adds first route table items to and transmits.
By means of above-mentioned processing, by list item whether be present in transmitting judgement and to the judgement of list item next hop address, can determine not add to the route table items in transmitting simply, apace, effectively avoid unnecessary route table items joined and transmit, thereby in guaranteeing network, reduced the capacity of transmitting under the normal prerequisite of communication.
In step S103,, judge whether the next hop address of first route table items is identical with the port address of secondary route list item if the next hop address of first route table items is identical with the next hop address of secondary route list item; If for being, then forbidding first route table items added to, judged result transmits, if judged result for not, is then added first route table items to and to be transmitted.
In specific implementation process, under the secondary route list item is present in situation in transmitting, if desired with the deletion of secondary route list item, then first route table items is added to transmit in and from transmit, delete the secondary route list item.
The present invention is based on existing route table items and carry out the incompatible compression of transmitting of autohemagglutination of network prefix, thereby the reduction that has realized transmitting clauses and subclauses has solved the problem of transmitting off-capacity.
After the network equipment is learnt routing table by various Routing Protocols, form local routing table, after local routing table is set up, local network device need screen local routing table, network node is preferably after all optimum routes, optimum route is changed to forwarding state adds to and transmit, and this is the process of transmitting of setting up, usually, the routing table that capacity is bigger can correspondingly produce bigger transmitting.
To be that example describes basic thought of the present invention below with the network topology of a reality, as shown in Figure 2, the method for building up of transmitting according to prior art, the list item 48.1.2.0/24 that transmits a redundancy of existence that forms at last, since the subnetwork prefix of this list item and list item 48.1.0.0/16 the overall network prefix identical, and the purpose IP figure place of list item 48.1.0.0/16 is less than the purpose IP figure place of list item 48.1.2.0/24, so list item 48.1.2.0/24 can be aggregated to list item 48.1.0.0/16, and, because these two list items have identical next hop address and outbound port, like this, even 48.1.2.0/16 adds to and transmits, go to the packet of destination network segment 48.1.2.0, also can be routed to next-hop device via list item 48.1.0.0/16, as can be seen, even there is not list item 48.1.2.0/16 in transmitting, packet still can be routed to next-hop device exactly, therefore, determine 48.1.2.0/16 not to be increased to and transmit routing table being screened the back, can under the prerequisite that does not influence data packet transmission, reduce the scale of transmitting and not to be present in and to transmit.
Fig. 3 is the simple knot composition of routing tree.In actual applications, the routing tree structure need be carried a plurality of information such as purpose IP, next hop information, route-type, optimum route and forwarding state.In routing tree structure shown in Figure 3, for purpose clearly, only show the used purpose IP address of the present invention, next hop address and forwarding state, wherein, whether whether forwarding state is set identifies this route and can be added to and transmit, other routing topology informations can be with reference to the RADIX tree structure, this paper no longer describes in detail.
In the present invention, for certain route table items (for example, route table items 1), if (for example can be aggregated to another route table items, route table items 2), and route table items 1 has identical next hop address with route table items 2, then can in routing table route table items 1 be changed to forwarding state, that is, do not need route table items 1 is issued to and transmit.For example, as shown in Figure 2, list item 72.1.1.0/24 can be aggregated to 72.0.0.0/8, and 72.1.1.0/24 has identical next hop address 166.1.1.2 with 72.0.0.0/8, according to method of the present invention, during this 72.1.1.0/24 can not be added to and transmit; List item 72.1.0.0/16 also can be aggregated to 72.0.0.0/8, but because the next hop address of 72.1.0.0/16 and 72.0.0.0/8 is different, therefore, 72.1.0.0/16 need be added to and transmit.Promptly, when a certain route table items being carried out whether can carry out the inspection of polymerization, can upwards search routing tree and (generally adopt the Radix tree, BSD adopts a kind of routing table data structure) time, as shown in Figure 2, exist if run into the different list item of next hop address, just can determine that this list item can not be aggregated, the forwarding state of this list item must be set and add to and transmit.
At top this situation, also must consider the situation of routing update, for example, 72.1.0.0/16 beginning is not present in the routing table, decline forwarding state 72.1.1.0/24 be aggregated, when 72.1.0.0/16 upgrades, traversal Radix sets downwards, search the route table items that whether exists next hop address different, if there is such route table items, this route table items must be set at once is forwarding state, and adds to and transmit, and makes before this list item and the paradigmatic relation between other list items lost efficacy.
Equally, when needs (are for example deleted certain route table items from routing table, route table items 1) time, if the state of this route table items 1 is (this route table items is arranged in and transmits) when transmitting attitude, because the possible polymerization of other route table items is in route table items 1, at this moment, need traversal radix tree downwards, if exist do not put forwarding state same next (for example jump route table items, route table items 2), then needs route table items 2 added to and transmit, add process need and carry out the front route and add the method for transmitting to, execute downward traversing operation finish transmit interpolation after, route table items 1 can be deleted from routing table.Certainly, if route table items 1 is not put forwarding state, even route table items 1 is the list item that is aggregated, the deletion of route table items 1 can't influence the correctness of transmitting, and can directly delete route table items 1.
The management method of transmitting of the present invention can mainly comprise two processes upgrading and deleting in the process of transmitting, form routing table and carry out, and transmits interpolation process (being the routing update process) and routing table delete procedure.
Forwarding-table item adds process: need travel through route RADIX tree at first downwards, when searching the different route table items of next hop address, if this route table items has been put forwarding state, then do not handle, if do not put forwarding state, then this list item is changed to forwarding state, add to and transmit.In addition, jump route table items, check forwarding state,, then remove forwarding state, deletion from transmit (because the new at least list item that adds can this list item of polymerization) if forwarding state is put if search with next; If forwarding state is not put, this kind situation can be returned the polymerizable conditional code, and like this, new route table items need not upwards travel through routing tree, puts non-forwarding state (because the front has the new list item of route polymerizable with next jumping certainly).Finish downward traversal, and do not find non-forwarding state same next when jumping route, continue upwards to travel through routing table, jump route if search with next, put non-forwarding state; If search different next jumping route, put forwarding state immediately, interpolation is transmitted; If can not search any routing iinformation, put forwarding state equally, add to and transmit.
Route table items delete procedure:, also just do not need upwards to travel through routing tree because long prefix network route can not influence short prefix routing forwarding state.When the forwarding state of this route not during set, promptly do not add to and transmit, also need not to travel through routing tree (because this list item can not influence the state of transmitting) downwards; When deletion when having put the route of forwarding state, need traversal routing tree downwards, if search do not put forwarding state same next jump route, need this list item is changed to forwarding state, add to and transmit; Next jumps routes if search difference, this list item is added to transmit upgrade tabulation (because this list item might be aggregated).
By means of above-mentioned processing, can be when network node screens optimum route, carry out the inspection of forwarding-table item polymerizable information with simple, effective and efficient manner, decline forwarding state for the list item that can be aggregated, do not add and transmit, thereby can normally send and not increase under the prerequisite of processing burden of the network equipment scale that effectively reduction realizes forwarding-table item not influencing packet, effectively reduced and transmitted the cost that administers and maintains, save the processing resource of the network equipment, reduced the processing delay of transmitting; And,, can make forwarding route in the network can successfully manage the information-change of transmitting that route flapping causes by the route list item reasonably being deleted and being added management.
Fig. 4 is the detail flowchart of the processing method of transmitting of the embodiment of the invention, as shown in Figure 4, comprises following processing:
Step 403-404 begins to travel through routing tree downwards from routing node to be added, finds out first route physical node, if left child node need be searched right child node simultaneously, and carries out the processing of step 405; If search failure, then execution in step 410;
Step 405 is checked route information on the routing node that finds, and judges that at first the next hop information of this node and the next hop information of route table items to be added are inconsistent, if next hop address is identical, carries out according to step 408; If next hop address is inequality, then handle according to step 406;
Step 406 is checked the forwarding state that searches routing node, that is, whether this route has added to is transmitted.If this route is a forwarding state, then 410 continuation are handled set by step; If this route is non-forwarding state, then 407 continuation are handled set by step;
Whether step 408 when finding the routing node with identical next hop address, is at first judged the forwarding state of this route, added and transmitted.If non-forwarding state illustrates that then this list item can be aggregated to a certain of front originally and transmit, so list item to be added also can be aggregated, do not need to add and transmit, 413 handle set by step;
Step 411 confirms whether can find the real information of transmitting, if can not find, handles according to step 414; If can find, then handle according to step 412;
Step 412 is transmitted node inspection to what find, obtains the next hop information of transmitting, and compares with the next hop address of route to be added, if next hop address is identical, then handles according to step 413; If next hop address is inequality, then handle according to step 414;
Step 414 is changed to forwarding with the forwarding state of routing node to be added, adds to and transmits;
Step 421-422 transmits deletion to the route to be deleted in the route renewal and handles, before deletion, at first need to judge the state of this route, whether added to and transmitted, if this list item is not put forwarding state, promptly this list item does not add to and transmits, and then handles according to step 427; Otherwise continue to handle according to step 423;
Whether step 423-424 treats remove entries and carries out the downward traversal of transmitting, confirm to have longer prefix entries to exist.Handle according to step 425 if can find forwarding-table item then continue; Otherwise handle according to step 427;
Whether step 425 is checked the information of the list item that searches, more consistent with this list item than the next hop address for the treatment of remove entries.If two next hop address are identical, then handle according to step 426, if inequality, then handle according to step 402;
Step 427 is directly deleted this list item from routing table.
Fig. 5 is the structured flowchart according to the processing unit of transmitting of the embodiment of the invention, and as shown in Figure 5, this device comprises:
Add module 52, be used for when there is not the secondary route list item in the judged result of judge module for transmitting, first route table items is added to transmit; Also be used for having the secondary route list item, and the next hop address of first route table items is different with the next hop address of secondary route list item, first route table items is added to transmit.
Said apparatus can also comprise removing module 54, be used for being present under the situation about transmitting at the secondary route list item, if desired with secondary route list item deletion, then first route table items is added to transmit in and from transmit, delete the secondary route list item.
In order to guarantee that routing table is managed and safeguard that said apparatus can further include routing management module; In addition, in this device, carry out that list item adds and during deletion required carry out transmit traversing operation can carry out by independent module (hereinafter this module is called to transmit and searches module) (, this module will comprise the function of above-mentioned judge module, and travel through the function of searching in the time of need being included in deletion), this module executes the result that traversal can be searched after the traversal and returns to corresponding interpolation module, processing module and removing module.
In addition, above-mentioned interpolation module and processing module can be unified setting, obtain transmitting interpolation/update module, are used for determining whether to carry out the list item interpolation according to transmitting the traversal lookup result of searching module.
Fig. 6 is the preferred structure block diagram that the present invention transmits management devices.By this device, the network equipment is issuing routing table in the process of transmitting, during the route table items that is aggregated of identical next jumping is not added to and transmits, significantly reduce the redundant list item information in transmitting, thereby reach the purpose of compressing transmitting.As shown in Figure 6, this device comprises with lower module: routing management module, transmit interpolation/update module, transmit removing module (function approaches above-mentioned removing module 54) and transmit and search module.
As shown in Figure 6, routing management module is used to integrate the routing iinformation that each Routing Protocol is learnt, and adds in the routing table; This module also is used for calling respectively to be transmitted the module of interpolation/more and transmits the foundation that removing module is transmitted, routing table is managed and safeguards, and can be according to routing update information, the interpolation that trigger table interpolation/update module is transmitted when route is added; When route changes, trigger and transmit interpolation/update module upgrading to transmitting; When route is deleted, trigger and transmit the deletion that removing module carries out forwarding-table item.
Transmit interpolation/update module, (for example be used under the scheduling of routing management module, the interpolation/lastest imformation of transmitting in response to the routing management module transmission), determine optimum route according to routing iinformation, after confirming optimum route, the best route that filters out is changed to preferred route (to be added transmitting), call afterwards to transmit and search module and routing tree is traveled through search, whether this route table items is put forwarding state according to lookup result decision, and add to and transmit.
Equally, transmit the route of removing module in deletion is transmitted, also need at first to call to transmit and search module, confirm whether the deletion of this route influences the route that is aggregated, add and to transmit for being aggregated route, for treating that polymerization route notice transmits update module and upgrade again.Particularly, the above-mentioned removing module of transmitting is transmitted deletion message in response to what routing management module sent, directly deletes from routing table for the list item of not putting forwarding state; For the list item that is changed to forwarding state, before deletion, need call to transmit and search module, and search the lookup result that module returns and determine whether to delete according to transmitting.
Transmit and search module for transmitting interpolation/update module and transmitting the service of searching that removing module provides routing tree.
Particularly, for adding operation, transmitting after interpolation/update module finishes the affirmation of optimum route, transmit and search module and need begin to travel through the routing tree node downwards and upwards travel through the routing tree result from this routing tree node, and lookup result returned to transmit interpolation/update module, so that whether transmit interpolation/update module puts this route the forwarding state position according to lookup result decision and adds to and transmit, wherein, all traversing operations are and search first objective result for finishing, because no matter find the routing node that whether has identical next hop address, all determined the forwarding state of this list item.
For deletion action, transmit and search module traversal routing tree downwards, after finding routing node with identical next hop address, this routing node is notified to transmits removing module, check its forwarding state so that transmit removing module, if non-forwarding state then at first is changed to forwarding state with the route that searches, from routing table, delete this route to be deleted then; If search the routing node of different next jumping, then transmit removing module and can at first delete corresponding routing node, the route that searches is transmitted upgraded operation afterwards.
For above-mentioned interpolation operation and deletion grass group, search module and provide in the process of the preceding traversal transmitted and back traversing operation transmitting for transmitting interpolations/update module and transmitting removing module, search first transmit after till.And return to corresponding module according to lookup result, further operation is continued to finish dealing with by corresponding module (transmit interpolation/update module or transmit removing module).
In sum, by means of technique scheme of the present invention, when network node screens optimum route, can carry out the inspection of forwarding-table item polymerizable information with simple, effective and efficient manner, decline forwarding state for the list item that can be aggregated, do not add and transmit, thereby can normally send and not increase under the prerequisite of processing burden of the network equipment scale that effectively reduction realizes forwarding-table item not influencing packet, effectively reduced and transmitted the cost that administers and maintains, save the processing resource of the network equipment, reduced the processing delay of transmitting; And,, can make forwarding route in the network can successfully manage the information-change of transmitting that route flapping causes by the route list item reasonably being deleted and being added management.
The above only is preferred embodiment of the present invention, and is in order to restriction the present invention, within the spirit and principles in the present invention not all, any modification of being done, is equal to replacement, improvement etc., all should be included within protection scope of the present invention.
Claims (10)
1. a processing method of transmitting is characterized in that, comprising:
When first route table items in the routing table is handled, the network equipment judge whether exist in transmitting can described first route table items of polymerization the secondary route list item;
If there is described secondary route list item, and the next hop address of described first route table items is identical with the next hop address of described secondary route list item, then forbids described first route table items is added in described the transmitting.
2. processing method according to claim 1 is characterized in that, further comprises:
If exist the next hop address of described secondary route list item and described first route table items different in described the transmitting, then described first route table items added in described the transmitting with the next hop address of described secondary route list item.
3. processing method according to claim 1 is characterized in that,
The port address of described secondary route list item is identical with the next hop address of forbidden described first route table items.
4. processing method according to claim 1 is characterized in that, after adding to described first route table items in described the transmitting, described method further comprises:
Described first route table items corresponding state in described routing table is changed to forwarding state.
5. processing method according to claim 1 is characterized in that, also comprises:
Under described secondary route list item is present in situation in described the transmitting,, then adds to described first route table items in described the transmitting and from described transmitting, delete described secondary route list item if desired with described secondary route list item deletion.
6. processing method according to claim 1 is characterized in that, also comprises:
If there is no described secondary route list item then adds described first route table items in described the transmitting to.
7. according to each described processing method in the claim 1 to 6, it is characterized in that, described first route table items can be meant by the polymerization of described secondary route list item: the preceding N position network prefix of described first route table items is identical with the overall network prefix of described secondary route list item, wherein, the figure place of the overall network prefix of described first route table items is greater than N.
8. a processing unit of transmitting is characterized in that, comprising:
Judge module, when being used for first route table items of routing table handled, judge whether exist in transmitting can described first route table items of polymerization the secondary route list item;
Processing module, be used for transmitting under the next hop address that has described secondary route list item and described first route table items situation identical, forbid described first route table items is added in described the transmitting with the next hop address of described secondary route list item described.
9. processing unit according to claim 8 is characterized in that, also comprises:
Add module, be used for transmitting when not having described secondary route list item, described first route table items is added in described the transmitting described; Also be used for having described secondary route list item, and under the next hop address of described first route table items situation different, described first route table items added in described the transmitting with the next hop address of described secondary route list item.
10. according to Claim 8 or 9 described processing unit, it is characterized in that, also comprise:
Removing module, be used for being present under the described situation about transmitting at described secondary route list item, if desired with described secondary route list item deletion, then add to described first route table items in described the transmitting and the described secondary route list item of deletion from described transmitting.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2010102345022A CN101909005A (en) | 2010-07-20 | 2010-07-20 | Method and device for processing forwarding table |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2010102345022A CN101909005A (en) | 2010-07-20 | 2010-07-20 | Method and device for processing forwarding table |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN101909005A true CN101909005A (en) | 2010-12-08 |
Family
ID=43264328
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2010102345022A Pending CN101909005A (en) | 2010-07-20 | 2010-07-20 | Method and device for processing forwarding table |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101909005A (en) |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105379210A (en) * | 2014-02-21 | 2016-03-02 | 华为技术有限公司 | Data flow processing method and apparatus |
| CN107231304A (en) * | 2016-03-23 | 2017-10-03 | 瞻博网络公司 | For forwarding network traffics mthods, systems and devices using minimum forwarding information storehouse |
| WO2018000442A1 (en) * | 2016-07-01 | 2018-01-04 | 华为技术有限公司 | Method, apparatus and system for forwarding packet in service function chaining (sfc) |
| CN112565072A (en) * | 2020-11-02 | 2021-03-26 | 鹏城实验室 | Router compression method, router and storage medium |
| CN112787938A (en) * | 2021-01-14 | 2021-05-11 | 北京星网锐捷网络技术有限公司 | Routing table item configuration method and device |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1402488A (en) * | 2002-10-14 | 2003-03-12 | 北京港湾网络有限公司 | Routing table compression method |
| US20070165543A1 (en) * | 2006-01-19 | 2007-07-19 | Hong-Don Joo | Routing system and route update method |
| CN101110778A (en) * | 2007-07-23 | 2008-01-23 | 中兴通讯股份有限公司 | Method for compressing path transmitting table by router |
-
2010
- 2010-07-20 CN CN2010102345022A patent/CN101909005A/en active Pending
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1402488A (en) * | 2002-10-14 | 2003-03-12 | 北京港湾网络有限公司 | Routing table compression method |
| US20070165543A1 (en) * | 2006-01-19 | 2007-07-19 | Hong-Don Joo | Routing system and route update method |
| CN101110778A (en) * | 2007-07-23 | 2008-01-23 | 中兴通讯股份有限公司 | Method for compressing path transmitting table by router |
Cited By (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105379210A (en) * | 2014-02-21 | 2016-03-02 | 华为技术有限公司 | Data flow processing method and apparatus |
| US10116554B2 (en) | 2014-02-21 | 2018-10-30 | Huawei Technologies Co., Ltd. | Data flow processing method and apparatus |
| CN105379210B (en) * | 2014-02-21 | 2019-02-01 | 华为技术有限公司 | A kind of data flow processing method and device |
| CN107231304A (en) * | 2016-03-23 | 2017-10-03 | 瞻博网络公司 | For forwarding network traffics mthods, systems and devices using minimum forwarding information storehouse |
| WO2018000442A1 (en) * | 2016-07-01 | 2018-01-04 | 华为技术有限公司 | Method, apparatus and system for forwarding packet in service function chaining (sfc) |
| US11075839B2 (en) | 2016-07-01 | 2021-07-27 | Huawei Technologies Co., Ltd. | Method, apparatus, and system for forwarding packet in service function chaining SFC |
| US11671364B2 (en) | 2016-07-01 | 2023-06-06 | Huawei Technologies Co., Ltd. | Method, apparatus, and system for forwarding packet in service function chaining SFC |
| CN112565072A (en) * | 2020-11-02 | 2021-03-26 | 鹏城实验室 | Router compression method, router and storage medium |
| CN112565072B (en) * | 2020-11-02 | 2022-08-09 | 鹏城实验室 | Router compression method, router and storage medium |
| CN112787938A (en) * | 2021-01-14 | 2021-05-11 | 北京星网锐捷网络技术有限公司 | Routing table item configuration method and device |
| CN112787938B (en) * | 2021-01-14 | 2022-09-20 | 北京星网锐捷网络技术有限公司 | Routing table item configuration method and device |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US9621642B2 (en) | Methods of forwarding data packets using transient tables and related load balancers | |
| US20140369204A1 (en) | Methods of load balancing using primary and stand-by addresses and related load balancers and servers | |
| US20140372616A1 (en) | Methods of forwarding/receiving data packets using unicast and/or multicast communications and related load balancers and servers | |
| US10862800B2 (en) | Method and system for managing network communications | |
| CN1744563B (en) | Method for realizing strate gic route in Ethernet switch | |
| EP3903461B1 (en) | Packet analysis and filtering | |
| CN101106518B (en) | Service denial method for providing load protection of central processor | |
| CN103795644B (en) | Policy Table's list item collocation method, apparatus and system | |
| CN103297347B (en) | A kind of load balance process method and device | |
| KR101460048B1 (en) | Method and apparatus for control of dynamic service chaining by using tagging | |
| US11444840B2 (en) | Virtualized networking application and infrastructure | |
| CN105594176B (en) | Pass through the method and system of network interface transfers packet | |
| CN102291455A (en) | Distributed cluster processing system and message processing method thereof | |
| WO2001067662A2 (en) | Method and system for operation of a resilient closed communication network without a dedicated protection network segment | |
| CN105471747B (en) | A kind of intelligent router route selecting method and device | |
| CN101909005A (en) | Method and device for processing forwarding table | |
| CN108696438A (en) | The retransmission method and device of BIER messages | |
| CN111490939A (en) | High-performance windows network card driving method supporting advanced strategy configuration | |
| Ahmed et al. | Performance evaluation of best route and broadcast strategy for NDN producer’s mobility | |
| CN107948104A (en) | The method and switching equipment that message forwards in a kind of network address translation environment | |
| CN103457854B (en) | A kind of message forwarding method and equipment | |
| CN101340370B (en) | Link selection method and apparatus | |
| US11968113B1 (en) | Computing power routing methods, apparatus, electronic devices and storage media | |
| CN106230983A (en) | A kind of control device and method | |
| CN108199965B (en) | Flow spec table item issuing method, network device, controller and autonomous system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C12 | Rejection of a patent application after its publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20101208 |