CN101616090A - A kind of partition tree node resource method and device - Google Patents
A kind of partition tree node resource method and device Download PDFInfo
- Publication number
- CN101616090A CN101616090A CN200910152055A CN200910152055A CN101616090A CN 101616090 A CN101616090 A CN 101616090A CN 200910152055 A CN200910152055 A CN 200910152055A CN 200910152055 A CN200910152055 A CN 200910152055A CN 101616090 A CN101616090 A CN 101616090A
- Authority
- CN
- China
- Prior art keywords
- tree node
- list item
- tree
- page
- leaf
- 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
Images
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a kind of partition tree node resource method and device, this method comprises: to the tree node resource number in the binary tree, make that the numbering of the tree node in the described binary tree is continuous; In more than one page or leaf, the numbering of the tree node in each page is continuous with the tree node resource division after the numbering, is not the tree node that all comprises similar number in each page in all pages or leaves.The embodiment of the invention also provides corresponding device thereof.Technical solution of the present invention is owing to the tree node resource division in the binary tree being the page or leaf that varies in size, the equipment that makes can be according to the needed tree node quantity of each VPN, be chosen as each VPN and distribute a corresponding page or leaf, thereby the numbering of the tree node resource of distributing for each VPN is continuous, compared with prior art, improved the route refresh performance of router, reduced searching the complexity of engine design.Simultaneously, improved the utilance of storing tree node in the router of transmitting prefix based on binary tree.
Description
Technical field
The present invention relates to communication technical field, be specifically related to a kind of partition tree node resource method and device.
Background technology
In router based on binary tree storage routing forwarding prefix, usually need be with a plurality of Virtual Private Network (VPN, Virtual Private Network) forwarding prefix is stored in the same binary tree, in order to reach more satisfactory route refresh performance, what at first need to solve is that how to be each VPN in a binary tree distribute and transmit the needed tree node resource of prefix, make when the list item of one or more VPN increases, router can distribute enough tree node resources, and, router should guarantee as far as possible that the numbering of the tree node that distributes into each VPN is continuous, because, be a VPN distributed number continuous tree node after, search engine in this VPN of search, coboundary and the lower boundary that only need know the tree node numbering of distributing for this VPN are just passable, otherwise search engine and need write down the employed all discrete big tree node of this VPN, this increases random asccess memory (RAM in the extra sheet except needs, Random AccessMemory) outside the resource, also increased searching the complexity of engine design, reduced the refresh performance of router route.
In the prior art, in the router tree node resource in the binary tree at first is divided into the page or leaf of identical size, the page or leaf of said identical size is meant that the tree node quantity that comprises in each page is identical, and the tree node numbering in each page continuously.When the tree node quantity that provides in than single page or leaf as tree node quantity that VPN needs was big, then needing was that this VPN distributes the page or leaf more than.Though the numbering of the tree node in each page is continuously,, be that all tree node numberings that comprise in a plurality of pages or leaves of a VPN distribution may not be continuous.
In research and practice process to prior art, the present inventor finds, available technology adopting is the page or leaf of identical size with the tree node resource division, though the numbering of the tree node in each page continuously, but the numbering of all tree nodes in a plurality of pages or leaves that are difficult to guarantee to distribute for each VPN all is continuous, has increased searching the complexity of engine design, reduce the refresh performance of route, and be difficult to improve the utilance of tree node.
Summary of the invention
The embodiment of the invention provides a kind of partition tree node resource method and device, and can solve is that the tree node that a VPN distributes is numbered discontinuous problem, has compared with prior art improved the route refresh performance of router.
The embodiment of the invention provides a kind of partition tree node resource method, comprising:
To the tree node resource number in the binary tree, make that the numbering of the tree node in the described binary tree is continuous;
In more than one page or leaf, the numbering of the tree node in each page is continuous with the tree node resource division after the numbering, is not the tree node that all comprises similar number in each page in all pages or leaves.
The embodiment of the invention also provides a kind of device of partition tree node resource, comprising: numbered cell, dispensing unit,
Described numbered cell is used for the tree node resource number to binary tree, makes that the numbering of the tree node in the described binary tree is continuous;
Described dispensing unit is used for the tree node resource division after the numbering more than one page or leaf, and the numbering of the tree node in each page is continuous, is not the tree node that all comprises similar number in each page in all pages or leaves.
The embodiment of the invention is the page or leaf that varies in size with the tree node resource division, the equipment that makes can be selected corresponding page or leaf according to the required tree node number of concrete VPN, can guarantee to distribute a page or leaf into each VPN, guaranteed that promptly the tree node numbering of distributing for each VPN is continuous, compared with prior art, improved the route refresh performance of router, reduced searching the complexity of engine design.
Description of drawings
In order to be illustrated more clearly in embodiment of the invention technical scheme, to do to introduce simply to the accompanying drawing of required use in embodiment or the description of the Prior Art below, apparently, accompanying drawing in describing below only is some embodiments of the present invention, for those of ordinary skills, under the prerequisite of not paying creative work, can also obtain other accompanying drawing according to these accompanying drawings.
Fig. 1 is a kind of partition tree node resource method flow sketch that the embodiment of the invention one provides;
Fig. 2 is a rough schematic of dividing page or leaf and piece in the embodiment of the invention one;
Fig. 3 is 23 layers of binary tree structure schematic diagram of giving an example in the embodiment of the invention two;
Fig. 4 is a kind of partition tree node resource method flow sketch that the embodiment of the invention two provides;
Fig. 5 is a binary tree structure schematic diagram of giving an example in the embodiment of the invention three;
Fig. 6 is a kind of partition tree node resource method flow sketch that the embodiment of the invention three provides;
Fig. 7 is the logical block schematic diagram of a kind of storage device of providing of the embodiment of the invention four.
Embodiment
Below in conjunction with the accompanying drawing in the embodiment of the invention, the technical scheme in the embodiment of the invention is clearly and completely described, obviously, described embodiment only is the present invention's part embodiment, rather than whole embodiment.Based on the embodiment among the present invention, those of ordinary skills belong to the scope of protection of the invention not making the every other embodiment that is obtained under the creative work prerequisite.
Embodiment one,
Present embodiment provides a kind of partition tree node resource method, and as shown in Figure 1, this method comprises:
1:, make that the numbering of the tree node in the binary tree is continuous to the tree node resource number in the binary tree;
Wherein, to the dextrosinistral numbering of the tree node in the binary tree, make that the numbering of the tree node in the described binary tree is continuous, and the numbering of rightmost tree node is less than the numbering of Far Left tree node.All be not limited to dextrosinistral method for numbering serial among the embodiment of present embodiment and follow-up explanation, the method for other numbering also can be arranged.
2: the tree node resource division after will numbering is in more than one page or leaf, and the numbering of the tree node in each page is continuous, is not the tree node that all comprises similar number in each page in all pages or leaves.
Each tree node in the binary tree in the router of the storage forwarding prefix of needs understanding employing binary tree structure all has fixing numbering, and numbering is continuous integer.Be implemented as before VPN distributes tree node resource on the binary tree at router, tree node resource on the binary tree is classified in advance, be that tree node resource in the binary tree is divided into different page or leaf (Page), a plurality of pages size is unfixed, that is: the tree node quantity that comprises in some page can be identical, the quantity difference of the tree node that comprises in some page.All carry out in the time of needn't carrying out resource allocation methods to the division of the tree node resource on the binary tree at every turn.
A kind of partition tree node resource method that provides by present embodiment, employing is the page or leaf that varies in size with the tree node resource division, the equipment that makes can be selected corresponding page or leaf according to the required tree node number of concrete VPN, can guarantee to distribute a page or leaf into each VPN, guaranteed that promptly the tree node numbering of distributing for each VPN is continuous, compared with prior art, improved the route refresh performance of router, reduced searching the complexity of engine design.
A kind of partition tree node resource method that present embodiment provides after 2, can also comprise:
3: the page or leaf that will divide is divided into the piece more than again, comprise one or in each piece after the division more than a page or leaf, belong to every page of tree node that all has equal number in the piece, belong to the tree node that any two pages or leaves in the different masses have varying number.
Wherein, also need to illustrate, above-mentioned 3 also can carry out before 2, were about to tree node resource division in the binary tree in more than one piece;
Specifically comprise in then above-mentioned 2: the tree node resource division in the piece that will divide is in more than one page or leaf, the numbering of the tree node in each page is continuous, in all pages or leaves is not the tree node that all comprises similar number in each page, and comprise one or in each piece more than a page or leaf, belong to every page of tree node that all has equal number in the piece, belong to the tree node that any two pages or leaves in the different masses have varying number.
By increasing by 3, be equivalent to page or leaf is done classification, the page or leaf that size is identical is categorized as in the piece, thereby is convenient to the management of equipment the tree node resource.
After complete above-mentioned 2, perhaps, after complete above-mentioned 2 and 3, a kind of partition tree node resource method that present embodiment provides can also comprise:
4: obtain the tree node quantity that a VPN(Virtual Private Network) needs;
Wherein, the tree node quantity that obtaining VPN needs specifically can be severals number of nodes that need provide for this VPN that the network manager imports, and also can be that to make router to learn need be the resource size of this VPN distribution to additive method.
5: for this VPN distributes a page or leaf, the continuous tree node quantity of the numbering that comprises in this page is greater than or equal to the required tree node quantity of this VPN.
Wherein, because two or have discontinuous situation more than the numbering of all tree nodes of comprising in two the page or leaf, therefore, by 5, will be according to the tree node situation of a VPN actual needs, select a page or leaf, make this page to provide enough, and number continuous tree node resource for a VPN.
Also need to prove, in order to make router be convenient to the management tree node resource, also need page or leaf is divided usually, page or leaf is divided into piece.As: the tree node resource in binary tree is divided into a plurality of, comprises one or more than one page or leaf, every page of tree node resource that all has equal number in the same block again in each piece; The quantity of tree node increases progressively gradually in the single page or leaf in every.As shown in Figure 2, wherein, piece also can be divided into two classes, comprising: conventional bar (Normal Block) and mixed block (Hybrid Block); Can comprise a plurality of in the conventional bar, from Block1, Block2 to Block n, and the tree node quantity that comprises among each Page among Block identical (being each Page big or small identical among the same Block), the size of single Page among the Block2, big than single Page among the Block1, in like manner, according to from Block1, the order of Block2 to Block n, the size of single Page increases successively among each Block, be that the tree node quantity that comprises among the single Page among each Block increases gradually, wherein, the mode that tree node quantity among each Block among the single Page increases can have multiple, as: adopt the mode of arithmetic progression to increase, also can (K be 0 according to 2K, 1,2, the integer of 3 grades, the number of K is identical with the quantity of Normal Block) be single Page allocation tree node resource among each Block, can also decide single Page programming tree number of nodes according to the peak use rate of concrete tree node into each Block.Wherein, as single Page among each Normal Block during according to 2K programming tree node resource, the diversity ratio of the granularity of the Page among the different N ormal Block is bigger, and this moment, the peak use rate of tree node was 50%.
The above-mentioned method that Page is classified as different Block makes router flexible more, reasonable to the management of the tree node resource in the binary tree.
A kind of partition tree node resource method that present embodiment provides, router is according to the needed tree node quantity of each VPN, be chosen as each VPN and distribute a corresponding page or leaf, should corresponding page or leaf just have the continuous tree node quantity of numbering and be greater than or equal to a page or leaf with the required tree node quantity of the corresponding VPN of page or leaf, adopt this resource allocation methods, make for the numbering of the tree node resource of each VPN distribution continuous, compared with prior art, improved the route refresh performance of router, reduced searching the complexity of engine design.Simultaneously, improved the utilance of storing tree node in the router of transmitting prefix based on binary tree.
Embodiment two,
Present embodiment provides a kind of partition tree node resource method, and the method that present embodiment provides is similar to the method that embodiment one provides, and the method that present embodiment provides is than a kind of more specifically partition tree node resource of embodiment one method.Be that example is done a kind of partition tree node resource method of explanation with one 23 layers binary tree only in the present embodiment, other can obtain with reference to present embodiment easily based on the resource allocation methods of the binary tree of concrete form.
As shown in Figure 3, one 23 layers binary tree structure, this binary tree is divided into two parts again, comprising: the top of binary tree comprises 15 layers, 32K-1 big tree node and the bottom little tree node that has 8 layers altogether.Wherein, each big tree node is related with a little tree by pointer in 32K-1 the big tree node.Wherein, the tree node resource of distributing for each VPN is big tree node, is appreciated that the tree node resource that becomes the VPN distribution is to carry out according to 255 granularity.Being adopted as VPN distributes the benefit of big tree node to be: the quantity of big tree node is 32K-1, and the summation of big tree node and little tree node is 8M; The management of the management of 32K-1 tree node obviously being compared 8M tree node is easier.Therefore, the illustrated tree node resource for the VPN distribution is meant the big tree node of distribution below.
As shown in Figure 4, the method that provides of present embodiment comprises:
A1:, make that the numbering of the tree node in the binary tree is continuous to the tree node resource number in the binary tree;
A2: the tree node resource division after will numbering is in more than one page or leaf, and the numbering of the tree node in each page is continuous, is not the tree node that all comprises similar number in each page in all pages or leaves;
A3: the page or leaf that will divide is divided into the piece more than again, comprise one or in each piece after the division more than a page or leaf, belong to every page of tree node that all has equal number in the piece, belong to the tree node that any two pages or leaves in the different masses have varying number;
A4: obtain the big tree node quantity that a VPN(Virtual Private Network) needs;
Wherein, the method for obtaining the big tree node quantity of VPN needs specifically can be: at first obtain the tree node resource that this VPN needs altogether, once more, calculate the quantity of the big tree node of these VPN needs.For example: what VPN needed is 600 tree node resources, includes 255 decimal nodes under the big tree node, and then this VPN needs three big tree nodes.Also have other method of obtaining the big tree node quantity of VPN needs, explanation herein should not be construed the restriction to present embodiment.
It will be appreciated that the effect in router is identical to big tree node with the little tree node, all be used for storage and transmit prefix.
A5: for this VPN distributes a page or leaf, the continuous tree node quantity of the numbering that comprises in this page is greater than or equal to the required big tree node quantity of this VPN.
Wherein, need to prove that the big tree node in this router in the binary tree had been divided into page or leaf in advance before this method of execution, a plurality of pages or leaves are classified as different pieces again, and piece is divided into: conventional bar and mixed block.Still referring to shown in Figure 2, comprise in this router: 8 Normal Block and 1 HybridBlock, wherein, 8 Normal Block are respectively: Block1 to Block8.Comprise among each Block more than 1 Page, belong to the big tree node that each Page among the same Normal Block includes similar number.And big tree node number increases gradually among the single Page from Block1 to Block8, specifically can be: belong to that the big tree node number of single Page is 1 among the Block1, belong to that the big tree node number of single Page is 2 among the Block2, belong to that the big tree node number of single Page is 4 among the Block3, and the like, belong to that the big tree node number of single Page is 2 among the Block8
7Big tree node number among the single Page among the Hybrid Block can be set to 350.Then adopt the above-mentioned method that the size of each Page is set, the utilance of all tree nodes is the poorest in the binary tree can reach 50%.The size of single Page is regular increase among common a plurality of Normal Block, and big than single Page among the Normal Block usually of the single Page among the Hybrid Block.
If the big tree node quantity that current VPN needs is 7, then router can distribute a Page to give this VPN with (single Page size is 8 big tree nodes) among the Block4.
Wherein, need to prove that the number of big tree node concrete among each Page is not fixed, can number specifically be set according to the purpose utilance.Usually low more then this router route refresh performance of utilance is good more; And utilance is high more, and the forwarding prefix of then storing in the router is many more, and the capacity of storage prefix is just big more, and the route refresh performance of router is then low than the router performance that adopts the low partition tree node of utilance.Therefore, the designer determines utilance according to actual conditions, thus divided block and page or leaf.
A6: the big tree node quantity that needs as a VPN increases, when making big tree node quantity that current VPN needs greater than the big tree node quantity that provides in the page or leaf that has distributed, for this VPN redistributes a page or leaf, the continuous big tree node quantity of numbering that comprises in the page or leaf of redistributing is greater than or equal to the big tree node quantity of current VPN needs;
Wherein, with what illustrated among the A5, division result in advance to the big tree node in the binary tree in the router, if the big tree node quantity that VPN needs increases, current VPN needs 30 big tree nodes, and then (single Page size is 32 big tree nodes) distributes two Page to give this VPN in Normal Block5; If current VPN needs 300 big tree nodes, then (single Page size is 350 big tree nodes) distributes a Page to give this VPN in Hybrid Block.Then the Page among the Block4 is released, the explanation among the following A5.
A7: the VPN that discharges among the A6 increases before the big tree node quantity that needs, the page or leaf that distributes for this VPN.
Need to prove, among the above-mentioned A6, when the big tree node quantity of VPN needs is increased to 300, distributed a Page to give this VPN among the Hybrid Block.
A kind of partition tree node resource method that present embodiment provides, with the tree node resource division is the page or leaf that varies in size, according to the needed tree node quantity of each VPN, be chosen as each VPN and distribute a corresponding page or leaf, should corresponding page or leaf just have the continuous tree node quantity of numbering and be greater than or equal to a page or leaf with the required big tree node quantity of the corresponding VPN of page or leaf, adopt this resource allocation methods, make that the numbering of the tree node resource of distributing for most of VPN is continuous, compared with prior art, improved the route refresh performance of router, reduced searching the complexity of engine design.
Embodiment three,
Present embodiment provides a kind of partition tree node resource method, and the method that present embodiment provides is to implement on the basis of embodiment one or embodiment two.Before present embodiment is done explanation, need to prove, binary tree in the router is used for list items such as storing IP v4 or IPv6, because a tree node can only memory length be the list item of 32 bits (bit), therefore, the list item for surpassing 32bit need use a plurality of tree nodes simultaneously, for example: store the list item of 64bit, need to use the tree node of 2 32bit.
Because the effect of big tree node and little tree node is identical, therefore, big tree node and little tree node can be unitedly called to be tree node.Do explanation with tree node in the present embodiment.
In order to improve the utilance of tree node, usually be used for storing the list item of 32bit and 64bit in the binary tree, as shown in Figure 5, list item for 64bit, need two 32bit tree nodes to store with layer, and need to guarantee that the space of 32bit and 64bit can not be overlapping, for ease of understanding say overlapping here, comprise for example: if the numbering of the tree node in binary tree is respectively from 1 to 31, wherein, the tree node of numbering from 1 to 16 is used to store the list item of 32bit, and the tree node of numbering from 17 to 31 is used to store the list item of 64bit; The list item space of then working as 32bit is not enough, even the tree node of numbering from 17 to 23 does not have the list item of 64bit to take immediately, also the list item that the tree node of numbering from 17 to 23 cannot be distributed to 32bit uses, therefore, can produce the situation of node waste at the boundary of 32bit and 64bit, reduce the utilance of node.
Therefore, be divided into two parts a binary tree by the border of 32bit and 64bit: the list item of part storage 32bit, the list item of part storage 64bit, promptly the tree node in binary tree is divided into: two parts of the tree node of the tree node of the short list item of storage and the long list item of storage, wherein, the short list item of storage just thinks to store the list item of 32bit, stores long list item and just thinks to store 64bit, perhaps the list item of high-bit width more.In prior art, the border of 32bit and 64bit is according to the variation of route table items and corresponding adjustment in the binary tree, and long list item and short list item are shared whole binary tree space.
Search and refresh list item for the ease of router, all there is fixing numbering the position of each list item of storage in the binary tree, as simple example among Fig. 5, VPN A and VPN B are two Virtual Private Networks that need represent with the 64bit list item, two tree nodes with layer (are convenient to understand, also can think two child nodes deriving by a father node) list item of storage, the memory location that two tree nodes are formed renumbers, the numbering of the memory location that two tree nodes after renumbeing are formed is also fixed, for example: what distribute for VPN B is to be numbered 9 to 12 memory location, and each memory location is made up of two tree nodes; For the VPNA distribution is to be numbered 13 to 15 memory location.
Three networks of VPN C, VPN D and VPN E are Virtual Private Networks of representing with the 32bit list item, and the tree node that distributes for these three Virtual Private Networks is respectively: tree node is numbered 8 to 16, tree node be numbered 3 to 7 and tree node be numbered 1 to 2.
If router need be given VPN F allocation tree node resource, the network segment adopts the list item of 32bit to represent among the VPN F, and the tree node resource in the current 32bit space has been used up, and also have tree node not to be used in the 64bit space, as shown in Figure 5, hypothesis tree node 17 to 19 does not have occupied, then can increase a virtual tree node, this virtual tree node be numbered 22 tree node and form the memory space of a 64bit, therefore, tree node 17 to 19 can be divided in the memory space of 32bit, make that the border of 32bit and 64bit is dynamic, rather than changeless.Thereby improved the utilance of tree node in the binary tree.Binary tree shown in Figure 5 is a kind of very simple binary tree, for comprising in the router that the more binary tree of the number of plies can carry out resource allocation according to binary tree shown in Figure 5.
Above-mentioned is for the ease of understanding the explanation of a kind of partition tree node resource method that present embodiment three provides, below the method that present embodiment provides is done explanation, and as shown in Figure 6, this method comprises:
B1:, make that the numbering of the tree node in the binary tree is continuous to the tree node resource number in the binary tree;
B2: the tree node resource division after will numbering is in more than one page or leaf, and the numbering of the tree node in each page is continuous, is not the tree node that all comprises similar number in each page in all pages or leaves;
B3: the page or leaf that will divide is divided into the piece more than again, comprise one or in each piece after the division more than a page or leaf, belong to every page of tree node that all has equal number in the piece, belong to the tree node that any two pages or leaves in the different masses have varying number;
Wherein, when representing the network segment that comprises of VPN for the list item that adopts 32bit, each tree node just can be stored the network segment of 32bit, and therefore, a tree node just can be represented a list item; And when representing the network segment that comprises of VPN, need two tree nodes represent a list item for the list item that adopts 64bit, illustrated usually these two tree nodes with layer.For a more clear understanding of the present invention, can reconstitute a new tree node with thinking with two tree nodes of layer, this new tree node can be stored the network segment of 64bit.Therefore, tree node among B2 and the B3 can be understood as the network segment that each tree node can be stored 32bit, also can be understood as each tree node and can store the network segment of 64bit (promptly this tree node is to be made of the tree node that two bit wides are 32bit), perhaps, also can be understood as the network segment that each tree node can be stored the integral multiple of 32bit.
Above-mentioned B2, B3 can with implement 1,2 identical in one, specifying can reference example one.
B4: when the tree node lazy weight that is used to store short list item, and be positioned at the tree node of the short list item of storage and the boundary of the tree node of the long list item of storage, exist do not have occupied when being used to store the tree node of long list item, with boundary, there is not the occupied tree node that is used to store long list item, be divided into the tree node that is used to store short list item, regain and be used to first border of storing the tree node of short list item and being used to store the tree node of long list item;
Wherein, the boundary of the tree node of the tree node of the short list item of the storage of saying among the B4 and the long list item of storage, still with reference to Fig. 5, for numbering rule as shown in FIG. to the tree node of binary tree, as can be known, said herein border, be exactly to number 1 to 31 tree node, from demarcating between numbering 16 and 17, wherein, the tree node of numbering 1 to 16 is used to store short list item, and the tree node of numbering 17 to 31 is used to store long list item, being positioned at the tree node of the short list item of storage and the boundary of the tree node of the long list item of storage is meant from numbering 17, the tree node that numbering increases progressively continuously.
The above notion that the border is described according to numbering shown in Figure 5, it will be appreciated that, for different numberings, the understanding on border has multiple, binary tree figure from standard, the border of the tree node of the tree node of the short list item of storage and the long list item of storage is divided into two parts with straight line with tree node in the binary tree as shown in Figure 5.
B5: if the border will be attached to the low 32 bit tree nodes that two of same father node are used for storing the tree node of long list item, be divided into when being used to store the tree node of short list item, then increase the virtual tree node, make two of being attached to same father node be used for storing the high 32 bit tree nodes of the tree node of long list item, form the space of the long list item of storage with the virtual tree node that increases;
Wherein, the virtual tree node that increases among the B5 can be realized by the random asccess memory (RAM, Random Access Memory) that increases in realization.
Wherein, for the ease of understanding B5, still with Fig. 5 the example explanation, suppose to be divided into and be used to store long list item and be numbered 17,18,19 3 tree nodes are current be do not have occupied, and the tree node of the short list item of storage is not enough, then will be numbered 17,18, three tree nodes of 19 are divided into can store short list item, and be attached to the tree node of same father node with numbering 18 tree node, promptly be numbered 22 tree node, be not divided into the short list item of storage, be numbered 22 tree node needs and the virtual tree node that increases and reconfigure, just can be used to store long list item.Also need to prove, belong to the tree node that in the same father node two are used to store long list item and comprise: high 32 bit tree nodes and low 32 bit tree nodes; For example: being numbered 28 tree node and being numbered 20 tree node is to belong to a father node (promptly being numbered 24 tree node), and wherein, being numbered 28 tree node is high 32 bit tree nodes, is numbered 20 the low 32 bit tree nodes of tree node; Usually belong in two tree nodes of a father node, the big tree node of numbering number is high 32 bit tree nodes, and the tree node that the numbering number is little is low 32 bit tree nodes.
Perhaps, suppose to be divided into be used to store long list item be numbered 17,18,19,20 4 trees be node current be do not have occupied, above-mentioned four tree nodes are divided into the short list item of storage, and be attached to the tree node of same father node with numbering 20,18 tree node, promptly be numbered 28,22 tree node, be not divided into the short list item of storage, numbering is respectively 28,22 tree node to be needed and increases the virtual tree node to reconfigure, and just can be used to store long list item.
By above-mentioned explanation to B5 as can be known, for once repartitioning the border, needing the quantity of the virtual tree node that increases can be more than one.Bottom and top layer for a binary tree generally can not increase the virtual tree node, and for example: for the binary tree of 15 layers of big tree, its 1st layer and the 15th layer can not increase the virtual tree node.
B6: when the tree node lazy weight that is used to store long list item, and be positioned at the tree node of the short list item of storage and the boundary of the tree node of the long list item of storage, exist do not have occupied when being used to store the tree node of short list item, with boundary, do not have the occupied tree node that is used to store short list item, be divided into the tree node that is used to store long list item; Wherein, be used for storing the tree node of long list item, belong to long list item of two tree node storages of same father node; Be used for storing the tree node of short list item, short list item of a tree node storage.
Wherein, when the tree node resource that is used for storing long list item does not have the virtual tree node, then can directly not be used to store long list item among the B6 with having the tree node of the short list item of occupied storage, being divided into.
B7: when the tree node resource that is used for storing long list item has the virtual tree node, judge the tree node that forms the space of the long list item of storage with the virtual tree node, whether can divide from the tree node that is used for storing short list item with second border, be used to store the tree node of long list item, again form the space of the long list item of storage, if then discharge the virtual tree node.
By above-mentioned B7, make that under the situation that the virtual tree node is arranged the tree node that will be used to store short list item is divided into when being used to store long list item, initiate tree node can not conflict with the virtual tree node.
Also need to prove, for above-mentioned B4 and B7, the space of the short list item of impossible unconfined expansion storage in the router, the space of the long list item of perhaps impossible unconfined expansion storage, the maximum magnitude that can allow can determine according to practical application.
By above-mentioned explanation to B1 to B7, router is according to the needed tree node quantity of each VPN as can be known, be chosen as each VPN and distribute a corresponding page or leaf, make that to a great extent the numbering of the tree node resource of distributing for most of VPN is continuous, compared with prior art, improved the route refresh performance of router, reduced searching the complexity of engine design; Further, the tree node situation required according to VPN, the dynamic division is used to store long list item and the tree node resource of storing short list item, improved the utilance of tree node, compared with prior art, reduced the waste to tree node.
Also need to prove, is with the execution entity of router as method, in fact among three embodiment that more than provide, the entity of carrying out this method is not limited to router, also can be a kind of storage device, can be other also, should not be construed the restriction to above three embodiment.
Embodiment four,
Present embodiment provides a kind of device of partition tree node resource, and as shown in Figure 7, the device of this partition tree node resource comprises: numbered cell 10 and dispensing unit 20.
Wherein, numbered cell 10 is used for the tree node resource number to binary tree, makes that the numbering of the tree node in the described binary tree is continuous;
This dispensing unit 20 is used for the tree node resource division after the numbering more than one page or leaf, and the numbering of the tree node in each page is continuous, is not the tree node that all comprises similar number in each page in all pages or leaves.
Specifically can the size of dividing page or leaf according to the utilance of tree node in the dispensing unit 20.
The explanation of detailed partition page or leaf and piece can be obtained easily by explanation among the method embodiment in the dispensing unit 20, does not repeat herein.
The device of a kind of partition tree node resource that provides by present embodiment, employing is the page or leaf that varies in size with the tree node resource division, the equipment that makes can be selected corresponding page or leaf according to the required tree node number of concrete VPN, can guarantee a page or leaf, guarantee that promptly the tree node numbering of distributing for each VPN is continuous into each VPN distribution.
Optionally, this dispensing unit 20, can also be used for the page or leaf of described division is divided into piece more than one again, comprise one or in each piece after the described division more than a page or leaf, belong to every page of tree node that all has equal number in the piece, belong to the tree node that any two pages or leaves in the different masses have varying number.
This dispensing unit 20 is equivalent to page or leaf is done classification by increasing above-mentioned functions, the page or leaf that size is identical is categorized as in the piece, thereby is convenient to the management of device to the tree node resource.
Optionally, this device can also comprise: acquiring unit 30, allocation units 40 and memory cell 50.
Wherein, acquiring unit 30 is used to obtain the tree node quantity of VPN(Virtual Private Network) needs;
Described memory cell 50 is used for according to the page or leaf that distributes for VPN, the forwarding prefix of storage VPN, and described tree node is represented memory space.
Device by above-mentioned a kind of partition tree node resource that present embodiment is provided, this device can be according to the needed tree node quantity of each VPN, be chosen as each VPN and distribute a corresponding page or leaf, should corresponding page or leaf just have the continuous tree node quantity of numbering and be greater than or equal to a page or leaf with the required tree node quantity of the corresponding VPN of page or leaf, adopt this resource allocation methods, make for the numbering of the tree node resource of each VPN distribution continuous, compared with prior art, improved the route refresh performance of router, reduced searching the complexity of engine design.
Optionally, allocation units 40 also are used for increasing when the tree node quantity of VPN needs, when making tree node quantity that current VPN needs greater than the tree node quantity that provides in the page or leaf that has distributed for this VPN, for this VPN redistributes a page or leaf, the continuous tree node quantity of numbering that comprises in the page or leaf of redistributing is greater than or equal to the tree node quantity of current VPN needs.
It is the page or leaf that this VPN distributes that then described memory cell 50 also is used to discharge, and wherein, the page or leaf that distributes for this VPN is: for this VPN before increasing the tree node quantity that needs, distributed page.
Wherein, be the page or leaf of VPN distribution before discharging in the memory cell 50, concrete operation can be the forwarding prefix deletion that will store in this page, as the page or leaf recovery of sky.
Optionally, can also comprise in this storage device: the second resource adjustment unit 80 and configuration virtual tree node unit 70.
Wherein, the second resource adjustment unit 80, be used for when the tree node lazy weight that is used to store short list item, and be positioned at the tree node of the short list item of storage and the boundary of the tree node of the long list item of storage, exist do not have occupied when being used to store the tree node of long list item, with described boundary, there is not the occupied tree node that is used to store long list item, be divided into the tree node that is used to store short list item, regain and be used to first border of storing the tree node of short list item and being used to store the tree node of long list item;
Configuration virtual tree node unit 80, to be attached to the low 32 bit tree nodes that two of same father node are used to store the tree node of long list item if be used for described border, be divided into when being used to store the tree node of short list item, then increase the virtual tree node, make described two of being attached to same father node be used for storing the high 32 bit tree nodes of the tree node of long list item, form the space of the long list item of storage with the virtual tree node of described increase.
Then allocation units 30, also are used for the tree node that being used to of dividing that the back obtains stored short list item is distributed to described one or more than a Virtual Private Network.
Optionally, this storage device can also comprise: the first resource adjustment unit 60, be used for when the tree node lazy weight that is used to store long list item, and be positioned at the tree node of the short list item of storage and the boundary of the tree node of the long list item of storage, exist do not have occupied when being used to store the tree node of short list item, with described boundary, there is not the occupied tree node that is used to store short list item, be divided into the tree node that is used to store long list item; Wherein, the described tree node that is used for storing long list item, two tree nodes that belong to same father node are stored a long list item; The described tree node that is used for storing short list item, short list item of a tree node storage.
Then allocation units 40, also are used for the tree node that being used to of dividing that the back obtains stored long list item is distributed to described one or more than a Virtual Private Network.
Optionally, the first resource adjustment unit 60, also be used for when the tree node lazy weight that is used to store long list item, and be positioned at the tree node of the short list item of storage and the boundary of the tree node of the long list item of storage, exist do not have occupied when being used to store the tree node of short list item, with described boundary, there is not the occupied tree node that is used to store short list item, be divided into the tree node that is used to store long list item, be used to second border of storing the tree node of short list item and being used to store the tree node of long list item thereby regain;
Then, the device of a kind of partition tree node resource that present embodiment provides also comprises: judging unit 90;
Wherein, judging unit 90, be used for when the tree node resource that is used to store long list item has the virtual tree node, judge the tree node that forms the space of the long list item of storage with described virtual tree node, whether can divide from the tree node that is used for storing short list item, be used to store the tree node of long list item, form the space of the long list item of storage again with second border, if notify described configuration virtual tree node unit;
Then, configuration virtual tree node unit 70, also be used for when storing the tree node in the space of long list item with the formation of virtual tree node, can divide from the tree node that is used for storing short list item with second border, be used to store the tree node of long list item, when forming the space of the long list item of storage again, discharge described virtual tree node.
Need to prove that also the realization of virtual tree node can adopt RAM to realize usually, therefore, can also optionally comprise RAM in this storage device, is used to realize the virtual tree node.
Other explanations of above-mentioned illustrated all logic modules, the related description of a kind of partition tree node resource method that can provide with reference to present embodiment, and learn easily.
The storage device that provides in the present embodiment, by increasing by the first resource adjustment unit 60, the second resource adjustment unit 80, configuration virtual tree node unit 70 and judging unit 90, make the tree node situation that this storage device can be required according to VPN, the dynamic tree node resource that is used to store long list item and the short list item of storage of dividing, improved the utilance of tree node, compared with prior art, reduced waste to tree node.
One of ordinary skill in the art will appreciate that all or part of step in the whole bag of tricks of the foregoing description is to instruct relevant hardware to finish by program, this program can be stored in the computer-readable recording medium, and storage medium can comprise: ROM, RAM, disk or CD etc.
More than a kind of partition tree node resource method and device that the embodiment of the invention provided are described in detail, used specific case herein principle of the present invention and execution mode are set forth, the explanation of above embodiment just is used for helping to understand method of the present invention and core concept thereof; Simultaneously, for one of ordinary skill in the art, according to thought of the present invention, the part that all can change in specific embodiments and applications, in sum, this description should not be construed as limitation of the present invention.
Claims (16)
1, a kind of partition tree node resource method is characterized in that, comprising:
To the tree node resource number in the binary tree, make that the numbering of the tree node in the described binary tree is continuous;
In more than one page or leaf, the numbering of the tree node in each page is continuous with the tree node resource division after the numbering, is not the tree node that all comprises similar number in each page in all pages or leaves.
2, partition tree node resource method according to claim 1 is characterized in that, with the tree node resource division in the binary tree more than one the page or leaf in after, described method also comprises:
The page or leaf of dividing is divided into piece more than one again, comprise one or in each piece after the described division more than a page or leaf, belong to every page of tree node that all has equal number in the piece, belong to the tree node that any two pages or leaves in the different masses have varying number.
3, partition tree node resource method according to claim 1 is characterized in that, with the tree node resource division in the binary tree more than one the page or leaf in before, described method also comprises:
With the tree node resource division in the binary tree in more than one piece;
Then described with the tree node resource division in the binary tree in more than one page or leaf, the numbering of the tree node in each page is continuous, is not the tree node that all comprises similar number in each page in all pages or leaves, specifically comprises:
With the tree node resource division in the piece of dividing in more than one page or leaf, the numbering of the tree node in each page is continuous, in all pages or leaves is not the tree node that all comprises similar number in each page, and comprise one or in each piece more than a page or leaf, belong to every page of tree node that all has equal number in the piece, belong to the tree node that any two pages or leaves in the different masses have varying number.
4, want 1 described partition tree node resource method according to right, it is characterized in that, with the tree node resource division in the binary tree more than one the page or leaf in after, described method also comprises:
Obtain the tree node quantity that a Virtual Private Network needs;
For described Virtual Private Network distributes a page or leaf, the continuous tree node quantity of numbering that comprises in the described page or leaf is greater than or equal to the required tree node quantity of described Virtual Private Network.
5, partition tree node resource method according to claim 4 is characterized in that, described for after page or leaf of Virtual Private Network distribution, described method also comprises:
The tree node quantity that needs when a Virtual Private Network increases, when making tree node quantity that current described Virtual Private Network needs greater than the tree node quantity that provides in the page or leaf that has distributed for described Virtual Private Network, for described Virtual Private Network is redistributed a page or leaf, the continuous tree node quantity of numbering that comprises in the newly assigned page or leaf is greater than or equal to the tree node quantity of described current Virtual Private Network needs;
Discharging be the page or leaf that described Virtual Private Network distributes, and the described page or leaf that has distributed for Virtual Private Network is: for described Virtual Private Network increase need tree node quantity before distributed page.
6, partition tree node resource method according to claim 1 is characterized in that, with the tree node resource division in the binary tree more than one the page or leaf in after, described method also comprises:
When the tree node lazy weight that is used to store long list item, and be positioned at the tree node of the short list item of storage and the boundary of the tree node of the long list item of storage, exist do not have occupied when being used to store the tree node of short list item, with described boundary, do not have the occupied tree node that is used to store short list item, be divided into the tree node that is used to store long list item;
Wherein, the described tree node that is used for storing long list item, two tree nodes that belong to same father node are stored a long list item; The described tree node that is used for storing short list item, short list item of a tree node storage.
7, according to claim 1 or 6 described partition tree node resource methods, it is characterized in that, with the tree node resource division in the binary tree more than one the page or leaf in after, described method also comprises:
When the tree node lazy weight that is used to store short list item, and be positioned at the tree node of the short list item of storage and the boundary of the tree node of the long list item of storage, exist do not have occupied when being used to store the tree node of long list item, with described boundary, there is not the occupied tree node that is used to store long list item, be divided into the tree node that is used to store short list item, regain and be used to first border of storing the tree node of short list item and being used to store the tree node of long list item;
If described border will be attached to the low 32 bit tree nodes that two of same father node are used for storing the tree node of long list item, be divided into when being used to store the tree node of short list item, then increase the virtual tree node, make described two of being attached to same father node be used for storing the high 32 bit tree nodes of the tree node of long list item, form the space of the long list item of storage with the virtual tree node of described increase.
8, partition tree node resource method according to claim 7 is characterized in that, after the described increase virtual tree node, described method also comprises:
When the tree node lazy weight that is used to store long list item, and be positioned at the tree node of the short list item of storage and the boundary of the tree node of the long list item of storage, exist do not have occupied when being used to store the tree node of short list item, with described boundary, there is not the occupied tree node that is used to store short list item, be divided into the tree node that is used to store long list item, be used to second border of storing the tree node of short list item and being used to store the tree node of long list item thereby regain;
When the tree node resource that is used for storing long list item has the virtual tree node, judge the tree node that forms the space of the long list item of storage with described virtual tree node, whether can divide from the tree node that is used for storing short list item with second border, be used to store the tree node of long list item, again form the space of the long list item of storage, if then discharge described virtual tree node.
9, partition tree node resource method according to claim 1 is characterized in that, and is described to the tree node in binary tree numbering, makes that the numbering of the tree node in the described binary tree is continuous, specifically comprises:
To the dextrosinistral numbering of the tree node in the binary tree, make that the numbering of the tree node in the described binary tree is continuous, and the numbering of rightmost tree node is less than the numbering of Far Left tree node.
10, a kind of device of partition tree node resource is characterized in that, comprising: numbered cell, dispensing unit,
Described numbered cell is used for the tree node resource number to binary tree, makes that the numbering of the tree node in the described binary tree is continuous;
Described dispensing unit is used for the tree node resource division after the numbering more than one page or leaf, and the numbering of the tree node in each page is continuous, is not the tree node that all comprises similar number in each page in all pages or leaves.
11, device according to claim 10, it is characterized in that, described dispensing unit, the page or leaf that also is used for dividing is divided into the piece more than again, comprise one or in each piece after the described division more than a page or leaf, belong to every page of tree node that all has equal number in the piece, belong to the tree node that any two pages or leaves in the different masses have varying number.
12, device according to claim 10 is characterized in that, described device also comprises: acquiring unit, allocation units and memory cell;
Described acquiring unit is used to obtain the tree node quantity of Virtual Private Network needs;
Described allocation units are used to described Virtual Private Network to distribute a page or leaf, and the continuous tree node quantity of numbering that comprises in the described page or leaf is greater than or equal to the required tree node quantity of described Virtual Private Network;
Described memory cell is used for according to the page or leaf for described Virtual Private Network distribution, the forwarding prefix of storing described Virtual Private Network, and described tree node is represented memory space.
13, device according to claim 12, it is characterized in that, described allocation units, also be used for increasing when the tree node quantity of Virtual Private Network needs, when making tree node quantity that current described Virtual Private Network needs greater than the tree node quantity that provides in the page or leaf that has distributed for described Virtual Private Network, for described Virtual Private Network is redistributed a page or leaf, the continuous tree node quantity of numbering that comprises in the newly assigned page or leaf is greater than or equal to the tree node quantity of described current Virtual Private Network needs;
Described memory cell also is used to discharge the page or leaf that distributes for described Virtual Private Network, and the described page or leaf that has distributed for Virtual Private Network is: for described Virtual Private Network increase need tree node quantity before distributed page.
14, device according to claim 10 is characterized in that, described device also comprises: the first resource adjustment unit,
The described first resource adjustment unit, be used for when the tree node lazy weight that is used to store long list item, and be positioned at the tree node of the short list item of storage and the boundary of the tree node of the long list item of storage, exist do not have occupied when being used to store the tree node of short list item, with described boundary, do not have the occupied tree node that is used to store short list item, be divided into the tree node that is used to store long list item;
Wherein, the described tree node that is used for storing long list item, two tree nodes that belong to same father node are stored a long list item; The described tree node that is used for storing short list item, short list item of a tree node storage.
15, according to claim 10 or 14 described storage devices, it is characterized in that described device also comprises: the second resource adjustment unit and configuration virtual tree node unit,
The described second resource adjustment unit, be used for when the tree node lazy weight that is used to store short list item, and be positioned at the tree node of the short list item of storage and the boundary of the tree node of the long list item of storage, exist do not have occupied when being used to store the tree node of long list item, with described boundary, there is not the occupied tree node that is used to store long list item, be divided into the tree node that is used to store short list item, regain and be used to first border of storing the tree node of short list item and being used to store the tree node of long list item;
Described configuration virtual tree node unit, to be attached to the low 32 bit tree nodes that two of same father node are used to store the tree node of long list item if be used for described border, be divided into when being used to store the tree node of short list item, then increase the virtual tree node, make described two of being attached to same father node be used for storing the high 32 bit tree nodes of the tree node of long list item, form the space of the long list item of storage with the virtual tree node of described increase.
16, storage device according to claim 15, it is characterized in that, the described first resource adjustment unit, also be used for when the tree node lazy weight that is used to store long list item, and be positioned at the tree node of the short list item of storage and the boundary of the tree node of the long list item of storage, exist do not have occupied when being used to store the tree node of short list item, with described boundary, there is not the occupied tree node that is used to store short list item, be divided into the tree node that is used to store long list item, be used to second border of storing the tree node of short list item and being used to store the tree node of long list item thereby regain;
Described device also comprises: judging unit,
Described judging unit, be used for when the tree node resource that is used to store long list item has the virtual tree node, judge the tree node that forms the space of the long list item of storage with described virtual tree node, whether can divide from the tree node that is used for storing short list item with second border, be used to store the tree node of long list item, again form the space of the long list item of storage, if notify described configuration virtual tree node unit;
Then described configuration virtual tree node unit, also be used for when storing the tree node in the space of long list item with the formation of virtual tree node, can divide from the tree node that is used for storing short list item with second border, be used to store the tree node of long list item, when forming the space of the long list item of storage again, discharge described virtual tree node.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN200910152055A CN101616090B (en) | 2009-07-28 | 2009-07-28 | Method and device for dividing treenode resources |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN200910152055A CN101616090B (en) | 2009-07-28 | 2009-07-28 | Method and device for dividing treenode resources |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101616090A true CN101616090A (en) | 2009-12-30 |
| CN101616090B CN101616090B (en) | 2012-08-29 |
Family
ID=41495506
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN200910152055A Expired - Fee Related CN101616090B (en) | 2009-07-28 | 2009-07-28 | Method and device for dividing treenode resources |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101616090B (en) |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2012130054A1 (en) * | 2011-03-29 | 2012-10-04 | 华为技术有限公司 | Routing address inquiry method and apparatus |
| CN104579896A (en) * | 2014-11-20 | 2015-04-29 | 北京邮电大学 | Method and device for dividing virtual network |
| CN105916185A (en) * | 2016-03-30 | 2016-08-31 | 中国科学院信息工程研究所 | Uplink scheduling method based on double-tree routing and device |
| US10635645B1 (en) | 2014-05-04 | 2020-04-28 | Veritas Technologies Llc | Systems and methods for maintaining aggregate tables in databases |
| CN112883239A (en) * | 2021-01-26 | 2021-06-01 | 北京升哲科技有限公司 | Resource allocation method and device, computer equipment and storage medium |
| CN114781328A (en) * | 2022-06-21 | 2022-07-22 | 成都中科合迅科技有限公司 | Method for visually arranging business process based on plaintext file |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6421664B1 (en) * | 1999-06-16 | 2002-07-16 | International Business Machines Corporation | Apparatus, program product and method for estimating the number of keys within an index key range |
| US7330958B2 (en) * | 2005-09-22 | 2008-02-12 | International Business Machines Corporation | Method and apparatus for translating a virtual address to a real address using blocks of contiguous page table entries |
| CN101388842B (en) * | 2008-10-30 | 2012-04-04 | 华为技术有限公司 | Storage method and apparatus |
-
2009
- 2009-07-28 CN CN200910152055A patent/CN101616090B/en not_active Expired - Fee Related
Cited By (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2012130054A1 (en) * | 2011-03-29 | 2012-10-04 | 华为技术有限公司 | Routing address inquiry method and apparatus |
| US10635645B1 (en) | 2014-05-04 | 2020-04-28 | Veritas Technologies Llc | Systems and methods for maintaining aggregate tables in databases |
| US10817510B1 (en) * | 2014-05-04 | 2020-10-27 | Veritas Technologies Llc | Systems and methods for navigating through a hierarchy of nodes stored in a database |
| CN104579896A (en) * | 2014-11-20 | 2015-04-29 | 北京邮电大学 | Method and device for dividing virtual network |
| CN104579896B (en) * | 2014-11-20 | 2018-01-12 | 北京邮电大学 | A kind of partitioning method and device of virtual network |
| CN105916185A (en) * | 2016-03-30 | 2016-08-31 | 中国科学院信息工程研究所 | Uplink scheduling method based on double-tree routing and device |
| CN105916185B (en) * | 2016-03-30 | 2019-07-12 | 中国科学院信息工程研究所 | A kind of uplink dispatch method and device based on double tree routings |
| CN112883239A (en) * | 2021-01-26 | 2021-06-01 | 北京升哲科技有限公司 | Resource allocation method and device, computer equipment and storage medium |
| CN112883239B (en) * | 2021-01-26 | 2023-07-18 | 北京升哲科技有限公司 | Resource allocation method and device, computer equipment and storage medium |
| CN114781328A (en) * | 2022-06-21 | 2022-07-22 | 成都中科合迅科技有限公司 | Method for visually arranging business process based on plaintext file |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101616090B (en) | 2012-08-29 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101616090B (en) | Method and device for dividing treenode resources | |
| JP6190754B2 (en) | Apparatus and method for table lookup using centralized memory pool in network switch | |
| US11652760B2 (en) | Packet processing system, method and device having reduced static power consumption | |
| US8341187B2 (en) | Method and device for storage | |
| JP6789401B2 (en) | Equal cost path entry established | |
| CN104391907B (en) | A kind of fast path method for searching of variable resolution degree | |
| CN103825837A (en) | Node load distributed CDN global scheduling method | |
| US10042683B2 (en) | All-to-all message exchange in parallel computing systems | |
| US20150327135A1 (en) | Apparatus and method for dynamic hybrid routing in sdn networks to avoid congestion and balance loads under changing traffic load | |
| CN102075402A (en) | Virtual network mapping processing method and system | |
| CN102291296A (en) | Updating method and system of routing table | |
| CN106416152A (en) | Lookup device, lookup configuration method and lookup method | |
| CN105791455B (en) | Processing method and device for TCAM space | |
| US20190386910A1 (en) | Establishing entry corresponding to equal cost paths | |
| CN106033442B (en) | A kind of parallel breadth first search method based on shared drive architecture | |
| US11570105B2 (en) | Dynamic route profile storage in a hardware trie routing table | |
| CN106143532A (en) | Method that Train Dynamic heavily joins and node | |
| CN103270727B (en) | Bank aware multi-it trie | |
| CN102082832A (en) | Data storage method and device in distributed file system | |
| CN102420797A (en) | Topology mapping method and system | |
| CN104954263A (en) | Method and device for searching target nodes of complex network | |
| CN103457855B (en) | Classless inter-domain routing table is established and the method and apparatus of message forwarding | |
| WO2015055502A2 (en) | Method of partitioning storage in a distributed data storage system and corresponding device | |
| CN101420382A (en) | Method for relating next hop, method and apparatus for service flow switching | |
| Chen et al. | Algorithm for virtual nodes reconfiguration on network virtualization |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20120829 Termination date: 20190728 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |