CN108683595A - A kind of route storage method of optimization - Google Patents
A kind of route storage method of optimization Download PDFInfo
- Publication number
- CN108683595A CN108683595A CN201810369065.1A CN201810369065A CN108683595A CN 108683595 A CN108683595 A CN 108683595A CN 201810369065 A CN201810369065 A CN 201810369065A CN 108683595 A CN108683595 A CN 108683595A
- Authority
- CN
- China
- Prior art keywords
- routing
- hop
- node
- storage method
- route storage
- 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
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/74—Address processing for routing
- H04L45/745—Address table lookup; Address filtering
- H04L45/7453—Address table lookup; Address filtering using hashing
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
It is the invention discloses a kind of route storage method of optimization, the different next-hops used in routing are centrally stored, and the same next-hop can be shared by a plurality of routing.Scheme provided by the invention is by next-hop by being changed to concentrate shared storage by routing entry dispersion storage, so that identical next-hop need to only preserve portion, and can be shared by all routings for using it, a large amount of memories have been saved, have effectively been overcome the problems of in the prior art.
Description
Technical field
The present invention relates to data communication technologies, and in particular to IP route technologies.
Background technology
Routing table is usually stored in the form of binary tree in router memory, is needed according to message when E-Packeting
Destination address table of query and routing finds corresponding routing node and therefrom obtains next hop information, then according to next hop information
Decision is forwarded from which interface.
Since the routing table of inquiry binary tree form is relatively slow, in order to accelerate to forward, it will usually the knot that last time is inquired
Fruit is cached, that is, establishes Cache, can directly be looked into Cache when encountering the message of identical destination address again so as to next time
To next hop information.Since tissue, inquiry velocity are faster than looking into routing table under normal circumstances in the form of Hash table by Cache
It is more, so can first look into Cache when E-Packeting, if can find as a result, if directly forwarding, avoid the behaviour of table of query and routing
Make to accelerate to forward；If can not find out, table of query and routing is simultaneously added to query result in Cache.
In above-mentioned existing route storage scheme, since the interface quantity of router and the quantity of the opposite end connected all have
Limit, therefore the number of the different next-hops of all routings is also limited.When number of routes is more, many routings can all have
Identical next-hop, if the next-hop of every routing all independently preserves, identical next-hop can be saved many parts, wave
Take a large amount of memory headrooms.
Furthermore Cache is associated with as routing inquiry as a result, necessarily existing with routing, when routing changes, is needed
Associated Cache list items are deleted, to ensure the correctness of forwarding.In order to accomplish this point, need routing entry and
Incidence relation between Cache list items is recorded, it is common practice to a chained list or y-bend are preserved in routing entry
It sets to record the Cache list items being associated.It is new in addition to needing to add in the binary tree of routing table when adding new routing
Routing node outside, it is also necessary to traverse the associated all Cache list items of father node of new routing node, and being removed from it can be new
It is route the list item of covering, this mode largely effects on router efficiency.
Invention content
For clear statement this programme, two technical names arrived involved in this programme are explained first here：
The outgoing interface and peer IP address of-one routing of next-hop；
Cache- route-cachings, the result cache for looking into routing table, so that next time forwards the report of identical destination address
Wen Shineng is directly obtained from caching as a result, without looking into routing table again, to accelerate forwarding speed.
The problem of needing a large amount of memory headrooms for existing route storage scheme, the small road of memory headroom is occupied there is an urgent need for a kind of
By storing new departure.
For this purpose, problem to be solved by this invention is to provide a kind of route storage method of optimization, to overcome the prior art
The problems of.
To solve the above-mentioned problems, the route storage method of optimization provided by the invention, will be under the difference that used in routing
One jump is centrally stored, and the same next-hop can be shared by a plurality of routing.
Further, to organize centrally stored difference with the form of array or Hash table in the routing next
It jumps.
Further, the pointer for being directed toward next-hop is only preserved in routing node.
Further, the method records a reference count value in each next-hop, when the reference count becomes 0
When, delete the next-hop.
Further, ache management structure is added directly into the binary tree of routing table in the method.
Further, it when there is new routing node to be added, then deletes directly from the subtree of this new node and does not have all
By the node of the expression Cache of other routing coverings.
Scheme provided by the invention is by next-hop by being changed to concentrate shared storage by routing entry dispersion storage so that phase
Same next-hop need to only preserve portion, and can be shared by all routings for using it, save a large amount of memories, effectively overcome existing
The problem of having in the presence of technology.
Furthermore Cache is further managed structure and is integrated with routing table to accelerate Cache to refresh by this programme, is carried significantly
The update efficiency of height routing.
Description of the drawings
It is further illustrated the present invention below in conjunction with the drawings and specific embodiments.
Fig. 1 is that the routing optimized in present example stores schematic diagram.
Specific implementation mode
In order to make the technical means, the creative features, the aims and the efficiencies achieved by the present invention be easy to understand, tie below
Conjunction is specifically illustrating, and the present invention is further explained.
This programme uses the mode of centrally stored next-hop so that identical next-hop need to only preserve portion, and can be by
All routings for using it are shared, thus save a large amount of memories.
Specifically, this programme saves all different next-hops concentrations used that route, here can with array or
The form of Hash table organizes so that identical next-hop need to only preserve portion.
When managing different next-hops concentratedly, all different next-hops can be stored in an array with array.
It when adding new next-hop, is searched in the array first, whether inquiry has existed identical next-hop, if deposited
Then this already existing next-hop is being returned as a result；If it does not exist, then being inserted into new next-hop knot in array
Structure is then back to this new next-hop.
Meanwhile only needing to preserve the pointer for the next-hop structure being directed toward in above-mentioned array in routing node, without repeating
Preserve the content of next-hop；Next-hop pointer in different routing nodes can be directed toward the same next-hop structure, so that
The same next-hop structure can be shared by a plurality of routing, that is, all routings for possessing identical next-hop are shared under portion
One jumps structure, can greatly save memory.
A reference count value is recorded in this programme in each next-hop, indicates that how many item routing is quoting it
When the reference count becomes 0 (it is used without routing in (having pointer to be directed toward it in how many routing node)
When), the next-hop is deleted, is removed from next skip list.
What this programme was innovated as a result, is changed to concentrate shared storage by next-hop by storing by routing entry dispersion, effectively
Saving memory.
On this basis, this programme further integrates Cache management structure with routing table, is achieved in raising
Routing update efficiency.
This programme using Cache management structures it is virtual as one by prefix of destination address with complete 1 for mask routing
It is equally added directly into the binary tree of routing table by node with addition routing, without deliberately with certain true routing phase
Association.
Accordingly, it if there is new routing node is added, then deletes directly from the subtree of this new node and does not have all
By the node of the expression Cache of other routing coverings, chained list or tree are traversed again without tracing back to father node, operate nature and
It is more efficient.
For said program, illustrated below by way of an example.
Referring to Fig. 1 which shows realize routing for the centrally stored and shared schematic diagram of next-hop in this example.
As seen from the figure, all different next-hops concentrations used that route are saved in this example so that next hop count
Group is globally unique, and each next-hop can be shared by a plurality of routing.
In scheme shown in attached drawing, there are two the next-hop pointers of routing node to be directed toward the same next-hop structure, then table
The next-hop of bright this two routings is identical.
Furthermore Cache management nodes are added as common routing node in routing table this example, what the inside preserved
Do not refer to the pointer of down hop, and is directed to the pointers of Cache contents (in such as attached drawing, solid node indicates routing node, empty
Heart node indicates Cache management nodes).Cache management nodes are corresponded with Cache list items, indicate corresponding Cache list items
Dependent on the immediate routing node of Cache management nodes.In this way, when routing changes, directly changing
Routing node subtree in all Cache management nodes and its corresponding Cache list items delete.
For example, there is two Cache list items, destination address is respectively 1.1.1.10 and 1.1.0.5, all relies on same road
By 1.1.0.0/16, if increasing new this Cache management node of routing 1.1.1.0/24,1.1.1.10 at this time
It will be located at using new routing node 1.1.1.0/24 (to be covered by new routing) in the subtree of root, then this Cache is needed
It is to be deleted (hereafter if also having the flow to 1.1.1.10, this Cache that be subsequently supplied, but new routing will to be depended on
1.1.1.0/24)；And 1.1.0.5 is using newly-increased routing node in the subtree of root, to be not covered with, so without deleting
It removes, still relies on original routing 1.1.0.0/16.
The basic principles, main features and advantages of the present invention have been shown and described above.The technology of the industry
Personnel are it should be appreciated that the present invention is not limited to the above embodiments, and the above embodiments and description only describe this
The principle of invention, without departing from the spirit and scope of the present invention, various changes and improvements may be made to the invention, these changes
Change and improvement all fall within the protetion scope of the claimed invention.The claimed scope of the invention by appended claims and its
Equivalent thereof.
Claims (6)
1. the route storage method of optimization, which is characterized in that the different next-hops used in routing are centrally stored and same
Next-hop can be shared by a plurality of routing.
2. route storage method according to claim 1, which is characterized in that using array or the form tissue of Hash table
Manage centrally stored different next-hops.
3. route storage method according to claim 1, which is characterized in that only preserved in routing node and be directed toward next-hop
Pointer.
4. route storage method according to claim 1, which is characterized in that the method records one in each next-hop
A reference count value deletes the next-hop when the reference count becomes 0.
5. route storage method according to claim 1, which is characterized in that in the method that ache management structure is direct
It is added in the binary tree of routing table.
6. route storage method according to claim 5, which is characterized in that when there is new routing node to be added, then directly
It connects and is deleted from the subtree of this new node all not by the node of the expression Cache of other routing coverings.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810369065.1A CN108683595A (en) | 2018-04-23 | 2018-04-23 | A kind of route storage method of optimization |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810369065.1A CN108683595A (en) | 2018-04-23 | 2018-04-23 | A kind of route storage method of optimization |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN108683595A true CN108683595A (en) | 2018-10-19 |
Family
ID=63801141
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810369065.1A Pending CN108683595A (en) | 2018-04-23 | 2018-04-23 | A kind of route storage method of optimization |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108683595A (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1897560A (en) * | 2005-07-12 | 2007-01-17 | 中兴通讯股份有限公司 | Method for improving routing list capacity |
| CN1897562A (en) * | 2005-07-12 | 2007-01-17 | 华为技术有限公司 | Method for storing routing hop and next skip list by routing hop |
| CN102035738A (en) * | 2010-12-14 | 2011-04-27 | 中兴通讯股份有限公司 | Method and device for acquiring routing information |
| US20150078384A1 (en) * | 2013-09-15 | 2015-03-19 | Nicira, Inc. | Tracking Prefixes of Values Associated with Different Rules to Generate Flows |
| CN107204926A (en) * | 2017-05-16 | 2017-09-26 | 上海博达数据通信有限公司 | Pre-process cache route fast searching method |
-
2018
- 2018-04-23 CN CN201810369065.1A patent/CN108683595A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1897560A (en) * | 2005-07-12 | 2007-01-17 | 中兴通讯股份有限公司 | Method for improving routing list capacity |
| CN1897562A (en) * | 2005-07-12 | 2007-01-17 | 华为技术有限公司 | Method for storing routing hop and next skip list by routing hop |
| CN102035738A (en) * | 2010-12-14 | 2011-04-27 | 中兴通讯股份有限公司 | Method and device for acquiring routing information |
| US20150078384A1 (en) * | 2013-09-15 | 2015-03-19 | Nicira, Inc. | Tracking Prefixes of Values Associated with Different Rules to Generate Flows |
| CN107204926A (en) * | 2017-05-16 | 2017-09-26 | 上海博达数据通信有限公司 | Pre-process cache route fast searching method |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US6490592B1 (en) | Method of and apparatus for generating a tree data structure supporting longest match lookup | |
| CN102484610B (en) | Routing table construction method and device and routing table lookup method and device | |
| CN100496019C (en) | A method to quickly search and update IPv6 routing list | |
| US7774538B2 (en) | Method for ternary contents address memory table management | |
| CN103560959B (en) | Method and device for selecting static route | |
| CN103546380B (en) | A kind of message forwarding method based on policybased routing and device | |
| CN100566281C (en) | The method and apparatus of virtual private network routing search | |
| CN103780491B (en) | A kind of method for realizing IPv6 fast routing lookups | |
| CN101695054A (en) | Method and device for route maintenance and method and device for route query | |
| CN101582851B (en) | Method and system for realizing sharing route capacity on dual-stacker router | |
| CN102405623A (en) | Method and device for storing routing table entry | |
| CN101620623A (en) | Method and device for managing list item of content addressable memory CAM | |
| CN108600099A (en) | A kind of message forwarding method, device and Leaf equipment | |
| CN101171802B (en) | Node, network, creating method of corresponding relation for transmitting information in network | |
| CN113810287B (en) | Data retrieval and pushing method based on NDN and SDN | |
| CN100397816C (en) | Method for classifying received data pocket in network apparatus | |
| CN101562574A (en) | Method for updating routing list and device thereof | |
| CN103238300B (en) | The method and device that out-of-date route in the routing information storehouse of managing network element removes | |
| CN107181683B (en) | Vehicle-mounted network data distribution route maintenance method combining named data network and road name | |
| CN108683595A (en) | A kind of route storage method of optimization | |
| CN100393072C (en) | Method and apparatus for storing table entry, and inquiry method | |
| KR102287520B1 (en) | Method for Managing Domain Routing Table in Router on Network Structure Based on Hierarchical Domain | |
| CN106656816B (en) | Distributed ipv6 method for searching route and system | |
| CN102724061B (en) | A kind of network interface management method | |
| CN102045262B (en) | Updating method, device and network equipment of media access control address table |
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 | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20181019 |
|
| RJ01 | Rejection of invention patent application after publication |