CN101582851B - Method and system for realizing sharing route capacity on dual-stacker router - Google Patents
Method and system for realizing sharing route capacity on dual-stacker router Download PDFInfo
- Publication number
- CN101582851B CN101582851B CN2009101080002A CN200910108000A CN101582851B CN 101582851 B CN101582851 B CN 101582851B CN 2009101080002 A CN2009101080002 A CN 2009101080002A CN 200910108000 A CN200910108000 A CN 200910108000A CN 101582851 B CN101582851 B CN 101582851B
- Authority
- CN
- China
- Prior art keywords
- ipv4
- ipv6
- route
- routing table
- route entry
- 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.)
- Expired - Fee Related
Links
- 238000000034 method Methods 0.000 title claims abstract description 48
- 238000012545 processing Methods 0.000 claims abstract description 13
- 238000012217 deletion Methods 0.000 claims description 20
- 230000037430 deletion Effects 0.000 claims description 20
- 230000009977 dual effect Effects 0.000 claims description 6
- 238000012423 maintenance Methods 0.000 abstract description 3
- 238000010586 diagram Methods 0.000 description 8
- 230000008569 process Effects 0.000 description 8
- 238000012986 modification Methods 0.000 description 7
- 230000004048 modification Effects 0.000 description 7
- 238000005516 engineering process Methods 0.000 description 5
- 230000007704 transition Effects 0.000 description 5
- 230000008859 change Effects 0.000 description 3
- 238000004891 communication Methods 0.000 description 3
- 230000009286 beneficial effect Effects 0.000 description 2
- 238000011161 development Methods 0.000 description 2
- 230000008901 benefit Effects 0.000 description 1
- 230000000295 complement effect Effects 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 230000006641 stabilisation Effects 0.000 description 1
- 238000011105 stabilization Methods 0.000 description 1
- 238000013519 translation Methods 0.000 description 1
Images
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a method and a system for realizing sharing route capacity on a dual-stacker router, and the method and the system realize sharing route capacity by arranging a shared resourcepool of an IPv4 route and an IPv6 route and providing a processing mechanism of adding route items and deleting route items. The method and the system can effectively improve the utilization ratio of the memory resource of the router, can effectively reduce the maintenance complexity of the router and can flexibly configure the IPv4 route capacity and the IPv6 route capacity supported by the rout er equipment according to actual needs.
Description
Technical field
The present invention relates to the method for IPv4 and the shared routing capacity of IPv6 on the router of supporting IPv4 (internet protocol version 4) and IPv6 (internet protocol version 6) dual stack, relate to the computer network communication technology field.
Background technology
Along with the development of society and the progress of science and technology, increasing people brings into use the Internet, and the miscellaneous service on the Internet also emerges in an endless stream, and the IPv4 agreement as the internet core technology can not satisfy the needs of people for the Internet all the time.The network address that the IPv4 agreement can provide is about to run out of.In order to address this problem, the Internet is developed better to satisfy human wants, more network addresss are provided and have solved the IPv6 agreement that has IPv4 agreement shortcoming now and carried, and brought into use in a plurality of countries and regions.Though the purpose that the IPv6 agreement occurs is to substitute the IPv4 agreement, but the IPv6 agreement substitutes the IPv4 agreement can not accomplish in one move, in prevailing still IPv4 agreement of existing stage, the situation of two kinds of agreement coexistences will continue the quite a long time on the Internet, can fully substitute IPv4 until last IPv6.Can imagine that As time goes on, in the later stage of IPv4 to two kinds of agreement coexistences of IPv6, the agreement of dominate will be IPv6.
In order to solve the problem of IPv4 and IPv6 protocol interconnection, there has been a lot of methods to be carried, comprise various NAT (network address translation), tunnel etc.In any case but, all will support two protocol stacks of IPv4 and IPv6 in the IP agreement simultaneously by the IPv4 network equipment to the IPv6 transition stage, especially router, finishing the communication between the IPv4 network equipment, and the communication between the IPv6 network equipment.
Transmit and the forwarding of IPv6 message for supporting the IPv4 message simultaneously, the mode that existing route device equipment is adopted is that IPv4 protocol stack and IPv6 protocol stack are all safeguarded routing table separately, the all corresponding memory resource pool of each routing table, when adding the IPv4 route entry, from the memory resource pool of IPv4 routing table correspondence, apply for resource, corresponding route entry is added in the IPv4 routing table; When adding the IPv6 route entry, from the memory resource pool of IPv6 routing table correspondence, apply for resource, corresponding route entry is added in the IPv6 routing table.When the deletion route entry, resource is discharged into respectively in the corresponding memory resource pool.
Routing table is many to be realized with data tree structure, because the characteristics of longest prefix match algorithm, the storage of routing table need take very many storage resources, and in order to find route results quickly, most of routing tables realize all improving routing table lookup efficient by the method for trading space for time, such as the TRIE tree algorithm etc., this class algorithm is to just big especially surprising of the demand of storage resources.When system supports IPv4 and IPv6 dual stack, need be two routing tables difference reserved storage space, promptly safeguard the memory resource pool of two routing tables; Be not that two routing tables are reserved memory resource pool clearly during some are realized, but but limited the capacity of each routing table or the route entry number that can support respectively, this also is equivalent to impliedly is that two routing tables have been reserved memory resource pool separately.Because the use scene of router device is uncertain, thus the IPv4 routing table and an IPv6 routing table memory resource pool allocative decision that can be fit to all application scenarioss can't be selected, so storage resources is difficult to be utilized fully.Extreme case is, may only have the IPv4 route on the router of support IPv4/IPv6 dual stack, and there is not the IPv6 route at all, the memory resource pool of the so whole IPv6 of keeping for routing table will all be wasted, perhaps have only the IPv6 route on the router, the memory resource pool of the whole IPv4 of keeping for routing table will all be wasted.
Prior art has two kinds of typical methods to improve the routing capacity that router device is supported, but all there are some shortcomings in two methods, and these two methods are respectively:
1, increases the storage resources of router device, enlarge IPv4 routing table memory resource pool and IPv6 routing table memory resource pool simultaneously, make equipment support bigger IPv4 routing capacity and bigger IPv6 routing capacity simultaneously.Providing bigger routing capacity by the method that increases hardware resource is a kind of directly simple and effective method, but this method has following shortcoming: a) equipment cost raises; B) for commercial equipment, do not possess operability; C) utilization of resources of equipment is low, in the transition stage of IPv4 network to the IPv6 network, the IPv4 routing table scale of whole network is different with IPv6 routing table scale, still can't correctly estimate specifically should reserve great memory resource pool for which routing table, will certainly cause the wasting of resources.
2, revise IPv4 routing capacity or IPv6 routing capacity by upgrading router software,, provide different software versions according to the different application scene.Under the constant situation of memory space, can improve the routing capacity that another routing table is supported by the scale of a routing table of restriction.Though can realize redistributing by the mode of upgrade software to the device hardware resource, but at different application scenarioss, need to make different software versions, and along with networks development may need the software of updating the equipment continually, this can bring complexity to system maintenance, also may exert an influence to stabilization of equipment performance.
Summary of the invention
Technical problem to be solved by this invention provides a kind of method and system of realizing sharing route capacity on dual-stacker router, can improve the utilance of the storage resources of router effectively, and the complexity of safeguarding that reduces router effectively.
For solving the problems of the technologies described above, the present invention is achieved through the following technical solutions:
A kind of method that realizes sharing route capacity on dual-stacker router comprises following processing procedure: for the routing table on the dual-stacker router is distributed a shared resource pond; When adding route entry, memory allocated resource from the shared resource pond, and its new node as routing table added in the routing table; During the deletion route entry, resource is discharged in the shared memory resource pool.
Preferably, the described shared resource pond amount of capacity of distributing is determined one of in the following manner: the IPv4 route entry numbers that the shared resource pond is supported at most when not having the IPv6 route entry; The IPv6 route entry number that the shared resource pond is supported at most when not having the IPv4 route entry; IPv4 route entry number and the IPv6 route entry that can support are simultaneously counted sum.
Further, distribute the mode in shared resource pond to comprise:, perhaps to distribute a shared resource pond for the IPv4/IPv6 on the dual-stacker router unifies routing table for the IPv4 routing table on the dual-stacker router and shared resource pond of IPv6 routing table distribution.
A kind of system that realizes sharing route capacity on dual-stacker router comprises: the distributor that is used to the shared resource pond of routing table distribution on the dual-stacker router; When being used to add route entry, memory allocated resource from the shared resource pond, and add its new node in the routing table route adding set as routing table; When being used to delete route entry, resource is discharged into the route delete device of sharing in the memory resource pool.
Further, described distributor is used to IPv4 routing table and the IPv6 routing table on the dual-stacker router to distribute a shared resource pond, perhaps distributes a shared resource pond for the IPv4/IPv6 on the dual-stacker router unifies routing table.
The present invention has following beneficial effect:
The present invention is by carrying out small change to the routing table implementation method, just can realize the shared routing table storage resources of IPv4 and IPv6, and then the following beneficial effect of realization: first, can reduce routing table taking to storage resources, reduce the hardware cost of router device, improve the routing capacity that router device can be supported.Second, router device can automatically be adjusted the routing capacity of its support according to the network application scene, and when needs added more IPv4 route, equipment can be supported more IPv4 route automatically, when needs added more IPv6 route, equipment can be supported more IPv6 route automatically.The 3rd, the plant maintenance personnel can be according to actual needs, and IPv4 routing capacity and IPv6 routing capacity that equipment is supported artificially dispose, and do not need to upgrade router software, can realize the more easy and safe management of equipment.
Description of drawings
Fig. 1 a is the using method schematic diagram of traditional routing table implementation method for the IPv4 memory resource pool;
Fig. 1 b is the using method schematic diagram of traditional routing table implementation method for the IPv6 memory resource pool;
Fig. 2 is the embodiment of the invention one using method schematic diagram for memory resource pool when adopting IPv4/IPv6 independence routing tree;
When Fig. 3 adopts IPv4/IPv6 to unify routing table for the embodiment of the invention two for the using method schematic diagram of memory resource pool;
Fig. 4 is a segment schematic diagram of the embodiment of the invention two routing trees;
Fig. 5 a is the employed routing tree node data of a traditional routing table structural representation;
Fig. 5 b is the embodiment of the invention two employed routing tree node data structural representations;
Fig. 6 adds in the embodiment of the invention two and the state machine state transition schematic diagram of route tree node when deletion IPv4 and IPv6 route entry;
Fig. 7 unifies the flow chart of tabling look-up of routing table for IPv4/IPv6 in the embodiment of the invention two.
Embodiment
Below in conjunction with drawings and Examples the present invention is described in further detail.
Fig. 1 is the distribution method of conventional router equipment for the storage resources of IPv4 routing table and IPv6 routing table, and Fig. 1 a is the IPv4 route, and Fig. 1 b is the IPv6 route.When adding the IPv4 route, from exclusively enjoy memory resource pool, take out storage resources and add in the IPv4 routing table; During deletion IPv4 route, from the IPv4 routing table, discharge storage resources to exclusively enjoying in the memory resource pool.When adding the IPv6 route, from exclusively enjoy memory resource pool, take out storage resources and add in the IPv6 routing table; During deletion IPv6 route, from the IPv6 routing table, discharge storage resources to exclusively enjoying in the memory resource pool.As can be seen from the figure, in traditional routing table implementation method, IPv4 routing table and IPv6 routing table exclusively enjoy memory resource pool separately, can't utilize storage resources fully, and flexibility are not high.
Fig. 2 is the distribution method of the embodiment of the invention one for storage resources.IPv4 routing table and IPv6 routing table adopt independently routing tree, still Resources allocation from same memory resource pool.
Fig. 3 is the distribution method of the embodiment of the invention two for storage resources, in this case, not only realized IPv4 routing table and IPv6 routing table for the sharing of memory resource pool, routing table itself has also become one by two, has greatly improved the utilance of storage resources.
Implementation procedure to two embodiment is elaborated below.
Embodiment one:
Implementation algorithm for existing IPv4 routing table and IPv6 does not need to do any change, only revises the flow process of the application storage resources when adding route entry, and the flow process that reclaims storage resources during the deletion route entry.The routing table lookup algorithm does not need to do any change fully.
When adding route entry, no matter add which kind of route entry, all from same shared resource pond, apply for storage resources.1) if what add is the IPv4 route entry, then the storage resources that will apply for appends in the IPv4 routing table as IPv4 routing tree node.2) if what add is the IPv6 route entry, then the storage resources that will apply for appends in the IPv6 routing table as IPv6 routing tree node.
During the deletion route entry, no matter deletion is the IPv4 route entry, still deletion is the IPv6 route entry, all storage resources is recovered in the shared storage resources.
The routing table lookup algorithm is continued to use traditional routing table lookup algorithm fully, and therefore the advantage of this implementation method is less for existing software architecture influence.
Embodiment two:
Present embodiment is unified routing table corresponding to the IPv4/IPv6 that is mentioned among the present invention, need be to the structure of routing table, and flow process such as add, delete, table look-up adjusts, and can improve the utilance of storage resources to a greater degree.Its basic thought is that IPv4 route entry and IPv6 route entry are put in the unified routing table, on the routing tree of unified routing table correspondence, promptly the IPv4 route prefix can be arranged on each node, again the IPv6 route prefix can be arranged, both can exist simultaneously.
Fig. 4 is to use a subtree segment in the routing table that present embodiment creates, and in the figure, circular node is represented the empty node of routing tree, and square node is represented the routing tree physical node, and rectangle frame is then represented the route prefix node.So-called empty node is meant that this is to have only the pointer that points to next stage routing tree node on the routing tree node, does not adhere to real route prefix information on it; So-called physical node is represented to have adhered to real route prefix information on this routing tree node, whether has next stage routing tree node with it and has nothing to do; Real route prefix information is stored in the route prefix node.In subtree segment shown in Figure 4, promptly there is the IPv4 prefix that the IPv6 prefix is arranged again on the node P1, wherein the IPv6 prefix is added in the routing table prior to the IPv4 prefix; Has only an IPv4 prefix on the node P2; Also be promptly to have an IPv4 prefix that an IPv6 prefix is arranged again on the node P3, but the IPv4 prefix add in the routing table prior to the IPv6 prefix, node P4 has only an IPv6 prefix.
Realize that present embodiment relates to the modification of routing table data structure, and add, delete route entry, search the modification of flow processs such as routing table.Its alter mode is as described below:
One, the modification of routing table data structure.
As shown in Figure 5, Fig. 5 a is the data structure schematic diagram of traditional routing table tree node, and Fig. 5 b is the data structure schematic diagram of routing table tree node of the present invention.Have only route prefix pointer and child node pointer on the tradition routing table tree node, the present invention increases " route prefix type " field in the data structure that realizes routing table, and its span is respectively a) does not have route prefix; B) has only the IPv4 route prefix; C) has only the IPv6 route prefix; D) the IPv4 route prefix is promptly arranged, the IPv6 route prefix is arranged again.Shown in Fig. 5 b, except route prefix pointer and child node pointer are arranged, also have the route prefix type on the node, this field only needs two bits in realization, and whether correspondence has IPv4 route prefix and IPv6 route prefix respectively.The value of corresponding four kinds of route prefix types is respectively (digital back represents that with an alphabetical b this is a binary number): 00b-does not have route prefix; 01b-has only the IPv4 route prefix; 10b-has only the IPv6 route prefix; 11b-promptly has the IPv4 route prefix, and the IPv6 route prefix is arranged again.
Fig. 6 is the transition between states figure of the finite state machine of routing tree node.This state machine has four line states, is respectively: state 0, this node are empty node, and prefix types is 00b; State 1 has an IPv4 route prefix on this node, prefix types is 01b; State 2 has an IPv6 route prefix on this node, prefix types is 10b; State 3 has an IPv4 route prefix and an IPv6 route prefix simultaneously on this node, prefix types is 11b.
The transition process of a routing tree node under four kinds of states is: state 0 corresponding initial condition; After adding an IPv4 route from state 0, node gets the hang of 1; After adding an IPv6 route from state 0, node gets the hang of 2; After adding an IPv6 route from state 1, perhaps after IPv4 route of state 2 interpolations, node gets the hang of 3.After IPv6 route of state 3 deletions, node gets the hang of 1; After IPv4 route of state 3 deletions, node gets the hang of 2; After IPv4 route of state 1 deletion, perhaps after IPv6 route of state 2 deletions, node is got back to state 0 again.
Two, routing table is added the modification of flow process.
No matter be to add the IPv4 route entry or add the IPv6 route entry, all from the memory resource pool of sharing, apply for storage resources, then the storage resources of applying for is added in the unified routing table as node.If add the IPv4 route, corresponding routing tree node is put IPv4 route entry mark, showing has an IPv4 route entry herein; Equally, if add the IPv6 route, corresponding routing tree node is put IPv6 route entry mark, showing has an IPv6 route entry herein.
Three, the modification of routing table deletion flow process.
If deletion is the IPv4 route entry, and also have the IPv6 route entry on the corresponding node, then only remove the IPv4 route entry mark of respective nodes, do not discharge the shared resource of node; Conversely,, and also have the IPv4 route entry on the corresponding node, then only remove the IPv6 route entry mark on the respective nodes, do not discharge the shared resource of node if deletion is the IPv6 route entry.For other situation, all from unified routing table, extract node corresponding, and resource is recovered in the shared memory resource pool.
Four, the routing table modification of flow process of tabling look-up.
As shown in Figure 7, according to the IP address that will search, the node on the respective path of place routing tree is carried out following processing:
1, carries out redirect according to the type of searching the IP address that routing table uses,, then jump to step 2, otherwise jump to step 3 if what search is an IPv4 address.
2, judge whether the prefix types in the routing tree node is " having only the IPv4 prefix ", if, then take out the IPv4 prefix pointers, finish processing to this routing tree node.Otherwise, jump to step 4.
3, judge whether the prefix types in the routing tree node is " having only the IPv6 prefix ", if, then take out the IPv6 prefix pointers, finish processing to this routing tree node.Otherwise, jump to step 4.
4, judge whether the prefix types in the routing tree node is " existing IPv4 prefix has the IPv6 prefix again ", if not, illustrate that this routing tree node is an empty node, there is not route prefix on it, finish processing to this routing tree node.If then jump to step 5.
5, take out the prefix pointers route prefix data pointed of current routing tree node, judge that whether its type search employed IP address class type and be complementary with current, if, then take out current route prefix pointer, finish processing to this routing tree node.Otherwise, jump to step 6.
6, according to " next prefix pointers " of route prefix data in the step 5, take out new route prefix pointer, finish processing this routing tree node.
In addition, the present invention adopts IPv4 route and IPv6 route to share a memory resource pool being provided with of shared resource pond, physically do not distinguish the memory resource pool of two routes, promptly that the capacity limit of every kind of route is not dead, only restriction totally is used for the storage resources space of routing table.When not having the IPv6 route entry, support how many bar IPv4 route entrys at most such as router device, perhaps when not having the IPv4 route entry, support how many bar IPv6 route entrys at most, IPv4 route entry number and the IPv6 route entry number that can support simultaneously perhaps are set.Whole routing capacity is determined by the size of distributing to the shared memory resource pool of using of IPv4 route and IPv6 route, has been increased the flexibility of routing device.
The above only is preferred embodiment of the present invention, not in order to restriction the present invention, all any modifications of being done within the spirit and principles in the present invention, is equal to and replaces and improvement etc., all should be included within protection scope of the present invention.
Claims (6)
1. a method that realizes sharing route capacity on dual-stacker router is characterized in that, comprises following processing procedure:
Distribute a shared resource pond for the routing table on the dual-stacker router of supporting IPV4 and IPV6 dual stack, be specially: be the IPv4 routing table on the described dual-stacker router and shared resource pond of IPv6 routing table distribution;
When adding route entry, memory allocated resource from the shared resource pond, and its new node as IPV4 routing table/IPV6 routing table added in IPV4 routing table/IPV6 routing table accordingly;
During the deletion route entry, resource is discharged in the shared memory resource pool.
2. method according to claim 1 is characterized in that, the amount of capacity that described shared resource pond is distributed is determined one of in the following manner:
The IPv4 route entry number that the shared resource pond is supported at most when not having the IPv6 route entry;
The IPv6 route entry number that the shared resource pond is supported at most when not having the IPv4 route entry;
IPv4 route entry number and the IPv6 route entry that can support are simultaneously counted sum.
3. method according to claim 1 and 2 is characterized in that, the concrete processing procedure of described interpolation route entry comprises:
Memory allocated resource from the shared resource pond;
When adding the IPv4 route entry, the storage resources that is assigned to is added in the IPv4 routing table as new node; When adding the IPv6 route entry, the storage resources that is assigned to is added in the IPv6 routing table as new node.
4. a method that realizes sharing route capacity on dual-stacker router is characterized in that, comprises following processing procedure:
Distribute a shared resource pond for the routing table on the dual-stacker router of supporting IPV4 and IPV6 dual stack, be specially: distribute a shared resource pond for the IPv4/IPv6 on the described dual-stacker router unifies routing table;
When adding route entry, memory allocated resource from the shared resource pond, and its new node as routing table added in the routing table, concrete processing procedure comprises: memory allocated resource from the shared resource pond; Add the storage resources that is assigned to IPv4/IPv6 as new node and unify in the routing table, and on the new node that adds, IPv4 and/or IPv6 route-type mark are set;
During the deletion route entry, resource is discharged in the shared memory resource pool, concrete processing procedure comprises:
When deletion IPv4 route entry, the IPv4 route-type mark on this route entry corresponding node is removed; When deletion IPv6 route entry, the IPv6 route-type mark on this route entry corresponding node is removed; If do not have route entry on this route entry corresponding node, the resource of this route entry corresponding node is discharged into shares in the memory resource pool.
5. method according to claim 4 is characterized in that, the amount of capacity that described shared resource pond is distributed is determined one of in the following manner:
The IPv4 route entry number that the shared resource pond is supported at most when not having the IPv6 route entry;
The IPv6 route entry number that the shared resource pond is supported at most when not having the IPv4 route entry;
IPv4 route entry number and the IPv6 route entry that can support are simultaneously counted sum.
6. a system that realizes sharing route capacity on dual-stacker router is characterized in that, comprising:
The distributor that is used to IPv4 routing table on the dual-stacker router of supporting IPV4 and IPV6 dual stack and IPv6 routing table to distribute a shared resource pond;
When being used to add route entry, memory allocated resource from the shared resource pond, and add its new node in IPV4 routing table/IPV6 routing table route adding set accordingly as IPV4 routing table/IPV6 routing table;
When being used to delete route entry, resource is discharged into the route delete device of sharing in the memory resource pool.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2009101080002A CN101582851B (en) | 2009-06-12 | 2009-06-12 | Method and system for realizing sharing route capacity on dual-stacker router |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2009101080002A CN101582851B (en) | 2009-06-12 | 2009-06-12 | Method and system for realizing sharing route capacity on dual-stacker router |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101582851A CN101582851A (en) | 2009-11-18 |
| CN101582851B true CN101582851B (en) | 2011-11-30 |
Family
ID=41364817
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2009101080002A Expired - Fee Related CN101582851B (en) | 2009-06-12 | 2009-06-12 | Method and system for realizing sharing route capacity on dual-stacker router |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101582851B (en) |
Families Citing this family (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101938424B (en) * | 2010-09-15 | 2013-03-13 | 北京星网锐捷网络技术有限公司 | Method and device for establishing routing table and method and device for transmitting message |
| CN102164080B (en) * | 2011-03-29 | 2014-03-12 | 华为技术有限公司 | Routing address inquiry method and device |
| CN103457864B (en) * | 2013-08-27 | 2016-12-28 | 福建星网锐捷网络有限公司 | Process the method for route next jump, device and the network equipment |
| CN104426774A (en) * | 2013-09-03 | 2015-03-18 | 中兴通讯股份有限公司 | High-speed routing lookup method and device simultaneously supporting IPv4 and IPv6 |
| CN104009922B (en) * | 2014-05-09 | 2017-03-15 | 烽火通信科技股份有限公司 | IPV4/IPV6 routing capacity sharing methods based on TCAM |
| CN104253746B (en) * | 2014-09-17 | 2017-04-12 | 烽火通信科技股份有限公司 | Fast rerouting switching method and system |
| CN109688241B (en) * | 2018-12-25 | 2021-08-31 | 武汉烽火信息集成技术有限公司 | IPv4/IPv6 dual-stack conversion method and system based on SDN |
| CN110247837A (en) * | 2019-07-23 | 2019-09-17 | 上海地面通信息网络股份有限公司 | An IPv6 Network Transmission System |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1520188A (en) * | 1994-07-22 | 2004-08-11 | ������������ʽ���� | Inter-frame predictive coding and decoding device |
| CN1612562A (en) * | 2003-10-28 | 2005-05-04 | 武汉烽火网络有限责任公司 | Method and apparatus for implementing different internet protocol data packet forwarding using policy flow |
| US7356045B2 (en) * | 2002-10-22 | 2008-04-08 | Cisco Technology, Inc. | Shared port address translation on a router behaving as NAT & NAT-PT gateway |
-
2009
- 2009-06-12 CN CN2009101080002A patent/CN101582851B/en not_active Expired - Fee Related
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1520188A (en) * | 1994-07-22 | 2004-08-11 | ������������ʽ���� | Inter-frame predictive coding and decoding device |
| US7356045B2 (en) * | 2002-10-22 | 2008-04-08 | Cisco Technology, Inc. | Shared port address translation on a router behaving as NAT & NAT-PT gateway |
| CN1612562A (en) * | 2003-10-28 | 2005-05-04 | 武汉烽火网络有限责任公司 | Method and apparatus for implementing different internet protocol data packet forwarding using policy flow |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101582851A (en) | 2009-11-18 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101582851B (en) | Method and system for realizing sharing route capacity on dual-stacker router | |
| EP2850517B1 (en) | System and method for routing traffic between distinct infiniband subnets based on source routing | |
| US6490592B1 (en) | Method of and apparatus for generating a tree data structure supporting longest match lookup | |
| US7016979B2 (en) | System and method of accessing and transmitting different data frames in a digital transmission network | |
| US10284472B2 (en) | Dynamic and compressed trie for use in route lookup | |
| CN104272679A (en) | Communication system, control device, communication method, and program | |
| EP2997702B1 (en) | Compressing singly linked lists sharing common nodes for multi-destination group expansion | |
| CN109905251A (en) | Network management method, apparatus, electronic device and storage medium | |
| US9071503B2 (en) | Highly scalable OSPF routing in support of full mesh optical networks | |
| CN105324964A (en) | System and method for supporting multi-homed fat-tree routing in a middleware machine environment | |
| US9197598B2 (en) | MAC address distribution | |
| JP2015535410A (en) | Method and apparatus for modifying and forwarding messages in a data communication network | |
| Le et al. | Memory-efficient and scalable virtual routers using FPGA | |
| CN103270727B (en) | Bank aware multi-it trie | |
| CN101620623A (en) | Method and device for managing list item of content addressable memory CAM | |
| CN106453091B (en) | The equivalent route management method and device of router Forwarding plane | |
| Zhong | An IPv6 address lookup algorithm based on recursive balanced multi-way range trees with efficient search and update | |
| Luo et al. | A trie merging approach with incremental updates for virtual routers | |
| RU2120190C1 (en) | Method for correction of routes in data transmission network | |
| CN104301227B (en) | High-speed low-power-consumption IP route table lookup method based on TCAM | |
| CN102045262B (en) | Method, device and network equipment for updating media access control address table | |
| CN201414137Y (en) | Route list capability adjustment device | |
| CN106453092A (en) | Routing update method and device | |
| US7171490B2 (en) | Method and apparatus for reducing the number of write operations during route updates in pipelined forwarding engines | |
| CN104253710B (en) | The service management of MPLS three-layer VPNs optimizes system and method |
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 | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20190128 Address after: Delaware Patentee after: Open Invention Network Co.,Ltd. Address before: 518057 Zhongxing communication tower, South China Road, Nanshan District science and Technology Park, Shenzhen, Guangdong Patentee before: ZTE Corp. |
|
| TR01 | Transfer of patent right | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20111130 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |