CN117938776B - Network congestion reverse avoiding method and network congestion reverse avoiding network card - Google Patents
Network congestion reverse avoiding method and network congestion reverse avoiding network card Download PDFInfo
- Publication number
- CN117938776B CN117938776B CN202410183997.2A CN202410183997A CN117938776B CN 117938776 B CN117938776 B CN 117938776B CN 202410183997 A CN202410183997 A CN 202410183997A CN 117938776 B CN117938776 B CN 117938776B
- Authority
- CN
- China
- Prior art keywords
- transmission
- network
- node
- queue
- waiting
- 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
- 238000000034 method Methods 0.000 title claims abstract description 27
- 230000005540 biological transmission Effects 0.000 claims abstract description 160
- 230000001186 cumulative effect Effects 0.000 claims 3
- 238000012545 processing Methods 0.000 abstract description 4
- 238000004364 calculation method Methods 0.000 description 6
- 238000004891 communication Methods 0.000 description 6
- 230000008569 process Effects 0.000 description 4
- 230000007246 mechanism Effects 0.000 description 3
- 238000012986 modification Methods 0.000 description 3
- 230000004048 modification Effects 0.000 description 3
- 238000010586 diagram Methods 0.000 description 2
- 230000000977 initiatory effect Effects 0.000 description 2
- 230000003993 interaction Effects 0.000 description 2
- 230000001360 synchronised effect Effects 0.000 description 2
- 230000002159 abnormal effect Effects 0.000 description 1
- 238000004590 computer program Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000002474 experimental method Methods 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 238000002955 isolation Methods 0.000 description 1
- 239000004973 liquid crystal related substance Substances 0.000 description 1
- 238000012423 maintenance Methods 0.000 description 1
- 230000004044 response Effects 0.000 description 1
- 230000001953 sensory effect Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 230000000007 visual effect Effects 0.000 description 1
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/50—Queue scheduling
- H04L47/62—Queue scheduling characterised by scheduling criteria
- H04L47/622—Queue service order
- H04L47/623—Weighted service order
-
- 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/50—Queue scheduling
- H04L47/62—Queue scheduling characterised by scheduling criteria
- H04L47/6285—Provisions for avoiding starvation of low priority queues
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/70—Admission control; Resource allocation
- H04L47/80—Actions related to the user profile or the type of traffic
- H04L47/806—Broadcast or multicast traffic
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention relates to a network congestion reverse avoiding method and a network congestion reverse avoiding network card, wherein the network congestion reverse avoiding method comprises the following steps of generating an idle queue according to idle notification broadcasted to a network by an idle node; generating a waiting queue according to waiting notices broadcasted to the network by a waiting node, generating a transmission queue according to the transmission notices broadcasted to the network by a transmission node, calculating the percentage of the node number of the transmission node and the node number of all nodes to obtain the network transmission node percentage, wherein all the nodes comprise the idle node, the waiting node and the transmission node, and adding the request node into the idle queue, the waiting queue or the transmission queue according to the network transmission node percentage or the identity of the request node. The network self-optimizing capability is given, so that the node actively gives off the occupation of network resources in advance, and the extra burden of processing network congestion by the network protocol stack of the operating system is obviously reduced.
Description
Technical Field
The invention belongs to the technical field of network information security, and particularly relates to a network congestion reverse avoiding method and a network card.
Background
Network congestion refers to the phenomenon that the amount of data transmitted in a network exceeds the processing capacity of network resources, resulting in a decrease in the transmission speed of the network, an increase in delay, and even data loss. There is no pre-broadcast in conventional network communication mechanisms, direct initiation of point-to-point initiation of connection requests (TCP), or transmission (UDP). This inevitably results in collision of network messages at the switch side. The collision of local terminal ports can further lead to the message collision of the whole switch, and the network performance is seriously reduced. In addition, link layer communication between nodes of the traditional local area network lacks flexible, safe, efficient and autonomous guarantee means. Currently common security means are unidirectional transport based on unidirectional isolation cards and VLAN (virtual local area network). Unidirectional isolator cards severely reduce the flexibility of network usage while inevitably creating a large number of redundant transmissions to ensure the integrity of reception. The application of VLAN technology results in point-to-point transmission strictly following VLAN tag registration division, and cannot adapt to flexible and autonomous transmission occasions between nodes.
Disclosure of Invention
Aiming at the problems, the invention provides a reverse evasion method of network congestion, which comprises the following steps:
Generating an idle queue according to idle advertisements broadcasted to the network by idle nodes;
Generating a waiting queue according to a waiting notice broadcasted to the network by a waiting node;
generating a transmission queue according to a transmission notice broadcasted to the network by a transmission node;
calculating the percentage of the node number of the transmission node and the node number of all nodes to obtain the network transmission node percentage, wherein all the nodes comprise the idle node, the waiting node and the transmission node;
and adding the request node into the idle queue, the waiting queue or the transmission queue according to the percentage of the network transmission nodes and the identity of the request node.
Correspondingly, the invention also provides a network congestion reverse circumvention network card, which comprises at least one processor, a memory and a network interface, wherein the network card stores instructions, and when the instructions are executed by the at least one processor, the steps of the network congestion reverse circumvention method are implemented.
The technical scheme of the invention can obviously reduce the occurrence of network congestion and improve the network flexibility, and is characterized in that the network congestion is fully utilized to actively broadcast the flow of the network card, so that other network cards in the network can timely master the current network congestion condition, the network transmission of the terminal where the network card is positioned is optimized, the self-optimizing capability of the network is endowed, the node can actively give out the occupation of network resources in advance, the extra burden of processing the network congestion by the network protocol stack of an operating system is obviously reduced, the network congestion is completely realized in the bottom data link layer, the network congestion is completely transparent to the system layer, no system intervention is required, and no additional management operation of network management is required.
Drawings
FIG. 1 is a flow chart of a network congestion reverse circumvention method of some aspects;
FIG. 2 is a schematic diagram of a network node implementation of some aspects of a network congestion reverse evasion method;
Figure 3 is a schematic diagram of a reverse circumvention network card for some network congestion.
Detailed Description
It should be noted that, in the following, the "broadcast" refers to a "one-to-all" network communication mode between nodes (hosts), and broadcast information sent by any node will be unconditionally copied and forwarded to other nodes. All nodes participating in the broadcast maintain a broadcast table together. "requesting node" refers hereinafter to the node that receives the network TCP request to initiate a transmission. The networks referred to in the following schemes include, but are not limited to, local area networks, and some specific embodiments relate to local area networks comprised of peer nodes.
The following examples further illustrate the invention but are not to be construed as limiting the invention. Modifications and substitutions to methods, procedures, or conditions of the present invention without departing from the spirit and nature of the invention are intended to be within the scope of the present invention.
Some schemes comprise the following steps:
Generating an idle queue according to idle advertisements broadcasted to the network by idle nodes;
Generating a waiting queue according to a waiting notice broadcasted to the network by a waiting node;
generating a transmission queue according to a transmission notice broadcasted to the network by a transmission node;
calculating the percentage of the node number of the transmission node and the node number of all nodes to obtain the network transmission node percentage, wherein all the nodes comprise the idle node, the waiting node and the transmission node;
and adding the request node into the idle queue, the waiting queue or the transmission queue according to the percentage of the network transmission nodes and the identity of the request node.
In the above steps, the term "network transmission node percentage ŋ" refers to the percentage of the number of nodes currently participating in transmission to the number of all nodes. The "identity of the requesting node" is the validity of the MAC address of the network card, and the low three bytes of the MAC address must meet the address naming specification for the identity KEY. The step of adding the request node to the idle queue, the waiting queue or the transmission queue according to the percentage of the network transmission nodes and the identity of the request node is as follows in embodiment 1:
Example 1
A gigabit switch is provided to connect 20 nodes. When the transmission node percentage value ŋ reaches 30% (i.e., 6 of the 20 nodes are transmitting at the same time), the actual maximum load of the network is approached. So when the enqueue request is reviewed, the enqueue request is prohibited when the current network transmission node percentage ŋ is greater than 30%. When the actual total node number is less than or equal to 6, the actual network congestion does not occur.
According to the scheme or the implementation mode, through the active forecast transmission mechanism, the transmission state initiated by the network card is monitored and updated at all times, so that other smooth network cards on the network can timely adjust and arrange the transmission to be initiated by the network card. The occurrence of network congestion is obviously reduced, and the network flow under full load is fully utilized.
Some specific schemes based on the above scheme include the steps shown in fig. 1, where the node periodically sends out two kinds of link layer broadcast information, including a broadcast idle notification as shown in table 1 and a broadcast transmission notification as shown in table 2, where the broadcast idle notification is a request transmission message broadcast to the link layer every 5 seconds when the node requests transmission. The broadcast transmission notification is a message that the node currently occupies the transmission condition is broadcast to the link layer every 5 seconds in the transmission process.
Table 1. Broadcast idle announcement message ethernet frame format
Table 2. Broadcast transport advertisement message ethernet frame format
Based on the above schemes, some more specific schemes, such as fig. 2, include a transmission queue, a waiting queue, and an idle queue, all nodes will self-generate a broadcast table through a broadcast mechanism. Some specific broadcast tables are the network node state list as shown in table 3 stored in each node, and no network management maintenance is needed.
TABLE 3 network node State List
Some aspects of the above aspects further include assigning weights to the requesting nodes that join the idle queue, the wait queue, or the transmit queue.
Some of the above schemes are based on the scheme, the requesting node added to the transmission queue performs the following steps in the current time period:
decrementing the weight of the last time period of the request node currently added to the transmission queue by 1 weight unit to obtain the current transmission weight of the request node currently added to the transmission queue;
Calculating the accumulated operation time length of the current time period of the request node which is currently added into the transmission queue, calculating the average operation time length based on the accumulated operation time length of each time period of the request node which is added into the transmission queue, and calculating the ratio of the difference value of the accumulated operation time length and the average operation time length to the average operation time length;
if the ratio of the difference between the accumulated operating time length and the average operating time length to the average operating time length is greater than a time length threshold or the current transmission weight is equal to 0,
The requesting node currently joining the transmit queue transmits a message with maximum delay.
If the requesting node joining the transmit queue is no longer transmitting and receiving messages,
The requesting node joining the transmit queue updates the current transmit weight to 0 and exits the transmit queue and joins the free queue.
The step of the request node added to the transmission queue running in the current time period further comprises the steps of calculating the average value of the current transmission weights of all transmission nodes of the transmission queue to obtain the average weight of the current transmission queue, if the average weight of the current transmission queue is too small, suspending the weight updating of the waiting node in the waiting queue in the current time period, and continuing to update the weight of the node in the waiting queue after the percentage of the network transmission nodes is reduced to be smaller than the preset value.
It should be noted that, the term "weight" is integer data for characterizing a node status and a transmission priority, 1 weight unit is 1, and the term "time period" is a time period synchronized with a broadcasting table timing unit, for example, a time period synchronized with 5s as a timing unit, that is, a time period of the last 5s as set forth in table 3.
The original network link layer has no means to interfere with the currently ongoing transmissions, resulting in the node having a long duration of network load. For this situation, the above scheme enables the requesting node to start actively decrementing its own weight once it is queried that the weight of the waiting transmission node is significantly higher than that of the other waiting nodes. When the weight reaches the lower limit of the weight of the transmission queue, the transmission node becomes a yielding transmission node, namely the request node achieves the aim of reducing speed by adjusting the transmission delay of UDP or TCP messages at a link layer, and the request node is still in the transmission queue at the moment, but does not participate in the calculation of the percentage of the transmission node and does not participate in the calculation of the weight.
Example 2
The steps performed by the requesting node added to the transmission queue in the above scheme are specifically described in a specific embodiment. This embodiment assumes that there are n nodes in the transmission queue, and takes the nth node as the requesting node newly added to the transmission queue, and each time period is 5s. The values of the initial weights of the transmission nodes are all set to 360.
Each node of the transmission queue receives broadcast notifications from other nodes every 5s, wherein the nth node (the requesting node) performs the following steps:
Starting from the initial weight, on the basis of the self weight of the request node of the previous 5s, sequentially decrementing 1 weight unit:
Wn (t) =Wn (t-1) -1 formula (1)
The formula (1) t is a time variable, wn (t) is a weight of the t-th time period of the request node, wn (t-1) is a weight of the t-1-th time period of the request node, and n is a number of the request node in a transmission queue.
Judging whether the current operation time length of the request node meets any one of the conditions of the formula (2-3):
Wn (t) =0 (2)
The formula (2) t is a time variable, wn (t) is a weight of the t-th time period of the request node, and n is a number of the request node in a transmission queue.
[ (Tn (t) -Te (t))/Te (t) ] >35% formula (3)
The formula (3) t is a time variable, n is the number of the request node in the transmission queue, tn (t) is the accumulated operation duration of the request node up to the t-th time period, and Te (t) is the average operation duration of all nodes of the current transmission queue up to the t-th time period.
If any one of the conditions of the above formulas (2-3) is satisfied, the packet sending delay of the request node is adjusted to be the maximum delay, and the identity of the request node is updated to be the yielding transmission node. The request node is still in a transmission queue at this time, but does not participate in the transmission node percentage calculation and does not participate in the weight calculation. The current network node transmission percentage ŋ can be effectively reduced.
The requesting node added to the transmission queue specifically operates in each time period and further comprises the following steps:
Calculating the average weight We of the current transmission queue:
Formula (4) t is a time variable, we is an average weight of a current transmission queue, W i (t) is a weight of a numbered ith node of the transmission queue in a t-th time period, N is the number of all transmission nodes in the transmission queue, i is the number of the nodes in the transmission queue, and the values are 1, 2.
If We <100, it indicates that the current average occupancy rate of the network is large, and the waiting queue node does not update the weight. And recovering the weight updating of the nodes in the waiting queue until the percentage ŋ of the network transmission nodes is less than or equal to 35 percent.
The requesting node added to the transmission queue specifically operates in each time period and further comprises the following steps:
calculating the accumulated running time Tn (t) of the requesting node up to the t-th time period:
tn (t) =tn (t-1) +1 formula (5)
In the formula (5), t is a time variable, n is the number of the request node in a transmission queue, tn (t) is the accumulated operation duration of the request node in the t-th time period, and Tn (t-1) is the accumulated operation duration of the request node in the t-1-th time period.
Calculating the average running time Te (t) of all nodes of the current transmission queue:
In the formula (6), T is a time variable, T i (T) is the accumulated operation duration of the ith node in the transmission queue up to the T-th time period, te (T) is the average operation duration of all nodes in the current transmission queue up to the T-th time period, N is the number of all transmission nodes in the transmission queue, i is the number of the nodes in the transmission queue, and the value is 1, 2.
The yielding transmission node is still in the transmission queue, but does not participate in the transmission node percentage calculation and does not participate in the weight calculation.
If the request node does not send and receive the message any more and eliminates transmission interruption caused by abnormal factors, the request node added into the transmission queue directly clears the current weight Wn (t) of the request node, and the state of the current node is changed into idle (the transmission queue is exited and the idle queue is added). This means that the current node actively and thoroughly gives up the usage rights of the transmission queue.
In some schemes based on the scheme, the request node initiates a transmission task after acquiring the network transmission token, and returns the network transmission token after the transmission task is finished. A token refers to a frame containing control information. The token process allows the network device to transmit data to the network.
Some of the solutions based on the above solutions, the requesting node added to the waiting queue performs the following steps in the current time period:
Increasing the weight of the request node currently added into the waiting queue by 1 weight unit in the last time period to obtain the current waiting weight of the request node currently added into the waiting queue;
calculating the current network transmission node percentage of the current time period of the request node which is currently added into the waiting queue;
If the current network transmission node percentage is smaller than a preset value, and the current waiting weight is the maximum value of the weights of all nodes added into the waiting queue;
The requesting node currently joining the wait queue exits the wait queue and joins the transmit queue.
Example 3
The method of increasing the weight of the waiting node by itself is specifically explained by an embodiment, which assumes that in the waiting queue, the mth node is the requesting node (current node) newly added to the transmission queue, and each time period is 5s. The values of the initial weights of the transmission nodes are all set to 0.
When the waiting queue receives broadcast notification of other nodes of the network every 5 seconds, the weight is calculated according to the following rule:
Calculating the current self weight Wm (t) of the mth node, and increasing a weight unit on the self weight of the last time period each time, wherein the weight unit is as shown in the formula (7):
wm (t) =wm (t-1) +1 formula (7)
In the formula (7), t is a time variable, wm (t) is a weight of the t-th time period of the request node, wm (t-1) is a weight of the t-1-th time period of the request node, and m is a number of the request node in a waiting queue.
And calculating the current transmission node percentage ŋ, and if ŋ is smaller than 30%, judging whether the self weight of the mth node reaches the maximum value in the current waiting queue. If the self weight of the mth node is the maximum value in the current waiting queue, changing the state of the mth node into a transmission state, and adding the mth node into the transmission queue.
The idle node initiates transmission operation according to the context of the protocol stack based on the above schemes, and specifically comprises the following steps executed by the idle node, namely, directly adding the idle node into a waiting queue after the idle node receives a message issued by the protocol stack. That is, when the idle node receives the UDP message or the TCP message issued by the protocol stack, the idle node directly enters the waiting queue, and even if the percentage ŋ of the transmission nodes in the current network is smaller than the preset value, the idle node does not directly apply for adding the transmission queue, and the idle node and the waiting node must be added into the transmission queue after the sequence of adding the idle queue and the waiting queue is sequentially performed.
Some solutions based on the above solutions, if the requesting node fails to join the waiting queue or join the transmission queue, discarding a current message, where the current message includes a UDP message or a TCP connection request.
Some schemes correspond to a network congestion reverse circumvention network card, such as fig. 3, comprising at least one processor and a memory and network interface storing instructions that when executed by the at least one processor implement all steps of all schemes described above.
The processes and logic flows described in this specification can be performed by one or more programmable computers executing one or more computer programs to perform functions by operating on input data and generating output. The processes and logic flows can also be performed by, and apparatus can also be implemented as, special purpose logic circuitry, e.g., an FPGA (field programmable gate array) or an ASIC (application-specific integrated circuit).
To transmit interactions with a user, embodiments of the subject matter described in this specification can be implemented on a computer having a display device, e.g., a CRT (cathode ray tube) or LCD (liquid crystal display) monitor, for displaying information to the user, and a keyboard and a pointing device, e.g., a mouse or a trackball, by which the user can transmit input to the computer. Other types of devices may also be used to send interactions with the user, for example, feedback provided to the user may be any form of sensory feedback, e.g., visual feedback, auditory feedback, or tactile feedback, and input from the user may be received in any form, including audible input, voice input, or tactile input. In addition, the computer may interact with the user by sending documents to and receiving documents from devices used by the user, e.g., by sending web pages to a web browser on the user's client device in response to received requests from the web browser.
Embodiments of the subject matter described in this specification can be implemented in a computing system that includes a back-end component, e.g., as a data server, or that includes an intermediate component, e.g., as an application server, or that includes a front-end component, e.g., as a client computer having a graphical user interface or web browser through which a user can interact with an implementation of the subject matter described in this specification, or that includes any combination of one or more such back-end components, intermediate components, or front-end components. The components in the system can be interconnected by any form or medium of digital data communication, e.g., a communication network. Examples of communication networks include local area networks ("LANs") and wide area networks ("WANs"), such as the internet.
Specific embodiments of the subject matter have been described. Other embodiments are within the scope of the following claims. For example, the activities recited in the claims can be executed in a different order and still achieve desirable results. As one example, the processes depicted in the accompanying drawings do not necessarily require the particular order shown, or sequential order, to achieve desirable results. In certain implementations, multitasking and parallel processing may be advantageous.
While the invention has been described in detail in the foregoing general description, embodiments and experiments, it will be apparent to those skilled in the art that modifications and improvements can be made thereto. Accordingly, such modifications or improvements may be made without departing from the spirit of the invention and are intended to be within the scope of the invention as claimed.
Claims (9)
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202410183997.2A CN117938776B (en) | 2024-02-19 | 2024-02-19 | Network congestion reverse avoiding method and network congestion reverse avoiding network card |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202410183997.2A CN117938776B (en) | 2024-02-19 | 2024-02-19 | Network congestion reverse avoiding method and network congestion reverse avoiding network card |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN117938776A CN117938776A (en) | 2024-04-26 |
| CN117938776B true CN117938776B (en) | 2024-12-20 |
Family
ID=90764554
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202410183997.2A Active CN117938776B (en) | 2024-02-19 | 2024-02-19 | Network congestion reverse avoiding method and network congestion reverse avoiding network card |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN117938776B (en) |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101179487A (en) * | 2006-11-10 | 2008-05-14 | 中兴通讯股份有限公司 | Computer network data packet forwarding queue management method |
| CN113438184A (en) * | 2021-06-25 | 2021-09-24 | 北京汇钧科技有限公司 | Network card queue management method and device and electronic equipment |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113709057B (en) * | 2017-08-11 | 2023-05-05 | 华为技术有限公司 | Network congestion notification method, proxy node, network node and computer equipment |
| CN109660463A (en) * | 2017-10-11 | 2019-04-19 | 华为技术有限公司 | A kind of congestion stream recognition method and the network equipment |
-
2024
- 2024-02-19 CN CN202410183997.2A patent/CN117938776B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101179487A (en) * | 2006-11-10 | 2008-05-14 | 中兴通讯股份有限公司 | Computer network data packet forwarding queue management method |
| CN113438184A (en) * | 2021-06-25 | 2021-09-24 | 北京汇钧科技有限公司 | Network card queue management method and device and electronic equipment |
Also Published As
| Publication number | Publication date |
|---|---|
| CN117938776A (en) | 2024-04-26 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| EP2421205B1 (en) | Flooding-based routing protocol having average-rate and burst-rate control | |
| CN102143198B (en) | Method, device and system for transferring messages | |
| JP5625997B2 (en) | Communication system and transmission apparatus | |
| US9025451B2 (en) | Positive feedback ethernet link flow control for promoting lossless ethernet | |
| US11234159B2 (en) | Systems and methods for congestion control on mobile edge networks | |
| US20140003247A1 (en) | Method, network node, and network system for offloading network traffic | |
| EP3525406A1 (en) | Method and apparatus for determining tcp congestion window | |
| US8787160B2 (en) | Method, apparatus, and system for judging path congestion | |
| EP3993330B1 (en) | Flow rate control method and apparatus | |
| CN110798412B (en) | Multicast service processing method and device, cloud platform, equipment and readable storage medium | |
| EP2773070A1 (en) | Multicast processing method and apparatus | |
| WO2017114231A1 (en) | Packet sending method, tcp proxy, and tcp client | |
| CN110062004A (en) | A kind of message handling system and method based on Internet of Things fidonetFido | |
| CN103314552B (en) | Use the method for multicasting based on group of non-unified receiver | |
| CN112087390A (en) | A kind of network routing method and device | |
| CN113938955B (en) | Data transmission method, device, equipment and system | |
| WO2021203985A1 (en) | Congestion information synchronizing method and related apparatus | |
| CN113141314A (en) | Congestion control method and equipment | |
| CN115776443A (en) | Method, device and system for determining network optimization strategy | |
| CN116156019A (en) | TCP flow control method, system, equipment and medium for satellite network | |
| CN117938776B (en) | Network congestion reverse avoiding method and network congestion reverse avoiding network card | |
| CN109586931B (en) | Multicast method and terminal equipment | |
| EP4425880A1 (en) | Parameter adjustment method and apparatus | |
| JP4838739B2 (en) | Router buffer management method and router using the management method | |
| WO2021103822A1 (en) | Method for acquiring common maximum segment size (mss), and device |
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 |