CN102594699A - Routing method based on routing list decomposition storage for extensible router system - Google Patents
Routing method based on routing list decomposition storage for extensible router system Download PDFInfo
- Publication number
- CN102594699A CN102594699A CN2012100655748A CN201210065574A CN102594699A CN 102594699 A CN102594699 A CN 102594699A CN 2012100655748 A CN2012100655748 A CN 2012100655748A CN 201210065574 A CN201210065574 A CN 201210065574A CN 102594699 A CN102594699 A CN 102594699A
- Authority
- CN
- China
- Prior art keywords
- prefix
- ply
- yarn drill
- route
- routing
- 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 routing method based on routing list decomposition storage for an extensible router system. The method comprises the following steps: A: calculating the number of unit prefixes according to the number (n) of system line cards; B: creating a maping relation between the unit prefixes and the line cards; C: storing real routing lists in a decomposition manner according to the maping relation; D: creating and storing a virtual router of the unit prefixes; and E: forwarding and processing message according to the virtual router and the decomposed real routing lists. Through the method provided by the invention, the total storage and forwarding items of the system and the storage and forwarding items of each line card are greatly reduced, the seeking frequency is reduced, and accordingly, the storage expense and energy consumption of the extensible router are reduced, and the hardware resource is saved.
Description
Technical field
The present invention relates to internet ip router architecture studying technological domain, relate in particular to a kind of expandable route system method for routing that decomposes storage based on routing table.
Background technology
The sharp increase that significant problem is exactly the core router routing table that the Internet fast development brings.We need dispose more jumbo route querying and storage chip in router.And commercial routers generally adopts full redundancy backup method storage route table items, and this method makes every ply-yarn drill (LC, Line Card) all will expand hardware resource in a large number, and chip power supply that thereupon brings and radiating treatment also can consume more electric power resource.Along with the development of router system to expandable structure, it is more outstanding that this problem seems.
Expandable route is a unified route system that is formed by experimental process router cascade.It has great extensibility at aspects such as function, performance, interface scales.Its major advantage has: protection operation in early stage is invested, is improved systematic function, strengthens reliability, simplifies network topology etc.A key character of expandable route is that ply-yarn drill quantity sharply increases, and in expandable route, seems more outstanding so routing list capacity increases the contradiction that causes consuming more hardware resources and electric energy.
Existing routing table research mainly concentrates on through parallel processing and improves inquiry velocity; Decompose storage scheme though there is document to propose routing table; But still there are a large amount of redundant storage of transmitting, increased the storage overhead and the energy consumption of expandable route, wasted hardware resource at the polylith ply-yarn drill.
Summary of the invention
The technical problem that (one) will solve
The technical problem that the present invention will solve is: how to realize the decomposition storage of routing table effectively, reduce storage redundancy, reduce and search number of times, thereby reduce the storage overhead and the energy consumption of expandable route effectively, save hardware resource.
(2) technical scheme
For addressing the above problem, the invention provides a kind of expandable route system method for routing based on routing table decomposition storage, may further comprise the steps:
A: according to the quantity of the ply-yarn drill quantity n of system computing unit prefix;
B: the mapping relations of setting up unit prefix and ply-yarn drill;
C: decompose the true routing table of storage according to said mapping relations;
D: the virtual route and the storage of constructing said unit prefix;
E: carry out message according to the true routing table after said virtual route and the said decomposition and transmit processing.
Wherein, said steps A further comprises:
A1: calculate decomposition position
and represent unit prefix i according to the principle that preceding k bit value in the IP prefix equals i;
A2: the quantity
of calculating decomposable unit prefix
Wherein, said step B further may further comprise the steps:
B1:, then shine upon according to the form of m the corresponding m piece of unit prefix ply-yarn drill if n is 2 index;
B2: if n is not 2 index; Then with of the form mapping of preceding n unit prefix according to m the corresponding m piece of unit prefix ply-yarn drill; Is that 0 ply-yarn drill begins to continue to shine upon in order with remaining unit prefix from card number, and unit prefix i and card number are shone upon for the ply-yarn drill of (i-n).
Wherein, said step C further may further comprise the steps:
Whether the mask-length that detects the true route prefix in the routing table is less than k, if then this true route prefix is stored in all ply-yarn drills for assembling prefix; If not, then this route prefix is stored in the corresponding ply-yarn drill of the unit prefix of its ownership.
Wherein, said step D further may further comprise the steps:
A D1: describe with the mode of < destination network segment, outlet card number, outgoing interface number, next hop address>and to transmit;
D2: to arbitrary unit prefix i, if its corresponding ply-yarn drill j, then constructing destination network segment <unit prefix i, j, Inv, Inv>is the virtual route of this unit prefix, and wherein, Inv representes an invalid value;
D3: the virtual route of being constructed is sent to all outer ply-yarn drill storages of ply-yarn drill j.
Wherein, said step e further may further comprise the steps:
E1: through longest prefix match search receive message go into ply-yarn drill whether with the true matched routings of this message, if, execution in step E2 then, if not, execution in step E3 then;
E2: obtain all true forwarding information, and transmit this message according to said true forwarding information;
E3: this message is forwarded to the ply-yarn drill that goes out in the virtual route with its coupling through the inner exchanging network; After message arrives out ply-yarn drill; Search the true route of mating with this message through longest prefix match; And obtain all true forwarding information, and transmit this message according to said true forwarding information.
Wherein, carry out longest prefix match among said step e 1, the E3 when searching,, then abandon this message if search failure.
(3) beneficial effect
The present invention is based on expandable route system method for routing that routing table decomposes storage with IP unit prefix before some bit position serve as according to decomposing storage, realizing the decomposition storage of ply-yarn drill to routing table.This method increases a small amount of virtual route at each ply-yarn drill and coexists as one with true route entry and transmit.The inquiry of the longest prefix match of ply-yarn drill forwarding engine is integrated to the searching of virtual route and true route entry, and both can realize transmitting next and jump inquiry, can realize that again message arrives the correspondence of transmitting sublist.The present invention system that greatly reduces stores forwarding entry and each ply-yarn drill storage forwarding entry altogether, has reduced and has searched number of times, thereby reduced the storage overhead and the energy consumption of expandable route, has saved hardware resource.
Description of drawings
Fig. 1 decomposes the expandable route system method for routing of storing based on routing table in the embodiment of the present invention.
Embodiment
Below in conjunction with accompanying drawing and embodiment, specific embodiments of the invention describes in further detail.Following examples are used to explain the present invention, but are not used for limiting scope of the present invention.
As shown in Figure 1, a kind of expandable route system method for routing based on routing table decomposition storage of the present invention may further comprise the steps:
A: according to the quantity of the ply-yarn drill quantity n of system computing unit prefix;
This step specifically can realize through following steps:
A1: calculate decomposition position
and represent unit prefix i according to the principle that preceding k bit value in the IP prefix equals i;
A2: the quantity
of calculating decomposable unit prefix
B: the mapping relations of setting up unit prefix and ply-yarn drill;
This step specifically can realize through following steps:
B1:, then shine upon according to the form of m the corresponding m piece of unit prefix ply-yarn drill if n is 2 index;
B2: if n is not 2 index; This moment unit prefix sum necessarily greater than ply-yarn drill sum n less than 2n; With of the form mapping of preceding n unit prefix according to m the corresponding m piece of unit prefix ply-yarn drill; Is that 0 ply-yarn drill begins to continue to shine upon in order with remaining unit prefix from card number, and unit prefix i and card number are shone upon for the ply-yarn drill of (i-n).
C: decompose the true routing table of storage according to said mapping relations;
This step specifically can realize through following method:
Whether the mask-length that detects the true route prefix in the routing table is less than k, if then this true route prefix is stored in all ply-yarn drills for assembling prefix; If not, then its preceding k position binary value must equate with the preceding k position binary value of a certain unit prefix, explains that this route prefix belongs to this unit prefix, and store this route prefix in the corresponding ply-yarn drill of the unit prefix of its ownership into this moment.
D: the virtual route and the storage of constructing said unit prefix;
This step specifically can realize through following steps:
A D1: describe with the mode of < destination network segment, outlet card number, outgoing interface number, next hop address>and to transmit;
D2: to arbitrary unit prefix i, if its corresponding ply-yarn drill j, then constructing destination network segment <unit prefix i, j, Inv, Inv>is the virtual route of this unit prefix, and wherein, Inv representes an invalid value;
D3: the virtual route of being constructed is sent to all outer ply-yarn drill storages of ply-yarn drill j.
E: carry out message according to the true routing table after said virtual route and the said decomposition and transmit processing.
This step specifically can realize through following steps:
E1: through longest prefix match search receive message go into ply-yarn drill whether with the true matched routings of this message, if, execution in step E2 then, if not, execution in step E3 then;
E2: obtain all true forwarding information, and transmit this message according to said true forwarding information;
E3: this message is forwarded to the ply-yarn drill that goes out in the virtual route with its coupling through the inner exchanging network; After message arrives out ply-yarn drill; Search the true route of mating with this message through longest prefix match; And obtain all true forwarding information, and transmit this message according to said true forwarding information.
Wherein, carry out longest prefix match among said step e 1, the E3 when searching,, then abandon this message if search failure.
Above execution mode only is used to explain the present invention; And be not limitation of the present invention; The those of ordinary skill in relevant technologies field under the situation that does not break away from the spirit and scope of the present invention, can also be made various variations and modification; Therefore all technical schemes that are equal to also belong to category of the present invention, and scope of patent protection of the present invention should be defined by the claims.
Claims (7)
1. the expandable route system method for routing based on routing table decomposition storage is characterized in that, may further comprise the steps:
A: according to the quantity of the ply-yarn drill quantity n of system computing unit prefix;
B: the mapping relations of setting up unit prefix and ply-yarn drill;
C: decompose the true routing table of storage according to said mapping relations;
D: the virtual route and the storage of constructing said unit prefix;
E: carry out message according to the true routing table after said virtual route and the said decomposition and transmit processing.
2. the expandable route system method for routing based on routing table decomposition storage as claimed in claim 1 is characterized in that said steps A further comprises:
A1: calculate decomposition position
and represent unit prefix i according to the principle that preceding k bit value in the IP prefix equals i;
A2: the quantity
of calculating decomposable unit prefix
3. the expandable route system method for routing based on routing table decomposition storage as claimed in claim 1 is characterized in that said step B further may further comprise the steps:
B1:, then shine upon according to the form of m the corresponding m piece of unit prefix ply-yarn drill if n is 2 index;
B2: if n is not 2 index; Then with of the form mapping of preceding n unit prefix according to m the corresponding m piece of unit prefix ply-yarn drill; Is that 0 ply-yarn drill begins to continue to shine upon in order with remaining unit prefix from card number, and unit prefix i and card number are shone upon for the ply-yarn drill of (i-n).
4. the expandable route system method for routing based on routing table decomposition storage as claimed in claim 1 is characterized in that said step C further may further comprise the steps:
Whether the mask-length that detects the true route prefix in the routing table is less than k, if then this true route prefix is stored in all ply-yarn drills for assembling prefix; If not, then this route prefix is stored in the corresponding ply-yarn drill of the unit prefix of its ownership.
5. the expandable route system method for routing based on routing table decomposition storage as claimed in claim 1 is characterized in that said step D further may further comprise the steps:
A D1: describe with the mode of < destination network segment, outlet card number, outgoing interface number, next hop address>and to transmit;
D2: to arbitrary unit prefix i, if its corresponding ply-yarn drill j, then constructing destination network segment <unit prefix i, j, Inv, Inv>is the virtual route of this unit prefix, and wherein, Inv representes an invalid value;
D3: the virtual route of being constructed is sent to all outer ply-yarn drill storages of ply-yarn drill j.
6. the expandable route system method for routing based on routing table decomposition storage as claimed in claim 1 is characterized in that said step e further may further comprise the steps:
E1: through longest prefix match search receive message go into ply-yarn drill whether with the true matched routings of this message, if, execution in step E2 then, if not, execution in step E3 then;
E2: obtain all true forwarding information, and transmit this message according to said true forwarding information;
E3: this message is forwarded to the ply-yarn drill that goes out in the virtual route with its coupling through the inner exchanging network; After message arrives out ply-yarn drill; Search the true route of mating with this message through longest prefix match; And obtain all true forwarding information, and transmit this message according to said true forwarding information.
7. as claimed in claim 6ly decompose the expandable route system method for routing of storage, it is characterized in that, carry out longest prefix match among said step e 1, the E3 when searching,, then abandon this message if search failure based on routing table.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2012100655748A CN102594699A (en) | 2012-01-13 | 2012-01-13 | Routing method based on routing list decomposition storage for extensible router system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2012100655748A CN102594699A (en) | 2012-01-13 | 2012-01-13 | Routing method based on routing list decomposition storage for extensible router system |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN102594699A true CN102594699A (en) | 2012-07-18 |
Family
ID=46482915
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2012100655748A Pending CN102594699A (en) | 2012-01-13 | 2012-01-13 | Routing method based on routing list decomposition storage for extensible router system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102594699A (en) |
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104079495A (en) * | 2014-06-13 | 2014-10-01 | 首都师范大学 | Route synchronization method of route system and route system |
| CN104618248A (en) * | 2015-01-27 | 2015-05-13 | 首都师范大学 | Cluster router multicast forwarding table designing and forwarding algorithm |
| CN105262684A (en) * | 2015-10-23 | 2016-01-20 | 首都师范大学 | Real-time dynamic decomposition storage method for routing table and route data forwarding method |
| CN105706401A (en) * | 2013-11-05 | 2016-06-22 | 思科技术公司 | Hierarchical routing with table management across hardware modules |
| WO2017032238A1 (en) * | 2015-08-21 | 2017-03-02 | 杭州华三通信技术有限公司 | Route management |
| CN106961388A (en) * | 2017-02-28 | 2017-07-18 | 首都师范大学 | Fib table decomposition method based on multiple order of magnitude line card |
| WO2017219717A1 (en) * | 2016-06-24 | 2017-12-28 | 华为技术有限公司 | Routing lookup method and apparatus, and routing device |
| CN112152941A (en) * | 2020-09-17 | 2020-12-29 | 锐捷网络股份有限公司 | Method for expanding single-port large-capacity table item, network transmission equipment and storage medium |
-
2012
- 2012-01-13 CN CN2012100655748A patent/CN102594699A/en active Pending
Non-Patent Citations (2)
| Title |
|---|
| NIAN-FENG TZENG 等: "Routing Table Partitioning for Speedy Packet Lookups in Scalable Routers", 《IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS》 * |
| 陈文龙 等: "可扩展路由器FIB表分解存储模型", 《计算机学报》 * |
Cited By (18)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US10374952B2 (en) | 2013-11-05 | 2019-08-06 | Cisco Technology, Inc. | Method for increasing layer-3 longest prefix match scale |
| CN105706401A (en) * | 2013-11-05 | 2016-06-22 | 思科技术公司 | Hierarchical routing with table management across hardware modules |
| CN104079495A (en) * | 2014-06-13 | 2014-10-01 | 首都师范大学 | Route synchronization method of route system and route system |
| CN104618248A (en) * | 2015-01-27 | 2015-05-13 | 首都师范大学 | Cluster router multicast forwarding table designing and forwarding algorithm |
| WO2017032238A1 (en) * | 2015-08-21 | 2017-03-02 | 杭州华三通信技术有限公司 | Route management |
| US10880233B2 (en) | 2015-08-21 | 2020-12-29 | New H3C Technologies Co., Ltd. | Routing management |
| CN107040393A (en) * | 2015-08-21 | 2017-08-11 | 新华三技术有限公司 | A kind of route management method and equipment |
| CN105262684B (en) * | 2015-10-23 | 2018-05-04 | 首都师范大学 | The real-time dynamic Decomposition storage method and route data forwarding method of routing table |
| CN105262684A (en) * | 2015-10-23 | 2016-01-20 | 首都师范大学 | Real-time dynamic decomposition storage method for routing table and route data forwarding method |
| WO2017219717A1 (en) * | 2016-06-24 | 2017-12-28 | 华为技术有限公司 | Routing lookup method and apparatus, and routing device |
| CN107547409A (en) * | 2016-06-24 | 2018-01-05 | 华为技术有限公司 | A kind of method for searching route, device and routing device |
| EP3462689A4 (en) * | 2016-06-24 | 2019-05-15 | Huawei Technologies Co., Ltd. | Routing lookup method and apparatus, and routing device |
| US10931579B2 (en) | 2016-06-24 | 2021-02-23 | Huawei Technologies Co., Ltd. | Route search method and apparatus, and routing device |
| CN107547409B (en) * | 2016-06-24 | 2020-12-25 | 华为技术有限公司 | Route searching method and device and routing equipment |
| CN106961388B (en) * | 2017-02-28 | 2019-07-26 | 首都师范大学 | The fib table decomposition method of multiple order of magnitude line card |
| CN106961388A (en) * | 2017-02-28 | 2017-07-18 | 首都师范大学 | Fib table decomposition method based on multiple order of magnitude line card |
| CN112152941A (en) * | 2020-09-17 | 2020-12-29 | 锐捷网络股份有限公司 | Method for expanding single-port large-capacity table item, network transmission equipment and storage medium |
| CN112152941B (en) * | 2020-09-17 | 2023-03-21 | 锐捷网络股份有限公司 | Method for expanding single-port large-capacity table item, network transmission equipment and storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102594699A (en) | Routing method based on routing list decomposition storage for extensible router system | |
| CN111611613B (en) | ICN-based industrial Internet identification analysis system and data access method | |
| US8938469B1 (en) | Dynamically adjusting hash table capacity | |
| CN101594319B (en) | Entry lookup method and entry lookup device | |
| CN101005461B (en) | IPv6 route list checking and repeating method | |
| CN104820717A (en) | Massive small file storage and management method and system | |
| CN107770076A (en) | A kind of processing method of hash-collision, device and switching equipment | |
| CN104079478A (en) | Method and device of packet forwarding | |
| CN102223289A (en) | Method and device for storing IPv4 (the Fourth Internet Protocol Version) address and IPv6 (the Sixth Internet Protocol Version) address | |
| CN101883055B (en) | Capacity expansion realization method and device of routing forwarding table and switching device | |
| CN105072030A (en) | NDN (Named Data Networking) route system based on content clustering, and clustering query method therefor | |
| CN101620623A (en) | Method and device for managing list item of content addressable memory CAM | |
| WO2016106506A1 (en) | Routing method and device | |
| CN105763454A (en) | Data message forwarding method and device based on two-dimensional routing policy | |
| CN104025520A (en) | Lookup table creation method and query method, and controller, forwarding device and system therefor | |
| CN103475584A (en) | Query method and query device for ternary content addressable memory (TCAM) | |
| CN106453091B (en) | The equivalent route management method and device of router Forwarding plane | |
| CN101556610B (en) | Table creating and searching method used by network processor | |
| CN100426791C (en) | Engine apparatus for route forwarding table address searching | |
| CN101500012B (en) | Packet classification method and system | |
| Guha et al. | Improved algorithms for fault tolerant facility location | |
| CN101222434B (en) | Storage policy control list, policy searching method and tri-state addressing memory | |
| JP5050978B2 (en) | Transmission information transfer apparatus and method | |
| CN102984071B (en) | Method for organizing routing table of segment address route and method for checking route | |
| CN104125147A (en) | Method for realizing separation of next-hop configuration data |
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: 20120718 |