CN108989148A - A kind of relaying multipath flow allocation method that propagation delay time minimizes - Google Patents
A kind of relaying multipath flow allocation method that propagation delay time minimizes Download PDFInfo
- Publication number
- CN108989148A CN108989148A CN201810783246.9A CN201810783246A CN108989148A CN 108989148 A CN108989148 A CN 108989148A CN 201810783246 A CN201810783246 A CN 201810783246A CN 108989148 A CN108989148 A CN 108989148A
- Authority
- CN
- China
- Prior art keywords
- path
- traffic
- assignment
- paths
- node
- 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
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L43/00—Arrangements for monitoring or testing data switching networks
- H04L43/08—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L43/00—Arrangements for monitoring or testing data switching networks
- H04L43/08—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters
- H04L43/0823—Errors, e.g. transmission errors
- H04L43/0829—Packet loss
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L43/00—Arrangements for monitoring or testing data switching networks
- H04L43/08—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters
- H04L43/0852—Delays
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L43/00—Arrangements for monitoring or testing data switching networks
- H04L43/08—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters
- H04L43/0876—Network utilisation, e.g. volume of load or congestion level
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/02—Topology update or discovery
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/12—Shortest path evaluation
- H04L45/123—Evaluation of link metrics
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/24—Multipath
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Environmental & Geological Engineering (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses the relaying multipath flow allocation methods that a kind of propagation delay time minimizes.Traditional flow allocation method directly carries out end-to-end flux distribution to network subflow, and propagation delay time performance can be caused to decline.The method of the present invention, according to aggregation node split path, carries out relaying multipath assignment of traffic in path dependent.This method carries out information collection first, path is split, then network path modeling, quality evaluation are carried out, the queuing delay in Flow Distribution Calculation path is transmitted, solves the smallest assignment of traffic of time delay, coupling traffic allocation result, the mean transit delay for making data grouping reach destination node minimize.Delay performance angle is broadcast live from promotion in the method for the present invention, consider the case where there are aggregation nodes in multi-path transmission, real-time monitoring link information, relaying multipath assignment of traffic is carried out to obtain minimum transfer time delay, transmission performance caused by traditional flow allocation method neutron current competition shared link resource is avoided and declines.
Description
Technical field
The invention belongs to network communication technology fields, and in particular to a kind of relaying multichannel run-off that propagation delay time minimizes
Distribution method.
Background technique
With the development of network technology and various new medias, continuing to bring out from media, video stream media industry is achieved
Significant progress, industry are higher and higher to live streaming delay and the requirement of interactivity.Interaction direct seeding technique has been live streaming industry
Standard configuration.Under normal conditions, delay can do the interaction of some relatively high frequencies lower than 800 milliseconds in live streaming, for example talk
Talk about program and live streaming line.If being promoted to 400 milliseconds, there can be enough surpluses to resist network fluctuation, realize that interaction is straight
It broadcasts.Therefore, how network delay performance is preferably promoted, becomes real-time video application and guarantees user-interaction experience quality, ranks among
The key factor of industry-leading level.
With the development of multi-access technology, terminal device is generally configured with a variety of different network interfaces, supports different connect
Enter technology.Under bandwidth sufficiency, the utilization of resources is unfavorable for using single network access, manual switching access way will cause
Service instantaneous interruption.To solve these problems, about multi-path transmission technology (Concurrent Multipath
Transmission, CMT) it receives significant attention.
Segmentation/polymerization transmission mode is generallyd use during multi-path transmission technical application, when with the presence of aggregation node
When, the end-to-end path of source node to destination node is not independent, and different paths may share certain link circuit resources, there is competition
Relationship.Existing flow allocation method usually only carries out modeling analysis to end-to-end assignment of traffic, makes not go the same way by assignment of traffic
The delay inequality of diameter minimizes, and reduces the delay jitter of data grouping, alleviates out-of-order problem；According to subflow situation dynamic adjustment distribution
To the flow of subflow, the maximization of handling capacity is realized；To the user experience quality modelling evaluation in transmission process, pass through flow point
With optimization user experience quality.
However, having distributed flow can be to other subflow on shared link when carrying out assignment of traffic to dependent path
Transmission impacts, and carrying out assignment of traffic by original mode can cause transmission performance to decline.Therefore, how preferably non-in path
Under standalone case, reasonable assignment of traffic is carried out to obtain the smallest mean transit delay with important meaning to multi-path transmission
Justice.The present invention considers multi-path transmission the case where there are aggregation nodes, according to aggregation node split path, carries out relaying multipath
Assignment of traffic, the mean transit delay for making data grouping reach destination node minimize.
Summary of the invention
The purpose of the present invention is to the deficiencies in the prior art, provide a kind of relaying multipath that propagation delay time minimizes
Flow allocation method.
The method of the present invention, according to aggregation node split path, carries out relaying multichannel run-off in path dependent
Distribution, the mean transit delay for making data grouping reach destination node minimize, the specific steps are as follows:
Step 1. information is collected:
Monitoring network flow is collected and estimates link information；According to the link information being collected into, generates and pass through from source node
Set of paths of the aggregation node to destination node；
Network is regarded as digraph G=(V, E), whereinIndicate the set of node, E={ eij, table
Show the set of inter-node link；S indicates that source node, d indicate destination node, nijIndicate j-th of network node, N on the i-th paths
Expression general networking node, N=1,2 ... }, eijIndicate j-th strip network link on the i-th paths；Source node s and purpose section
Between point d it is simple without circulation available path collection be combined into P, P={ P1,P2,...,PK, K is number of path.
Step 2. path is split:
Source node s to the path of destination node d is split into multiple portions according to aggregation node c, and is redefined each
Partial logical path set, P=P ': P ": ... }={ (P1′,P2′,P3′,P4′,...):(P1″,P2" ...): ... },
First logical path set after middle P ' expression fractionation, P " indicate second logical path set after splitting, Pi'=
{e′i1,e′i2... }, Pi"={ e "i1,e″i2... } and indicate mutually indepedent link on the i-th paths between each node, e 'i1Table
Show in first logical path set, first link on the i-th paths, e "i1It indicates in second logical path set, the
First link on i paths.
The modeling of step 3. network path:
A logical path set is chosen, obtain and updates path network parameter: path PiOn packet loss Indicate link eijOn packet loss, maximum available bandwidth ai, propagation delay pdi, average transmission speed
Rate ri, define path PiOn transmission available bandwidth wi=ri+ai；Define path PiOn trend bandwidthFor current time t with
The predicted value of preceding q moment transmission available bandwidth variation tendency:Wherein parameter
φ1,φ2,φ3...,φqFor autoregressive coefficient, εtFor mutually independent white noise sequence.
Step 4. quality evaluation:
According to path PiOn transmission available bandwidth wi, packet loss pi, binding time series model, after calculating quality evaluation
Assessment bandwidth:WhereinIt is weighting coefficient with θ, respectively indicates packet loss weight and trend band
Wide weight,0 < θ < 1 meets
Step 5. transmits assignment of traffic:
The Mean Speed for the transmitting terminal that all data groupings reach is λ packets/second, and after reaching source node, transmitting terminal will be counted
It is assigned on K paths and transmits according to grouping；Each data grouping is with probability γiIt is assigned on the i-th paths, requested data
Grouping is with rate γiλ reaches path PiIt is sent.
Step 6. calculates path PiQueuing delay, solve the smallest assignment of traffic of time delay:
According to queueing theory, path P is providediMean transit delay: source node is in PiThe upper average time for sending data groupingConstruct the smallest assignment of traffic problem of propagation delay time, and solve optimize assignment of traffic vector γ=
(γ1,γ2,...,γK)；λiIndicate the rate for being assigned to the i-th paths,Indicate the assessment bandwidth on the i-th paths, pdiTable
Show the propagation delay on the i-th paths；
Constraint condition C1 limits transmission rate of the transmitting terminal in each path no more than maximum available bandwidth, constrains item
Part C2 is the normalization and nonnegativity requirement to data grouping distribution；
Define Lagrangianμ, v, α are glug
Bright day multiplier,It is solved according to KKT condition:
Wherein m is the path number that assignment of traffic is selected in set of paths, the flow distributed on each paths are as follows:
If the propagation delay difference of each paths of step 7. is less than setting time, it is close to be considered as propagation delay, enters step 8；
If the propagation delay difference of each paths is more than or equal to setting time, it is considered as propagation delay and differs larger, enter step 9；Described
Setting time is 3~8 milliseconds；
The propagation delay of each paths subflow of step 8. is close, solves the closed solutions of assignment of traffic:
Enter step 10；
The propagation delay difference of each paths subflow of step 9. is larger, using binary search, determines the bound of search, asks
α approximate solutionObtain assignment of traffic result；It is specific as follows:
Search precision σ is arranged in step 9.1., determines the bound of binary search:
The median of step 9.2. update binary search
Step 9.3. calculates judgement:
IfAdjustment search lower bound,
Return step 9.2；IfThe upper bound of binary search is adjusted,Return step 9.2；IfAcquire precision
For the approximate solution under σ
Step 9.4. will be acquiredIt substitutes intoObtain assignment of traffic result:
Step 10. does not carry out the logical path set of assignment of traffic if it exists, then carries out to next logical path set
Assignment of traffic enters step 3；Otherwise, 11 are entered step.
Step 11. coupling traffic allocation result:
Each section assignment of traffic result is coupled, generate source node to destination node transmission path P=P ':
P ": ... and assignment of traffic γ '+γ " ... } as a result, carrying out data transmission；If there is new data grouping to arrive after being sent completely
It reaches, enters step 3, new round data are transmitted and carry out the smallest relaying multipath assignment of traffic of propagation delay time；Otherwise, terminate simultaneously
It exits.
The method of the present invention considers that there are the feelings of aggregation node in multi-path transmission from live streaming delay performance angle is promoted
Condition, real-time monitoring link information carry out relaying multipath assignment of traffic to obtain minimum transfer time delay.With traditional assignment of traffic side
Method is compared, and advantage is embodied in:
Traditional flow allocation method typically directly carries out end-to-end flux distribution to network subflow.When network subflow is in centre
When node converges, the transmission of other subflows on shared link can be impacted by having distributed flow, be carried out by original mode
Assignment of traffic can cause transmission performance to decline.And the method for the present invention passage path split, propagation delay time minimize assignment of traffic with
And the coupling to flow allocation result, avoid biography caused by traditional flow allocation method neutron current competition shared link resource
Defeated performance decline, the mean transit delay for making data grouping reach destination node minimize.
Detailed description of the invention
Fig. 1 is the flow chart of the method for the present invention；
Fig. 2 is the multi-path transmission network topology for having an aggregation node.
Specific embodiment
Below in conjunction with attached drawing and citing is described in further details the present invention, and method flow is as shown in Figure 1.
The present invention is illustrated relaying multipath flow allocation method, multi-path transmission by taking an aggregation node as an example
Network topology is as shown in Figure 2.There are an aggregation node c between source node s to destination node d.The propagation delay time of each link is equal
It is set as 10ms, bottleneck link e '11,e′21,e′31Available bandwidth be respectively set to 6Mbps, 4Mbps and 5Mbps, packet loss
It is set as 0.1%, the available bandwidth of other links is set as 10Mbps, and packet loss is set as 0.
1. information is collected.Monitoring network flow is collected and estimates link information；According to the link information being collected into, generate
From source node by the set of paths of aggregation node to destination node.Network is regarded as digraph G=(V, E), whereinIndicate the set of node, E={ eij, indicate the set of inter-node link；S indicates that source node, d indicate
Destination node, nijIndicating j-th of network node on the i-th paths, N indicates general networking node, N=1,2 ... }, eijTable
Show j-th strip network link on the i-th paths；Between source node s and destination node d it is simple without circulation available path collection be combined into P,
P={ P1,P2,P3,P4,P5,P6, path number 6.
2. path is split.Source node s to the path of destination node d is split into 2 parts according to aggregation node c, is laid equal stress on
The new logical path set for defining various pieces, P=P ': P " }={ (P1′,P2′,P3′):(P1″,P2"), wherein P ' and P " table
Show the logical path of each section after splitting, Pi'={ e 'i1,e′i2, Pi"={ e "i1,e″i2Indicate each node on the i-th paths
Between mutually independent link；
3. network path models.Logical path set P ' is chosen, obtains and updates path PiOn network parameter:
Packet loss: pi=0.1%, i=1,2,3；
Maximum available bandwidth: a1=6Mbps, a2=4Mbps, a3=5Mbps；
Propagation delay: pdi=20ms, i=1,2,3；
Average transmission rate: ri=0, i=1,2,3；
Transmit available bandwidth: w1=6Mbps, w2=4Mbps, w3=5Mbps；
Trend bandwidth:
4. quality evaluation.Take packet loss weightFor trend bandwidth weighting θ=0.9, according to path PiOn biography
Defeated available bandwidth wi, packet loss pi, calculate quality evaluation after assessment bandwidth:
5. transmitting assignment of traffic.By taking the transmission rate of 12.32Mbps as an example, each data packet size is set as 1400 words
Section, the Mean Speed that data grouping reaches are 1100 packets/seconds.
6. calculating path PiQueuing delay, seek closed solutions γ '=(γ ' of logical path set P ' assignment of traffic1,γ
′2,γ′3)。
7. the propagation delay pd of each pathsiDifference is smaller, enters step 8；
8. acquiring the closed solutions γ ' of logical path set P ' assignment of traffic:
γ′1=0.41, γ '2=0.26, γ '3=0.33.
9. a couple logical path set P " is repeated the above process, solution obtains the assignment of traffic result of logical path set P "
γ ", γ "1=0.5, γ "2=0.5.
10. coupling traffic allocation result.Each section assignment of traffic result is coupled, generates source node to destination node
Transmission path set P={ P ': P ": ... } and assignment of traffic { γ '+γ " ... } as a result, carrying out data transmission:
P1={ e '11,e′12,e″11,e″12},γ1=0.205；
P2={ e '11,e′12,e″21,e″22},γ2=0.205；
P3={ e '21,e′22,e″11,e″12},γ3=0.13；
P4={ e '21,e′22,e″21,e″22},γ4=0.13；
P5={ e '31,e′32,e″11,e″12},γ5=0.165；
P6={ e '31,e′32,e″21,e″22},γ6=0.165；
11. backing into step 3, new round data are transmitted and carry out the smallest relaying multichannel run-off of propagation delay time point
Match, until being sent completely.
12. if the propagation delay pd of each pathsiDifference is larger, pd1=20ms, pd2=40ms, pd3=30ms is used
Binary search calculates assignment of traffic.
13. determining boundSearch precision σ=1 is set.
14. updating the median of binary search
14. judgement is calculated,Adjustment search lower bound,
16. updating the median of binary search
17. judgement is calculated,Adjustment search lower bound,
18. repeating binary search process, meet until acquiring
Approximate solution
19. according to approximate solutionCarry out assignment of traffic:
γ′1=0.4126, γ '2=0.2545, γ '3=0.3329.
Claims (1)
1. the relaying multipath flow allocation method that a kind of propagation delay time minimizes, it is characterised in that this method specific steps are such as
Under:
Step 1. information is collected:
Monitoring network flow is collected and estimates link information；According to the link information being collected into, generate from source node by converging
Set of paths of the node to destination node；
Network is regarded as digraph G=(V, E), whereinIndicate the set of node, E={ eij, indicate section
The set of link between point；S indicates that source node, d indicate destination node, nijIndicate that j-th of network node on the i-th paths, N indicate
General networking node, N=1,2 ... }, eijIndicate j-th strip network link on the i-th paths；Source node s and destination node d it
Between it is simple without circulation available path collection be combined into P, P={ P1,P2,...,PK, K is number of path；
Step 2. path is split:
Source node s to the path of destination node d is split into multiple portions according to aggregation node c, and redefines various pieces
Logical path set, P={ P ': P ": ... }={ (P1′,P2′,P3′,P4′,...):(P1″,P2" ...): ... }, wherein P '
Indicate first logical path set after splitting, P " indicates second logical path set after splitting, Pi'={ e 'i1,e
′i2... }, Pi"={ e "i1,e″i2... } and indicate mutually indepedent link on the i-th paths between each node, e 'i1Indicate first
In a logical path set, first link on the i-th paths, e 'i1It indicates in second logical path set, i-th road
First link on diameter；
The modeling of step 3. network path:
A logical path set is chosen, obtain and updates path network parameter: path PiOn packet loss Indicate link eijOn packet loss, maximum available bandwidth ai, propagation delay pdi, average transmission speed
Rate ri, define path PiOn transmission available bandwidth wi=ri+ai；Define path PiOn trend bandwidthFor current time t with
The predicted value of preceding q moment transmission available bandwidth variation tendency:Wherein parameter
φ1,φ2,φ3...,φqFor autoregressive coefficient, εtFor mutually independent white noise sequence；
Step 4. quality evaluation:
According to path PiOn transmission available bandwidth wi, packet loss pi, binding time series model, commenting after calculating quality evaluation
Estimate bandwidth:WhereinIt is weighting coefficient with θ, respectively indicates packet loss weight and trend bandwidth is weighed
Weight,0 < θ < 1 meets
Step 5. transmits assignment of traffic:
The Mean Speed for the transmitting terminal that all data groupings reach is λ packets/second, and after reaching source node, transmitting terminal divides data
Group is assigned on K paths and transmits；Each data grouping is with probability γiIt is assigned on the i-th paths, requested data grouping
With rate γiλ reaches path PiIt is sent；
Step 6. calculates path PiQueuing delay, solve the smallest assignment of traffic of time delay:
According to queueing theory, path P is providediMean transit delay: source node is in PiThe upper average time for sending data groupingConstruct the smallest assignment of traffic problem of propagation delay time, and solve optimize assignment of traffic vector γ=
(γ1,γ2,...,γK)；λiIndicate the rate for being assigned to the i-th paths,Indicate the assessment bandwidth on the i-th paths, pdiTable
Show the propagation delay on the i-th paths；
Constraint condition C1 limits transmission rate of the transmitting terminal in each path no more than maximum available bandwidth, constraint condition C2
It is the normalization and nonnegativity requirement to data grouping distribution；
Define Lagrangianμ, v, α are Lagrange
Multiplier,It is solved according to KKT condition:
Wherein m is the path number that assignment of traffic is selected in set of paths, the flow distributed on each paths are as follows:
If the propagation delay difference of each paths of step 7. is less than setting time, it is close to be considered as propagation delay, enters step 8；If each
The propagation delay difference of paths is more than or equal to setting time, is considered as propagation delay and differs larger, enters step 9；The setting
Time is 3~8 milliseconds；
The propagation delay of each paths subflow of step 8. is close, solves the closed solutions of assignment of traffic:
Enter step 10；
Step 9. uses binary search, determines the bound of search, seeks α approximate solutionAssignment of traffic is obtained as a result, specific as follows:
Search precision σ is arranged in step 9.1., determines the bound of binary search:
The median of step 9.2. update binary search
Step 9.3. calculates judgement:
IfAdjustment search lower bound,It returns
Step 9.2；IfThe upper bound of binary search is adjusted,Return step 9.2；IfAcquire precision
For the approximate solution under σ
Step 9.4. will be acquiredIt substitutes intoObtain assignment of traffic result:
Step 10. does not carry out the logical path set of assignment of traffic if it exists, then carries out flow to next logical path set
Distribution, enters step 3；Otherwise, 11 are entered step；
Step 11. coupling traffic allocation result:
Each section assignment of traffic result is coupled, generate source node to destination node transmission path P={ P ': P ": ... }
With assignment of traffic { γ '+γ " ... } as a result, carrying out data transmission；If there is new data grouping to reach after being sent completely, enter
Step 3, new round data are transmitted and carries out the smallest relaying multipath assignment of traffic of propagation delay time；Otherwise, terminate and exit.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810783246.9A CN108989148B (en) | 2018-07-17 | 2018-07-17 | Relay multi-path flow distribution method with minimized transmission delay |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810783246.9A CN108989148B (en) | 2018-07-17 | 2018-07-17 | Relay multi-path flow distribution method with minimized transmission delay |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108989148A true CN108989148A (en) | 2018-12-11 |
| CN108989148B CN108989148B (en) | 2020-07-21 |
Family
ID=64549861
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810783246.9A Active CN108989148B (en) | 2018-07-17 | 2018-07-17 | Relay multi-path flow distribution method with minimized transmission delay |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108989148B (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110490322A (en) * | 2019-08-14 | 2019-11-22 | 北京中科寒武纪科技有限公司 | Method for splitting and device, the electronic equipment and storage medium of operation node |
| CN110503199A (en) * | 2019-08-14 | 2019-11-26 | 北京中科寒武纪科技有限公司 | Method for splitting and device, the electronic equipment and storage medium of operation node |
| CN111628942A (en) * | 2020-05-28 | 2020-09-04 | 燕山大学 | Resource allocation method in time-sensitive network |
| CN113852571A (en) * | 2021-08-20 | 2021-12-28 | 阿里巴巴（中国）有限公司 | Method and device for distributing flow |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102594703A (en) * | 2012-03-19 | 2012-07-18 | 广州华多网络科技有限公司 | Relay-node-based Internet communication system and communication path selection method |
| CN104540182A (en) * | 2014-12-16 | 2015-04-22 | 浙江工业大学 | Time delay minimization route selecting method for wireless sensor network with energy capture characteristic |
| US20150281074A1 (en) * | 2014-03-28 | 2015-10-01 | Fujitsu Limited | Data transfer control device and data transfer control method |
| CN106899503A (en) * | 2015-12-18 | 2017-06-27 | 华为技术有限公司 | The route selection method and network manager of a kind of data center network |
-
2018
- 2018-07-17 CN CN201810783246.9A patent/CN108989148B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102594703A (en) * | 2012-03-19 | 2012-07-18 | 广州华多网络科技有限公司 | Relay-node-based Internet communication system and communication path selection method |
| US20150281074A1 (en) * | 2014-03-28 | 2015-10-01 | Fujitsu Limited | Data transfer control device and data transfer control method |
| CN104540182A (en) * | 2014-12-16 | 2015-04-22 | 浙江工业大学 | Time delay minimization route selecting method for wireless sensor network with energy capture characteristic |
| CN106899503A (en) * | 2015-12-18 | 2017-06-27 | 华为技术有限公司 | The route selection method and network manager of a kind of data center network |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110490322A (en) * | 2019-08-14 | 2019-11-22 | 北京中科寒武纪科技有限公司 | Method for splitting and device, the electronic equipment and storage medium of operation node |
| CN110503199A (en) * | 2019-08-14 | 2019-11-26 | 北京中科寒武纪科技有限公司 | Method for splitting and device, the electronic equipment and storage medium of operation node |
| CN111628942A (en) * | 2020-05-28 | 2020-09-04 | 燕山大学 | Resource allocation method in time-sensitive network |
| CN111628942B (en) * | 2020-05-28 | 2022-03-25 | 燕山大学 | Resource allocation method in time-sensitive network |
| CN113852571A (en) * | 2021-08-20 | 2021-12-28 | 阿里巴巴（中国）有限公司 | Method and device for distributing flow |
| CN113852571B (en) * | 2021-08-20 | 2023-11-28 | 阿里巴巴（中国）有限公司 | Method and device for distributing flow |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108989148B (en) | 2020-07-21 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108833279B (en) | Method for multi-constraint QoS routing based on service classification in software defined network | |
| CN108989148A (en) | A kind of relaying multipath flow allocation method that propagation delay time minimizes | |
| CN104158753B (en) | Dynamic stream scheduling method and system based on software defined network | |
| CN112491619B (en) | Service customization network resource self-adaptive distribution method based on SDN | |
| CN108809857B (en) | SDN-based traffic monitoring and service quality assurance strategy method | |
| CN108259367B (en) | Service-aware flow strategy customization method based on software defined network | |
| CN104767694B (en) | A kind of stream compression forwarding method towards Fat Tree data center network architectures | |
| CN106341346A (en) | Routing algorithm of guaranteeing QoS in data center network based on SDN | |
| CN105847151A (en) | Multi-constraint QoS routing strategy design method for software defined network | |
| CN105897575A (en) | Path computing method based on multi-constrained path computing strategy under SDN | |
| CN110177054B (en) | Port queue scheduling method, device, network controller and storage medium | |
| CN109039897B (en) | Software defined backhaul network routing method based on service awareness | |
| CN103607737B (en) | A kind of heterogeneous-network service shunt method and system | |
| CN109547358B (en) | Method for constructing time-sensitive network slice | |
| CN107070794A (en) | A kind of low rail information network optimal network benefit delay constraint method for routing | |
| CN104093009B (en) | Video transmission method based on network utility in wireless self-organization network | |
| CN106550049B (en) | A kind of Middleware portion arranging method, apparatus and system | |
| CN103825838B (en) | A kind of data center removes bandwidth fragmentation stream scheduling method | |
| CN107948067B (en) | Link load balancing method for QoS guarantee of multiple service flows in software defined network | |
| CN106936705B (en) | Software defined network routing method | |
| CN106953742A (en) | A kind of wireless isomer network bandwidth safeguard method based on SDN | |
| EP2869506B1 (en) | Congestion avoidance and fairness in data networks with multiple traffic sources | |
| Li et al. | Reliability and robust resource allocation for Cache-enabled HetNets: QoS-aware mobile edge computing | |
| US20220104127A1 (en) | Method and apparatus for power management in a wireless communication system | |
| CN105871745A (en) | Mixed-service-based dispatching method in SDN network |
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 |