CN106209626B - Self-adaptive routing issuing method and device - Google Patents
Self-adaptive routing issuing method and device Download PDFInfo
- Publication number
- CN106209626B CN106209626B CN201610596265.1A CN201610596265A CN106209626B CN 106209626 B CN106209626 B CN 106209626B CN 201610596265 A CN201610596265 A CN 201610596265A CN 106209626 B CN106209626 B CN 106209626B
- Authority
- CN
- China
- Prior art keywords
- issued
- routes
- issuing
- route
- time
- 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.)
- Active
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/02—Topology update or discovery
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/14—Routing performance; Theoretical aspects
Abstract
the invention provides a self-adaptive routing issuing method and a device, wherein the method comprises the following steps: when detecting a route to be issued, acquiring the issuing quantity of historical routes; judging whether the historical route issuing quantity is smaller than a first preset quantity or not; if the number of the routes to be issued is less than the preset number, the routes to be issued are issued to a prestored Tree table; and if the number of the routes to be issued is larger than or equal to the number of the routes to be issued, issuing the routes to be issued to a prestored Tree table according to a specified issuing mode, and further greatly improving the route issuing efficiency.
Description
Technical Field
the present invention relates to the field of communications technologies, and in particular, to a method and an apparatus for adaptively issuing a route.
Background
currently, when a route forwarding table is stored in a Tree table manner, if a route change is detected, the route which changes is directly issued to a pre-stored Tree table, and the route can be enabled to take effect quickly by using the issuing manner. However, when the number of routes stored in the Tree table is large, the depth of the Tree table becomes deeper and deeper, and if the routes are issued in the above manner when a large number of routes are continuously issued, the imbalance of the Tree table becomes more and more serious, the issuing speed of the route table entry becomes slower and slower, and further, the route issuing efficiency is reduced.
Disclosure of Invention
aiming at the defects of the prior art, the invention provides a self-adaptive routing issuing method and a device.
the invention provides a self-adaptive routing issuing method, which is applied to network equipment, wherein the method comprises the following steps:
When detecting a route to be issued, acquiring the issuing quantity of historical routes;
Judging whether the historical route issuing quantity is smaller than a first preset quantity or not;
if the historical route issuing number is smaller than a first preset number, issuing the routes to be issued to a prestored Tree table;
and if the historical route issuing number is greater than or equal to a first preset number, issuing the routes to be issued to a pre-stored Tree table according to a specified issuing mode.
the invention also provides a self-adaptive routing issuing device, which is applied to network equipment and comprises:
The acquisition unit is used for acquiring the issuing quantity of the historical routes when the routes to be issued are detected;
the judging unit is used for judging whether the historical route issuing quantity is smaller than a first preset quantity or not;
the first issuing unit is used for issuing the routes to be issued to a pre-stored Tree table when the issuing number of the historical routes is smaller than a first preset number;
And the second issuing unit is used for issuing the routes to be issued to a pre-stored Tree table according to a specified issuing mode when the issuing quantity of the historical routes is greater than or equal to a first preset quantity.
when the self-adaptive routing issuing method and the device provided by the invention detect the to-be-issued routes, if the historical routing issuing number is determined to be smaller than the first preset number, the to-be-issued routes are issued to the pre-stored Tree table, and if the historical routing issuing number is determined to be larger than or equal to the first preset number, the to-be-issued routes are issued to the pre-stored Tree table according to the specified issuing mode. Therefore, when the large-size route is stored in the Tree table mode, the route issuing efficiency can be improved by adaptively adjusting the route issuing mode.
Drawings
fig. 1 is a schematic flow chart of a self-adaptive routing method in the embodiment of the present invention;
Fig. 2 is a schematic diagram of a logic structure of an adaptive forwarding routing apparatus according to an embodiment of the present invention;
fig. 3 is a schematic diagram of a hardware architecture of a network device where a self-adaptive routing issuing device is located in the embodiment of the present invention.
Detailed Description
for the purpose of making the present application more apparent, its technical solutions and advantages will be further described in detail with reference to the accompanying drawings.
in order to solve the problems in the prior art, the invention provides a self-adaptive routing issuing method and a device.
referring to fig. 1, a schematic processing flow diagram of a self-adaptive routing method for sending down, which is applicable to a network device, is shown, and the method includes the following steps:
step 101, when detecting the route to be issued, acquiring the issuing quantity of the historical route.
when the pre-stored routing table changes, for example: when a route is newly added, changed or deleted, a changed route needs to be issued to the Tree table stored to hardware such as a forwarding chip, and the changed route is a route to be issued. The route may be an IPv4 route or an IPv6 route, and the Tree table may also be implemented by various algorithm modes, for example, an algorithm mode combining Tcam (Ternary Content-Addressable Memory) and the Tree table.
The historical route issuing number in this embodiment is the sum of the route number stored in the Tree table, the number of routes to be issued stored in the cache table entry, and the number of currently detected routes to be issued. As for the number of routes to be issued stored in the cache entry, the following description is omitted for the sake of brevity.
and 102, judging whether the historical route issuing quantity is less than a first preset quantity.
the first preset number is used for judging whether the number of the historical issued routes is larger than a critical value, and is also one of the standards for judging which issuing mode is used for the current route to be issued. The first preset number may also be referred to as a threshold Nh of the number of entries of the first-stage end entry, for example: a typical value may be 150K.
In this embodiment, a stage in which the historical route delivery number is smaller than the first preset number may be used as the first stage, and a stage equal to or larger than the first preset number may be used as the second stage. And executing step 103 when determining that the historical route issuing number is smaller than a first stage of a first preset number, and executing step 104 when determining that the historical route issuing number is greater than or equal to a second stage of the first preset number.
and 103, sending the route to be sent to a prestored Tree table.
In the first stage, the historical route issuing number is smaller than the first preset number, which indicates that the number of the historical issued routes is small, or the number of the routes stored in the Tree table is small, so that the routes to be issued can be directly issued to the pre-stored Tree table, and the issuing speed of the Tree table cannot be influenced.
and 104, issuing the to-be-issued routes to a pre-stored Tree table according to a specified issuing mode.
in this embodiment, each time a route to be issued is detected, the route to be issued needs to be counted, and the count is recorded in the count of the route to be issued. When the subsequent to-be-issued route is counted, one may be added on the basis of the count recorded in the to-be-issued route count. However, for the situation that the routing table does not change for a long time, a new route to be issued will be detected only after a long interval, and in order to ensure that the route issuing efficiency of the present invention is maximized, a time window t1 may be set in advance, and a typical value may be 5min, which is used to determine the counting manner of the route to be issued when the route to be issued is detected. When a to-be-issued route is detected, first, a first interval time between the current time of detecting the to-be-issued route and the last time of detecting the to-be-issued route is calculated, and whether the first interval time is less than a time window t1 is judged, if the first interval time is less than the time window t1, the count recorded in the count of the to-be-issued route is increased by one, if the first interval time is greater than or equal to the time window t1, another group of routes are considered to be issued, the count recorded in the count of the to-be-issued route is set to an initial value, for example, 0, and the count is counted again from 0.
in the second stage, when the historical route issuing number is greater than or equal to the first preset number, it indicates that the number of the historical issued routes is greater, or the number of the routes stored in the Tree table is greater, and if the routes to be issued are directly issued to the prestored Tree table, the issuing speed of the Tree table may be affected, and the processing efficiency is reduced. Therefore, in the embodiment of the present invention, the route to be issued may be issued to a pre-stored Tree table according to a specified issuing manner.
The designated issuing mode is as follows:
when the count of the current routes to be issued is greater than or equal to a first preset number, checking whether the pre-stored cache table entries store the routes to be issued or not;
If yes, storing the routes to be issued into the cache table entry, and generating an optimal Tree according to all the routes to be issued in the cache table entry and all the routes in the preset Tree table and issuing the optimal Tree to the Tree table when a preset condition is met;
otherwise, judging whether the count of the currently detected to-be-issued routes is smaller than a second preset number;
When the count of the current routing table items to be issued is less than a second preset number, issuing the routes to be issued to a prestored Tree table;
And when the count of the current routes to be issued is greater than or equal to a second preset number, storing the routes to be issued into the cache table entry, and when a preset condition is met, generating an optimal Tree according to all the routes to be issued in the cache table entry and all the routes in the preset Tree table, and issuing the optimal Tree to the Tree table.
Wherein, the meeting of the preset condition comprises:
When a polling period is reached, acquiring the current time;
Calculating a second interval time when the time of the last stored route to be issued reaches the current time in the cache table entry;
judging whether the second interval time is smaller than a time window t 2;
if the second interval time is less than or equal to the time window t2, calculating the table item establishing time of the cache table item, and when the table item establishing time is greater than or equal to the table item delay time and the cache table item has a route to be issued, determining that a preset condition is met;
and if the second interval time is greater than or equal to the time window t2 and the cache table entry has the route to be issued, determining that the preset condition is met.
In this embodiment, the designated delivery method of the second stage may include a method of delivering a route using a priority delivery method and a method of delivering a cache.
Specifically, when the current second stage is determined to be a second stage with more routes to be issued, that is, when the count of the current routes to be issued is greater than or equal to the first preset number, whether the routes to be issued are stored in the established cache table entry may be checked in the following two ways:
In the first way, the cache status stored in the rebuild table is detected, for example, "true" indicates that the route to be issued is stored, and "False" indicates that the route to be issued is not stored.
in the second mode, the recorded number of cache entries, which is the number of routes to be issued stored in the cache entry in step 101, is obtained. For example, if the number of cache entries is 0, it indicates that the route to be issued is not stored, and the number of cache entries is not 0, it indicates that the route to be issued is stored.
it should be noted that the cache entry may not exist in the initial state, and therefore, in the process of issuing a route according to the cache issuing manner for the first time, when a route to be issued needs to be added to the cache entry, a cache entry may be generated according to the route to be issued, and the cache state of the cache entry may be stored in the rebuild table. Of course, the cache table entry may also create an empty cache table entry for later use when the adaptive routing function provided by the present invention is enabled.
If the to-be-issued route is determined to be stored in the cache entry according to the above method, which indicates that the to-be-issued route is currently issued by using the cache issuing method, the to-be-issued route may be stored in the cache and continuously issued according to the cache issuing method, and the number of the cache entries is updated.
When it is determined that the to-be-issued routes are not stored in the cache table entry according to the above manner, whether the number of the current to-be-issued routes is too large is further determined, so as to reach the degree of affecting the processing efficiency. The condition of judging whether the number of the routes to be issued is excessive may be set to a second preset number in addition to the above condition of determining that the number of the routes to be issued is stored in the cache table entry, and when it is determined that the count of the routes to be issued is smaller than the second preset number, the number of the routes currently changed may be considered to be smaller, and in order to take the time for the routes in the cache table entry into consideration, the routes to be issued may be issued to the Tree table preferentially according to the manner in step 103, that is, the routes are issued in a preferential issuing manner.
On the contrary, when it is determined that the count of the current route to be issued is greater than or equal to the second preset number, it may be considered that the number of the currently changed routes is too large to reach the degree that the route issuing efficiency is affected, and at this time, the route to be issued may be stored in the cache entry in a cache issuing manner to wait for issuing.
in the cache delivery mode, after the route to be delivered is stored in the cache entry, the information related to the cache entry needs to be updated or recorded correspondingly, so as to construct the optimal tree in the following. For example, the information that needs to be updated includes: updating the number of cache entries; the information to be recorded includes: recording the time for storing the to-be-issued route into the cache table entry, and in addition, judging whether the table entry establishment time of the cache table entry is 0, if so, indicating that the to-be-issued route is the first route added into the cache table entry, and recording the current time as the establishment starting time of the cache table entry.
In this embodiment, a duration of the polling cycle is also preset, when the polling cycle is reached, the current time of the system is obtained, a second interval time when the time of the last stored route to be delivered reaches the current time in the cache table entry is calculated, and it is determined whether there is no new route to be delivered for a long time through a preset time window t2, where the time window t2 may also be referred to as a cache delivery finish time window Tpf, for example: a typical value may be 5 s.
if the second interval time is greater than or equal to the time window t2(Tpf), it is indicated that no new route to be issued exists for a long time, whether a route to be issued exists in the cache table entry can be judged according to the above manner, and when the route to be issued exists, the preset condition for issuing the route to be issued to the Tree table is determined to be met, the recorded route count to be issued can be set as an initial value to perform a new round of counting, the number of the cache table entries and the table entry establishment time are simultaneously cleared, and through a rebuild action, the route to be issued in the cache table entry and all routes in the preset Tree table are constructed into an optimal Tree and issued to the Tree table to replace the original Tree table, and finally, the cache state stored in the rebuild table is modified into 'False' indicating that the route to be issued is not stored, so as to complete the route issuing of the round.
if the second interval time is smaller than the time window t2(Tpf), it may be further determined whether the entry setup time of the cache entry is too long. Specifically, the entry delay time may be preset, and may also be referred to as a buffer down-sending delay window Td, which represents the maximum buffer time of the buffer entry, for example: a typical value may be 2 min. When the first route to be issued is stored in the cache table entry, that is, timing is started, when the second interval time is less than a time window t2, the table entry establishing time of the current cache table entry is obtained, when the table entry establishing time is greater than or equal to a table entry delay time (Td), the longest cache time of the cache table entry is shown to be reached, whether the route to be issued exists in the cache table entry can be judged according to the method, when the route to be issued exists, the preset condition for issuing the route to be issued to the Tree table is determined to be met, the count of the route to be issued can be set as an initial value to perform a new round of counting, the number of the cache table entries and the table entry establishing time are simultaneously cleared, an optimal Tree is constructed according to the route to be issued in the cache table entry and all routes in the preset Tree table by a rebuild action to replace the original Tree table, and finally, the state stored in the rebuild table is modified into 'False' indicating that the route to be issued is not stored, to complete the route transmission of the current round.
Therefore, according to the self-adaptive routing issuing method provided by the invention, when the to-be-issued routes are detected, if the historical routing issuing number is determined to be smaller than the first preset number, the to-be-issued routes are issued to the pre-stored Tree table, and if the historical routing issuing number is determined to be larger than or equal to the first preset number, the to-be-issued routes are issued to the pre-stored Tree table according to the specified issuing mode. Therefore, when the large-size route is stored in the Tree table mode, the method and the device can adapt to the change of the existing network route, adaptively adjust the route issuing mode, give consideration to the issuing speed and the effective time delay of the Tree table and improve the route issuing efficiency.
the present invention further provides a self-adaptive routing issuing device, fig. 2 is a schematic structural diagram of the self-adaptive routing issuing device, the device may be applied to a network device, the self-adaptive routing issuing device may include an obtaining unit, a 201 determining unit 202, a first issuing unit 203, and a second issuing unit 204, wherein:
an obtaining unit 201, configured to obtain a historical route issuing number when a route to be issued is detected;
a determining unit 202, configured to determine whether the historical route issuing number is smaller than a first preset number;
the first issuing unit 203 is configured to issue the routes to be issued to a pre-stored Tree table when the historical route issuing number is smaller than a first preset number;
and a second issuing unit 204, configured to issue the route to be issued to a pre-stored Tree table according to a specified issuing manner when the historical route issuing number is greater than or equal to a first preset number.
Further, the historical route issuing number is a sum of the route number stored in the Tree table, the number of routes to be issued stored in the cache table entry, and the number of currently detected routes to be issued.
Further, the apparatus may further include a counting unit 205, configured to count the to-be-issued routes;
The second issuing unit 204 may be configured to:
if the historical route issuing number is greater than or equal to a first preset number, checking whether a pre-stored cache table item stores routes to be issued;
If yes, storing the routes to be issued into the cache table entry, and generating an optimal Tree according to all the routes to be issued in the cache table entry and all the routes in the preset Tree table and issuing the optimal Tree to the Tree table when a preset condition is met;
otherwise, judging whether the count of the currently detected to-be-issued routes is smaller than a second preset number;
when the count of the current routing table items to be issued is less than a second preset number, issuing the routes to be issued to a prestored Tree table;
And when the count of the current routes to be issued is greater than or equal to a second preset number, storing the routes to be issued into the cache table entry, and when a preset condition is met, generating an optimal Tree according to all the routes to be issued in the cache table entry and all the routes in the preset Tree table, and issuing the optimal Tree to the Tree table.
further, the counting unit 205 may be configured to:
Calculating a first interval time between the time when the route to be issued is detected and the time when the route to be issued is detected last time;
judging whether the first interval time is smaller than a time window t 1;
If the number of the detected routes to be issued is less than the preset number, adding one to the count of the last detected route to be issued to serve as the count of the detected route to be issued;
and if the number of the routes to be issued is larger than or equal to the preset number, setting the count of the routes to be issued as an initial value.
Further, the preset condition may include:
When a polling period is reached, acquiring the current time;
calculating a second interval time when the time of the last stored route to be issued reaches the current time in the cache table entry;
Judging whether the second interval time is smaller than a time window t 2;
If the second interval time is less than or equal to the time window t2, calculating the table item establishing time of the cache table item, and when the table item establishing time is greater than or equal to the table item delay time and the cache table item has a route to be issued, determining that a preset condition is met;
And if the second interval time is greater than or equal to the time window t2 and the cache table entry has the route to be issued, determining that the preset condition is met.
further, the apparatus may further include a clearing unit 206, configured to set a count of routes to be issued as an initial value and clear the entry establishment time when it is determined that the preset condition is met.
The adaptive routing issuing device applied to the network device of the present invention may be consistent with the processing flow of the adaptive routing issuing method applied to the network device in the specific processing flow, and is not described herein again.
The adaptive routing issuing device applied to the network device of the present invention may be consistent with the processing flow of the adaptive routing issuing method applied to the network device in the specific processing flow, and is not described herein again.
the foregoing devices may be implemented by software or hardware, and the schematic diagram of the hardware architecture of the network device where the adaptive routing device is located is shown in fig. 3, where the basic hardware environment includes a central processing unit CPU301, a forwarding chip 302, a memory 303 and other hardware 304, where the memory 303 includes a machine-readable instruction, and the CPU301 reads and executes the machine-readable instruction to execute the functions of the units in fig. 2.
The above description is only for the purpose of illustrating the preferred embodiments of the present invention and is not to be construed as limiting the invention, and any modifications, equivalents, improvements and the like made within the spirit and principle of the present invention should be included in the scope of the present invention.
Claims (10)
1. A self-adaptive routing issuing method is applied to network equipment and is characterized by comprising the following steps:
when detecting a route to be issued, acquiring the issuing quantity of historical routes; the historical route issuing number is the sum of the route number stored in the Tree table, the number of the routes to be issued stored in the cache table item and the number of the currently detected routes to be issued;
judging whether the historical route issuing quantity is smaller than a first preset quantity or not;
if the historical route issuing number is smaller than a first preset number, issuing the routes to be issued to a prestored Tree table;
and if the historical route issuing number is greater than or equal to a first preset number, issuing the routes to be issued to a pre-stored Tree table according to a specified issuing mode.
2. the method of claim 1, further comprising:
counting the routes to be issued;
The issuing the to-be-issued routes to a pre-stored Tree table according to the specified issuing mode comprises the following steps:
if the historical route issuing number is greater than or equal to a first preset number, checking whether a pre-stored cache table item stores routes to be issued;
If yes, storing the routes to be issued into the cache table entry, and generating an optimal Tree according to all the routes to be issued in the cache table entry and all the routes in the preset Tree table and issuing the optimal Tree to the Tree table when a preset condition is met; the preset condition is to determine whether the preset condition is met according to a second interval time when the time of the last stored route to be issued reaches the current time in the cache table entry and a time window t 2;
otherwise, judging whether the count of the currently detected to-be-issued routes is smaller than a second preset number;
when the count of the current routing table items to be issued is less than a second preset number, issuing the routes to be issued to a prestored Tree table;
and when the count of the current routes to be issued is greater than or equal to a second preset number, storing the routes to be issued into the cache table entry, and when a preset condition is met, generating an optimal Tree according to all the routes to be issued in the cache table entry and all the routes in the preset Tree table, and issuing the optimal Tree to the Tree table.
3. The method of claim 2, wherein the counting the pending routes comprises:
calculating a first interval time between the time when the route to be issued is detected and the time when the route to be issued is detected last time;
judging whether the first interval time is smaller than a time window t 1;
If the number of the detected routes to be issued is less than the preset number, adding one to the count of the last detected route to be issued to serve as the count of the detected route to be issued;
And if the number of the routes to be issued is larger than or equal to the preset number, setting the count of the routes to be issued as an initial value.
4. the method according to claim 2, wherein the preset conditions include:
when a polling period is reached, acquiring the current time;
calculating a second interval time when the time of the last stored route to be issued reaches the current time in the cache table entry;
Judging whether the second interval time is smaller than a time window t 2;
if the second interval time is less than or equal to the time window t2, calculating the table item establishing time of the cache table item, and when the table item establishing time is greater than or equal to the table item delay time and the cache table item has a route to be issued, determining that a preset condition is met;
And if the second interval time is greater than or equal to the time window t2 and the cache table entry has the route to be issued, determining that the preset condition is met.
5. The method of claim 2, wherein upon determining that a preset condition is satisfied, the method further comprises:
And setting the count of the to-be-issued route as an initial value, and clearing the table entry establishing time.
6. a self-adaptive down-sending routing device is applied to network equipment, and is characterized in that the device comprises:
the acquisition unit is used for acquiring the issuing quantity of the historical routes when the routes to be issued are detected; the historical route issuing number is the sum of the route number stored in the Tree table, the number of the routes to be issued stored in the cache table item and the number of the currently detected routes to be issued;
the judging unit is used for judging whether the historical route issuing quantity is smaller than a first preset quantity or not;
The first issuing unit is used for issuing the routes to be issued to a pre-stored Tree table when the issuing number of the historical routes is smaller than a first preset number;
And the second issuing unit is used for issuing the routes to be issued to a pre-stored Tree table according to a specified issuing mode when the issuing quantity of the historical routes is greater than or equal to a first preset quantity.
7. the apparatus of claim 6, further comprising:
the counting unit is used for counting the to-be-issued routes;
The second issuing unit is configured to:
if the historical route issuing number is greater than or equal to a first preset number, checking whether a pre-stored cache table item stores routes to be issued;
if yes, storing the routes to be issued into the cache table entry, and generating an optimal Tree according to all the routes to be issued in the cache table entry and all the routes in the preset Tree table and issuing the optimal Tree to the Tree table when a preset condition is met; the preset condition is to determine whether the preset condition is met according to a second interval time when the time of the last stored route to be issued reaches the current time in the cache table entry and a time window t 2;
otherwise, judging whether the count of the currently detected to-be-issued routes is smaller than a second preset number;
When the count of the current routing table items to be issued is less than a second preset number, issuing the routes to be issued to a prestored Tree table;
And when the count of the current routes to be issued is greater than or equal to a second preset number, storing the routes to be issued into the cache table entry, and when a preset condition is met, generating an optimal Tree according to all the routes to be issued in the cache table entry and all the routes in the preset Tree table, and issuing the optimal Tree to the Tree table.
8. The apparatus of claim 7, wherein the counting unit is configured to:
Calculating a first interval time between the time when the route to be issued is detected and the time when the route to be issued is detected last time;
judging whether the first interval time is smaller than a time window t 1;
if the number of the detected routes to be issued is less than the preset number, adding one to the count of the last detected route to be issued to serve as the count of the detected route to be issued;
and if the number of the routes to be issued is larger than or equal to the preset number, setting the count of the routes to be issued as an initial value.
9. the apparatus of claim 7, wherein the preset condition comprises:
when a polling period is reached, acquiring the current time;
calculating a second interval time when the time of the last stored route to be issued reaches the current time in the cache table entry;
judging whether the second interval time is smaller than a time window t 2;
if the second interval time is less than or equal to the time window t2, calculating the table item establishing time of the cache table item, and when the table item establishing time is greater than or equal to the table item delay time and the cache table item has a route to be issued, determining that a preset condition is met;
and if the second interval time is greater than or equal to the time window t2 and the cache table entry has the route to be issued, determining that the preset condition is met.
10. The apparatus according to claim 7, wherein when it is determined that a preset condition is satisfied, the apparatus further comprises:
and the clearing unit is used for setting the count of the route to be issued as an initial value and clearing the table entry establishing time.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610596265.1A CN106209626B (en) | 2016-07-26 | 2016-07-26 | Self-adaptive routing issuing method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610596265.1A CN106209626B (en) | 2016-07-26 | 2016-07-26 | Self-adaptive routing issuing method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106209626A CN106209626A (en) | 2016-12-07 |
| CN106209626B true CN106209626B (en) | 2019-12-06 |
Family
ID=57495301
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610596265.1A Active CN106209626B (en) | 2016-07-26 | 2016-07-26 | Self-adaptive routing issuing method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106209626B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109488469B (en) * | 2018-12-28 | 2020-12-01 | 威睿电动汽车技术(宁波)有限公司 | Extended range electric automobile engine control method and control device |
| CN111131051A (en) * | 2019-12-30 | 2020-05-08 | 杭州迪普科技股份有限公司 | Route issuing method and device |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102984069A (en) * | 2012-11-30 | 2013-03-20 | 福建星网锐捷网络有限公司 | Entry regulation method, entry regulation device and switching equipment |
| CN103297957A (en) * | 2013-05-13 | 2013-09-11 | 西安电子科技大学 | Defending method of wireless ad hoc network routing inquiry flooding attacks |
| CN104348672A (en) * | 2013-07-29 | 2015-02-11 | 中国电信股份有限公司 | Large-scale IP network BGP routing entry detection method and device |
| CN104410588A (en) * | 2014-10-22 | 2015-03-11 | 福建星网锐捷网络有限公司 | Method of implementing virtual switching on router equipment and router equipment |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2013019996A1 (en) * | 2011-08-02 | 2013-02-07 | Cavium, Inc. | Lookup front end input processor |
| CN103095579B (en) * | 2013-01-18 | 2016-03-30 | 华为技术有限公司 | TRILL network interconnected method, Apparatus and system |
-
2016
- 2016-07-26 CN CN201610596265.1A patent/CN106209626B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102984069A (en) * | 2012-11-30 | 2013-03-20 | 福建星网锐捷网络有限公司 | Entry regulation method, entry regulation device and switching equipment |
| CN103297957A (en) * | 2013-05-13 | 2013-09-11 | 西安电子科技大学 | Defending method of wireless ad hoc network routing inquiry flooding attacks |
| CN104348672A (en) * | 2013-07-29 | 2015-02-11 | 中国电信股份有限公司 | Large-scale IP network BGP routing entry detection method and device |
| CN104410588A (en) * | 2014-10-22 | 2015-03-11 | 福建星网锐捷网络有限公司 | Method of implementing virtual switching on router equipment and router equipment |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106209626A (en) | 2016-12-07 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106230744B (en) | A kind of method and forwarding device of the recombination of data flow random ordering | |
| CN106202112B (en) | CACHE DIRECTORY method for refreshing and device | |
| KR101715080B1 (en) | Node apparatus and method that prevent overflow of pending Interest table in network system of name base | |
| WO2015149488A1 (en) | Method and apparatus for limiting rate by means of token bucket, and computer storage medium | |
| CN107547507B (en) | Anti-attack method and device, router equipment and machine readable storage medium | |
| CN106209626B (en) | Self-adaptive routing issuing method and device | |
| CN107786450B (en) | Data message transmission method and device and machine-readable storage medium | |
| CN107454276A (en) | A kind of subscriber terminal equipment and its data forwarding method and communication system | |
| CN101699795A (en) | Message congestion processing method and system | |
| US10079754B2 (en) | Adapative message caches for replay/flood protection in mesh network devices | |
| WO2017161967A1 (en) | Method of monitoring data traffic in packets per second, device, and computer storage medium | |
| CN106130930A (en) | A kind of Frame in advance join the team process device and method | |
| CN108566344B (en) | Message processing method and device | |
| CN103685058B (en) | Method for controlling QoS (Quality of Service) of stream data, and OpenFlow controller | |
| CN103428185B (en) | Packet filtering/method for limiting speed, system and device | |
| CN106657126A (en) | Device and method for detecting and defending DDos attack | |
| CN108965263A (en) | Network attack defence method and device | |
| CN102629910A (en) | Congestion avoidance method based on weighted random early detection (WRED) and system thereof | |
| US7031331B2 (en) | Method and system for managing packets in a shared memory buffer that serves multiple output links | |
| CN110300074A (en) | A kind of IP packet fragmentation and reassembly method | |
| CN107682266B (en) | Method and device for matching flow table items and computer-readable storage medium | |
| JPWO2009016692A1 (en) | Packet processing device | |
| CN106656975A (en) | Attack defense method and attack defense device | |
| CN107809385A (en) | A kind of triggering of Packet In message and control method | |
| CN110233838B (en) | Pulse type attack defense method, device and equipment |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| CB02 | Change of applicant information |
Address after: 310052 Binjiang District Changhe Road, Zhejiang, China, No. 466, No. Applicant after: NEW H3C TECHNOLOGIES Co.,Ltd. Address before: 310052 Binjiang District Changhe Road, Zhejiang, China, No. 466, No. Applicant before: HANGZHOU H3C TECHNOLOGIES Co.,Ltd. |
|
| CB02 | Change of applicant information | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20230629 Address after: 310052 11th Floor, 466 Changhe Road, Binjiang District, Hangzhou City, Zhejiang Province Patentee after: H3C INFORMATION TECHNOLOGY Co.,Ltd. Address before: 310052 Changhe Road, Binjiang District, Hangzhou, Zhejiang Province, No. 466 Patentee before: NEW H3C TECHNOLOGIES Co.,Ltd. |
|
| TR01 | Transfer of patent right |