CN107566275B - Multi-path transmission method based on the delay inequality opposite sex in data center network - Google Patents
Multi-path transmission method based on the delay inequality opposite sex in data center network Download PDFInfo
- Publication number
- CN107566275B CN107566275B CN201710968716.4A CN201710968716A CN107566275B CN 107566275 B CN107566275 B CN 107566275B CN 201710968716 A CN201710968716 A CN 201710968716A CN 107566275 B CN107566275 B CN 107566275B
- Authority
- CN
- China
- Prior art keywords
- path
- data
- available
- data packet
- sent
- 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
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a kind of multi-path transmission methods based on the delay inequality opposite sex in data center network, transmitting terminal is that each path dynamically distributes data packet according to path delay and stream size, the data packet first sent is sent to high delay path, the data packet sent afterwards is sent to low delay path, to reduce the deadline of hangover stream.The present invention can allow data-center applications more reasonably to use the available bandwidth of multipath, the deadline of stream be reduced, to promote application performance.
Description
Technical field
The present invention relates in data center network (DCN, Data Center Network) based on the delay inequality opposite sex come minimum
Change the multi-path transmission method of stream deadline.
Background technique
With the high speed development of the network applications such as on-line search, social networks, e-commerce, more and more application on site
System is migrated to data center, provides network service with storage resource using large-scale calculate for user.Under normal conditions,
Data center network flow has the feature of high concurrent and low delay.These online real-time network applications, to meet extensive use
Family is target to the low delay performance requirement of access.Many optimization method strategies have been proposed in research at present, mainly from transmission
Two aspects of layer and network layer improve and optimize.In transport layer, mainly using congestion control as core technology, gathered around by measuring
Plug degree in time carries out flow control, provides efficient, fair, reliable data transport service for user.In network layer, mainly
Using Routing Protocol and dispatching algorithm as core technology, data packet is dispatched for the Congestion Level SPCC on different paths and is selected optimal
Transmission path finally provides users with efficient services.
The side that the Congestion control protocol DCTCP of current data central site network mainstream is marked using Explicit Congestion notice (ECN)
Method realizes congestion control.In switch configuration buffer queue threshold k.When switch queue length is greater than K, data packet is marked
Note, and fed back using ACK and carry out rate adaptation.The shortcomings that DCTCP, is transmitted using single path, and idle band cannot be made full use of
Width, network resource utilization is low, load imbalance, when high concurrent in core Spine interchanger hot issue easy to form.
In recent years, researchers propose some novel data center network topology structure such as Fat-tree and Leaf-
Spine, there are relatively rich path resources in these network topologies.In order to utilize multipath resource, ECMP utilizes data packet head
The five-tuple information of carrying realizes load balancing using hash algorithm in interchanger, improves network resource utilization.But work as
When a plurality of stream is hashed function and is distributed to interchanger same exit port, Hash collision is just formed.And RPS touches in order to avoid Hash
Problem is hit, using the routing mechanism of package level.When data packet reaches interchanger, data packet is distributed to exchange by RPS at random
The exit port of machine realizes load balancing.MPTCP is the multi-path transmission protocol realized according to ECMP, data flow is divided into multiple
Subflow parallel transmission on different paths.In general, above multi-path routing mechanism can improve network utilization, but
There is also a common problems: not accounting for different paths, there may be delay differences.If the data packet finally sent
Or excessive data packet is addressed to the deadline that high delay path will increase whole stream, reduces network transmission efficiency.
Therefore, data center network multipath resource how to be made full use of to minimize the deadline of stream, be one urgently
Problem to be solved.
Summary of the invention
Technical problem solved by the invention is, in view of the deficiencies of the prior art, provides base in a kind of data center network
In the multi-path transmission method of the delay inequality opposite sex, data-center applications can be allowed more reasonably to use the available band of multipath
Width reduces the deadline of stream.
Technical solution of the present invention the following steps are included:
A kind of multi-path transmission method based on the delay inequality opposite sex in data center network, the data that transmitting terminal is sent at it
Port numbers are written in packet header, and the port numbers on Leaf interchanger read data packet head simultaneously press the port numbers to output port forwarding number
According to packet, multi-path transmission is realized；Transmitting terminal calculates the receiving time and its corresponding data packet of the ACK packet when receiving ACK packet
Sending time between difference, using the RTT value of this difference transmission path corresponding as the ACK packet；It is corresponding according to path
Port numbers and RTT value establish routing information table (including port number field and RTT field；Wherein port number field is for identifying
Path, the corresponding different paths of different port number；RTT field record path round-trip delay value size, transmitting terminal are received from difference
Timely update the RTT value in path in table after the ACK packet in path), by the data packet first sent be sent in routing information table RTT value compared with
Big (height delay) path, the data packet sent afterwards are sent to lesser (low delay) path of RTT value in routing information table.
Further, after receiving end receives the data packet that transmitting terminal is sent, by its available cache memory size write-in ACK packet
Reserved field, and feed back to receiving end；
The data packet that will first send is sent to the biggish path of RTT value in routing information table, the data packet hair sent afterwards
The lesser path of RTT value into routing information table specifically includes the following steps:
Step 1: initialization obtains transmitting terminal network interface card bandwidth C and maximum transmission unit MTU size, and previous by reading
The reserved field for sending the corresponding ACK packet of data packet obtains receiving end available cache memory size；
Step 2: numbering from big to small to path in the information table of path according to RTT value is 1~N, i.e. the maximum road of RTT value
Diameter its number i is that second largest path of 1, RTT value its number i is 2, and so on, the smallest path of RTT value its number i is N；
Wherein N is number of path, i.e. core Spine interchanger quantity；
Step 3: judge whether currently transmitted caching is sky, if it is empty, indicates that no data need to send, then terminates；If
It is not sky, expression needs to send there are also data, then enters step four；
Step 4: judging whether currently transmitted buffer data size is greater than receiving end available cache memory, if so, caching from sending
The data volume of recipient's available cache memory size is taken out, is otherwise cached from transmission and takes out total data；
Step 5: it will be assigned to L from the data volume size for sending caching taking-up, and calculates and transfers data volume L needs
Minimum time Tl；
Step 6: RTT value is selected to be not more than T from routing tablelPath form available path set；
Step 7: according to available path PiRTT value, calculate respective paths distribution data volume weight factor Wi；Wherein
I is the number in path；
Step 8: the smallest available path of number i is selected from available path set；
Step 9: available path P is calculatediThe number-of-packet L*W for needing to sendi；
Step 10: to available path PiSend data packet；
Step 11: statistics has passed through available path PiThe number-of-packet of transmission, judges whether it is less than L*WiIf then
Go to step ten；Otherwise transmitting terminal updates RTT value in routing information table according to ACK is returned, and judges whether that there are also other available roads
Diameter enables i=i+1, and go to step ten if there is other available paths, if going to step two without other available paths.
Further, in the step 1, transmitting terminal network interface card bandwidth C=1Gbps, maximum transmission unit MTU=
1500Bytes。
Further, in the step 5, transmitting terminal transfers the minimum time T of data volume L needslCalculation formula
Are as follows:
Wherein, RTTminFor the minimum value in the RTT value in all paths.
Further, in the step 7, the weight factor W of data volume is distributediCalculation formula are as follows:
Wherein, RTTiFor the RTT value of i-th available path；M is available path number.
The utility model has the advantages that
The invention discloses a kind of multi-path transmission methods based on the delay inequality opposite sex in data center network, solve list
The low problem of network resource utilization in path transmission；Relative to existing multi-path transmission method, transmitting terminal of the present invention according to
Path delay and stream size are that each path dynamically distributes data packet, and the data packet first sent is sent to high delay path, rear to send
Data packet be sent to low delay path, thus reduce hangover stream deadline, data-center applications can be allowed more reasonable
Ground uses the available bandwidth of multipath, the deadline of stream is reduced, to promote application performance.
Detailed description of the invention
Fig. 1 is flow chart of the invention.
Fig. 2 is Leaf-Spine topological structure used by testing, and multipath quantity is core Spine interchanger number.
Fig. 3 is the deadline schematic diagram for sending successive data packet selection different delayed time path；Fig. 3 (a) will first be sent
Data packet is sent to low delay path, and the data packet sent afterwards is sent to high delay path；Used by Fig. 3 (b) is DDMCC of the present invention
The data packet first sent is sent to high delay path by method, and the data packet sent afterwards is sent to low delay path to complete to transmit.
Fig. 4 (a) is the stream deadline result figure for testing different agreement or method.Experiment parameter is provided that server
Sending stream size is respectively 64KB, 32KB and 16KB, and the round trip delay time of 3 paths is respectively RTT1=100us, RTT2=150us
And RTT3=300us, receiving end cache size 64KB, wherein the present invention is named as DDMCC.
When Fig. 4 (b) is test different agreement or the dirty size of method is 64KB, each data packet reaches the time of receiving end
Result figure, the same to Fig. 4 (a) of experiment parameter
Fig. 5 (a) is the deadline result figure for testing different agreement or the method short stream under different delayed time otherness degree.
Experiment parameter is as follows: it is 64KB, receiving end cache size 64KB that server, which sends stream size, has 10 paths in topology, wherein
The RTT value of one paths increases to 700us from 100us, other 9 paths time delay RTT values are 100us.
Fig. 5 (b) tests different agreement or method in the case where path delay has differences, every segment data transmission in long stream
Goodput result figure, middle section size be 64KB.Experiment parameter is provided that server sends stream size and is
1280KB, receiving end cache size 64KB, are 300us there are delay path RTT one high, other 9 paths RTT values are
100us。
Fig. 6 (a) is different agreement or method in the case where high delay path quantity is different, short stream deadline result
Figure.It is 64KB, receiving end cache size 64KB that experiment parameter, which is provided that server sends stream size, totally 10 paths, wherein
Low delay path RTT is 100us, and high delay path is 300us.Successively testing high delay path quantity is 0,2,4,6
The short stream deadline of item, 8 five kinds of situations.
Fig. 6 (b) is different agreement or method under 3 high delay paths, and every segment data transmission effectively handles up in long stream
Rate result figure, middle section size are 64KB.It is 1280KB that experiment parameter, which is provided that server sends stream size, and receiving end is slow
Deposit size 64KB；Having delay path RTT 3 high is 300us, and low delay path RTT is 100us.
Specific embodiment
Referring to Fig. 1, Fig. 1 is flow chart of the invention.Process is as follows:
Initialization, transmitting terminal is by being written port numbers, the port of Leaf interchanger read data packet head in data packet header
Number and by the port numbers to output port forward data packet, realize multi-path transmission.Transmitting terminal calculates each road further according to feeding back ACK
Diameter time delay RTT value is established routing information table, and is sorted from large to small by RTT value.
When transmitting terminal there are data to need to send, it is big first to judge whether transmission buffer data size is greater than receiving end available cache memory
It is small, if it is, taking out the open ended data volume transmission in receiving end from sending to cache, is otherwise cached from transmission and take out total data
It sends, and the data volume sent will be needed to be assigned to L.
Minimum time T required for transmitting terminal transfers data volume L according to RTT value calculating in routing information tablel, then will
RTT value is not more than TlPath form available path set, and calculate according to available path RTT value the weight W of each path iiAnd point
The data volume L*W matchedi。
Transmitting terminal starts to send data and judges to be sent to path PiData volume whether be less than L*WiIf then continuing toward road
Diameter PiSend data packet；When having sent L*WiWhen data, transmitting terminal updates RTT value in routing information table according to ACK is returned, and sentences
Disconnected whether there are also available paths, if then toward Pi+1Path sends L*Wi+1Data, if without available path, transmitting terminal according to
RTT value from big to small resequences to path.
Fig. 2 is experiment topological diagram, sees 2 explanation of attached drawing in detail.
Fig. 3 is the timing diagram of existing common method and DDMCC of the present invention.Fig. 3 (a) shows existing common method first sending out
The data packet sent is sent to low delay path, and the data packet sent afterwards is sent to high delay path；Fig. 3 (b) is the side of being used of the invention
The data packet first sent is sent to high delay path by method, and the data packet sent afterwards is sent to low delay path.By figure observable
It arrives, the data packet that the present invention is sent after capable of helping pursues the first hair data transmitted on high delay path using low delay path
Packet reduces the overall arrival time for sending packet, to reduce the deadline of whole stream.
The present invention is realized using NS2.35 network simulation platform, and has carried out performance test.Experimental result is to repeat 50
The average result of secondary experiment.
Fig. 4 compared the stream deadline of this method DDMMC and RPS, DCTCP.Experiment parameter is provided that transmitting terminal arrives
There are three paths, round trip delay time is respectively RTT for receiving end1=100us, RTT2=150us and RTT3=300us, interchanger are slow
250 packets are saved as, all link capacities are 1Gbps, and stream size is respectively 64KB, 32KB and 16KB, receiving end cache size
64KB。
It can be seen that from Fig. 4 (a), the DCTCP deadline is all longest under not cocurrent flow size cases, DDMCC's of the present invention
It is most short to flow the deadline.Fig. 4 (b) is the time diagram for flowing each data packet when size is 64KB and reaching receiving end.As can be seen that
DCTCP is transmitted using single path, and available bandwidth is less than multi-path transmission, so effect is worst.RPS does not account for the delay inequality opposite sex
Cause data packet to randomly choose path transmission, forms trailing phenomenon, increase the deadline of stream.DDMCC of the present invention passes through
For different delayed time path allocation different data packet, a small number of packets first sent are sent to high delay path, the most packet hairs sent afterwards
Toward low delay path, finally makes the data packet finally transmitted on different paths substantially while reaching receiving end, to reduce
The deadline of whole stream.
Fig. 5 is the result figure that the test path delay inequality opposite sex influences short stream deadline and long stream goodput.Fig. 5
(a) experiment parameter is provided that transmission flows size for 64KB, and receiving end cache size 64KB, transmitting terminal exists to receiving end
10 paths, wherein RTT value increases to 700us, link bandwidth 1Gbps from 100us there are a high delay path；Fig. 5
(b) experiment parameter is provided that transmission stream size is 1280KB, and high delay path RTT is 300us, and low delay path RTT is
100us, the same to Fig. 5 (a) of other experiment parameters.
Find out from Fig. 5 (a), the stream deadline of DCTCP is continuously increased and amplitude is smaller.The reason is that in 10 paths,
Only one high delay path RTT increase causes average RTT amplification smaller, so the amplification of stream deadline is also smaller.The stream of RPS
Deadline is incremented by with high delay path RTT and is become larger, the reason is that the delay inequality opposite sex becomes as high delay path RTT value increases
Greatly, there are more data packets to form hangover, increase the deadline of stream.8 subflow parallel transmissions, but subflow are used in MPTCP
It is also random selection transmitting path, so that the data packet sent afterwards is addressed to high delay path, so as RTT otherness becomes
Greatly, the stream deadline impacted maximum of MPTCP, significantly increases the deadline of stream.DDMCC of the present invention gives high delay path
The packet number of distribution is reduced, and the data packet first sent is sent to high delay path, the data packet sent afterwards is sent to low delay path, energy
The deadline of stream is effectively reduced.In addition, other agreements or method are still to this when high delay path RTT increases to 700us
Superelevation delay path sends data packet；And the present invention can be denoted as the path in unavailable path, to significantly reduce stream
Deadline.
Find out from Fig. 5 (b), the goodput of DCTCP is basically stable at 0.8Gbps or so, but the bandwidth benefit in network
It is only 1/10 with rate.Although RPS is transmitted with 10 paths, but its method for randomly choosing path reduces having for long stream
Imitate throughput.MPTCP is influenced by high delay path, and goodput is stablized in 0.6Gbps or so.DDMCC of the present invention
Due to being to cache to take out the transmission of 64KB data from transmission every time, every section of data packet considers multipath state to transmit, has
Throughput is imitated to stablize in 0.9Gbps or so.
Fig. 6 is the result figure that the high delay path quantity of test influences short stream deadline and long stream goodput.Fig. 6
(a) experiment parameter is provided that transmission flows size for 64KB, and receiving end cache size 64KB, transmitting terminal exists to receiving end
10 paths, high delay path quantity are respectively 0,2,4,6,8 five groups of situations, link bandwidth 1Gbps；Fig. 6 (b)
Experiment parameter be provided that transmission stream size be 1280KB, choose exist 3 RTT values be 300us high delay path,
The same Fig. 6 (a) of his parameter.
Find out from Fig. 6 (a), the short stream deadline of DCTCP increases as average delay increases.The reason is that with height
Delay path quantity increases, and average RTT is also being accordingly increased, so the stream deadline is also stepped up.In RPS, with height
Delay path number increases, and more data packets are transmitted on high delay path, and the stream deadline is also increasing.MPTCP is with height
Delay path number increases, and has more data packets and is assigned to high delay path to increase the stream deadline.This
DDMCC is invented when all path delay are 100us, transmitting terminal assigns to data 10 paths, when stream at this time is completed
Between it is minimum.As high delay path quantity increases, data packet is gradually displaced to low delay path, ensure that lesser stream is completed
When.
Find out from Fig. 6 (b), effectively handling up for DCTCP is reduced as high delay path number increases.In RPS, with Gao Yan
When number of paths increase, goodput is promoted but is not obvious.In MPTCP, the increase of high delay path quantity is simultaneously
Very big influence is not caused to the section goodput of long stream.DDMCC of the present invention is effectively gulped down with the increase of high delay path quantity
All declines of rate are spat, but are still higher than other agreements or method.
Claims (2)
1. a kind of multi-path transmission method based on the delay inequality opposite sex in data center network, which is characterized in that transmitting terminal is at it
Port numbers are written in the data packet header of transmission, and the port numbers on Leaf interchanger read data packet head simultaneously press the port numbers to output
Port forwards data packet, realizes multi-path transmission；It is after receiving end receives the data packet of transmitting terminal transmission, its available cache memory is big
The reserved field of small write-in ACK packet, and feed back to transmitting terminal；Transmitting terminal is when receiving ACK packet, when calculating the reception of the ACK packet
Between difference between the sending time of its corresponding data packet, using this difference transmission path corresponding as the ACK packet
RTT value；Transmitting terminal establishes routing information table according to the corresponding port numbers in path and RTT value, and the data packet first sent is sent to road
The biggish path of RTT value in diameter information table, the data packet sent afterwards are sent to the lesser path of RTT value in routing information table, specifically
The following steps are included:
Step 1: initialization obtains transmitting terminal network interface card bandwidth C and maximum transmission unit MTU size, and is previously sent by reading
The reserved field of the corresponding ACK packet of data packet obtains receiving end available cache memory size；
Step 2: numbering from big to small to path in the information table of path according to RTT value is 1~N, and wherein N is number of path, i.e. core
Spine interchanger quantity；
Step 3: judge whether currently transmitted caching is sky, if it is empty, indicates that no data need to send, then terminates；If not
Sky, expression need to send there are also data, then enter step four；
Step 4: judging whether currently transmitted buffer data size is greater than receiving end available cache memory, if so, taking out from caching is sent
Otherwise the data volume of recipient's available cache memory size caches from transmission and takes out total data；
Step 5: it will be assigned to L from the data volume size for sending caching taking-up, and calculates the minimum for transferring data volume L needs
Time Tl, calculation formula are as follows:
Wherein, RTTminFor the minimum value in the RTT value in all paths；
Step 6: RTT value is selected to be not more than T from routing tablelPath form available path set；
Step 7: according to available path PiRTT value, calculate respective paths distribution data volume weight factor Wi, calculation formula
Are as follows:
Wherein, i is the number in path；RTTiFor the RTT value of i-th available path；M is available path number;
Step 8: the smallest available path of number i is selected from available path set；
Step 9: available path P is calculatediThe number-of-packet L*W for needing to sendi；
Step 10: to available path PiSend data packet；
Step 11: statistics has passed through available path PiThe number-of-packet of transmission, judges whether it is less than L*WiIf then turning to walk
Rapid ten；Otherwise transmitting terminal updates RTT value in routing information table according to ACK is returned, and judges whether that there are also other available paths, if
There are other available paths, then enable i=i+1, and go to step ten, if going to step two without other available paths.
2. the multi-path transmission method based on the delay inequality opposite sex in data center network according to claim 1, feature
It is, in the step 1, transmitting terminal network interface card bandwidth C=1Gbps, maximum transmission unit MTU=1500Bytes.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710968716.4A CN107566275B (en) | 2017-10-18 | 2017-10-18 | Multi-path transmission method based on the delay inequality opposite sex in data center network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710968716.4A CN107566275B (en) | 2017-10-18 | 2017-10-18 | Multi-path transmission method based on the delay inequality opposite sex in data center network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107566275A CN107566275A (en) | 2018-01-09 |
| CN107566275B true CN107566275B (en) | 2019-12-03 |
Family
ID=60986331
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710968716.4A Active CN107566275B (en) | 2017-10-18 | 2017-10-18 | Multi-path transmission method based on the delay inequality opposite sex in data center network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107566275B (en) |
Families Citing this family (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110380978B (en) * | 2018-04-13 | 2021-09-28 | 清华大学 | Scheduling method and device for multipath transmission, computer equipment and storage medium |
| CN110336823B (en) * | 2019-07-09 | 2021-12-03 | 深圳市网心科技有限公司 | Task allocation method, electronic device, system and medium based on RTT |
| CN110392394B (en) * | 2019-07-26 | 2021-04-16 | 湖南大学 | MPTCP scheduling method based on link state information in wireless network |
| CN110351187B (en) * | 2019-08-02 | 2021-03-12 | 中南大学 | Load balancing method for path switching granularity self-adaption in data center network |
| CN113783787B (en) * | 2021-08-05 | 2023-06-13 | 山东省计算中心（国家超级计算济南中心） | Cloud edge cooperation-based non-real-time data transmission method and device |
| CN115714776B (en) * | 2023-01-09 | 2023-05-09 | 杭州涂鸦信息技术有限公司 | Method for receiving reported data from equipment and method for reporting data by equipment |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102185771A (en) * | 2011-05-05 | 2011-09-14 | 清华大学 | Dispatching method and system for data packet of sender in MPTCP (Multipath TCP (Transmission Control Protocol)) |
| JP2012195836A (en) * | 2011-03-17 | 2012-10-11 | Nec Corp | Communication device and communication control method in data communication system |
| CN103346963A (en) * | 2013-06-26 | 2013-10-09 | 南京昭视畅网络科技有限公司 | MPTCP data scheduling method based on forecast arrival time |
| CN106656856A (en) * | 2016-12-16 | 2017-05-10 | 浙江大学 | Data package scheduling method for resisting blockage of MPTCP receiving buffer zone |
| WO2017115907A1 (en) * | 2015-12-28 | 2017-07-06 | 전자부품연구원 | Transmission device and method for measuring dynamic path state in various network environments |
-
2017
- 2017-10-18 CN CN201710968716.4A patent/CN107566275B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2012195836A (en) * | 2011-03-17 | 2012-10-11 | Nec Corp | Communication device and communication control method in data communication system |
| CN102185771A (en) * | 2011-05-05 | 2011-09-14 | 清华大学 | Dispatching method and system for data packet of sender in MPTCP (Multipath TCP (Transmission Control Protocol)) |
| CN103346963A (en) * | 2013-06-26 | 2013-10-09 | 南京昭视畅网络科技有限公司 | MPTCP data scheduling method based on forecast arrival time |
| WO2017115907A1 (en) * | 2015-12-28 | 2017-07-06 | 전자부품연구원 | Transmission device and method for measuring dynamic path state in various network environments |
| CN106656856A (en) * | 2016-12-16 | 2017-05-10 | 浙江大学 | Data package scheduling method for resisting blockage of MPTCP receiving buffer zone |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107566275A (en) | 2018-01-09 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107566275B (en) | Multi-path transmission method based on the delay inequality opposite sex in data center network | |
| CN106411733B (en) | A kind of SDN dynamic load leveling dispatching method based on link real time load | |
| CN104767694B (en) | A kind of stream compression forwarding method towards Fat Tree data center network architectures | |
| CN105227481B (en) | SDN congestion control method for routing based on path cost and stream scheduling cost minimization | |
| CN103716208B (en) | Support network management, system, interchanger and the network of elephant stream | |
| CN107959633A (en) | A kind of load balance method based on price mechanism in industry real-time network | |
| Ren et al. | Traffic-aware dynamic routing to alleviate congestion in wireless sensor networks | |
| CN107819695A (en) | A kind of distributed AC servo system SiteServer LBS and method based on SDN | |
| CN105897575A (en) | Path computing method based on multi-constrained path computing strategy under SDN | |
| Wang et al. | Implementation of multipath network virtualization with SDN and NFV | |
| CN107948103A (en) | A kind of interchanger PFC control methods and control system based on prediction | |
| CN106533970A (en) | Differential flow control method and device for cloud computing data center network | |
| CN107396396A (en) | Support the data transfer management method of multi-source multipath | |
| CN104092625B (en) | A kind of self adaptation being used in DCN asks dispatching method in batches | |
| CN103501209B (en) | Heterogeneous multi-network cooperative transmission single service flow division method and equipment | |
| CN107154897A (en) | Isomery stream partition method based on bag scattering in DCN | |
| CN102185771A (en) | Dispatching method and system for data packet of sender in MPTCP (Multipath TCP (Transmission Control Protocol)) | |
| CN114285758A (en) | Communication network optimization simulation system, method and device based on OPNET | |
| CN105163354B (en) | A kind of data stream time delay guarantee strategies using at network coding opportunity between convection current | |
| CN105577537A (en) | Multipath forwarding method and system of history record based information centric network | |
| Cheung et al. | DFFR: A flow-based approach for distributed load balancing in Data Center Networks | |
| CN104219170B (en) | The bag dispatching method retransmitted in wireless network based on probability | |
| Wang et al. | Load balancing for heterogeneous traffic in datacenter networks | |
| Yu et al. | A multipath routing protocol using congestion control in wireless multimedia sensor networks | |
| CN110198273A (en) | Multi-path transmission method in data center network based on network code |
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 |