CN109873773A - A kind of jamming control method for data center - Google Patents
A kind of jamming control method for data center Download PDFInfo
- Publication number
- CN109873773A CN109873773A CN201910195726.8A CN201910195726A CN109873773A CN 109873773 A CN109873773 A CN 109873773A CN 201910195726 A CN201910195726 A CN 201910195726A CN 109873773 A CN109873773 A CN 109873773A
- Authority
- CN
- China
- Prior art keywords
- ack
- congestion
- rtt
- data
- data flow
- 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.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 28
- 230000005540 biological transmission Effects 0.000 claims description 31
- 230000008569 process Effects 0.000 claims description 9
- HCHKCACWOHOZIP-UHFFFAOYSA-N Zinc Chemical compound [Zn] HCHKCACWOHOZIP-UHFFFAOYSA-N 0.000 claims description 3
- 235000013399 edible fruits Nutrition 0.000 claims description 3
- 230000004069 differentiation Effects 0.000 abstract description 3
- 230000007246 mechanism Effects 0.000 description 3
- 238000012790 confirmation Methods 0.000 description 2
- 230000015556 catabolic process Effects 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 238000011217 control strategy Methods 0.000 description 1
- 238000006731 degradation reaction Methods 0.000 description 1
- 238000001514 detection method Methods 0.000 description 1
- 230000003993 interaction Effects 0.000 description 1
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a kind of jamming control methods for data center, are updated according to the size of the priority of data flow, queuing delay and congestion level to congestion window；Advantage is to carry out differentiation control to the data flow of different priorities, when to deadline sensitive high amount of traffic Retransmission timeout, it is possible to reduce the deadline of low-volume traffic stream improves the handling capacity of long data flow.
Description
Technical field
The present invention relates to a kind of jamming control methods, more particularly, to a kind of jamming control method for data center.
Background technique
The development achievements of high-speed network technology data center.Data center has unique network topology structure, high band
Wide and low delay data link and the workload flow rate mode of high burst.In order to guarantee data interaction in data center
Order and timeliness need to be monitored the data congestion situation of data center and controlled according to detection case.Mesh
Before, in order to reduce the deadline of low-volume traffic stream (being less than 200KB), meet the need of the deadline to the data flow of time-sensitive
Ask and maximize the handling capacity of high amount of traffic (being greater than 1MB), the TCP congestion control of some specific customizations for data center
Method is suggested, such as DCTCP and L2DCT。
In network data transmission, data flow is typically divided into multiple data packets and sequentially sends, and all data packets are sent
It completes to indicate that data flow is sent completely.DCTCP and L2Both jamming control methods of DCT are all by congestion window
The control of size is to realize congestion control.Both jamming control methods, sender maintain a congestion window, congestion window
Size depend on the Congestion Level SPCC of network, and dynamic change, the principle that sender controls congestion window is: as long as network does not have
Congestion is occurred, congestion window just increases, to send data packets more in data flow；As long as network occurs
Congestion, congestion window are reduced by, to reduce the data packet being injected into network.DCTCP is utilized explicit in interchanger
Congestion notification (ECN) function combines ECN function with the control strategy of data source, to guarantee interchanger spatial cache
Data occupy rate and be consistently lower than some threshold value.When a packet is lost, DCTCP adjusts congestion window using network congestion degree.
On switches, DCTCP is arrived using very simple Active Queue for Management Mechanism when queue occupies over the threshold value of setting
Labeled upper congestion (CE) mark of the data packet reached, indicates that congestion has occurred in data packet.ECN passback is carried out in receiving end, i.e.,
Which data packet the receiving end DCTCP can accurately convey experienced congestion.And can data be coated with the probability α of label in transmitting terminal
Estimated, whenever a data packet of transmitting terminal transmission data flow is to receiving end, receiving end can be sent after receiving the data packet
ACK (confirmation message) is updated congestion probability α according to the quantity of the confirmation message received to transmitting terminal, transmitting terminal.
Illustrate that congestion may be low when α>0 and α<1；Work as α > 1 and illustrate that congestion possibility is high, thus according to and the value of probability α to congestion window
Mouth size is adjusted.But DCTCP needs to come the support of the good ecn (explicit congestion notification) of configuration of interchanger in automatic network,
It is more complicated, and DCTCP does not account for the transmission feature of high amount of traffic and low-volume traffic stream, therefore is unfavorable for reducing low-volume traffic stream
Transmission delay.L2DCT considers data stream size, and the data packet number and net sent so far is flowed to according to a data
Network Congestion Level SPCC adjusts congestion window.L2DCT is the adjustment that congestion window is carried out using the data volume of transmission, hidden to realize
Formula priority scheduling and lowest service (LAS).But same, L2DCT is a deadline unknowable method, it cannot be guaranteed that cutting
The only transmission performance of the data flow of time-sensitive.
DCTCP and L as a result,2Both jamming control methods of DCT are not able to satisfy the big data sensitive to deadline
The demand of stream cannot be the high amount of traffic distribution more bandwidth sensitive to deadline before deadline reaches, once
The data flow sensitive to deadline cannot complete transmission, big number sensitive to deadline at this time before deadline reaches
According to stream will Retransmission timeout, thus cause the deadline of low-volume traffic stream elongated, the throughput degradation of long data flow.
Summary of the invention
Technical problem to be solved by the invention is to provide the data flows of a kind of pair of different priorities to carry out differentiation control,
When to deadline sensitive high amount of traffic Retransmission timeout, it is possible to reduce the deadline of low-volume traffic stream improves long data flow
Handling capacity a kind of jamming control method for data center.
The technical scheme of the invention to solve the technical problem is: a kind of congestion control side for data center
Method is updated according to the size of the priority of data flow, queuing delay and congestion level to congestion window.
It is updated according to the size of the priority of data flow, queuing delay and congestion level to congestion window specific
Process are as follows:
1. setting reference value: congestion window size, the data flow weight threshold upper limit, data flow weight threshold lower limit, data
The stream size threshold value upper limit, data stream size bottom threshold, decision threshold, the minimum two-way time of data packet, transmitting terminal receive
The total quantity of ACK, transmitting terminal receive total quantity, weighted factor, congestion level and congestion threshold with congestion marking ACK,
The size of congestion window is denoted as cwnd, the data flow weight threshold upper limit is denoted as Smax, enable Smax=2.5, by data flow weight
Bottom threshold is denoted as Smin, enable Smin=0.125, data stream size upper threshold is denoted as ce, enable ce=1MB, by data stream size
Bottom threshold is denoted as mc, mcDecision threshold is denoted as p by=200KBc, enable pc=0.125, the minimum two-way time of data packet is remembered
For RTTmin, the total quantity that transmitting terminal receives ACK is denoted as ACKo, transmitting terminal receives the total quantity with congestion marking ACK
It is denoted as ACKs, weighted factor is denoted as g, enables g=0.0625, congestion level is denoted as α, congestion variable is denoted as α 1；
2. following the steps below control when the data packet that one transmits round, which reaches transmitting terminal, to be sent
2. the priority of data flow belonging to each data packet is respectively calculated in -1 pair of transmission round, detailed process
Are as follows:
A. the priority of each data packet is equal to the priority of the data flow belonging to it, therefore by data flow belonging to data packet
Priority weighting be denoted as sc, the priority of the data flow is denoted as p, obtains the size of the data flow, by the size of the data flow
It is denoted as fs；
B. the priority weighting s of the data flow is determinedcIf: fs≤mc, enable sc=SmaxIf fs≥ce, enable sc=Smin,
If mc< fs< ce, then enableSymbol * is multiplication symbol；
C. determine the priority p of the data flow: priority threshold value is denoted as p1, using formula by setting priority threshold valueP1 is calculated, if p1 < pc, then by pcValue be assigned to p, if p1 >=pc, then the value of p1 is assigned to p；
2. -2 couples of congestion level α are updated, detailed process are as follows:
D. to RTTmin、ACKo、ACKsIt is initialized with α, enables RTTmin=0, ACKo=0, ACKs=0, α=0；
E. in a network, each data flow is sequentially transmitted after being divided into multiple data packets, by a data in data flow
It wraps and is denoted as since the ACK time experienced for the data packet for receiving receiving end transmission to transmitting terminal being sent transmitting terminal
RTT obtains the RTT of data packet corresponding to the ACK when transmitting terminal receives an ACK of receiving end sending；
F. transmitting terminal often receives an ACK, then according to following rule to RTTmin、ACKo、ACKsIt is successively carried out more with α 1
It is new: first to RTTminCurrent value determined, if RTTminCurrent value be equal to 0 or RTTminCurrent value be greater than work as
The RTT of data packet corresponding to preceding received ACK, the value of the RTT of data packet corresponding to currently received ACK is assigned to
RTTmin, to RTTminCurrent value be updated, otherwise RTTminCurrent value remain unchanged；Then by ACKoCurrent value add 1
Obtained value assignment ACKo, to ACKoCurrent value be updated；Subsequently determine that data packet corresponding to currently received ACK
Whether RTT is greater than RTTmin+ Oth, wherein Oth=0.17d, d are equal to the RTT of data packet corresponding to currently received ACK, such as
The RTT of data packet corresponding to the currently received ACK of fruit is greater than RTTmin+ Oth is then marked the ACK, which is marked
For an ACK with congestion marking, and by ACKsCurrent value add 1 obtained value to be assigned to ACKS,To ACKsCurrent value into
Row updates, if the RTT of data packet corresponding to currently received ACK is less than or equal to RTTminWhen+Oth, then ACKsWork as
Preceding value remains unchanged；Last set intermediate variable parameter alpha 1 is calculated using formula α 1=(1-g) * α+g* (ACKs/ACKo)
The value for the α 1 being calculated is assigned to α, is updated to the current value of α by α 1；
As soon as 2. the every reception ACK of -3 transmitting terminals, according to corresponding to the α and currently received ACK that are currently calculated
The value of the priority p of the affiliated data flow of data packet is updated the size cwnd of congestion window, and according to updated congestion
The size cwnd of window adjusts congestion window: if currently received ACK is the ACK with congestion marking, usingValue go update congestion window size cwnd, if currently received ACK is not with congestion marking
ACK, the size cwnd of congestion window keeps its current value constant；
2. -4 after transmitting terminal receives the ACK of all data packets of current transmission round, are gone using the value of cwnd+cinc
The size cwnd of congestion window is updated, whereinWherein Qd indicates that queuing delay, queuing delay Qd are
The RTT of the last one data packet subtracts the difference of RTTmin in current transmission round, and the congestion control of the transmission round terminates；
3. return step is 2. to next transmission round when the data packet of next transmission round, which reaches transmitting terminal, to be sent
Congestion control is carried out, in cycles.In this method, network congestion is predicted using the delay of data packet rather than ECN label, this
There is no need to the supports of intermediate equipment, when α is zero, i.e., when network is without congestion, the data flow of high priority and low priority
The speed that data flow occupies bottleneck bandwidth is identical, this can guarantee the high link utilization of bottleneck link, work as α > 0, i.e. network is light
When spending congestion or severe congestion, low priority flows reduce transmission rate than high priority congestion mechanism earlier, both mechanism
The common guarantee performance of system, therefore this method can guarantee high-priority traffic in the case where network congestion degree is high
Transmission.
Compared with the prior art, the advantages of the present invention are as follows by according to the priority of data flow, queuing delay and gathering around
Plug grade is updated the size of congestion window, thus carries out differentiation control to the data flows of different priorities, when to cutting
Only when the high amount of traffic Retransmission timeout of time-sensitive, it is possible to reduce the deadline of low-volume traffic stream improves handling up for long data flow
Amount.
Specific embodiment
Present invention is further described in detail with reference to embodiments.
Embodiment one: a kind of jamming control method for data center, according to the priority of data flow, queuing delay with
And congestion level is updated the size of congestion window.
Embodiment two: the present embodiment is basically the same as the first embodiment, and difference is: according to the priority of data flow, being lined up
The detailed process that time delay and congestion level are updated the size of congestion window are as follows:
1. setting reference value: congestion window size, the data flow weight threshold upper limit, data flow weight threshold lower limit, data
The stream size threshold value upper limit, data stream size bottom threshold, decision threshold, the minimum two-way time of data packet, transmitting terminal receive
The total quantity of ACK, transmitting terminal receive total quantity, weighted factor, congestion level and congestion threshold with congestion marking ACK,
The size of congestion window is denoted as cwnd, the data flow weight threshold upper limit is denoted as Smax, enable Smax=2.5, by data flow weight
Bottom threshold is denoted as Smin, enable Smin=0.125, data stream size upper threshold is denoted as ce, enable ce=1MB, by data stream size
Bottom threshold is denoted as mc, mcDecision threshold is denoted as p by=200KBc, enable pc=0.125, the minimum two-way time of data packet is remembered
For RTTmin, the total quantity that transmitting terminal receives ACK is denoted as ACKo, transmitting terminal receives the total quantity with congestion marking ACK
It is denoted as ACKs, weighted factor is denoted as g, enables g=0.0625, congestion level is denoted as α, congestion variable is denoted as α 1；
2. following the steps below control when the data packet that one transmits round, which reaches transmitting terminal, to be sent
2. the priority of data flow belonging to each data packet is respectively calculated in -1 pair of transmission round, detailed process
Are as follows:
A. the priority of each data packet is equal to the priority of the data flow belonging to it, therefore by data flow belonging to data packet
Priority weighting be denoted as sc, the priority of the data flow is denoted as p, obtains the size of the data flow, by the size of the data flow
It is denoted as fs；
B. the priority weighting s of the data flow is determinedcIf: fs≤mc, enable sc=SmaxIf fs≥ce, enable sc=Smin,
If mc< fs< ce, then enableSymbol * is multiplication symbol；
C. determine the priority p of the data flow: priority threshold value is denoted as p1, using formula by setting priority threshold valueP1 is calculated, if p1 < pc, then by pcValue be assigned to p, if p1 >=pc, then the value of p1 is assigned to p；
2. -2 couples of congestion level α are updated, detailed process are as follows:
D. to RTTmin、ACKo、ACKsIt is initialized with α, enables RTTmin=0, ACKo=0, ACKs=0, α=0；
E. in a network, each data flow is sequentially transmitted after being divided into multiple data packets, by a data in data flow
It wraps and is denoted as since the ACK time experienced for the data packet for receiving receiving end transmission to transmitting terminal being sent transmitting terminal
RTT obtains the RTT of data packet corresponding to the ACK when transmitting terminal receives an ACK of receiving end sending；
F. transmitting terminal often receives an ACK, then according to following rule to RTTmin、ACKo、ACKsIt is successively carried out more with α 1
It is new: first to RTTminCurrent value determined, if RTTminCurrent value be equal to 0 or RTTminCurrent value be greater than work as
The RTT of data packet corresponding to preceding received ACK, the value of the RTT of data packet corresponding to currently received ACK is assigned to
RTTmin, to RTTminCurrent value be updated, otherwise RTTminCurrent value remain unchanged；Then by ACKoCurrent value add 1
Obtained value assignment ACKo, to ACKoCurrent value be updated；Subsequently determine that data packet corresponding to currently received ACK
Whether RTT is greater than RTTmin+ Oth, wherein Oth=0.17d, d are equal to the RTT of data packet corresponding to currently received ACK, such as
The RTT of data packet corresponding to the currently received ACK of fruit is greater than RTTmin+ Oth is then marked the ACK, which is marked
For an ACK with congestion marking, and by ACKsCurrent value add 1 obtained value to be assigned to ACKs, to ACKsCurrent value into
Row updates, if the RTT of data packet corresponding to currently received ACK is less than or equal to RTTminWhen+Oth, then ACKsWork as
Preceding value remains unchanged；Last set intermediate variable parameter alpha 1 is calculated using formula α 1=(1-g) * α+g* (ACKs/ACKo)
The value for the α 1 being calculated is assigned to α, is updated to the current value of α by α 1；
As soon as 2. the every reception ACK of -3 transmitting terminals, according to corresponding to the α and currently received ACK that are currently calculated
The value of the priority p of the affiliated data flow of data packet is updated the size cwnd of congestion window, and according to updated congestion
The size cwnd of window adjusts congestion window: if currently received ACK is the ACK with congestion marking, usingValue go update congestion window size cwnd, if currently received ACK is not with congestion marking
ACK, the size cwnd of congestion window keeps its current value constant；
2. -4 after transmitting terminal receives the ACK of all data packets of current transmission round, are gone using the value of cwnd+cinc
The size cwnd of congestion window is updated, whereinWherein Qd indicates that queuing delay, queuing delay Qd are
The RTT of the last one data packet subtracts the difference of RTTmin in current transmission round, and the congestion control of the transmission round terminates；
3. return step is 2. to next transmission round when the data packet of next transmission round, which reaches transmitting terminal, to be sent
Congestion control is carried out, in cycles.
The working principle of jamming control method for data center of the invention are as follows: be to replace network with time delay first
The ECN of interior interchanger is marked, and then adjusts transmitting terminal by the priority of data flow, queuing delay and network congestion degree
Congestion window size, when data are coated with virtual ECN label, expression may occur congestion, just reduce congestion window, one
After a transmission round, the size of congestion window is just updated by data stream priority and network congestion degree.
Claims (2)
1. a kind of jamming control method for data center, it is characterised in that according to the priority of data flow, queuing delay with
And congestion level is updated the size of congestion window.
2. a kind of jamming control method for data center according to claim 1, it is characterised in that according to data flow
Priority, queuing delay and congestion level detailed process that the size of congestion window is updated are as follows:
1. setting reference value: congestion window size, the data flow weight threshold upper limit, data flow weight threshold lower limit, data flow are big
Small upper threshold, data stream size bottom threshold, decision threshold, the minimum two-way time of data packet, transmitting terminal receive ACK's
Total quantity, transmitting terminal receive total quantity, weighted factor, congestion level and congestion threshold with congestion marking ACK, by congestion
The size of window is denoted as cwnd, and the data flow weight threshold upper limit is denoted as Smax, enable Smax=2.5, it will be under data flow weight threshold
Limit is denoted as Smin, enable Smin=0.125, data stream size upper threshold is denoted as ce, enable ce=1MB, will be under data stream size threshold value
Limit is denoted as mc, mcDecision threshold is denoted as p by=200KBc, enable pc=0.125, the minimum two-way time of data packet is denoted as
RTTmin, the total quantity that transmitting terminal receives ACK is denoted as ACKo, transmitting terminal receive the total quantity with congestion marking ACK note
For ACKs, weighted factor is denoted as g, enables g=0.0625, congestion level is denoted as α, congestion variable is denoted as α 1；
2. following the steps below control when the data packet that one transmits round, which reaches transmitting terminal, to be sent
2. the priority of data flow belonging to each data packet is respectively calculated in -1 pair of transmission round, detailed process are as follows:
A. the priority of each data packet is equal to the priority of the data flow belonging to it, therefore by the excellent of data flow belonging to data packet
First grade weight is denoted as sc, the priority of the data flow is denoted as p, obtains the size of the data flow, the size of the data flow is denoted as
fs；
B. the priority weighting s of the data flow is determinedcIf: fs≤mc, enable sc=SmaxIf fs≥ce, enable sc=SminIf
mc< fs< ce, then enableSymbol * is multiplication symbol；
C. determine the priority p of the data flow: priority threshold value is denoted as p1, using formula by setting priority threshold value
P1 is calculated, if p1 < pc, then by pcValue be assigned to p, if p1 >=pc, then the value of p1 is assigned to p；
2. -2 couples of congestion level α are updated, detailed process are as follows:
D. to RTTmin、ACKo、ACKsIt is initialized with α, enables RTTmin=0, ACKo=0, ACKs=0, α=0；
E. in a network, each data flow is sequentially transmitted after being divided into multiple data packets, by a data packet in data flow from
It is denoted as RTT in the ACK time experienced that transmitting terminal sends the data packet for starting to transmitting terminal to receive receiving end transmission, often
When transmitting terminal receives an ACK of receiving end sending, the RTT of data packet corresponding to the ACK is obtained；
F. transmitting terminal often receives an ACK, then according to following rule to RTTmin、ACKo、ACKsIt is successively updated with α 1: first
First to RTTminCurrent value determined, if RTTminCurrent value be equal to 0 or RTTminCurrent value be greater than current receive
ACK corresponding to data packet RTT, the value of the RTT of data packet corresponding to currently received ACK is assigned to RTTmin, right
RTTminCurrent value be updated, otherwise RTTminCurrent value remain unchanged；Then by ACKoCurrent value add 1 obtained value
Assignment ACKo, to ACKoCurrent value be updated；Subsequently determine that whether the RTT of data packet corresponding to currently received ACK is big
In RTTmin+ Oth, wherein Oth=0.17d, d are equal to the RTT of data packet corresponding to currently received ACK, if current receive
ACK corresponding to data packet RTT be greater than RTTmin+ Oth is then marked the ACK, which is had labeled as one
The ACK of congestion marking, and by ACKsCurrent value add 1 obtained value to be assigned to ACKs, to ACKsCurrent value be updated, such as
The RTT of data packet corresponding to the currently received ACK of fruit is less than or equal to RTTminWhen+Oth, then ACKsCurrent value keep
It is constant；Last set intermediate variable parameter alpha 1 is calculated α 1 using formula α 1=(1-g) * α+g* (ACKs/ACKo), will count
The value of obtained α 1 is assigned to α, is updated to the current value of α；
As soon as 2. the every reception ACK of -3 transmitting terminals, according to data corresponding to the α and currently received ACK that are currently calculated
The value of the priority p of data flow belonging to wrapping is updated the size cwnd of congestion window, and according to updated congestion window
Size cwnd adjust congestion window: if currently received ACK be the ACK with congestion marking, useValue go update congestion window size cwnd, if currently received ACK is not with congestion marking
ACK, the size cwnd of congestion window keeps its current value constant；
2. -4 after transmitting terminal receives the ACK of all data packets of current transmission round, go to update using the value of cwnd+cinc
The size cwnd of congestion window, whereinWherein Qd indicates queuing delay, and queuing delay Qd is current
The RTT of the last one data packet subtracts the difference of RTTmin in transmission round, and the congestion control of the transmission round terminates；
3. when the data packet of next transmission round, which reaches transmitting terminal, to be sent 2. return step carries out next transmission round
Congestion control, in cycles.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910195726.8A CN109873773B (en) | 2019-03-14 | 2019-03-14 | Congestion control method for data center |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910195726.8A CN109873773B (en) | 2019-03-14 | 2019-03-14 | Congestion control method for data center |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109873773A true CN109873773A (en) | 2019-06-11 |
| CN109873773B CN109873773B (en) | 2022-06-03 |
Family
ID=66920492
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910195726.8A Active CN109873773B (en) | 2019-03-14 | 2019-03-14 | Congestion control method for data center |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109873773B (en) |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111343104A (en) * | 2020-03-02 | 2020-06-26 | 西南交通大学 | Congestion control method for realizing authorized bandwidth allocation |
| CN112118191A (en) * | 2020-09-18 | 2020-12-22 | 首都师范大学 | Multipath transmission congestion control method, device, control equipment and storage medium |
| CN112565100A (en) * | 2020-11-30 | 2021-03-26 | 中国人民解放军国防科技大学 | Network congestion control method combining active and passive modes |
| CN112653635A (en) * | 2020-12-23 | 2021-04-13 | 百果园技术(新加坡)有限公司 | Congestion control algorithm improvement method, device, equipment and storage medium |
| CN114828081A (en) * | 2022-03-30 | 2022-07-29 | 天津大学 | Cooperative hybrid congestion control method based on path recovery |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20080298240A1 (en) * | 2007-06-01 | 2008-12-04 | Industry Collaboration Foundation Of Inha University | Node availability prediction-based grid network congestion control device and method therefor |
| CN105827540A (en) * | 2016-05-30 | 2016-08-03 | 清华大学深圳研究生院 | Data center network transmission layer stream data transmission method based on priority |
| CN105978822A (en) * | 2016-07-15 | 2016-09-28 | 福州大学 | Congestion control method based on deadline sensitivity and round-trip time in data center |
| CN108965151A (en) * | 2018-08-27 | 2018-12-07 | 华中科技大学 | A kind of Explicit Congestion control method based on queuing delay |
| CN109309625A (en) * | 2017-07-28 | 2019-02-05 | 北京交通大学 | A kind of data center network calamity is for transmission method |
-
2019
- 2019-03-14 CN CN201910195726.8A patent/CN109873773B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20080298240A1 (en) * | 2007-06-01 | 2008-12-04 | Industry Collaboration Foundation Of Inha University | Node availability prediction-based grid network congestion control device and method therefor |
| CN105827540A (en) * | 2016-05-30 | 2016-08-03 | 清华大学深圳研究生院 | Data center network transmission layer stream data transmission method based on priority |
| CN105978822A (en) * | 2016-07-15 | 2016-09-28 | 福州大学 | Congestion control method based on deadline sensitivity and round-trip time in data center |
| CN109309625A (en) * | 2017-07-28 | 2019-02-05 | 北京交通大学 | A kind of data center network calamity is for transmission method |
| CN108965151A (en) * | 2018-08-27 | 2018-12-07 | 华中科技大学 | A kind of Explicit Congestion control method based on queuing delay |
Non-Patent Citations (1)
| Title |
|---|
| XIANLIANG JIANG 等: ""HFCC: An Adaptive Congestion Control Algorithm Based on Explicit Hybrid Feedbacks"", 《IEEE》 * |
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111343104A (en) * | 2020-03-02 | 2020-06-26 | 西南交通大学 | Congestion control method for realizing authorized bandwidth allocation |
| CN111343104B (en) * | 2020-03-02 | 2022-04-29 | 西南交通大学 | Congestion control method for realizing authorized bandwidth allocation |
| CN112118191A (en) * | 2020-09-18 | 2020-12-22 | 首都师范大学 | Multipath transmission congestion control method, device, control equipment and storage medium |
| CN112118191B (en) * | 2020-09-18 | 2023-07-28 | 首都师范大学 | Multipath transmission congestion control method, device, control equipment and storage medium |
| CN112565100A (en) * | 2020-11-30 | 2021-03-26 | 中国人民解放军国防科技大学 | Network congestion control method combining active and passive modes |
| CN112565100B (en) * | 2020-11-30 | 2022-05-20 | 中国人民解放军国防科技大学 | Network congestion control method combining active and passive modes |
| CN112653635A (en) * | 2020-12-23 | 2021-04-13 | 百果园技术(新加坡)有限公司 | Congestion control algorithm improvement method, device, equipment and storage medium |
| CN114828081A (en) * | 2022-03-30 | 2022-07-29 | 天津大学 | Cooperative hybrid congestion control method based on path recovery |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109873773B (en) | 2022-06-03 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109873773A (en) | A kind of jamming control method for data center | |
| CN109120544B (en) | Transmission control method based on host end flow scheduling in data center network | |
| CN108965151B (en) | Explicit congestion control method based on queuing time delay | |
| CN106027416B (en) | A kind of data center network traffic scheduling method and system based on space-time combination | |
| US6078564A (en) | System for improving data throughput of a TCP/IP network connection with slow return channel | |
| US8553543B2 (en) | Traffic shaping method and device | |
| CN101582842A (en) | Congestion control method and congestion control device | |
| WO2003071740A1 (en) | A method of priority control in wireless packet data communications | |
| US20090010165A1 (en) | Apparatus and method for limiting packet transmission rate in communication system | |
| CN103905328A (en) | Data transmission control system and method and related equipment | |
| EP1402396A1 (en) | Method and apparatus for allocating link bandwidth | |
| CN110808884B (en) | Network congestion control method | |
| CN112995048B (en) | Blocking control and scheduling fusion method of data center network and terminal equipment | |
| CN106059951A (en) | Transmission control method for DCN (Data Center Network) based on multilevel congestion feedback | |
| CN114938350A (en) | Congestion feedback-based data flow transmission control method in lossless network of data center | |
| CN113543209B (en) | Token scheduling-based congestion control method and device | |
| WO2020090474A1 (en) | Packet forwarding apparatus, method and program | |
| CN108667746B (en) | Method for realizing service priority in deep space delay tolerant network | |
| CN110868359B (en) | Network congestion control method | |
| CN116980342B (en) | Method and system for transmitting data in multi-link aggregation mode | |
| CN114629847B (en) | Coupled multi-stream TCP congestion control method based on available bandwidth allocation | |
| CN115665060A (en) | Multi-path transmission scheduling method and device for heterogeneous network | |
| Szilágyi et al. | Efficient LTE PDCP buffer management | |
| JP2008193310A (en) | Buffer management method of router and router using the management method | |
| WO2024036476A1 (en) | Packet forwarding method and apparatus |
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 | ||
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20231226 Address after: Room 438, 4th Floor, Building A3, Hongfeng Science and Technology Park, No. 3 Zhixin Road, Nanjing Economic and Technological Development Zone, Nanjing City, Jiangsu Province, 210034 Patentee after: Nanjing Shuizhishi Information Technology Co.,Ltd. Address before: 201306 2nd floor, no.979, Yunhan Road, Lingang New District, Pudong New Area pilot Free Trade Zone, Shanghai Patentee before: Shanghai Miyuan Intellectual Property Service Co.,Ltd. Effective date of registration: 20231226 Address after: 201306 2nd floor, no.979, Yunhan Road, Lingang New District, Pudong New Area pilot Free Trade Zone, Shanghai Patentee after: Shanghai Miyuan Intellectual Property Service Co.,Ltd. Address before: 315211, Fenghua Road, Jiangbei District, Zhejiang, Ningbo 818 Patentee before: Ningbo University |