CN100440826C - Static route refresh method - Google Patents
Static route refresh method Download PDFInfo
- Publication number
- CN100440826C CN100440826C CNB031242510A CN03124251A CN100440826C CN 100440826 C CN100440826 C CN 100440826C CN B031242510 A CNB031242510 A CN B031242510A CN 03124251 A CN03124251 A CN 03124251A CN 100440826 C CN100440826 C CN 100440826C
- Authority
- CN
- China
- Prior art keywords
- static routing
- subtask
- time
- interface
- static
- 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
Images
Abstract
The present invention provides a static route refreshing method. The static route refreshing method comprises the following steps of establishing the correlation between a network interface and a relevant static route, searching a static route relevant to the network interface according to the changed network interface, only refreshing the searched relevant static route, and optimizing task scheduling mechanisms of route modules simultaneously so as to realize the stable running of the entire system. The present invention can furthest increase the processing efficiency and reduce the CPU occupation.
Description
Invention field
The present invention relates to data communication technology, be particularly related in routing device configuration and maintenance management to static routing, make in network interface change and need refresh relevant static routing the time, can reduce holding time, and can avoid because of to the long system in case of system halt problem that causes of the holding time of CPU in the equipment CPU in the equipment.
Background technology
In the communication system of routine, on routing device, all can set up and safeguard the radix tree that is used for static routing.All static routing of this equipment disposition have wherein been comprised.Conventional method is to come the configuring static route by order line.Static routing will be kept in this routing device once configuration successful.In case certain network interface changes, the routing module in the routing device will be searched for this radix tree, and finding out needs to upgrade static routing, with up-to-date interface message with this route refresh.Therefore, when the frequent opening/closing of interface, routing module also and then ceaselessly increases and deletes static routing, thereby has taken a large amount of CPU times.
On the other hand, the three-tier switch product for the supported vlans interface can dispose a large amount of VLAN interfaces on physical port.In case and this physical port changes, all these VLAN interfaces all can change, and correspondingly also will refresh static routing.Cause routing module to take oversize CPU this moment easily, and it is unusual to cause other modules to occur, and can cause system to be restarted when serious.
Why the static routing method for refreshing of prior art can occur taking long problem of CPU time, mainly contains the reason of two aspects:
1) routing module is unreasonable to the processing of static routing at interface opening/closing message.Any one interface changes, and routing module all will travel through all static routing in the radix tree, and each bar static routing is wherein all repeated refresh operation.Get final product with this interface related static routing and in fact only need refresh those.In addition, search the method that corresponding outgoing interface adopts linear search according to next jumping of static routing in the refresh operation, may need the total interface of the current configuration of Ergodic Theory.Therefore, after having disposed a large amount of VLAN interfaces, every static routing all searched like this must take a large amount of CPU times one time.
2) routing module is unreasonable to the scheduling strategy that static routing refreshes (maintenance) management.As long as there is message to need to handle, routing module just ceaselessly calls the message processing function of static routing, and does not consider the demand of other tasks fully, thereby causes other tasks because can not get carrying out by hungry to death.In fact, in the real-time system that cpu resource can not be seized, suitable delegating power is very important.That is to say that when system interface opens or closes continually, when perhaps network topology changes, at first should guarantee the even running of equipment, next is only the problem that consideration restrains as early as possible.Therefore, be necessary the route module is improved the processing method of safeguarding of static routing information, make it adapt to complicated running environment more.
At present, the inventor does not also find the relevant programme that is optimized with maintaining method that refreshes to static routing.
Summary of the invention
Therefore, at above-mentioned problems of the prior art, purpose of the present invention is exactly that a kind of new method that static routing is refreshed will be provided, and takies long problem of CPU time in operation to solve routing module.
According to the present invention, a kind of method for refreshing of static routing is provided, comprise the steps:
By constituting radix tree structure static routing chained list, generate static routing outgoing interface concordance list, set up related between network interface and the relevant static routing;
For the network interface that changes, the calculating static routing relevant with described network interface in described outgoing interface concordance list with search;
Search next jumping of described static routing; If find described next jumping, then the interface index according to this next jumping generates index node, adds in the described HASH table; If search, then described static routing is placed the ad-hoc location of described HASH table less than described next jumping.
In said method of the present invention, by constituting radix tree structure static routing chained list, generate static routing outgoing interface concordance list, set up related the comprising between network interface and the relevant static routing:
A plurality of static routing of same destination are constituted the static routing chained list, specific static routing of each expression in the described static routing chained list, and the chained list that comprises described next jumping of static routing, each node in this chained list have been represented next jumping of this static routing configuration;
The outgoing interface index that static routing is found according to next jumping of dispose carries out hash (HASH) computing, generates described static routing outgoing interface index HASH table, and next respective nodes of jumping in the chained list of the node of this HASH table and described static routing is interrelated.
In said method of the present invention, for the network interface that changes, the static routing that calculating is relevant with described network interface with search in described outgoing interface concordance list comprises:
When described network interface changes, calculate the HASH value of this interface index according to the interface that changes;
Search and described interface related static routing in described HASH table;
The static routing that searches is refreshed.
In said method of the present invention, refreshing of static routing comprised the steps:
Search next jumping of described static routing according to the interface that changes;
Legal outgoing interface is searched in next jumping with the static routing that finds once more;
If can find new outgoing interface, then next is jumped new outgoing interface index and generates index node according to this, adds again in the described HASH table;
If search, then described static routing is placed the ad-hoc location of described HASH table less than described next jumping.
In the static routing method for refreshing of prior art, just static routing is organized in the radix tree, and the interface of static routing and configuration is not connected.Any so just cause when interface variation, not knowing refresh bar static routing, so have to be with all static routing refresh alls one time.And in said method of the present invention, by setting up index relative between static routing of setting at radix and the interface that is disposed thereof.When network interface changes, just all relevant static routing that really need refresh can have been found out along this index.
In addition, in said method of the present invention, also can further comprise the steps:
The maximum execution time of once uninterruptedly carrying out for the setting of single static routing Processing tasks;
At least one time detecting point in described static routing Processing tasks detects the time of implementation of current static routing Processing tasks;
If the detected time of implementation does not surpass described maximum execution time, then continue to carry out described current static routing Processing tasks; With
If the detected time of implementation surpasses described maximum execution time, then stop to carry out current static routing Processing tasks, and discharge the CPU that carries out the static routing Processing tasks.
Owing to have the long problem of CPU time that takies aspect the scheduling of the route maintenance management role that comprises the static routing refresh process in the prior art, in said method of the present invention, manage the maximum duration of once carrying out by the control route maintenance, thereby avoided the phenomenon that other tasks is hungry to death.
The time of implementation that at least one time detecting point in described static routing Processing tasks of the present invention detects current static routing Processing tasks further also can comprise the steps:
According to the priority of the subtask that comprises in the current static routing Processing tasks, described maximum execution time is divided into and the corresponding subtask of the number of described subtask maximum execution time;
At least one time detecting point in described subtask detects the time of implementation of current subtask;
If the detected time of implementation does not surpass the maximum execution time of described subtask, then continue to carry out described current subtask; With
If the detected time of implementation surpasses the maximum execution time of described subtask, then stop to carry out current subtask, and carry out the next described subtask that comprises in the current static routing Processing tasks.
Because the shared operating system task of the maintenance management of static routing and other Routing Protocol is if the mechanism of delegating power synchronously such as employing sleep though be unlikely to other tasks are hung up for a long time, might be hung up other Routing Protocols in the route task.Therefore, said method of the present invention has further adopted asynchronous mechanism of delegating power.Be about to whole route task and be divided into a subtask again, for example: subtask etc. is handled in timer subtask, JOB subtask, interface, to each subtask wherein distributing time of implementation by its significance level.Even the time of implementation also is not finished to the back, also to delegates power and carry out to next subtask.Transfinite total time if carry out, then whole route task is delegated power to other tasks.Such mechanism had both guaranteed the fairness of route task and other tasks, had guaranteed the fairness between the inner subtask again.
Description of drawings
By detailed explanatory note and in conjunction with the following drawings, above-mentioned purpose of the present invention, feature and the advantage easy to understand more that will become, wherein:
Fig. 1 is a data structure diagram of setting up index relative according to of the present invention between static routing and the interface that disposed thereof;
Fig. 2 is according to maximum duration that the setting of route maintenance task is once uninterruptedly carried out of the present invention and the method schematic diagram that carries out corresponding task scheduling processing.
Put next jumping that number is not limit.
Specifically, as shown in Figure 1, the static routing with certain priority to same destination of disposing in the static routing is represented with a rt_static.Next jumping that it had is represented with adv.As mentioned above, the quantity of the adv corresponding with specific static routing can have a plurality of.They are formed a single-track link table and hang over below this rt_static.If for each next jumping of representing with adv, can find an outgoing interface by the calling interface query function, then routing module just can make this static routing come into force and issue microcode.
As shown in Figure 1, related for static routing and interface are set up in the present invention, carry out HASH computing (hash computing) to dispose the corresponding outgoing interface index that next jumping finds according to static routing, thereby generated a HASH table (hash_table).Because it is identical to carry out the HASH value that the hash computing draws to different interfaces, so need set up a conflict chain, the outgoing interface string that will have an identical HASH value together.
In addition, as shown in fig. 1, because the outgoing interface that might different static routing finds is identical, the therefore chained list of next jumping of the different static routing configurations of expression of regeneration in the HASH table.This chained list has a begin chain (head), and it is arranged in the conflict chain of HASH table.A doubly linked list is arranged under it, and each node in the doubly linked list can be described as elem.In elem, preserve the pointer ifap that points to outgoing interface.In order to find the static routing under this interface, in elem, also preserve a rt_static pointer.Simultaneously, for with the above-mentioned data structure of static routing in adv be mapped, so that can be during the deletion configuration with the elem deletion of correspondence, in each elem, also preserved an adv pointer, be that each elem structure is all corresponding with an adv structure, and each adv structure all have at least an elem structure related with it.As can be seen from Figure 1, adv chained list and elem chained list just look like the both sides that hang over " ladder " below the rt_static, and the mutual pointer between them has then constituted " crosspiece " of " ladder ", and adv chained list and elem chained list are linked together.In a word, set up the related of outgoing interface and static routing by elem structure, rt_static structure and adv structure in the chained list of next jumping of each static routing configuration.
Utilize the related of network interface that said structure sets up and static routing, when interface variation, can upgrade relevant static routing as follows:
(1) interface that changes is carried out hash and calculate, draw the HASH value of this interface.The corresponding head structure of search in the conflict chain of HASH table.If do not find, then show not configuration and this interface related static routing, do not carry out refreshing and discharging cpu resource of route; Otherwise change next step (2);
(2) all elem structures of hanging under the traversal head.To each elem, return the static routing that the finger pointer finds configuration from rt_static wherein, call the function that refreshes of single static routing, the parameter that will comprise rt_static pointer, adv pointer, ifap pointer simultaneously passes to this and refreshes function, and carries out next step:
(3) when utilizing above-mentioned parameter to refresh static routing, if can find outgoing interface, then be with the interface index key (promptly use interface index as input, and call the HASH function calculation draw the result, it will be as the index of HASH table) generate the index node of this interface, insert in the HASH table.So-called interface index is the unique identification that internal system is represented an interface, and it is the numerical value of a ULONG type.The HASH function adopts interface index as input, adopts methods such as displacement, addition, XOR to make the different interface index of input can access different result of calculation through the docking port index as far as possible.If can not find outgoing interface, need to generate an index node equally, so that can enable this static routing again behind the configuration interface IP address later on.Because there is not the index of outgoing interface, the static routing that therefore this class be can not find outgoing interface is suspended in the HASH table on the special position---for example on the 256th array.After, these static routing that can not find outgoing interface set are all checked in new IP address of every configuration, therefrom to find out the static routing that can come into force.
In the present invention, the function that utilizes next jumping to find out interface has utilized a kind of IP address radix tree as searching object.This tree is that the IP address of this equipment disposition is arranged on the binary tree according to subnet size and mask-length.In addition, next jumping that also needs to dispose in the static routing also hangs on this tree, and this moment, the IP address was exactly next jumping of configuration, and mask is 32.When finding out interface, resemble like this IP message searched the routing table next is jumped as destination address and search this radix tree, if can the longlyest match a node that hangs with the IP address, then the interface at this place, IP address is exactly the corresponding outgoing interface of this next jumping.Because no matter dispose how many IP addresses, the radix tree has only 32 layers at most, and can therefore maximum couplings just necessarily can be known for 32 times find outgoing interface.Certainly, even do not adopt such method for rapidly positioning, but continue to use original linear method that travels through each interface, still can find out outgoing interface, only efficient will be hanged down.But no matter adopt any method, the prototype of outgoing interface query function is the same, the just inner difference that realizes.For static routing, and do not know that how realize this function inside, just calls this query function.
Like this, utilize above-mentioned data structure of the present invention and method, can only upgrade and certain interface related static routing, then do not process for other static routing.Can improve the efficient of processing to greatest extent like this, reduce taking CPU.
The modification that top optimization is just made at static routing.The message that changes when Interface status not for a long time, top optimization is enough.If but the message that exists a large amount of Interface status to change, then the total time of static routing processing is still very long.Therefore, the message number that static routing is handled need be limited.Otherwise the route task takies the long problem of CPU still might be occurred.But because the handling duration difference of each message is very big, directly the number tool of restriction of message processing bears the character of much blindness.Therefore, the present invention further provides on time scale the method for restriction of message number indirectly based on the above method.
In the task of the maintenance management of static routing, comprised a plurality of different subtasks, summarize get up can be divided into following:
(1) message processing-mainly be the message that receives the ICP/IP protocol stack, adjust back the receiver function processing protocol message of each protocol registration;
(2) interface handle-mainly be to receive by the relevant Interface status that send on interface management and the IP module and the message of IP address;
(3) error handling processing-mainly be is handled by the error messages that send on the forwarding module, needs to retransmit existing routing iinformation in case of necessity;
(4) order line processing-mainly be to receive the configuration order that transmits by order line, be transmitted to the command processing function of each agreement;
(5) timer processing-routing module oneself is safeguarded a cover timer processing mechanism.
(6) the operation processing-routing module task that can postpone to carry out is called operation, be carried out when it is will be in system idle.
In the above subtask, except operation is only handled one at every turn, outside can't being controlled, all other task can limit the message number of single treatment by the time.Concrete grammar will be illustrated in conjunction with Fig. 2 hereinafter.
Specify one the once uninterrupted maximum execution time of carrying out (RMET) for whole route task (for example refreshing task), for example be decided to be 250ms.Can be at the demand correct of different equipment or system.At least one time detecting point is set in whole route task executions process.Check on these test points whether total time of implementation of current route refresh task surpasses RMET.If do not surpass, then continue to carry out this task, otherwise promptly stop to carry out current route refresh, and discharge the CPU control.Can guarantee that so current route refresh task can be not hungry to death with other operating system task.
In an embodiment of the present invention, can and carry out frequency, the RMET of 250ms is divided into 6 parts, be called subtask maximum execution time (SMET) by the significance level of above-mentioned 6 subtasks.For example, message is treated to 70ms; Interface is treated to 90ms; Error handling processing 20ms; Order line is treated to 30ms; Timer processing is 20ms; Operation is treated to 20ms.
When concrete the processing, the time of implementation of controlling each subtask can not surpass the value that above-mentioned subtask maximum execution time is limited.At least one test point also correspondingly is set in a subtask.Whether the time of implementation of searching the current subtask of inspection on these test points then surpasses corresponding SMET.If do not surpass, then continue the processing of subsequent message in this subtask, even otherwise also have message pending, also must from current subtask, return major cycle, give next subtask with CPU.
Specifically, in the embodiment shown in Figure 2, the timer subtask runs into test point, calculates the current time of having carried out earlier, judges whether to surpass RMET then.If surpassed RMET, then discharge CPU, deduct the time of implementation with SMET simultaneously, so that this subtask is continued time of implementation and can not be surpassed the restriction of SMET when next route task is resumed CPU after, thereby accomplish that the balance between the subtask dispatches.If do not surpass RMET, check further then whether the processing time of timer subtask surpasses its corresponding SMET, then can continue to handle other timer and repeat above-mentioned detection step as not surpassing; Otherwise, even also have timer need handle also and must in time withdraw from, deducting this subtask processing time with RMET, the processing of subtask is handled in the operation that enters next step then.After if all timer processing finish, time of implementation does not still surpass the restriction of SMET, be added to the remaining time that then SMET is deducted this time of implementation on the SMET of next subtask, make and to use more time to handle when other subtask is busy relatively.
The above-mentioned treatment step of just describing the timer subtask in detail, the execution in step of other subtask is also substantially identical in fact, all is that the time check point need be set in suitable place, and checks whether RMET and SMET be overtime.If overtimely after preserving breakpoint, need in time to withdraw from so that allow next subtask continue to carry out.
Determine whether allowing a subtask to continue to carry out according to two conditions: RMET remaining time that (1) route task is total, it has represented whole route task can also carry out at most how long the just necessary CPU of release gives other task, and what its guaranteed is the fairness that whole route task and other task take CPU; (2) maximum execution time of this subtask customization, its expression be that the processing time summation that once carry out this subtask can not surpass this restriction, its assurance be the fairness that between each subtask of route task inside CPU is taken.The SMET initial value can be specified by the user, and the route task run cross several all over after, RMET constantly successively decreases and the initial value of SMET remains unchanged, and makes that the numerical value of SMET may be greater than RMET, at this moment whole route task suspension can be discharged CPU and gives other task in the middle of handling a subtask.When the route task is carried out once more, still from the subtask of hanging up, recover to carry out, but hang up the restriction that this twice time of implementation summation in front and back, subtask can not surpass the SMET of customization.
In said method, the maximum time that the SMET Just One Of Those Things that provides can be carried out, and the time of implementation between these subtasks often has certain elasticity.If work has just been finished in this subtask before the time that its corresponding SMET limits, can return immediately, and be used for the subtask of back the remaining time.After the circulation one time, surpass the restriction of RMET like this, and current route task also has need of work to carry out, then can not delegate power, enter circulation once more, be used for the processing of busy subtask the remaining time if find total time of implementation.The circulation here just is meant that 6 subtasks carry out one time successively, some subtask wherein might occur and fulfil ahead of schedule in the time at SMET, and some subtask is because of the overtime uncompleted situation of SMET.In this case, circulation is exactly to handle those because of the overtime subtask of ending in advance of SMET in order to continue once more.Under most of situation, not every subtask is all very busy, and for example order line is handled the speed limit because of input command, the time of often toing many or too much for use 30ms; Timer processing all is to do some to time-sensitive and handle brief thing, the 20ms that often also toos many or too much for use, and the remaining time of these subtasks can be given such as message and handle or interface is handled the subtask and used.Make that just because of the loose relation between this subtask all subtasks all have an opportunity to obtain to carry out on the one hand; To the time distribute to busy subtask on the other hand as far as possible.
In a preferred embodiment of the invention, discharge to the operation of the control of CPU simply the sleep function of call operation system (this function resembles a timer that starts the operating system, and duration is exactly the parameter of sleep.The task of calling this function is suspended automatically just may be recovered to carry out after having spent the fixed time) mode, but start an operating system task that priority is very low.Send out an incident to this task, wait for that then this task returns a response.Because the priority of this task is very low, so also can guarantee that in system other task lower than route task priority obtains carrying out when very busy, and in system when not busy, this task can be returned a response immediately after the incident of receiving the route task, make the route task to carry out immediately, improved the service efficiency of CPU.
Although describe the present invention above, should be appreciated that these illustrate the example of just having enumerated concrete enforcement more of the present invention, rather than limitation of the invention.Obviously can carry out various modifications and adopt the various means that are equal to each details of the embodiment of the invention.
For example, core concept of the present invention is, between the static routing and the factor (interface, IP address) that may change, set up related, to reach the purpose that the fast processing static routing is upgraded.But it is widely different to set up related number and mode.It is wherein a kind of mode that the mode of passing through HASH table in embodiment of the present invention is set up related between interface index and static routing, and alternate manner can also be arranged.For example, by directly in the interface data structure with deposit in the data structure of IP address and increase the pointer chained list, also can reach same purpose.
Equally, for the scheduling of route task, scheduling strategy also has a variety of, also can use a lot of ready-made dispatching algorithms.The solution of the present invention is to realize in non-seizing of a task, does not implement like that to control very accurately to operating system, and considers the expense of scheduling itself, thereby only adopted a kind of of more or less freely realization.In addition, can also take all factors into consideration some other factors such as dynamic priority and time of implementation, antithetical phrase task handling flow process is controlled the operation to realize justice, to stablize, give priority to artificially.
Therefore, scope of the present invention is only limited by claims.
Claims (9)
1. the method for refreshing of a static routing comprises:
By constituting radix tree structure static routing chained list, generate static routing outgoing interface concordance list, set up related between network interface and the relevant static routing;
For the network interface that changes, the calculating static routing relevant with described network interface in described outgoing interface concordance list with search;
Search next jumping of described static routing; If find described next jumping, then the interface index according to this next jumping generates index node, adds in the described HASH table; If search, then described static routing is placed the ad-hoc location of described HASH table less than described next jumping.
2. method according to claim 1 is characterized in that, described related comprising of setting up between network interface and the relevant static routing:
A plurality of static routing of same destination are constituted the static routing chained list, specific static routing of each expression in the described static routing chained list, and the chained list that comprises described next jumping of static routing, each node in this chained list have been represented next jumping of this static routing configuration;
The outgoing interface index that static routing is found according to next jumping of dispose carries out hash HASH computing, generates described static routing outgoing interface index HASH table, and next respective nodes of jumping in the chained list of the node and described static routing of this HASH table is associated.
3. method according to claim 2 is characterized in that, described step is for the network interface that changes, and the static routing that calculating is relevant with described network interface with search in described outgoing interface concordance list comprises:
When described network interface changes, calculate the HASH value of this interface index according to the interface that changes;
Search and described interface related static routing in described HASH table.
4. method according to claim 1 is characterized in that, described step generates index node according to the interface index of this next jumping, adds in the described HASH table further to comprise:
It is 32 IP address that next of described static routing jumped as mask-length, sets up the radix tree;
When described network interface changes, search for the next-hop node of corresponding static route in the described radix tree;
Upgrade the pairing static routing of next-hop node.
5. method according to claim 1 is characterized in that, described method further comprises,
When a plurality of described network interface generation state variation, the message number that restriction is handled static routing.
6. method according to claim 5 is characterized in that, described restriction further comprises the step of the message number that static routing is handled:
The maximum execution time of once uninterruptedly carrying out for the setting of single static routing Processing tasks;
At least one time detecting point in described static routing Processing tasks detects the time of implementation of current static routing Processing tasks;
If the detected time of implementation does not surpass described maximum execution time, then continue to carry out described current static routing Processing tasks; With
If the detected time of implementation surpasses described maximum execution time, then stop to carry out current static routing Processing tasks, and discharge the CPU that carries out the static routing Processing tasks.
7. method according to claim 6 is characterized in that, the time of implementation that described at least one time detecting point in described static routing Processing tasks detects current static routing Processing tasks further comprises:
According to the priority of the subtask that comprises in the current static routing Processing tasks, described maximum execution time is divided into and the corresponding subtask of the number of described subtask maximum execution time;
At least one time detecting point in described subtask detects the time of implementation of current subtask;
If the detected time of implementation does not surpass the maximum execution time of described subtask, then continue to carry out described current subtask; With
If the detected time of implementation surpasses the maximum execution time of described subtask, then stop to carry out current subtask, and carry out the next described subtask that comprises in the current static routing Processing tasks.
8. method according to claim 7 is characterized in that, if the described detected time of implementation does not surpass the maximum execution time of described subtask, then continues to carry out described current subtask and further comprises:
When finish described current subtask, enter the next son task handling immediately in its maximum execution time;
And described method further comprises:
After the processing of having carried out all subtasks, judge whether to surpass the maximum execution time of described single static routing Processing tasks;
If do not surpass described maximum execution time, judge whether also have the subtask to need to carry out in the current static routing Processing tasks;
If also have the subtask to need to carry out, then carry out this subtask, at least one the time detecting point in described subtask detects the time of implementation of current subtask then.
9. according to any described method in the claim 6,7 or 8, it is characterized in that described method further comprises:
When discharging the CPU that carries out the static routing Processing tasks, startup has the operating system task of low priority.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB031242510A CN100440826C (en) | 2003-04-30 | 2003-04-30 | Static route refresh method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB031242510A CN100440826C (en) | 2003-04-30 | 2003-04-30 | Static route refresh method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1543133A CN1543133A (en) | 2004-11-03 |
| CN100440826C true CN100440826C (en) | 2008-12-03 |
Family
ID=34321612
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB031242510A Expired - Fee Related CN100440826C (en) | 2003-04-30 | 2003-04-30 | Static route refresh method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN100440826C (en) |
Families Citing this family (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101340386B (en) * | 2008-08-12 | 2011-08-10 | 华为技术有限公司 | Method and router for establishing and searching route table items |
| CN101674221A (en) * | 2008-09-09 | 2010-03-17 | 中国移动通信集团公司 | Static routing generation method, method and device for implementing terminal routing |
| CN102271050B (en) * | 2010-06-04 | 2014-04-30 | 华为技术有限公司 | Method and system for automatically configuring network equipment in Internet protocol version 6 (IPv6) network, and network equipment |
| CN102984056A (en) * | 2012-12-18 | 2013-03-20 | 华为技术有限公司 | Processing method and device of static route and edge equipment |
| CN104239100A (en) * | 2014-09-11 | 2014-12-24 | 浪潮软件集团有限公司 | Universal data processing method |
| CN104506440B (en) * | 2014-12-26 | 2017-12-26 | 成都致云科技有限公司 | The data packet sending method and routing table amending method of router |
| CN113726661B (en) * | 2021-08-27 | 2022-10-18 | 西安微电子技术研究所 | High-performance low-power-consumption router hash device and control method thereof |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2001066986A (en) * | 1999-08-26 | 2001-03-16 | Sony Corp | Transmitter and method, receiver and method, communication system, and program storage medium |
| US6260155B1 (en) * | 1998-05-01 | 2001-07-10 | Quad Research | Network information server |
| US20030048785A1 (en) * | 2001-08-28 | 2003-03-13 | International Business Machines Corporation | Network processor with single interface supporting tree search engine and CAM |
| CN1469587A (en) * | 2002-07-16 | 2004-01-21 | 华为技术有限公司 | Routing calculation method based on opened shortest route priority routing protocol |
-
2003
- 2003-04-30 CN CNB031242510A patent/CN100440826C/en not_active Expired - Fee Related
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6260155B1 (en) * | 1998-05-01 | 2001-07-10 | Quad Research | Network information server |
| JP2001066986A (en) * | 1999-08-26 | 2001-03-16 | Sony Corp | Transmitter and method, receiver and method, communication system, and program storage medium |
| US20030048785A1 (en) * | 2001-08-28 | 2003-03-13 | International Business Machines Corporation | Network processor with single interface supporting tree search engine and CAM |
| CN1469587A (en) * | 2002-07-16 | 2004-01-21 | 华为技术有限公司 | Routing calculation method based on opened shortest route priority routing protocol |
Also Published As
| Publication number | Publication date |
|---|---|
| CN1543133A (en) | 2004-11-03 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US8270299B2 (en) | Communicator-based token/buffer management for eager protocol support in collective communication operations | |
| EP3111588B1 (en) | Constrained device and supporting operating system | |
| Zhao et al. | A window protocol for transmission of time-constrained messages | |
| US9438485B1 (en) | State machine controlled dynamic distributed computing | |
| CN109901926A (en) | Method, server and storage medium based on big data behavior scheduling application task | |
| EugeneNg | Maestro: balancing fairness, latency and throughput in the OpenFlow control plane | |
| El Khoury et al. | Energy-aware placement and scheduling of network traffic flows with deadlines on virtual network functions | |
| CN100440826C (en) | Static route refresh method | |
| US10498817B1 (en) | Performance tuning in distributed computing systems | |
| CN102081554A (en) | Cloud computing operating system as well as kernel control system and method thereof | |
| Schilling et al. | Efficient and distributed rule placement in heavy constraint-driven event systems | |
| CN101398772B (en) | Network data interrupt treating method and device | |
| CN102158406B (en) | Intelligent routing method for computer network links | |
| Assi et al. | Energy-aware mapping and scheduling of network flows with deadlines on VNFs | |
| Aljoby et al. | On SDN-enabled online and dynamic bandwidth allocation for stream analytics | |
| CN108737455B (en) | Network service identification device and method | |
| Fischmeister et al. | A verifiable language for programming real-time communication schedules | |
| CN101207518B (en) | Asynchronization maintenance system facing to distributed resource node | |
| CN106789380A (en) | A kind of virtual machine network integration supervisory systems | |
| Gaj | The concept of a multi-network approach for a dynamic distribution of application relationships | |
| CN101299758A (en) | Well-regulated group system for cosmically processing event as well as processing method | |
| CN106325983A (en) | Micro program model has less memory usage and supporting concurrence, and scheduling method | |
| KR20070039190A (en) | Load balancing method in the function of link aggregration | |
| Fischmeister et al. | Network-code machine: Programmable real-time communication schedules | |
| Biswas et al. | Efficient real-time Linux interface for PCI devices: A study on hardening a Network Intrusion Detection System |
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: 20081203 Termination date: 20150430 |
|
| EXPY | Termination of patent right or utility model |