CN106961388B - The fib table decomposition method of multiple order of magnitude line card - Google Patents
The fib table decomposition method of multiple order of magnitude line card Download PDFInfo
- Publication number
- CN106961388B CN106961388B CN201710110660.9A CN201710110660A CN106961388B CN 106961388 B CN106961388 B CN 106961388B CN 201710110660 A CN201710110660 A CN 201710110660A CN 106961388 B CN106961388 B CN 106961388B
- Authority
- CN
- China
- Prior art keywords
- line card
- storage
- stored
- spanning tree
- decomposition method
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/74—Address processing for routing
- H04L45/742—Route cache; Operation thereof
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/48—Routing tree calculation
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/54—Organization of routing tables
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a kind of fib table decomposition method of multiple order of magnitude line card and systems, this method comprises: obtaining all line card storage saturation degree LS, the line card for selecting saturation degree minimum is selected line card；Entry can be stored according to the residue that the storage allowed band of setting calculates the selected line card；Sequence traversal routing spanning tree is to obtain the residue node that can to store entry equal with the selected line card；Selected subtree is moved in the selected line card and is stored, and deletes subtree stored in the routing spanning tree；It repeats the above steps, until whole Node Decompositions of the routing spanning tree are stored in multiple line cards.The present invention has the advantage that reducing the storage strategy that each piece of line card stores whole route table items completely respectively in conventional router causes the waste to the memory space of hardware；The burden of router forwarding is reduced simultaneously.
Description
Technical field
The present invention relates to router technology fields, and in particular to a kind of fib table decomposition method of multiple order of magnitude line card.
Background technique
The forwarding-table item of core router produces explosive amplification, and the routing entry in conventional router takes each piece
Line card stores the storage strategy of whole route table items completely respectively, on the one hand causes to waste to the memory space of hardware, another party
Very big burden is brought to the realization of router forwarding capability in face.Under conventional model, routing that the muti-piece line card of router can accommodate
Entry number is identical.
Part storage relative to complete storage, be by whole routing entries it is orderly be divided into several groups, be respectively stored in more
On block line card, a part of full routing table is only stored on every piece of line card.DSF storage model according to several bit of IP prefix into
Row forwarding table decomposes storage, and full routing table is resolved into several groups and is stored in multiple line cards, to reach the portion of routing table
Divide storage.This storage mode distributes whole routing entries according to line card number, but since former positions of entry prefix are different
Fixed equilibrium, so there is also each line cards to store entry not necessarily uniform defect by DSF.
Summary of the invention
The present invention is directed at least solve one of above-mentioned technical problem.
For this purpose, it is an object of the invention to propose a kind of fib table decomposition method of multiple order of magnitude line card.
To achieve the goals above, embodiment of the invention discloses a kind of fib table decomposition method of multiple order of magnitude line card, packets
Include following steps: S110: obtaining all line card storage saturation degrees, and the line card for selecting saturation degree minimum is selected line card；S120: root
Entry can be stored according to the residue that the storage allowed band of setting calculates the selected line card；S130: sequence traversal routing spanning tree
To obtain the remaining node that can to store entry equal with the selected line card；S140；Selected subtree is moved into the selected line
It is stored in card, and deletes subtree stored in the routing spanning tree；S150: repeating S110-S140, until by institute
The whole Node Decompositions for stating routing spanning tree are stored in multiple line cards.
The fib table decomposition method of multiple order of magnitude line card according to an embodiment of the present invention, by decomposing storage full routing table
A part reaches the decomposition storage of complete fib table, to reduce since each piece of line card stores all completely respectively in conventional router
The storage strategy of route table items causes the waste to the memory space of hardware；The burden of router forwarding is reduced simultaneously.
In addition, the fib table decomposition method according to the above embodiment of the present invention based on multiple order of magnitude line card, can also have as
Under additional technical characteristic:
Further, the memory capacity of each line card is different, wherein defines line card and stores saturation degree Line Card
Saturation (LS), i.e., the described line card storage saturation degree are the percentage that independent line card amount of storage accounts for capacity.
It further, is initial route table entry N limitation: 1 < N < C*TLS for the storage condition of any line card, wherein
TLS indicates that preset line card stores threshold value, and C indicates line card memory capacity；The permissible saturation degree range L S of the storage of any line card <
N/C*100%.
Further, the storage allowed band converges on the storage threshold value for indicating line card storage limit.
Additional aspect and advantage of the invention will be set forth in part in the description, and will partially become from the following description
Obviously, or practice through the invention is recognized.
Detailed description of the invention
Advantages of the present invention combination following accompanying drawings will be apparent and be readily appreciated that the description of embodiment, in which:
Fig. 1 is the flow chart of the fib table decomposition method based on multiple order of magnitude line card of one embodiment of the invention；
Fig. 2 is the schematic diagram of the routing spanning tree of one embodiment of the invention；
Fig. 3 is the schematic diagram of multiple line card current storage capacities of one embodiment of the invention；
Fig. 4 is the schematic diagram of the updated routing spanning tree of one embodiment of the invention；
Fig. 5 is the schematic diagram of updated multiple line card current storage capacities of one embodiment of the invention.
Specific embodiment
The embodiment of the present invention is described below in detail, examples of the embodiments are shown in the accompanying drawings, wherein from beginning to end
Same or similar label indicates same or similar element or element with the same or similar functions.Below with reference to attached
The embodiment of figure description is exemplary, and for explaining only the invention, and is not considered as limiting the invention.
In the description of the present invention, it is to be understood that, term " first ", " second " are used for description purposes only, and cannot
It is interpreted as indication or suggestion relative importance.
Referring to following description and drawings, it will be clear that these and other aspects of the embodiment of the present invention.In these descriptions
In attached drawing, some particular implementations in the embodiment of the present invention are specifically disclosed, to indicate to implement implementation of the invention
Some modes of the principle of example, but it is to be understood that the scope of embodiments of the invention is not limited.On the contrary, of the invention
Embodiment includes all changes, modification and the equivalent fallen within the scope of the spirit and intension of attached claims.
The present invention is described below in conjunction with attached drawing.
Fig. 1 is the flow chart of the fib table decomposition method based on multiple order of magnitude line card of the embodiment of the present invention.As shown in Figure 1, one
Fib table decomposition method of the kind based on multiple order of magnitude line card, comprising the following steps:
S110: obtaining all line card storage saturation degrees, and the line card for selecting saturation degree minimum is selected line card.
S120: entry can be stored according to the residue that the storage allowed band of setting calculates selected line card.S130: sequence traversal
Routing spanning tree is to obtain the residue node that can to store entry equal with selected line card.
S140: selected subtree being moved in the selected line card and is stored, and is deleted in the routing spanning tree
The subtree of storage.
S150: repeating S110-S140, until the whole Node Decompositions for routing spanning tree are stored in multiple line cards.
In one embodiment of the invention, in all line cards, the memory capacity of each line card is different.Wherein,
In order to define line card and store saturation degree Line Card Saturation with the amount of storage of identical canonical representation difference line card
(LS), i.e., independent line card amount of storage accounts for the percentage of capacity.
In one embodiment of the invention, for the storage condition of any line card are as follows:
Initial route table entry N limitation: 1 < N < C*TLS, wherein TLS indicates that preset line card stores threshold value, and C indicates line
Card memory capacity；
The storage of any line card allows saturation degree range L S < N/C*100%.
In one embodiment of the invention, storage allowed band converges on the storage threshold value for indicating line card storage limit.
In one embodiment of the invention, when N is more than TLS*C, take the mode of terminal route aggregation that N control is made to exist
Within the scope of.
To make it is further understood that the present invention, will be described in detail by following embodiment.
Fig. 2 is the schematic diagram of the routing spanning tree of one embodiment of the invention.As shown in Fig. 2, wherein grayed-out nodes are table
The node of necessary being in, white nodes are to keep spanning tree complete and the dummy node of building.
Fig. 3 is the schematic diagram of multiple line card current storage capacities of one embodiment of the invention.As shown in figure 3, inspection institute
There is line card to store saturation degree, finds the smallest line card LC of saturation degree, that is, saturation degree is selected to carry out decomposition storage for 40% line card.
If have several pieces of line cards storage saturation degrees it is equal if default to enable LC be the big line card of hardware surplus.
Make the residue of m LC that can store entry by calculating, wherein the total entry * LS Per LC-LC storage of m=LC, i.e., not
More than the surplus of critical value.
Sequence traversal routing spanning tree finds m value, can not find and m=m-1 is just traversed spanning tree again.
Assuming that the tree node that m=5 is searched out, the subtree found is moved into line card LC, update storage value, the ls of line card LC with
And routing spanning tree.The state of updated multiple line card current storage capacities and routing spanning tree is respectively such as Fig. 4 and Fig. 5 institute
Show.
The step of repeating to patrol all line card storage saturation degrees between update line card, until the whole of spanning tree will be routed
Node Decomposition is stored in multiple line cards.
Compared with the existing technology, there are following excellent for the fib table decomposition method based on multiple order of magnitude line card of the embodiment of the present invention
Point:
The a part for enabling each line card store full routing table respectively by centainly decomposing storage algorithm, reaches complete FIB
The decomposition of table stores.
For the target for further reaching energy conservation, maintaining routing table controllable, a line card storage threshold can be set in router
Value, to indicate that line card stores accessible limit.In storing process, the storage saturation degree of line card be will be maintained under threshold value,
So that every piece of line card will not be stored excessively, excessive space will not be wasted, line card is allowed to reach decomposition in special circumstances
It is balanced.
In addition, the fib table decomposition method of the multiple order of magnitude line card of the embodiment of the present invention and other compositions of system and effect
All be for a person skilled in the art it is known, in order to reduce redundancy, do not repeat them here.
In the description of this specification, reference term " one embodiment ", " some embodiments ", " example ", " specifically show
The description of example " or " some examples " etc. means specific features, structure, material or spy described in conjunction with this embodiment or example
Point is included at least one embodiment or example of the invention.In the present specification, schematic expression of the above terms are not
Centainly refer to identical embodiment or example.Moreover, particular features, structures, materials, or characteristics described can be any
One or more embodiment or examples in can be combined in any suitable manner.
Although an embodiment of the present invention has been shown and described, it will be understood by those skilled in the art that: not
A variety of change, modification, replacement and modification can be carried out to these embodiments in the case where being detached from the principle of the present invention and objective, this
The range of invention is by claim and its equivalent limits.
Claims (4)
1. a kind of fib table decomposition method of multiple order of magnitude line card, which comprises the following steps:
S110: obtaining all line card storage saturation degree LS, and the line card for selecting saturation degree minimum is selected line card, wherein the line
Card storage saturation degree LS is the percentage that independent line card amount of storage accounts for capacity；
S120: entry can be stored according to the residue that the storage allowed band of setting calculates the selected line card；
S130: sequence traversal routing spanning tree is to obtain the residue node that can to store entry equal with the selected line card；
S140；Selected subtree is moved in the selected line card and is stored, and is deleted stored in the routing spanning tree
Subtree；
S150: repeating S110-S140, until whole Node Decompositions of the routing spanning tree are stored in multiple line cards.
2. the fib table decomposition method of multiple order of magnitude line card according to claim 1, which is characterized in that the storage of each line card
Capacity is different.
3. the fib table decomposition method of multiple order of magnitude line card according to claim 2, which is characterized in that for any line card
Storage condition are as follows:
Initial route table entry N limitation: 1 < N < C*TLS, wherein TLS indicates that preset line card stores threshold value, and C indicates that line card is deposited
Store up capacity；
The storage of any line card allows saturation degree range L S < N/C*100%.
4. the fib table decomposition method of multiple order of magnitude line card according to claim 2, which is characterized in that the storage allows model
Enclose the storage threshold value converged on for indicating line card storage limit.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710110660.9A CN106961388B (en) | 2017-02-28 | 2017-02-28 | The fib table decomposition method of multiple order of magnitude line card |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710110660.9A CN106961388B (en) | 2017-02-28 | 2017-02-28 | The fib table decomposition method of multiple order of magnitude line card |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106961388A CN106961388A (en) | 2017-07-18 |
| CN106961388B true CN106961388B (en) | 2019-07-26 |
Family
ID=59470074
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710110660.9A Active CN106961388B (en) | 2017-02-28 | 2017-02-28 | The fib table decomposition method of multiple order of magnitude line card |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106961388B (en) |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102231699A (en) * | 2011-06-13 | 2011-11-02 | 迈普通信技术股份有限公司 | Route processing method in distributed system and distributed system |
| CN102594699A (en) * | 2012-01-13 | 2012-07-18 | 清华大学 | Routing method based on routing list decomposition storage for extensible router system |
| CN105262684A (en) * | 2015-10-23 | 2016-01-20 | 首都师范大学 | Real-time dynamic decomposition storage method for routing table and route data forwarding method |
| US9491087B1 (en) * | 2012-11-28 | 2016-11-08 | The Arizona Board Of Regents On Behalf Of The University Of Arizona | Devices and methods for forwarding information base aggregation |
-
2017
- 2017-02-28 CN CN201710110660.9A patent/CN106961388B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102231699A (en) * | 2011-06-13 | 2011-11-02 | 迈普通信技术股份有限公司 | Route processing method in distributed system and distributed system |
| CN102594699A (en) * | 2012-01-13 | 2012-07-18 | 清华大学 | Routing method based on routing list decomposition storage for extensible router system |
| US9491087B1 (en) * | 2012-11-28 | 2016-11-08 | The Arizona Board Of Regents On Behalf Of The University Of Arizona | Devices and methods for forwarding information base aggregation |
| CN105262684A (en) * | 2015-10-23 | 2016-01-20 | 首都师范大学 | Real-time dynamic decomposition storage method for routing table and route data forwarding method |
Non-Patent Citations (2)
| Title |
|---|
| 可扩展路由器FIB表分解存储模型;陈文龙 等;《计算机学报》;20110930;第1611-1620页 |
| 基于可扩展路由体系的路由均衡存储转发模型;王淑贤 等;《计算机应用与软件》;20151031;第32卷(第10期);第130-143页 |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106961388A (en) | 2017-07-18 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| EP2560327B1 (en) | Routing table establishment method and device | |
| US9819637B2 (en) | Efficient longest prefix matching techniques for network devices | |
| CN105141525B (en) | IPv6 method for searching route and device | |
| WO2014180307A1 (en) | Configuring forwarding information | |
| CN102405623B (en) | Method and device for storing routing table entry | |
| US11558294B2 (en) | Dynamic forward information base prefix optimization | |
| EP3661153B1 (en) | Building decision tree for packet classification | |
| CN106416152B (en) | A kind of lookup device searches configuration method and lookup method | |
| CN103780491A (en) | Method for realizing IPv6 fast route lookup | |
| CN101695054A (en) | Method and device for route maintenance and method and device for route query | |
| CN108259346A (en) | A kind of equivalent route item establishing method and device | |
| CN106330716B (en) | IP route searching method and device | |
| CN106961388B (en) | The fib table decomposition method of multiple order of magnitude line card | |
| CN106656816B (en) | Distributed ipv6 method for searching route and system | |
| US10454825B2 (en) | Hybrid routing table for routing network traffic | |
| CN105227468B (en) | A kind of lookup device, lookup method and configuration method | |
| CN103581023A (en) | Method and device for realizing longest mask matching | |
| CN106302178A (en) | A kind of method for searching route and device | |
| CN111865804B (en) | Method and system for improving route issuing efficiency through hardware packet issuing mechanism | |
| Erdem et al. | Array design for trie-based ip lookup | |
| CN106330721B (en) | IP method for searching route and device | |
| CN105099732B (en) | A kind of methods, devices and systems identifying abnormal IP traffic | |
| US20030031179A1 (en) | Self-updateable longest prefix matching method and apparatus | |
| CN104780100A (en) | Routing search method and router | |
| CN112565089B (en) | Method and device for processing routing information |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |