CN106961388A - Fib table decomposition method based on multiple order of magnitude line card - Google Patents

Fib table decomposition method based on multiple order of magnitude line card Download PDF

Info

Publication number
CN106961388A
CN106961388A CN201710110660.9A CN201710110660A CN106961388A CN 106961388 A CN106961388 A CN 106961388A CN 201710110660 A CN201710110660 A CN 201710110660A CN 106961388 A CN106961388 A CN 106961388A
Authority
CN
China
Prior art keywords
line card
storage
line
stored
decomposition
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.)
Granted
Application number
CN201710110660.9A
Other languages
Chinese (zh)
Other versions
CN106961388B (en
Inventor
陈文龙
陈赫阳
张硕
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Capital Normal University
Original Assignee
Capital Normal University
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Capital Normal University filed Critical Capital Normal University
Priority to CN201710110660.9A priority Critical patent/CN106961388B/en
Publication of CN106961388A publication Critical patent/CN106961388A/en
Application granted granted Critical
Publication of CN106961388B publication Critical patent/CN106961388B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/74Address processing for routing
    • H04L45/742Route cache and its operation
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/48Routing tree calculation
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/54Organization of routing tables

Abstract

The invention discloses a kind of fib table decomposition method of multiple order of magnitude line card and system, this method includes:The saturation degree of all line cards is obtained, the minimum line card of selection saturation degree 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 route spanning tree is to obtain the residue node that can to store entry equal with the selected line card;Selected subtree is moved to and stored in the selected line card, and deletes subtree stored in the route spanning tree;Repeat the above steps, until whole Node Decompositions of the route spanning tree are stored in multiple line cards.The invention has the advantages that:Reduce each piece of line card in conventional router and store the storage strategies of whole route table items completely respectively and cause the waste to the memory space of hardware;The burden of router forwarding is reduced simultaneously.

Description

Fib table decomposition method based on multiple order of magnitude line card
Technical field
The present invention relates to router technology field, and in particular to a kind of fib table decomposition method of multiple order of magnitude line card.
Background technology
The forwarding-table item of core router generates explosion type amplification, and the route entry in conventional router takes each piece Line card stores the storage strategy of whole route table items completely respectively, on the one hand the memory space of hardware is caused to waste, the opposing party Very big burden is brought to the realization of router forwarding capability in face.Under conventional model, the route that the polylith line card of router can be accommodated Entry number is identical.
Part storage relative to complete storage, be by whole route entrys in order be divided into some groups, be respectively stored in many On block line card, a part for full routing table is only stored on every piece of line card.DSF storage models are entered according to some bit of IP prefixes Row forward table decomposes storage, and full routing table is resolved into some groups and is stored in multiple line cards, so as to reach the portion of routing table Divide storage.This storage mode distributes whole route entrys according to line card number, but because former positions of entry prefix are differed Fixed equilibrium, so DSF stores entry not necessarily uniform defect there is also each line card.
The content of the invention
It is contemplated that at least solving one of above-mentioned technical problem.
Therefore, 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 these goals, embodiment of the invention discloses that a kind of fib table decomposition method of multiple order of magnitude line card, bag Include following steps:S110:The saturation degree of all line cards is obtained, the minimum line card of selection saturation degree is selected line card;S120:According to The residue that the storage allowed band of setting calculates the selected line card can store entry;S130:Sequence traversal route spanning tree with Obtain the remaining node that can to store entry equal with the selected line card;S140;Selected subtree is moved into the selected line card It is middle to be stored, and delete subtree stored in the route spanning tree;S150:S110-S140 is repeated, until will be described Whole Node Decompositions of route spanning tree are stored in multiple line cards.
The fib table decomposition method of multiple order of magnitude line card according to embodiments of the present invention, full routing table is stored by decomposing A part, reaches the decomposition storage of complete fib table, to reduce because each piece of line card is stored 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 such as The technical characteristic added down:
Further, the memory capacity of each line card is different, wherein, define line card storage saturation degree Line Card Sauration (LS), i.e., described line card storage saturation degree is the percentage that independent line card amount of storage accounts for capacity.
Further, it is for the storage condition of any line card, initial route table entry N limitations:1<N<C*TLS, wherein, TLS represents default line card storage threshold value, and C represents line card memory capacity;The storage of any line card can allow saturation degree range L S< N/C*100%.
Further, the storage allowed band is converged on for representing that line card stores the storage threshold value of limit.
The additional aspect and advantage of the present invention will be set forth in part in the description, and will partly become from the following description Obtain substantially, or recognized by the practice of the present invention.
Brief description of the drawings
Description of the advantages of the present invention combination accompanying drawings below to embodiment will be apparent and be readily appreciated that, wherein:
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 route 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 route spanning tree after the renewal of one embodiment of the invention;
Fig. 5 is the schematic diagram of multiple line card current storage capacities after the renewal of one embodiment of the invention.
Embodiment
Embodiments of the invention are described below in detail, the example of the embodiment is shown in the drawings, wherein from beginning to end Same or similar label represents same or similar element or the element with same or like function.Below with reference to attached The embodiment of figure description is exemplary, is only used for explaining the present invention, and is not considered as limiting the invention.
In the description of the invention, it is to be understood that term " first ", " second " are only used for describing purpose, and can not It is interpreted as indicating or implying relative importance.
With reference to following description and accompanying drawing, it will be clear that these and other aspects of embodiments of the invention.In these descriptions In accompanying drawing, some particular implementations in embodiments of the invention are specifically disclosed, to represent the implementation for implementing the present 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, the present invention Embodiment includes the spirit for falling into attached claims and all changes, modification and the equivalent in the range of intension.
The present invention is described below in conjunction with accompanying 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 The fib table decomposition method based on multiple order of magnitude line card is planted, is comprised the following steps:
S110:The saturation degree of all line cards is obtained, the minimum line card of selection saturation degree 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 is traveled through Route spanning tree is to obtain the residue node that can to store entry equal with selected line card.
S140:Selected subtree is moved to and stored in the selected line card, and is deleted in the route spanning tree The subtree of storage.
S150:S110-S140 is repeated, until the whole Node Decompositions for routeing 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 the amount of storage of the different line cards of identical canonical representation, define line card storage saturation degree Line Card Sauration (LS), i.e., independent line card amount of storage accounts for the percentage of capacity..
In one embodiment of the invention, it is for the storage condition of any line card:
Initial route table entry N is limited:1<N<C*TLS, wherein, TLS represents default line card storage threshold value, and C represents line Card memory capacity;
The storage of any line card can allow saturation degree range L S<N/C*100%.
In one embodiment of the invention, storage allowed band converges on the storage threshold value for representing that line card stores limit.
In one embodiment of the invention, when N is more than TLS*C, taking the mode of terminal route aggregation makes N controls exist Within the scope of.
To make it is further understood that the present invention, will be described in detail by following examples.
Fig. 2 is the schematic diagram of the route 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 in order that the dummy node that spanning tree is completely built.
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 the saturation degree of line card, find the minimum line card LC of saturation degree, that is, select saturation degree to carry out decomposition storage for 40% line card.If There is the saturation degree of some pieces of line cards equal, it is the big line card of hardware surplus that acquiescence, which makes LC,.
The residue for making m be LC by calculating can store entry, the total entry * LS Per LC-LC storages of wherein m=LC, i.e., not More than the surplus of critical value.
Sequence traversal route spanning tree finds m values, can not find and m=m-1 is just traveled through into spanning tree again.
Assuming that the tree node that m=5 is searched out, the subtree found is moved into line card LC, update line card LC storage value, ls with And route spanning tree.The state of multiple line card current storage capacities and route spanning tree after renewal is respectively such as Fig. 4 and Fig. 5 institutes Show.
Repeat to patrol all line cards saturation degree to the step of renewal between line card, until whole sections of spanning tree will be route Point decomposition is stored in multiple line cards.
The fib table decomposition method based on multiple order of magnitude line card of the embodiment of the present invention exists following excellent relative to prior art Point:
By necessarily decomposing the part that storage algorithm makes each line card store full routing table respectively, complete FIB is reached The decomposition storage of table.
In order to further up to energy-conservation, maintain the controllable target of routing table, a line card storage threshold can be set in router Value, to represent that line card stores accessible limit.In storing process, the storage saturation degree of line card will be maintained under threshold value, So that every piece of line card is excessively to store, excessive space will not be also wasted, allows line card to reach decomposition in particular cases It is balanced.
In addition, fib table decomposition method and other compositions of system and the effect of the multiple order of magnitude line card of the embodiment of the present invention All it is known for a person skilled in the art, in order to reduce redundancy, does not repeat.
In the description of this specification, reference term " one embodiment ", " some embodiments ", " example ", " specifically show The description of example " or " some examples " etc. means to combine specific features, structure, material or the spy that the embodiment or example are described Point is contained at least one embodiment of the present invention or example.In this manual, to the schematic representation of above-mentioned term not Necessarily refer to identical embodiment or example.Moreover, specific features, structure, material or the feature of description can be any One or more embodiments or example in combine in an appropriate 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 In the case of departing from the principle and objective of the present invention a variety of change, modification, replacement and modification can be carried out to these embodiments, this The scope 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, it is characterised in that comprise the following steps:
S110:The saturation degree of all line cards is obtained, the minimum line card of selection saturation degree is selected line card;
S120:Entry can be stored according to the residue that the storage allowed band of setting calculates the selected line card;
S130:Sequence traversal route spanning tree is to obtain the residue node that can to store entry equal with the selected line card;
S140;Selected subtree is moved to and stored in the selected line card, and deletes stored in the route spanning tree Subtree;
S150:S110-S140 is repeated, until whole Node Decompositions of the route spanning tree are stored in multiple line cards.
2. the fib table decomposition method according to claim 1 based on multiple order of magnitude line card, it is characterised in that each line card Memory capacity is different, wherein, define line card storage saturation degree Line Card Sauration (LS), the line card storage Saturation degree is the percentage that independent line card amount of storage accounts for capacity.
3. the fib table decomposition method according to claim 2 based on multiple order of magnitude line card, it is characterised in that for any line The storage condition of card is:
Initial route table entry N is limited:1<N<C*TLS, wherein, TLS represents default line card storage threshold value, and C represents that line card is deposited Store up capacity;
The storage of any line card can allow saturation degree range L S<N/C*100%.
4. the fib table decomposition method according to claim 2 based on multiple order of magnitude line card, it is characterised in that the storage is permitted Perhaps scope is converged on for representing that line card stores the storage threshold value of limit.
CN201710110660.9A 2017-02-28 2017-02-28 The fib table decomposition method of multiple order of magnitude line card Active CN106961388B (en)

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 true CN106961388A (en) 2017-07-18
CN106961388B 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)

* Cited by examiner, † Cited by third party
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

Patent Citations (4)

* Cited by examiner, † Cited by third party
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)

* Cited by examiner, † Cited by third party
Title
王淑贤 等: "基于可扩展路由体系的路由均衡存储转发模型", 《计算机应用与软件》 *
陈文龙 等: "可扩展路由器FIB表分解存储模型", 《计算机学报》 *

Also Published As

Publication number Publication date
CN106961388B (en) 2019-07-26

Similar Documents

Publication Publication Date Title
US9634867B2 (en) Computing service chain-aware paths
CN103825837B (en) A kind of method of the Distributed C DN overall schedulings of node load
US9680747B2 (en) Internet protocol and Ethernet lookup via a unified hashed trie
US7913060B2 (en) Method and apparatus for physical width expansion of a longest prefix match lookup table
Nilsson et al. IP-address lookup using LC-tries
US6081440A (en) Ternary content addressable memory (CAM) having fast insertion and deletion of data values
JP4369351B2 (en) Packet transfer device
CN106792978B (en) Cloud-based intelligent Internet of vehicles data communication method
US7039641B2 (en) Modular packet classification
EP2517420B1 (en) Systolic array architecture for fast ip lookup
EP2562978B1 (en) Content router of a content centric network
US7209976B2 (en) Protocol communication and transit packet forwarding routed between multiple virtual routers within a single physical router
US7415463B2 (en) Programming tree data structures and handling collisions while performing lookup operations
US9942149B2 (en) System and method of using an exact match table and longest prefix match table as a combined longest prefix match
US8356021B2 (en) Method and apparatus for indexing in a reduced-redundancy storage system
Kumar et al. Dual reinforcement Q-routing: An on-line adaptive routing algorithm
CN1655533B (en) Filter based on longest prefix match algorithm
US7281085B1 (en) Method and device for virtualization of multiple data sets on same associative memory
US20130308650A1 (en) Communication system, node, control server, communication method and program
US8908693B2 (en) Flow key lookup involving multiple simultaneous cam operations to identify hash values in a hash bucket
US5946679A (en) System and method for locating a route in a route table using hashing and compressed radix tree searching
TW468116B (en) High speed Internet protocol address lookups method for saving memory
Bornkamm Rates of change in vegetation during secondary succession
US20040236720A1 (en) Longest prefix match lookup using hash function
JP3199051B2 (en) Router deciding device having cache and machine-readable recording medium recording program

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