CN114827036B - SDN-based NDN hop-by-hop congestion control method with cache perception - Google Patents
SDN-based NDN hop-by-hop congestion control method with cache perception Download PDFInfo
- Publication number
- CN114827036B CN114827036B CN202210403963.0A CN202210403963A CN114827036B CN 114827036 B CN114827036 B CN 114827036B CN 202210403963 A CN202210403963 A CN 202210403963A CN 114827036 B CN114827036 B CN 114827036B
- Authority
- CN
- China
- Prior art keywords
- congestion
- ndn
- node
- routing node
- sdn controller
- 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
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/17—Interaction among intermediate nodes, e.g. hop by hop
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/11—Identifying congestion
- H04L47/115—Identifying congestion using a dedicated packet
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/12—Avoiding congestion; Recovering from congestion
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/22—Traffic shaping
- H04L47/225—Determination of shaping rate, e.g. using a moving window
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses an NDN hop-by-hop congestion control method with cache perception based on SDN, which introduces SDN technology into a named data network and fuses an original distributed NDN architecture with the SDN architecture; the NDN routing node monitors own link information and output queue information in real time to judge the network state, and periodically uploads the information to the SDN controller; when the network is in link congestion, the SDN controller calculates the port cost of the NDN routing node and informs the routing node based on the received link information and queue information of the NDN routing node. In addition, when the network is severely congested, the consumer adjusts the own interest packet sending window based on the received packet congestion flag. The invention realizes intelligent hop-by-hop control, further improves the synergy between the routing nodes and the consumers, ensures higher network throughput on the premise of relieving congestion, and improves the overall transmission performance of the network.
Description
Technical Field
The invention relates to a network congestion control method based on a Software defined network (Software-Defined Networking, SDN) and a named data networking (Named Data Networking, NDN), belonging to the technical field of computer networks.
Background
The explosive development of the internet has led to its penetration into various fields of global economy and society, becoming an essential element of economic development and social operation. However, under the pressure of the rapid increase in user demands and the diversification of demands, some inherent problems and limitations of the conventional TCP/IP network are increasingly revealed, and particularly, low adaptability in terms of network scalability, flexibility, mobility, and the like is exhibited. In this case, a new network architecture for data content-oriented, multi-source, multi-path content retrieval, named data networking (Named Data Networking, NDN), has been proposed to attract the attention of many researchers.
Unlike traditional TCP/IP end-to-end communication modes, NDNs employ one-to-one correspondence of interest packets and data packets, with the requested data content being "pulled" from the network by the requesting end. The transmission mode enables the NDN to have the characteristics of request end driving and flow self-balancing. However, even NDNs implementing traffic self-balancing cannot avoid congestion occurrence due to the large number of requests bursty by users and the availability of network resources. Therefore, congestion control is one of important research problems of NDN as a key factor for ensuring efficient and stable operation of a network. The overtime retransmission mechanism of the traditional TCP/IP cannot be directly adapted to the NDN due to different transmission delays of data caused by the NDN multisource characteristic. New and efficient congestion control mechanisms are specifically designed for NDNs.
Based on the multi-source nature of the NDN content, an ordered interface list is maintained for each content prefix by a routing protocol populated FIB table. The forwarding scheme selects the appropriate interface to send the packet of interest to the available location based on the FIB entry. Therefore, the forwarding strategy has a very great influence on the link congestion state, and can effectively relieve the link congestion state.
However, due to the independence of NDN nodes, the traffic distribution of the network cannot be predicted, making it difficult for node control to achieve long-term path selection benefits, while congestion may also be introduced in other links. In addition, to ensure optimal transport performance of the network, consumers are required to properly adjust the traffic capacity entering the network.
Disclosure of Invention
Aiming at the prior art, the invention provides an NDN hop-by-hop congestion control method with buffer awareness based on SDN, which solves the problems of the traditional NDN congestion control. The invention realizes the hop-by-hop congestion control method for intelligently managing the multipath capacity and combines the consumer congestion control mechanism for properly adjusting the network capacity, thereby improving the overall transmission performance of the network.
In order to solve the technical problems, the invention provides an NDN hop-by-hop congestion control method with cache perception based on SDN, which fuses a distributed NDN architecture with an SDN architecture and introduces an SDN controller with logic concentration; the supported network architecture comprises an SDN controller and a plurality of NDN routing nodes; the NDN routing node monitors own link information and output queue information in real time to judge the network state, and periodically uploads the information to the SDN controller, so that congestion control is concentrated in the SDN controller; when the network is in link congestion, the SDN controller calculates the port cost of the NDN routing node and informs the routing node based on the received link information and queue information of the NDN routing node; when the network is severely congested, the consumer adjusts the own interest packet sending window based on the received data packet congestion marks. The method comprises the following specific steps:
establishing connection among a plurality of NDN routing nodes and establishing connection among the plurality of NDN routing nodes and the SDN controller to construct a network;
step two, the NDN routing node monitors own link information, output queue information and cache information in real time; meanwhile, the routing node periodically uploads the cache information to the SDN controller; the SDN controller maintains cache information, including content prefixes and cache routing node numbers, and sorts the cache routing node numbers;
step three, the NDN routing node calculates the link utilization rate and the queue occupancy rate respectively based on the link information and the output queue information in the step two; meanwhile, the NDN routing node uploads the link utilization rate and the output queue occupancy rate to the SDN controller periodically;
step four, the NDN routing node judges the network state based on the link utilization rate and the output queue utilization rate in the step three: the network state has an idle state and a congestion state, wherein the congestion state is divided into a light congestion state and a heavy congestion state; when the network state is a light congestion state, executing the fifth step; when the network state is a severe congestion state, executing the step six;
fifthly, the SDN controller selects an operation content prefix according to the cache information with sequence, calculates the port cost of the NDN routing node and informs the routing node according to the received link utilization rate and queue occupancy rate of the NDN routing node;
and step six, when serious congestion occurs, the consumer adjusts the interesting packet sending window.
Further, the step three of the control method of the present invention is that the NDN routing node calculates the link utilization and the occupancy of the output queue as follows:
3-1) calculating the link utilization, beta ij The link utilization rate of the link between the node I and the node J is represented by the following calculation formula:
in the formula (1), x ij Representing the transmission rate of the data content in the link between the node I and the node J in unit time; c (C) ij Representing the link capacity, C ij ＞0；
3-2) calculating queue utilization, ε I The output queue occupancy of the node I is represented by the following calculation formula:
in the formula (2), q I Representing the size of the data content in the routing node I output queue; q (Q) I Representing the size of the output queue of the routing node, Q I ＞0；
3-3) periodically uploading the link utilization and the output queue occupancy to the SDN controller with a periodic frequency t=0.5 s.
In the fourth step, the flow of the NDN routing node for judging the network state is as follows:
4-1) when ε I ＜th 2 And beta is ij ＜th 1 At this time, the network state is idle; beta ij Represents the link utilization of the link between node I and node J I Representing the output queue occupancy of node I, where th 1 To set link utilization threshold, th 2 Outputting a queue occupancy rate threshold for the set routing node;
4-2) when ε I ＜th 2 And beta is ij ≥th 1 At this time, the network state is a light congestion state; sending a congestion signal to inform the SDN controller, wherein the congestion signal comprises a congestion node ID and the quantity of congestion node FIB entries; executing the fifth step;
4-3) when ε I ＞th 2 At this time, the network state is a serious congestion state; calculating window adjustment factor delta = epsilon I -th 2 The adjustment factors are used as congestion labels to mark transmission data packets, and the data packets are sent to consumers; and executing the step six.
The flow of the fifth step is as follows:
5-1) the SDN controller analyzes the congestion signal to obtain a congestion node ID and the FIB entry number of the congestion node;
5-2) the SDN controller selects content prefixes which are not cached or are 10% of the last sequence of the cache as a content prefix group to be operated based on the cache information; the SDN controller selects a content prefix to be operated from a content prefix group to be operated by utilizing a random function;
5-3) positioning a routing node with a plurality of available ports in a congestion link downstream path by the SDN controller based on a topological structure of the network, and marking the routing node as a shunting node;
5-4) the SDN controller calculates a cost metric for each port of the shunting node based on the link utilization and the output queue utilization uploaded by the routing node, where a calculation formula is as follows:
5-5) the SDN controller issues a port cost metric to the shunting node.
The flow of the step six is as follows:
6-1) the consumer receives the data packet, judges whether the congestion mark exists;
6-2) if congestion marks exist, the consumer obtains an adjustment factor delta in the data packet; if there is no congestion flag, the consumer sets an adjustment factor δ=1;
6-3) the consumer adjusts the send interest packet window size cwn=cwn× (1- δ) according to the adjustment factor.
Compared with the prior art, the invention has the beneficial effects that:
(1) The invention utilizes the link utilization rate and the output queue occupancy rate of the calculated routing node to realize the division of network transmission states, realizes the coordination between the congestion control of the routing node and the congestion control of a consumer, and avoids the network transmission performance reduction caused by repeated or excessive control of the two congestion controls;
(2) The invention utilizes the link utilization rate and the output queue occupancy rate information recorded by the SDN controller to cooperatively perform multi-path selection congestion control on the routing nodes, thereby avoiding introducing new congestion and effectively improving the overall resource utilization rate of the network. Meanwhile, the SDN controller calculates port cost, reduces node workload, and improves forwarding capacity of the nodes.
Drawings
FIG. 1 is a diagram of a network architecture and a network topology according to a first embodiment of the present invention;
FIG. 2 is a flow chart of a process of detecting network congestion by a routing node in the present invention;
fig. 3 is a flow chart of a process of calculating port cost by an SDN controller in the present invention.
Detailed Description
The invention will now be further described with reference to the accompanying drawings and specific examples, which are in no way limiting.
The design concept of the NDN hop-by-hop congestion control method with cache perception based on SDN provided by the invention is that a supported network architecture comprises two elements, namely an SDN controller and a plurality of NDN routing nodes. According to the method, a distributed NDN architecture and an SDN architecture are fused, a logic-centralized SDN controller is introduced, an NDN routing node monitors own link information and output queue information in real time to judge a network state, and the information is periodically uploaded to the SDN controller, so that congestion control is concentrated in the SDN controller, and the data processing capacity of the NDN node is fully improved. When the network is in link congestion, the SDN controller calculates the port cost of the NDN routing node and informs the routing node based on the received link information and queue information of the NDN routing node; when the network is severely congested, the consumer adjusts the own interest packet sending window based on the received data packet congestion mark, and besides, the invention provides a relatively gentle consumer sending window adjusting algorithm to ensure the transmission performance of the network.
The specific implementation steps of the NDN hop-by-hop congestion control method with cache perception based on SDN are as follows:
step one, establishing connection among a plurality of NDN routing nodes and establishing connection among the plurality of NDN routing nodes and the SDN controller to construct a network. The method merges the original NDN architecture with SDN technology, namely introducing an SDN controller in a logic set. As shown in fig. 1, the SDN controller serves as a congestion control module for centralized control, so as to fully improve the data processing capability of the NDN nodes, and a plurality of NDN routing nodes R1, R2 and R3 are exemplified as forwarding modules. The SDN controller locates and marks the edge route node of the user accessing the network, namely, in the invention, the route node connected with the user is the edge route node.
In the invention, congestion control is concentrated in the SDN controller, so that the data processing capacity of the NDN node is fully improved. Meanwhile, the SDN controller with the global field of view greatly improves the flexibility of the network in the congestion control process, ensures the transmission performance of the network and achieves the purpose of intelligently managing the multipath capacity.
Step two, the NDN routing nodes R1-R3 monitor their own link information, output queue information and cache information in real time, and meanwhile, the routing nodes R1-R3 upload the cache information periodically to the SDN controller, the SDN controller maintains the cache information, and the SDN controller maintains the cache information, including content prefixes and cache routing node numbers, and sorts the cache routing node numbers.
Step three, the NDN routing nodes R1-R3 respectively calculate the link utilization rate and the queue occupancy rate based on the link information and the output queue information in the step two; meanwhile, the NDN routing nodes R1-R3 upload the link utilization rate and the output queue occupancy rate period to the SDN controller; the specific flow of calculation of the link utilization rate and the output queue occupancy rate of the routing nodes R1-R3 is as follows:
3-1) routing node calculates link utilization, β ij The link utilization rate of the link between the node I and the node J is represented by the following calculation formula:
in the formula (1), x ij Representing the transmission rate of the data content in the link between the node I and the node J in unit time; c (C) ij > 0 represents the link capacity, wherein the link capacities are each set to 10Mbps;
3-2) route nodes calculate queue utilization, ε I The output queue occupancy of the node I is represented by the following calculation formula:
in the formula (2), q I Representing the size of the data content in the routing node I output queue; q (Q) I The value of > 0 represents the size of the output queue of the routing node, wherein the sizes of the output queues of the routing node are all set to be 200packets;
3-3) periodically uploading the link information to the SDN controller with a period frequency t=0.5 s.
Judging a network state by the NDN routing node based on the link utilization rate and the output queue utilization rate in the third step, wherein the network state has an idle state and a congestion state, and the congestion state is divided into a light congestion state and a heavy congestion state; as shown in fig. 2, the specific flow of the routing node for determining the network status is as follows, and in this embodiment, a link utilization threshold th is set 1 =0.8, set routing node output queue occupancy threshold th 2 =0.9, the NDN routing node determines the network state as follows:
4-1) when ε I ＜th 2 And beta is ij ＜th 1 When the routing node judges that the routing node is the sameThe network state is idle. When t=0s—3s, the utilization of links R1-R2, R1-R3, and R2-R3 is less than 0.8 and the output queue occupancy of R1, R2, and R3 is less than 0.9 during the content requested by the consumer from the producer. The routing node normally transmits the data content.
4-2) when ε I ＜th 2 And beta is ij ≥th 1 And when the routing node judges that the network state is slightly congested, sending a congestion signal to inform the SDN controller, wherein the signal content comprises a congestion node ID and the number of congestion node FIB entries. When t=3s, the utilization of links R1-R2 is greater than 0.83 and the occupancy of output queues of R1, R2 and R3 is less than 0.9 during the content requested by the consumer from the producer. The routing node R2 sends a congestion signal informing the SDN controller. Then executing the fifth step;
4-3) when ε I ＞th 2 When the routing node judges that the network state is severely congested, the routing node calculates a window adjustment factor delta=epsilon I -th 2 The adjustment factors are used as congestion labels to mark transmission data packets, and the data packets are sent to consumers; when t=4s, during the content requested by the consumer from the producer, the output queue occupancy of R2 is 0.96 to greater than 0.9. Routing node R2 marks the passing data packets. Step six is then performed.
And fifthly, when the SDN controller judges that the R2 has link congestion, the SDN controller selects an operation content prefix according to the cache information with sequence, and calculates the port cost of the NDN routing node and informs the routing node according to the received link utilization rate and queue occupancy rate of the NDN routing node. The specific flow of the SDN controller is shown in fig. 3, and the specific flow is as follows:
5-1) the SDN controller analyzes the received congestion signal to obtain the ID of the congestion node R2 and the FIB entry number of the congestion node R2;
5-2) the SDN controller selects content prefixes which are not cached or are 10% of the last sequence of the cache as a content prefix group to be operated based on the cache information; the SDN controller selects a content prefix to be operated from a content prefix group to be operated by utilizing a random function;
5-3) traversing the route nodes of the path where the R2 is located by the SDN controller based on the topological structure of the network, and judging whether the route nodes have a plurality of available ports or not. When locating to R1 in the downstream path of the congestion link, the routing node can acquire the data content of the producer through two ports (the port 1 connected with R2 and the port 2 connected with R3), so the R1 is marked as a shunt node;
5-4) the SDN controller calculates a port parameter metric for each port of the shunting node R1 based on the link utilization and the output queue utilization uploaded by the routing node, where a calculation formula is as follows:
5-5) the SDN controller issues a port cost to the shunting node R1. At this time, the port 1 parameter of R1 is higher than the port 2 parameter, so that partial flow in the links R1-R2 is transferred to the links R1-R3.
And step six, when serious congestion occurs, the consumer adjusts the interesting packet sending window. The consumer adjusts the interest package sending window, and the specific flow is as follows:
6-1) the consumer receives the data packet, judges whether the congestion mark exists;
6-2) if congestion marks exist, the consumer obtains an adjustment factor delta in the data packet; if there is no congestion flag, the consumer sets the adjustment factor δ=1. The adjustment factor δ=0.06 in the packet.
6-3) the consumer adjusts the send interest packet window size cwn=cwn× (1- δ) according to the adjustment factor.
The ndnSIM simulator is used for realizing a complete system prototype, a simulation topological diagram is shown in figure 1, and the effectiveness of the simulation topological diagram in dealing with congestion control in the NDN is verified by analyzing packet loss, average transmission delay and network throughput. The final simulation result shows that on the premise of relieving network congestion, the average transmission delay of the consumer is 51.3ms, which is 9% higher than that of the normal transmission condition. Furthermore, the present invention has a stable network throughput. Therefore, the invention designs the NDN hop-by-hop congestion control method with buffer perception based on SDN, which can ensure that network congestion is relieved, simultaneously provide low average transmission delay and ensure stable network throughput.
In conclusion, the invention realizes intelligent hop-by-hop control, further improves the synergy between the routing nodes and the consumers, ensures higher network throughput on the premise of relieving congestion, and improves the overall transmission performance of the network.
Although the invention has been described above with reference to the accompanying drawings, the invention is not limited to the above-described embodiments, which are merely illustrative and not restrictive, and many modifications may be made by those of ordinary skill in the art without departing from the spirit of the invention, which fall within the protection of the invention.
Claims (5)
1. An NDN hop-by-hop congestion control method with cache perception based on SDN fuses a distributed NDN architecture and an SDN architecture, and introduces an SDN controller in a logic set; the supported network architecture comprises an SDN controller and a plurality of NDN routing nodes; the NDN routing node monitors own link information and output queue information in real time to judge the network state, and periodically uploads the information to the SDN controller, so that congestion control is concentrated in the SDN controller; when the network is in link congestion, the SDN controller calculates the port cost of the NDN routing node and informs the routing node based on the received link information and queue information of the NDN routing node; when the network is severely congested, the consumer adjusts the own interest packet sending window based on the received data packet congestion mark, and the method is characterized in that: the method comprises the following steps:
establishing connection among a plurality of NDN routing nodes and establishing connection among the plurality of NDN routing nodes and the SDN controller to construct a network;
step two, the NDN routing node monitors own link information, output queue information and cache information in real time; meanwhile, the routing node periodically uploads the cache information to the SDN controller; the SDN controller maintains cache information, including content prefixes and cache routing node numbers, and sorts the cache routing node numbers;
step three, the NDN routing node calculates the link utilization rate and the queue occupancy rate respectively based on the link information and the output queue information in the step two; meanwhile, the NDN routing node uploads the link utilization rate and the output queue occupancy rate to the SDN controller periodically;
step four, the NDN routing node judges the network state based on the link utilization rate and the output queue utilization rate in the step three: the network state has an idle state and a congestion state, wherein the congestion state is divided into a light congestion state and a heavy congestion state; when the network state is a light congestion state, executing the fifth step; when the network state is a severe congestion state, executing the step six;
fifthly, the SDN controller selects an operation content prefix according to the cache information with sequence, calculates the port cost of the NDN routing node and informs the routing node according to the received link utilization rate and queue occupancy rate of the NDN routing node;
and step six, when serious congestion occurs, the consumer adjusts the interesting packet sending window.
2. The SDN-based NDN hop-by-hop congestion control method with cache awareness of claim 1, wherein: in the third step, the flow of calculating the link utilization rate and the output queue occupancy rate by the NDN routing node is as follows:
3-1) calculating the link utilization, beta ij The link utilization rate of the link between the node I and the node J is represented by the following calculation formula:
in the formula (1), x ij Representing the transmission rate of the data content in the link between the node I and the node J in unit time; c (C) ij Representing the link capacity, C ij ＞0；
3-2) calculating queue utilization, ε I The output queue occupancy of the node I is represented by the following calculation formula:
in the formula (2), q I Representing the size of the data content in the routing node I output queue; q (Q) I Representing the size of the output queue of the routing node, Q I ＞0；
3-3) periodically uploading the link utilization and the output queue occupancy to the SDN controller with a periodic frequency t=0.5 s.
3. The SDN-based NDN hop-by-hop congestion control method with cache awareness of claim 2, wherein: in the fourth step, the flow of the NDN routing node for judging the network state is as follows:
4-1) when ε I ＜th 2 And beta is ij ＜th 1 At this time, the network state is idle; beta ij Represents the link utilization of the link between node I and node J I Representing the output queue occupancy of node I, where th 1 To set link utilization threshold, th 2 Outputting a queue occupancy rate threshold for the set routing node;
4-2) when ε I ＜th 2 And beta is ij ≥th 1 At this time, the network state is a light congestion state; sending a congestion signal to inform the SDN controller, wherein the congestion signal comprises a congestion node ID and the quantity of congestion node FIB entries; executing the fifth step;
4-3) when ε I ＞th 2 At this time, the network state is a serious congestion state; calculating window adjustment factor delta = epsilon I -th 2 The adjustment factors are used as congestion labels to mark transmission data packets, and the data packets are sent to consumers; and executing the step six.
4. The SDN-based NDN hop-by-hop congestion control method with cache awareness of claim 3, wherein: the flow of the fifth step is as follows:
5-1) the SDN controller analyzes the congestion signal to obtain a congestion node ID and the FIB entry number of the congestion node;
5-2) the SDN controller selects content prefixes which are not cached or are 10% of the last sequence of the cache as a content prefix group to be operated based on the cache information; the SDN controller selects a content prefix to be operated from a content prefix group to be operated by utilizing a random function;
5-3) positioning a routing node with a plurality of available ports in a congestion link downstream path by the SDN controller based on a topological structure of the network, and marking the routing node as a shunting node;
5-4) the SDN controller calculates a cost metric for each port of the shunting node based on the link utilization and the output queue utilization uploaded by the routing node, where a calculation formula is as follows:
5-5) the SDN controller issues a port cost metric to the shunting node.
5. The SDN-based NDN hop-by-hop congestion control method with cache awareness of claim 3, wherein: the flow of the step six is as follows:
6-1) the consumer receives the data packet, judges whether the congestion mark exists;
6-2) if congestion marks exist, the consumer obtains an adjustment factor delta in the data packet; if there is no congestion flag, the consumer sets an adjustment factor δ=1;
6-3) the consumer adjusts the send interest packet window size to cwnx (1-delta) according to the adjustment factor.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210403963.0A CN114827036B (en) | 2022-04-18 | 2022-04-18 | SDN-based NDN hop-by-hop congestion control method with cache perception |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210403963.0A CN114827036B (en) | 2022-04-18 | 2022-04-18 | SDN-based NDN hop-by-hop congestion control method with cache perception |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114827036A CN114827036A (en) | 2022-07-29 |
| CN114827036B true CN114827036B (en) | 2023-09-29 |
Family
ID=82536984
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210403963.0A Active CN114827036B (en) | 2022-04-18 | 2022-04-18 | SDN-based NDN hop-by-hop congestion control method with cache perception |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114827036B (en) |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9270598B1 (en) * | 2013-12-13 | 2016-02-23 | Cisco Technology, Inc. | Congestion control using congestion prefix information in a named data networking environment |
| CN107634911A (en) * | 2017-10-31 | 2018-01-26 | 河南科技大学 | Adaptive congestion control method based on deep learning in a kind of information centre's network |
| CN108881048A (en) * | 2018-08-23 | 2018-11-23 | 北京理工大学 | A kind of name data network congestion control method based on intensified learning |
| CN110572320A (en) * | 2019-08-30 | 2019-12-13 | 湖南科技大学 | Named data single-source multi-path routing method, system and medium based on NDN |
| CN112350949A (en) * | 2020-10-23 | 2021-02-09 | 重庆邮电大学 | Rerouting congestion control method and system based on flow scheduling in software defined network |
| CN112804125A (en) * | 2021-02-09 | 2021-05-14 | 河南科技大学 | Named data network congestion control method based on fuzzy comprehensive evaluation algorithm |
-
2022
- 2022-04-18 CN CN202210403963.0A patent/CN114827036B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9270598B1 (en) * | 2013-12-13 | 2016-02-23 | Cisco Technology, Inc. | Congestion control using congestion prefix information in a named data networking environment |
| CN107634911A (en) * | 2017-10-31 | 2018-01-26 | 河南科技大学 | Adaptive congestion control method based on deep learning in a kind of information centre's network |
| CN108881048A (en) * | 2018-08-23 | 2018-11-23 | 北京理工大学 | A kind of name data network congestion control method based on intensified learning |
| CN110572320A (en) * | 2019-08-30 | 2019-12-13 | 湖南科技大学 | Named data single-source multi-path routing method, system and medium based on NDN |
| CN112350949A (en) * | 2020-10-23 | 2021-02-09 | 重庆邮电大学 | Rerouting congestion control method and system based on flow scheduling in software defined network |
| CN112804125A (en) * | 2021-02-09 | 2021-05-14 | 河南科技大学 | Named data network congestion control method based on fuzzy comprehensive evaluation algorithm |
Non-Patent Citations (1)
| Title |
|---|
| 基于SDN集中控制的NDN网络路由策略研究;黄涛等;《数字技术与应用》;第38卷(第2期);第3-4节 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114827036A (en) | 2022-07-29 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102075444B (en) | Network system and method for guaranteeing multi-type service quality | |
| Hafeez et al. | Detection and mitigation of congestion in SDN enabled data center networks: A survey | |
| CN106533960A (en) | Data center network routing method based on Fat-Tree structure | |
| JPH1065710A (en) | Digital network including mechanism for providing flow control information to transmission source | |
| CN102263697A (en) | Method and device for sharing aggregated link traffic | |
| JP2006506845A (en) | How to select a logical link for a packet in a router | |
| CN110351187A (en) | Data center network Road diameter switches the adaptive load-balancing method of granularity | |
| Kalyanaraman et al. | Performance and buffering requirements of internet protocols over ATM ABR and UBR services | |
| CN114666280A (en) | Industrial internet time delay optimization method based on time sensitive software defined network | |
| CN114500394B (en) | Congestion control method for differentiated services | |
| CN114398174A (en) | Dynamic energy-saving scheduling method and system for data center network in SDN environment | |
| CN110535770B (en) | QoS-aware-based intelligent routing method for video stream in SDN environment | |
| Sunassee et al. | A comprehensive review on congestion control techniques in networking | |
| CN110943927B (en) | Named data network transmission control method, device and equipment based on time delay management | |
| CN114827036B (en) | SDN-based NDN hop-by-hop congestion control method with cache perception | |
| CN114828081A (en) | Cooperative hybrid congestion control method based on path recovery | |
| Kaur | An overview of quality of service computer network | |
| CN114866476A (en) | Lossless and efficient RDMA transmission method | |
| Jin et al. | A qlearning based business differentiating routing mechanism in sdn architecture | |
| Tu et al. | Worst-case delay control in multigroup overlay networks | |
| Xing et al. | A VCP-based congestion control algorithm in named data networking | |
| Gu et al. | Research on congestion control link algorithm of computer network based on sdn | |
| CN110891027A (en) | Named data network transmission control method, device and equipment based on queue scheduling | |
| Saadatpour et al. | QoS improvement in SDN using centralized routing based on feedback | |
| Engan et al. | Selective truncating internetwork protocol: experiments with explicit framing |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |