CN105262684A - Real-time dynamic decomposition storage method for routing table and route data forwarding method - Google Patents
Real-time dynamic decomposition storage method for routing table and route data forwarding method Download PDFInfo
- Publication number
- CN105262684A CN105262684A CN201510696504.6A CN201510696504A CN105262684A CN 105262684 A CN105262684 A CN 105262684A CN 201510696504 A CN201510696504 A CN 201510696504A CN 105262684 A CN105262684 A CN 105262684A
- Authority
- CN
- China
- Prior art keywords
- line card
- route
- newly arrived
- unit
- prefix
- 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
Links
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
本发明公开了一种路由表的实时动态分解存储方法和路由数据转发方法,存储方法包括:获取新到达路由的单元前缀,将该单元前缀与各线卡上已经存储的单元前缀进行比较,如果存在与该路由相同的单元前缀,则将该新到达的路由存储在对应的线卡中;如果各线卡上均不存在与该单元前缀相同的数值,则根据各线卡的路由存储容量,将新到达路由存储在路由存储容量最少的线卡中。本发明具有如下优点:根据不同的单元前缀,将到达的路由项动态分解存储到各线卡,实现各线卡的负载均衡;同时,该设计对于任意时刻到达的路由项都能够实现动态分解存储,随机能力强,更加适应路由表从未知到已知的变化过程,实时性强。
The invention discloses a real-time dynamic decomposing storage method and a routing data forwarding method of a routing table. The storage method includes: obtaining the unit prefix of a newly arrived route, and comparing the unit prefix with the unit prefixes already stored on each line card. If If there is the same unit prefix as the route, store the newly arrived route in the corresponding line card; if there is no value identical to the unit prefix on each line card, then according to the route storage capacity of each line card, Store newly arrived routes in the line card with the least route storage capacity. The present invention has the following advantages: according to different unit prefixes, the arriving routing items are dynamically decomposed and stored in each line card, and the load balancing of each line card is realized; at the same time, the design can realize dynamic decomposing and storing for the routing items arriving at any time , strong random ability, more adaptable to the change process of the routing table from unknown to known, and strong real-time performance.
Description
技术领域technical field
本发明涉及通信领域,具体涉及一种路由表的实时动态分解存储方法和路由数据转发方法。The invention relates to the communication field, in particular to a method for real-time dynamic decomposition and storage of a routing table and a routing data forwarding method.
背景技术Background technique
Internet技术的发展给路由器的处理能力带来了很大的挑战,越来越多的研究也就致力于解决路由表存储与快速查找问题。但是,目前所提出的路由表分解存储方法都只是基于一定的算法,实现各线卡的路由负载均衡,并没有从路由表的状态以及路由项的动态变化方面进行考虑。随着路由表不断的更新,这些静态分解存储方法就不能很好的解决线卡负载均衡的问题,甚至可能影响整个路由表的处理速度。The development of Internet technology has brought great challenges to the processing capabilities of routers, and more and more researches are devoted to solving the problems of routing table storage and fast lookup. However, the routing table decomposing and storing methods proposed so far are only based on a certain algorithm to achieve routing load balancing of each line card, without considering the status of the routing table and the dynamic changes of routing entries. As the routing table is constantly updated, these static decomposition storage methods cannot well solve the problem of line card load balancing, and may even affect the processing speed of the entire routing table.
发明内容Contents of the invention
本发明旨在至少解决上述技术问题之一。The present invention aims to solve at least one of the above-mentioned technical problems.
为此,本发明的第一个目的在于提出一种路由表的实时动态分解存储方法。For this reason, the first object of the present invention is to propose a real-time dynamic decomposition storage method of the routing table.
本发明的第二个目的在于提出一种路由数据转发方法。The second object of the present invention is to propose a routing data forwarding method.
为了实现上述目的,本发明第一方面的实施例公开了一种路由表的实时动态分解存储方法,包括以下步骤:S1:获取新到达路由的单元前缀,其中,所述单元前缀为新到达路由的路由地址前缀前八位对应的数值;S2:将所述单元前缀与各线卡已经存储的单元前缀进行比较,如果某个线卡中已经存储了与所述新到达路由项相同的单元前缀,则将所述新到达路由存储在所述单元前缀对应的线卡中;如果各线卡均不存在与所述路由项相同的单元前缀,则进入步骤S3;S3:获取所有线卡路由存储容量;以及S4:将所述新到达路由存储在路由存储容量最少的线卡中。In order to achieve the above object, the embodiment of the first aspect of the present invention discloses a real-time dynamic decomposition storage method of the routing table, including the following steps: S1: Obtain the unit prefix of the newly arrived route, wherein the unit prefix is the newly arrived route The value corresponding to the first eight digits of the routing address prefix; S2: compare the unit prefix with the unit prefix stored in each line card, if a certain line card has already stored the same unit prefix as the newly arrived routing item , then store the new arrival route in the line card corresponding to the unit prefix; if each line card does not have the same unit prefix as the routing item, then enter step S3; S3: Get all line card route storage capacity; and S4: storing the newly arrived route in the line card with the least route storage capacity.
根据本发明实施例的路由表的实时动态分解存储方法,根据不同的单元前缀,将到达的路由项动态存储到各线卡,实现各线卡的负载均衡;同时,该设计对于任意时刻到达的路由项都能够实现动态分解存储,随机能力强,更加适应路由表从未知到已知的变化过程,实时性强。According to the real-time dynamic decomposition and storage method of the routing table in the embodiment of the present invention, according to different unit prefixes, the arriving routing items are dynamically stored in each line card, so as to realize the load balancing of each line card; Routing items can be dynamically decomposed and stored, with strong random ability, more adaptable to the change process of the routing table from unknown to known, and strong real-time performance.
另外,根据本发明上述实施例的路由表的实时动态分解存储方法,还可以具有如下附加的技术特征:In addition, the real-time dynamic decomposition storage method of the routing table according to the above-mentioned embodiments of the present invention may also have the following additional technical features:
进一步地,所述步骤S4进一步包括:S41:如果所述路由存储容量最少的线卡为多个,则获取所述多个线卡中已经存储的单元前缀的数量;S42:分别统计所述多个线卡上存储的不同单元前缀数量,其中,所述不同单元前缀数量为所述多个线卡中所有已经存储的单元前缀数量;以及S43:将所述新到达路由存储在所述不同单元前缀数量最少的线卡中。Further, the step S4 further includes: S41: If there are multiple line cards with the least routing storage capacity, then obtain the number of unit prefixes stored in the multiple line cards; S42: Count the multiple The number of different unit prefixes stored on each line card, wherein the number of different unit prefixes is the number of all stored unit prefixes in the multiple line cards; and S43: store the new arrival route in the different unit Among the line cards with the fewest number of prefixes.
进一步地,所述步骤S43进一步包括:S431:如果所述不同单元前缀数量最少的线卡为多个,则获取所述多个线卡的序列号;S432:将所述新到达路由按照所述多个线卡的序列号顺序存储。Further, the step S43 further includes: S431: If there are multiple line cards with the least number of different unit prefixes, then acquire the serial numbers of the multiple line cards; S432: Route the new arrival according to the The serial numbers of multiple line cards are stored sequentially.
为了实现上述目的,本发明第二方面的实施例公开了一种路由数据转发方法,包括以下步骤:定义接收新到达路由的线卡为接收线卡;获取所述新到达路由的宿主线卡,其中,所述宿主线卡为与所述新到达路由的目的地址匹配的线卡,所述宿主线卡是通过上述路由表的实时动态分解存储方法确定的;判断所述接收线卡与所述宿主线卡是否为同一线卡,如果是,则所述接收线卡对所述新到达路由进行最长前缀匹配后转发所述新到达路由;如果否,则所述接收线卡将所述新到达路由转发给所述宿主线卡,所述宿主线卡进行最长前缀匹配后转发所述新到达路由。In order to achieve the above object, the embodiment of the second aspect of the present invention discloses a routing data forwarding method, including the following steps: defining the line card receiving the newly arrived route as the receiving line card; obtaining the host line card of the newly arrived route, Wherein, the host line card is a line card that matches the destination address of the newly arrived route, and the host line card is determined by the real-time dynamic decomposition storage method of the routing table; Whether the host line card is the same line card, if yes, the receiving line card forwards the new arriving route after performing the longest prefix match on the newly arriving route; if not, then the receiving line card forwards the new arriving route The arrival route is forwarded to the host line card, and the host line card forwards the new arrival route after matching the longest prefix.
根据本发明实施例的路由数据转发方法,根据不同的单元前缀,将到达的路由项动态存储到各线卡,实现各线卡的负载均衡;同时,该设计对于任意时刻到达的路由项都能够实现动态分解存储,随机能力强,更加适应路由表从未知到已知的变化过程,实时性强。According to the routing data forwarding method of the embodiment of the present invention, according to different unit prefixes, the arriving routing items are dynamically stored in each line card, so as to realize the load balancing of each line card; at the same time, this design can be used for routing items arriving at any time Realize dynamic decomposition and storage, strong random ability, more adaptable to the change process of the routing table from unknown to known, and strong real-time performance.
本发明的附加方面和优点将在下面的描述中部分给出,部分将从下面的描述中变得明显,或通过本发明的实践了解到。Additional aspects and advantages of the invention will be set forth in the description which follows, and in part will be obvious from the description, or may be learned by practice of the invention.
附图说明Description of drawings
本发明的上述和/或附加的方面和优点从结合下面附图对实施例的描述中将变得明显和容易理解,其中:The above and/or additional aspects and advantages of the present invention will become apparent and comprehensible from the description of the embodiments in conjunction with the following drawings, wherein:
图1是本发明一个实施例的路由表的实时动态分解存储方法的流程图;Fig. 1 is the flowchart of the real-time dynamic decomposition storage method of the routing table of an embodiment of the present invention;
图2是本发明一个实施例的路由数据转发方法的流程图。Fig. 2 is a flowchart of a routing data forwarding method according to an embodiment of the present invention.
具体实施方式detailed description
下面详细描述本发明的实施例,所述实施例的示例在附图中示出,其中自始至终相同或类似的标号表示相同或类似的元件或具有相同或类似功能的元件。下面通过参考附图描述的实施例是示例性的,仅用于解释本发明,而不能理解为对本发明的限制。Embodiments of the present invention are described in detail below, examples of which are shown in the drawings, wherein the same or similar reference numerals designate the same or similar elements or elements having the same or similar functions throughout. The embodiments described below by referring to the figures are exemplary only for explaining the present invention and should not be construed as limiting the present invention.
在本发明的描述中,需要理解的是,术语“中心”、“纵向”、“横向”、“上”、“下”、“前”、“后”、“左”、“右”、“竖直”、“水平”、“顶”、“底”、“内”、“外”等指示的方位或位置关系为基于附图所示的方位或位置关系,仅是为了便于描述本发明和简化描述,而不是指示或暗示所指的装置或元件必须具有特定的方位、以特定的方位构造和操作,因此不能理解为对本发明的限制。此外,术语“第一”、“第二”仅用于描述目的,而不能理解为指示或暗示相对重要性。In describing the present invention, it should be understood that the terms "center", "longitudinal", "transverse", "upper", "lower", "front", "rear", "left", "right", " The orientations or positional relationships indicated by "vertical", "horizontal", "top", "bottom", "inner" and "outer" are based on the orientations or positional relationships shown in the drawings, and are only for the convenience of describing the present invention and Simplified descriptions, rather than indicating or implying that the device or element referred to must have a particular orientation, be constructed and operate in a particular orientation, and thus should not be construed as limiting the invention. In addition, the terms "first" and "second" are used for descriptive purposes only, and should not be understood as indicating or implying relative importance.
在本发明的描述中,需要说明的是,除非另有明确的规定和限定,术语“安装”、“相连”、“连接”应做广义理解,例如,可以是固定连接,也可以是可拆卸连接,或一体地连接;可以是机械连接,也可以是电连接;可以是直接相连,也可以通过中间媒介间接相连,可以是两个元件内部的连通。对于本领域的普通技术人员而言,可以具体情况理解上述术语在本发明中的具体含义。In the description of the present invention, it should be noted that unless otherwise specified and limited, the terms "installation", "connection" and "connection" should be understood in a broad sense, for example, it can be a fixed connection or a detachable connection. Connected, or integrally connected; it can be mechanically connected or electrically connected; it can be directly connected or indirectly connected through an intermediary, and it can be the internal communication of two components. Those of ordinary skill in the art can understand the specific meanings of the above terms in the present invention in specific situations.
参照下面的描述和附图,将清楚本发明的实施例的这些和其他方面。在这些描述和附图中,具体公开了本发明的实施例中的一些特定实施方式,来表示实施本发明的实施例的原理的一些方式,但是应当理解,本发明的实施例的范围不受此限制。相反,本发明的实施例包括落入所附加权利要求书的精神和内涵范围内的所有变化、修改和等同物。These and other aspects of embodiments of the invention will become apparent with reference to the following description and drawings. In these descriptions and drawings, some specific implementations of the embodiments of the present invention are specifically disclosed to represent some ways of implementing the principles of the embodiments of the present invention, but it should be understood that the scope of the embodiments of the present invention is not limited by This restriction. On the contrary, the embodiments of the present invention include all changes, modifications and equivalents coming within the spirit and scope of the appended claims.
以下结合附图描述根据本发明实施例的路由表的实时动态分解存储方法。The real-time dynamic decomposition storage method of the routing table according to the embodiment of the present invention will be described below with reference to the accompanying drawings.
请参考图1,路由表的实时动态分解存储方法包括以下步骤:Please refer to Figure 1, the real-time dynamic decomposition storage method of the routing table includes the following steps:
S1:获取新到达路由的单元前缀,其中,单元前缀为新到达路由的路由地址前缀前八位对应的数值。S1: Obtain the unit prefix of the newly arrived route, where the unit prefix is the value corresponding to the first eight digits of the routing address prefix of the newly arrived route.
在本发明的一个示例中,新到达路由的地址为192.154.0.0/14,其中“14”为路由前缀长度,单元前缀可以为路由地址前缀中的前n位。在本发明的一个实施例中,单元前缀为路由项地址前缀的前8位,即为十进制路由地址的第一字节数值,即单元前缀为“192”。In an example of the present invention, the address of the newly arrived route is 192.154.0.0/14, where "14" is the length of the route prefix, and the unit prefix may be the first n digits in the route address prefix. In one embodiment of the present invention, the unit prefix is the first 8 digits of the address prefix of the routing item, that is, the first byte value of the decimal routing address, that is, the unit prefix is "192".
S2:将单元前缀与路由表中各线卡已经存储的单元前缀的数值进行比较,如果某个线卡中已经存储了与所述新到达路由项相同的单元前缀,则将所述新到达路由存储在所述单元前缀对应的线卡中;如果各线卡均不存在与所述路由项相同的单元前缀,则进入步骤S3。S2: Compare the unit prefix with the value of the unit prefix already stored in each line card in the routing table, if a certain line card has already stored the same unit prefix as the newly arrived routing item, then the newly arrived route Stored in the line card corresponding to the unit prefix; if no line card has the same unit prefix as the routing item, go to step S3.
在本发明的一个示例中,假设路由器具有四个线卡,分别为线卡LC0,LC1,LC2,LC3。如果四个线卡中的某个线卡中存储了值为‘192’的单元前缀,则新到达路由存储在该单元前缀对应的线卡中;如果四个线卡中均没有存储值为‘192’的单元前缀,则进入步骤S3。In an example of the present invention, it is assumed that the router has four line cards, namely line cards LC0, LC1, LC2, and LC3. If one of the four line cards stores a unit prefix with the value '192', the newly arrived route is stored in the line card corresponding to the unit prefix; if none of the four line cards stores the value '192' 192' unit prefix, then go to step S3.
S3:获取所有线卡的路由存储容量,即获取所有线卡已经存储的路由数量。S3: Get the route storage capacity of all line cards, that is, get the number of routes stored in all line cards.
S4:将新到达路由存储在路由存储容量最少的线卡中。S4: Store the newly arrived route in the line card with the least route storage capacity.
在本发明的一个示例中,线卡LC0的路由存储数量为301、线卡LC1的路由存储数量为299,线卡LC2的路由存储数量为300,线卡LC3的路由存储数量为302,则将新到达路由存储在线卡LC1中,以达到均衡存储的目的。In an example of the present invention, the route storage quantity of the line card LC0 is 301, the route storage quantity of the line card LC1 is 299, the route storage quantity of the line card LC2 is 300, and the route storage quantity of the line card LC3 is 302, then the The newly arrived route is stored in the line card LC1 to achieve balanced storage.
在本发明的一个实施例中,步骤S4进一步包括:In one embodiment of the present invention, step S4 further includes:
S41:如果路由存储容量最少的线卡为多个,则获取多个线卡中已经存储的单元前缀的数目。S41: If there are multiple line cards with the least route storage capacity, acquire the number of unit prefixes stored in the multiple line cards.
在本发明的一个示例中,线卡LC0的路由存储容量为301,线卡LC1的路由存储容量为300,线卡LC2的路由存储容量为300,线卡LC3的路由存储容量为302。则排除线卡LC0和线卡LC3,通过下述步骤确定新到达路由的存储位置。In an example of the present invention, the route storage capacity of the line card LC0 is 301, the route storage capacity of the line card LC1 is 300, the route storage capacity of the line card LC2 is 300, and the route storage capacity of the line card LC3 is 302. Then the line card LC0 and the line card LC3 are excluded, and the storage location of the newly arrived route is determined through the following steps.
S42:分别统计多个线卡不同单元前缀数量,其中,不同单元前缀数量为多个线卡中已经存储的单元前缀的数量。S42: Count the number of different unit prefixes of multiple line cards respectively, where the number of different unit prefixes is the number of unit prefixes already stored in the multiple line cards.
在本发明的一个示例中,接着步骤S41的示例,分别统计线卡LC1和线卡LC2各自存储的单元前缀的数量。例如,线卡LC1存储了值为‘131’,‘135’,‘128’,‘56’,‘220’,‘98’的单元前缀,则线卡LC1中存储的单元前缀的数目为6。而线卡LC2上仅存储了值为‘110’,‘21’的单元前缀,则线卡LC2中存储的单元前缀的数目就为2。In an example of the present invention, following the example of step S41, the numbers of unit prefixes stored in the line card LC1 and the line card LC2 are respectively counted. For example, the line card LC1 stores cell prefixes with values of '131', '135', '128', '56', '220', '98', and the number of cell prefixes stored in the line card LC1 is 6. However, the line card LC2 only stores cell prefixes with the values '110' and '21', so the number of cell prefixes stored in the line card LC2 is 2.
S43:将新到达路由存储在所述不同单元前缀数量最少的线卡中。S43: Store the newly arrived route in the line card with the least number of different unit prefixes.
在本发明的一个示例中,接着步骤S42的示例,将新到达路由存储在线卡LC2中。In an example of the present invention, following the example of step S42, the newly arrived route is stored in the line card LC2.
在本发明的一个实施例中,步骤S43进一步包括:In one embodiment of the present invention, step S43 further includes:
S431:如果不同单元前缀数量最少的线卡为多个,则获取所述多个线卡的序列号。S431: If there are multiple line cards with the smallest number of different unit prefixes, acquire serial numbers of the multiple line cards.
在本发明的一个示例中,接着步骤S41的示例,统计线卡LC1和线卡LC2的不同单元前缀数量。例如,线卡LC1中存储的不同单元前缀的数目为6,线卡LC2存储的不同单元前缀的数目也为6。获取线卡LC1的序列号“1”和线卡LC2的序列号“2”。In an example of the present invention, following the example of step S41, the numbers of different cell prefixes of the line card LC1 and the line card LC2 are counted. For example, the number of different unit prefixes stored in the line card LC1 is 6, and the number of different unit prefixes stored in the line card LC2 is also 6. Obtain the serial number "1" of the line card LC1 and the serial number "2" of the line card LC2.
S432:将新到达路由按照多个线卡的序列号顺序存储。S432: Store the newly arrived route according to the order of serial numbers of multiple line cards.
在本发明的一个示例中,接着步骤S431的示例,将新到达路由存储在线卡LC1中。In an example of the present invention, following the example of step S431, the newly arrived route is stored in the line card LC1.
通过本实施例中路由表的实时动态分解存储方法,根据不同的单元前缀,将到达的路由项动态存储到各线卡,实现各线卡的负载均衡;同时,该设计对于任意时刻到达的路由项都能够实现动态分解存储,随机能力强,更加适应路由表从未知到已知的变化过程,实时性强。Through the real-time dynamic decomposition and storage method of the routing table in this embodiment, the arriving routing items are dynamically stored in each line card according to different unit prefixes, so as to realize the load balancing of each line card; Items can be dynamically decomposed and stored, with strong random ability, more adaptable to the change process of the routing table from unknown to known, and strong real-time performance.
此外,可以设置均衡度ED,压缩比RR来分析动态存储的均衡性和相应的压缩性能。In addition, you can set the balance degree ED and the compression ratio RR to analyze the balance of dynamic storage and the corresponding compression performance.
其中,ED表示路由动态分解存储的均衡度,RE_LCm表示各线卡路由存储容量,REave表示线卡的平均路由存储容量。Among them, ED represents the balance degree of routing dynamic decomposition storage, RE_LC m represents the routing storage capacity of each line card, and RE ave represents the average routing storage capacity of the line card.
其中,RR表示压缩比,RE表示动态分解存储模型下各线卡路由存储容量,REfull表示完全存储方式下各线卡路由存储容量。例如,在完全存储方式(FullBackupStorage)下,对于500条路由表项,若存储在4块线卡上,各线卡均存储500条,而在该动态均衡分解存储模型中,4块线卡的路由存储容量分别为:126,126,121,127,对应的压缩比分别为:0.252,0.252,0.242,0.254。Among them, RR represents the compression ratio, RE represents the route storage capacity of each line card under the dynamic decomposition storage model, and RE full represents the route storage capacity of each line card under the full storage mode. For example, in the full storage mode (FullBackupStorage), for 500 routing table entries, if stored on 4 line cards, each line card stores 500 entries, and in this dynamic balance decomposition storage model, the 4 line cards The routing storage capacities are: 126, 126, 121, 127, and the corresponding compression ratios are: 0.252, 0.252, 0.242, 0.254.
以下结合附图描述根据本发明实施例的路由数据转发方法。The routing data forwarding method according to the embodiment of the present invention will be described below with reference to the accompanying drawings.
请参考图2,路由数据转发方法包括以下步骤:Please refer to Figure 2, the routing data forwarding method includes the following steps:
定义接收新到达路由的线卡为接收线卡。Define the line card that receives the newly arrived route as the receiving line card.
获取所述新到达路由的宿主线卡,其中,宿主线卡为与新到达路由的目的地址匹配的线卡,宿主线卡是通过上述路由表的实时动态分解存储方法的实施例确定的。Obtain the host line card of the newly arrived route, wherein the host line card is a line card that matches the destination address of the newly arrived route, and the host line card is determined through the embodiment of the real-time dynamic decomposition storage method of the routing table.
判断接收线卡与宿主线卡是否为同一线卡,如果是,则接收线卡对新到达路由进行最长前缀匹配后转发所述新到达路由;如果否,则接收线卡将新到达路由转发给宿主线卡,宿主线卡进行最长前缀匹配后转发所述新到达路由。Determine whether the receiving line card and the host line card are the same line card, if yes, the receiving line card performs the longest prefix match on the newly arrived route and then forwards the new arriving route; if not, the receiving line card forwards the new arriving route to the host line card, and the host line card forwards the newly arrived route after matching the longest prefix.
另外,本发明实施例的路由表的实时动态分解存储方法和路由数据转发方法的其它构成以及作用对于本领域的技术人员而言都是已知的,为了减少冗余,不做赘述。In addition, other components and functions of the real-time dynamic decomposition and storage method of the routing table and the routing data forwarding method of the embodiment of the present invention are known to those skilled in the art, and will not be repeated in order to reduce redundancy.
在本说明书的描述中,参考术语“一个实施例”、“一些实施例”、“示例”、“具体示例”、或“一些示例”等的描述意指结合该实施例或示例描述的具体特征、结构、材料或者特点包含于本发明的至少一个实施例或示例中。在本说明书中,对上述术语的示意性表述不一定指的是相同的实施例或示例。而且,描述的具体特征、结构、材料或者特点可以在任何的一个或多个实施例或示例中以合适的方式结合。In the description of this specification, descriptions referring to the terms "one embodiment", "some embodiments", "example", "specific examples", or "some examples" mean that specific features described in connection with the embodiment or example , structure, material or characteristic is included in at least one embodiment or example of the present invention. In this specification, schematic representations of the above terms do not necessarily refer to the same embodiment or example. Furthermore, the specific features, structures, materials or characteristics described may be combined in any suitable manner in any one or more embodiments or examples.
尽管已经示出和描述了本发明的实施例,本领域的普通技术人员可以理解:在不脱离本发明的原理和宗旨的情况下可以对这些实施例进行多种变化、修改、替换和变型,本发明的范围由权利要求及其等同限定。Although the embodiments of the present invention have been shown and described, those skilled in the art can understand that various changes, modifications, substitutions and modifications can be made to these embodiments without departing from the principle and spirit of the present invention. The scope of the invention is defined by the claims and their equivalents.
Claims (4)
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201510696504.6A CN105262684B (en) | 2015-10-23 | 2015-10-23 | The real-time dynamic Decomposition storage method and route data forwarding method of routing table |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201510696504.6A CN105262684B (en) | 2015-10-23 | 2015-10-23 | The real-time dynamic Decomposition storage method and route data forwarding method of routing table |
Publications (2)
Publication Number | Publication Date |
---|---|
CN105262684A true CN105262684A (en) | 2016-01-20 |
CN105262684B CN105262684B (en) | 2018-05-04 |
Family
ID=55102194
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201510696504.6A Active CN105262684B (en) | 2015-10-23 | 2015-10-23 | The real-time dynamic Decomposition storage method and route data forwarding method of routing table |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN105262684B (en) |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN106961388A (en) * | 2017-02-28 | 2017-07-18 | 首都师范大学 | Fib table decomposition method based on multiple order of magnitude line card |
Citations (7)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN1561047A (en) * | 2004-02-20 | 2005-01-05 | 清华大学 | Distributed Parallel IP Routing Lookup Method Based on TCAM |
CN101252521A (en) * | 2008-03-19 | 2008-08-27 | 中兴通讯股份有限公司 | Method for forwarding message and distributed three layer network eqiupment |
US7474657B2 (en) * | 2002-04-30 | 2009-01-06 | University Of Florida Research Foundation, Inc. | Partitioning methods for dynamic router tables |
CN101631086A (en) * | 2009-08-10 | 2010-01-20 | 武汉烽火网络有限责任公司 | Routing list partitioning and placing method searched by parallel IP route |
CN101692653A (en) * | 2009-09-25 | 2010-04-07 | 中兴通讯股份有限公司 | Management method and management device for routing table |
CN102594699A (en) * | 2012-01-13 | 2012-07-18 | 清华大学 | Routing method based on routing list decomposition storage for extensible router system |
CN104618248A (en) * | 2015-01-27 | 2015-05-13 | 首都师范大学 | Cluster router multicast forwarding table designing and forwarding algorithm |
-
2015
- 2015-10-23 CN CN201510696504.6A patent/CN105262684B/en active Active
Patent Citations (7)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US7474657B2 (en) * | 2002-04-30 | 2009-01-06 | University Of Florida Research Foundation, Inc. | Partitioning methods for dynamic router tables |
CN1561047A (en) * | 2004-02-20 | 2005-01-05 | 清华大学 | Distributed Parallel IP Routing Lookup Method Based on TCAM |
CN101252521A (en) * | 2008-03-19 | 2008-08-27 | 中兴通讯股份有限公司 | Method for forwarding message and distributed three layer network eqiupment |
CN101631086A (en) * | 2009-08-10 | 2010-01-20 | 武汉烽火网络有限责任公司 | Routing list partitioning and placing method searched by parallel IP route |
CN101692653A (en) * | 2009-09-25 | 2010-04-07 | 中兴通讯股份有限公司 | Management method and management device for routing table |
CN102594699A (en) * | 2012-01-13 | 2012-07-18 | 清华大学 | Routing method based on routing list decomposition storage for extensible router system |
CN104618248A (en) * | 2015-01-27 | 2015-05-13 | 首都师范大学 | Cluster router multicast forwarding table designing and forwarding algorithm |
Non-Patent Citations (1)
Title |
---|
陈文龙等: "可扩展路由器FIB表分解存储模型", 《计算机学报》 * |
Cited By (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN106961388A (en) * | 2017-02-28 | 2017-07-18 | 首都师范大学 | Fib table decomposition method based on multiple order of magnitude line card |
CN106961388B (en) * | 2017-02-28 | 2019-07-26 | 首都师范大学 | FIB table decomposition method for multi-level line cards |
Also Published As
Publication number | Publication date |
---|---|
CN105262684B (en) | 2018-05-04 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN104468381B (en) | Implementation method for multi-field rule matching | |
US9438505B1 (en) | System and method for increasing capacity in router forwarding tables | |
CN105122745B (en) | Efficient longest prefix match technology for the network equipment | |
US9098601B2 (en) | Ternary content-addressable memory assisted packet classification | |
CN103873371B (en) | A kind of name route Rapid matching lookup method and device | |
US9083710B1 (en) | Server load balancing using minimally disruptive hash tables | |
US8199652B2 (en) | IP address lookup method and apparatus by using Bloom filter and multi-hashing architecture | |
US7990893B1 (en) | Fast prefix-based network route filtering | |
CN108769111A (en) | A kind of server connection method, computer readable storage medium and terminal device | |
CN103428093B (en) | Route prefix storing, matching and updating method and device based on names | |
US20130265883A1 (en) | Method and system for storing packet flows | |
CN101594319A (en) | Table item lookup method and device | |
US20130266014A1 (en) | Hashing of network packet flows for efficient searching | |
EP2995048A1 (en) | Configuring forwarding information | |
CN103107945B (en) | A kind of system and method for fast finding IPV6 route | |
CN105141525A (en) | IPv6 routing lookup method and IPv6 routing lookup device | |
WO2014047863A1 (en) | Generating a shape graph for a routing table | |
CN106453091B (en) | The equivalent route management method and device of router Forwarding plane | |
CN106330716A (en) | IP routing search method and device | |
CN111049746B (en) | Routing table item generation method, dictionary tree generation method and device | |
CN105262684B (en) | The real-time dynamic Decomposition storage method and route data forwarding method of routing table | |
CN104539537B (en) | A kind of method for searching route and device | |
Shi et al. | Re-designing compact-structure based forwarding for programmable networks | |
CN100486212C (en) | Method for improving routing list capacity | |
CN109861915A (en) | Method, apparatus, computer device, and readable storage medium for forwarding table operations |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
C06 | Publication | ||
PB01 | Publication | ||
C10 | Entry into substantive examination | ||
SE01 | Entry into force of request for substantive examination | ||
GR01 | Patent grant | ||
GR01 | Patent grant | ||
TR01 | Transfer of patent right |
Effective date of registration: 20210111 Address after: 8319 Yanshan Road, Bengbu City, Anhui Province Patentee after: Bengbu Lichao Information Technology Co.,Ltd. Address before: 100048 No. 105 West Third Ring Road North, Beijing, Haidian District Patentee before: Capital Normal University |
|
TR01 | Transfer of patent right | ||
TR01 | Transfer of patent right |
Effective date of registration: 20210430 Address after: 226600 Building 1, 8 Xiaoxing Avenue, Chengdong Town, Hai'an City, Nantong City, Jiangsu Province Patentee after: Jiangsu Zhuimeng Information Technology Co.,Ltd. Address before: 8319 Yanshan Road, Bengbu City, Anhui Province Patentee before: Bengbu Lichao Information Technology Co.,Ltd. |
|
TR01 | Transfer of patent right |