CN110460537A - Data center's asymmetric topology down-off dispatching method based on packet set - Google Patents
Data center's asymmetric topology down-off dispatching method based on packet set Download PDFInfo
- Publication number
- CN110460537A CN110460537A CN201910572054.8A CN201910572054A CN110460537A CN 110460537 A CN110460537 A CN 110460537A CN 201910572054 A CN201910572054 A CN 201910572054A CN 110460537 A CN110460537 A CN 110460537A
- Authority
- CN
- China
- Prior art keywords
- flowlet
- priority
- data packet
- hash
- 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
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/12—Avoiding congestion; Recovering from congestion
- H04L47/125—Avoiding congestion; Recovering from congestion by balancing the load, e.g. traffic engineering
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/50—Queue scheduling
- H04L47/62—Queue scheduling characterised by scheduling criteria
- H04L47/625—Queue scheduling characterised by scheduling criteria for service slots or service orders
- H04L47/6275—Queue scheduling characterised by scheduling criteria for service slots or service orders based on priority
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention belongs to, it is unknown in stream information, and the only flow scheduling in the case where exchange generator terminal realizes asymmetric topology is not changed in the case where host protocol stack, the present invention, based on data center's asymmetric topology down-off dispatching method of packet set, steps are as follows: initializing number of queues K and corresponding degradation threshold value；Initialize the default overtime time-out timeout value of some set flowlet being made of the packet of correlation in the same TCP flow；Flowlet table is initialized, is hash code according to the hash value for calculating the affiliated flow of the data packet including five-tuple in data packet when data packet reaches interchanger；Lookup comparison is carried out by major key of hash code in flowlet table；According to priority send data.Present invention is mainly applied to digital communication occasions.
Description
Technical field
The invention mainly relates to the scheduling of the distributed traffic at data center field, especially large-scale data center.
Background technique
Data center, which refers in a physical space, to be realized to the centralized processing of data information, storage, transmission, exchange, pipe
Reason, and computer, server, network, communication, storage equipment etc. are usually artificially the key equipments of data center.
Data center network refers to for the network in data center, for connecting the equipment in data center.With big
High bandwidth, efficient network protocol, flexible topology between scale, high scalability, high robustness, low configuration overhead, server
Etc. characteristics.
Flow scheduling refers to the data flow for its some known priority or its demand (such as deadline), how basis
Certain specified rules reach the optimization of utility function, and best performance has been provided.Its performance metric index is usual are as follows: has flowed
At the time, delay and fairness.
Flowlet refers to that some set being made of the packet of correlation, correlation here refer in the same TCP flow:
If two packets of arbitrary neighborhood, which reach the time interval between same switching equipment, is less than timeout value predetermined,
The packet for meeting this condition regards a set, referred to as a flowlet as.
Flowlet Switching is the route switching technology using flowlet as granularity, is subordinated to the same flowlet
Bao Douhui forwarded from the same port, different flowlet can be randomly selected forwarding port.Under normal conditions by timeout value
It is defined as the maximum value of delay inequality between mulitpath in multipath retransmission technique, TCP will not be caused to reorder phenomenon in this way.
Strict-priority, which refers to, is divided into multiple queues for some port in interchanger, has priority between queue
Difference, all packets by this port can enter corresponding priority query according to the priority of its label, and follow advanced elder generation
Principle out, but only when the queue higher than a certain queue priority is all sky, which is just allowed to send.
Asymmetric topology refers to the topology of data center for some reason, such as the design of topology, the failure of link or sets
Standby isomerism, from the multipath topology of otherwise symmetrical, the unavoidable topological structure being transformed into.
Delay-sensitive flow refers in the flow generated by the application for being deployed in data center, derived from interactive application
Partial discharge, occupy the 80% of flow sum, but the data volume actually carried only accounts for the 20% of total amount of data, it will directly
Influence the usage experience of user.
Bandwidth sensitive type flow is a part corresponding with delay-sensitive flow for delay and insensitive application
The flow of generation, is common in consistency, and the application such as backup requires lower but needs biggish bandwidth to transmit data to delay
Amount, number are only the 20% of flow sum, but carry 80% data volume
Degradation threshold value refers to the threshold value by being calculated, for reducing stream priority and switch the priority belonging to it
Queue.The stream for being i for a priority, when the flowlet number that the stream occurs is greater than the corresponding degradation threshold value of the priority
αi, then the priority for reducing the stream is (i+1).
As more and more applications are deployed to data center, the performance of application is increasingly dependent upon data center network
Performance.The flow that these applications generate is typically divided into two kinds: delay-sensitive flow and bandwidth sensitive type flow.How to adjust
It spends the flow of these mixing and attracts the sight of scientific research circle and industry to improve better usage experience still for user.Number simultaneously
Topology according to center is usually multipath, asymmetric topology, but asymmetric topology is still inevitable challenge.How asymmetric
Topology is lower to realize that higher two points of bandwidth are still a challenge.
Generally acknowledged the best way is to reduce mean flow deadline, the i.e. transmission of priority delay sensitive type stream.Existing stream
Amount scheduling scheme is roughly divided into two kinds: one kind is to simulate the preferential best practice of most short stream, but it is realized and depends on stream information, i.e.,
It is known that it flows size, the information such as stream deadline when a stream starts.This is infeasible in actual production environment.
Another kind of method then needs to modify to the ICP/IP protocol stack of host, disposes new mechanism and carries out flow scheduling, however
It is obviously also to be difficult to realize that large-scale data centre punch one, which modifies host,.
Flowlet Switching is that we provide completely new visual angles.We are balanced from Liu Hebao by the granularity of concern
It has arrived on flowlet, born advantage has been had for asymmetric topology based on the forwarding of flowlet, size has elasticity, right
There is adaptivity in link circuit condition and not will receive the interference of the out-of-order problem of packet.And present flowlet switch is
It is supported by existing device (such as Cisco), programmable switch (such as P4) or virtual switch (OpenvSwitch).This makes
Deployment more has flexibility.
Summary of the invention
In order to overcome the deficiencies of the prior art, the present invention is directed to propose a kind of data center based on flowlet is asymmetric opens up
Flutter down-off dispatching algorithm.This method can be unknown in stream information, and is only exchanging in the case where not changing host protocol stack
Generator terminal realizes the flow scheduling under asymmetric topology.For this reason, the technical scheme adopted by the present invention is that in the data based on packet set
Heart asymmetric topology down-off dispatching method, steps are as follows:
1) number of queues K and corresponding degradation threshold value are initialized；
2) the default time-out time-out of some set flowlet being made of the packet of correlation in the same TCP flow is initialized
Timeout value；
3) flowlet table (flowlet table) is initialized, for storing every data stream flow's in the process of running
Relevant information, including following list item: cryptographic Hash hash code, timestamp timestamp, priority priority, Path selection
Path decision, flowlet number number, wherein hash code is the index of flow, and timestamp is for storing
The time of the arrival interchanger of the upper data packet of the flow, priority is the priority of the flow, and path decision is
The exit port of flow, flowlet number are the flowlet numbers that current flow has been sent；
4) when data packet reach interchanger when, according in data packet include source IP address, purpose IP address, source
The hash value that the five-tuple of mouth, destination port and inbound port calculates the affiliated flow of the data packet is hash code；
5) it is searched in flowlet table using hash code as major key, if the flow without corresponding hash value, recognizes
It is a new flow for this, creates list item for it；Operating process is the same with new flowlet is triggered at this time, according to 7) being grasped
Make and record the hash code of flow, wrap arrival time timestamp, and determines its priority and selected for it
One exit port is denoted as path decision；
If 6) found corresponding list item, the value of delta of timestamp in current packet arrival time and table is calculated, and
And the value of timestamp is updated using current packet arrival time；
7) if time interval value δ is greater than preset timeout value, it is believed that new flowlet is triggered, at this point, first will
The counting of flowlet number adds one, then outlet of the random selection one as new flowlet in available outlet, and remembers
Record, then according to priority decisions 8) are carried out, finally forwards it to the port just selected in the domain path decision；
8) according to preset K priority and corresponding (K-1) a degradation threshold value, by flowlet sent number
It is successively compared with these degradation threshold values, when it is greater than i-th of degradation threshold value, then the priority flowed is reduced to (i+1), when it
It is then sent when greater than the last one degradation threshold value with lowest priority always.
For TCP transmitting terminal Server1 (IP:10.0.0.1 Port:3301) and the receiving end TCP Server12 (IP:
10.0.0.2Port:3302 the reachable path between) has two, is respectively as follows:WithIt is then specific
Step further refines as follows:
1) number of queues K and corresponding priority promotion threshold value (a are initialized1,….,aK-1), in total including 4 teams
Column, priority promotion threshold value is respectively a1=1, a2=16, a3=128；
2) timeout value is initialized, for the value for distinguishing different flowlet, timeout value, which is chosen, is greater than load balancing
The maximum delay of a plurality of parallel route is poor；
3) flowlet table is initialized, which includes 5 fields, it is respectively as follows: hash, timestamp, priority,
Path_decision and flowlet_number, wherein hash is for uniquely identifying the corresponding flow table of a TCP flow
, timestamp is used to record the time that a data packet in the TCP flow reaches, and it is current that priority is used to record TCP flow
Priority, path_decision identify current exit port, and flowlet_number records the flowlet number sent；
4) transmitting terminal be sent to the first three data packet of receiving terminal on interchanger S1 according to it is proposed that dispatching algorithm into
The following processing of row:
4.1.1) interchanger S1 receives first data packet of transmitting terminal, and the institute for calculating the data packet according to five-tuple is right
The hash_code value for answering TCP flow records the time arrive_ that the data packet reaches interchanger for hash_code=2019
Time is 216053us；
4.1.2 the record that hash value is 2019) is searched in flowlet table, is not present at this time, is then flowlet
Table adds a new record, wherein hash=2019, timestamp=216053, flowlet_number=1；
4.1.3) due to the packet that this is in first flowlet of the TCP flow, so flowlet_number=1, is less than
Equal to first degradation threshold value a1=1, so the priority priority=0 that the stream is current；
4.1.4 an exit port as the flowlet) is randomly choosed in available exit port, it is such as randomly selected
Output_port=3 sets 3 for the path_decision of corresponding record in flowlet table, and by the data packet by
No. 3 ports are with the sending of priority 0；
4.2.1) interchanger S1 receives second data packet of transmitting terminal, and the institute for calculating the data packet according to five-tuple is right
The hash_code value for answering TCP flow records the time arrive_ that the data packet reaches interchanger for hash_code=2019
Time is 216503us.
4.2.2 corresponding record) is found in flowlet table according to its hash value, it is known that a upper data packet
The time of arrival is timestamp=216053us, calculates the time interval δ=arrive_time-of two data packets
It is not triggered newly so data packet belongs to current flowlet -216503=450 < 500 timestamp=216053
flowlet；
4.2.3 the timestamp=arrive_time=216503us in table record) is updated；
4.2.4) according to priority existing in record and forwarding port, priority=0, path_decision=3,
The data packet is issued with priority 0 from No. 3 ports；
4.3.1) interchanger S1 receives the third data packet of transmitting terminal, and the institute for calculating the data packet according to five-tuple is right
The hash_code value for answering TCP flow records the time arrive_ that the data packet reaches interchanger for hash_code=2019
Time is 217024us；
4.3.2 corresponding record) is found in flowlet table according to its hash value, it is known that a upper data packet
The time of arrival is timestamp=216053us, calculates-the 216503=521 of time interval δ=217024 of two data packets
> 500, so data packet triggers new flowlet, it is immediately performed 4.3.3).
4.3.3 the timestamp=arrive_time=217024us, flowlet_number=in table record) are updated
2；
4.3.4) due to flowlet_number=1, a at this time1<flowlet_number≤a2, so current excellent of the stream
First grade priority=1；
4.3.5) due to triggering new flowlet, therefore a conduct is randomly choosed in available exit port should
The exit port of flowlet, such as randomly selected output_port=2, by the path_ of corresponding record in flowlet table
Decision is set as 2, and the data packet is issued by No. 3 ports with priority 1.
The features of the present invention and beneficial effect are:
Existing flow scheduling decision or be to assume or default topology based on flow information is known, or need
It to modify to the protocol stack of host.These scheduling mechanisms cannot all well adapt in the data center, asymmetric topology
Referred to as in the case where normality, the unknown flow scheduling of information.
In view of the above problems, the present invention utilizes this effective tool of flowlet switching, the granularity of scheduling is focused
Come on to flowlet, on the one hand simulate SJF (most casual labourer makees priority principle), is realizing the same of the deadline for minimizing short stream
When invasive injury is not carried out to long stream；On the other hand, use flowlet as scheduling granularity, its own size has bullet
Property, it does not realize load balancing closely, more avoids the out-of-order method of packet.This method is a kind of method of increment type, and existing
Various protocol stacks can be combined with using, only exchange generator terminal work, for realize flow scheduling provide new visual angle.
Detailed description of the invention:
A kind of data center's asymmetric topology down-off dispatching algorithm flow diagram based on flowlet of Fig. 1.
Fig. 2 sample topology.
Specific embodiment
Data center's asymmetric topology down-off scheduling based on flowlet that the technical problem to be solved by the present invention is to a kind of
Algorithm.This method can be unknown in stream information, and only realizes flow in exchange generator terminal in the case where not changing host protocol stack
Scheduling reduces the mean flow deadline.
The technical solution adopted by the present invention to solve the technical problems is:
9) number of queues K and corresponding degradation threshold value are initialized.
10) the default timeout value of flowlet is initialized.
11) flowlet table is initialized, for storing the relevant information of every flow in the process of running.Including such as
Lower list item (hash code, timestamp, priority, path decision, flowlet number), wherein hash
Code is the index of flow, and timestamp is used to store the time of the arrival interchanger of the upper data packet of the flow,
Priority is the priority of the flow, and path decision is the exit port of flow, and flowlet number is current flow
The flowlet number sent.
12) when data packet reaches interchanger, according to five-tuple (source IP address, purpose IP address, the source in data packet
Port, destination port, inbound port) the hash value of the affiliated flow of the data packet is calculated as hash code.
13) it is searched in flowlet table using hash code as major key, if the flow without corresponding hash value, recognizes
It is a new flow for this, creates list item for it.Operating process is the same with new flowlet is triggered at this time, according to 7) being grasped
Make and record the hash code of flow, wrap arrival time timestamp, and determines its priority and selected for it
One exit port is denoted as path decision.
If 14) found corresponding list item, the value of delta of timestamp in current packet arrival time and table is calculated, and
And the value of timestamp is updated using current packet arrival time.
15) if time interval value δ is greater than preset timeout value, it is believed that trigger new flowlet.At this point, first will
The counting of flowlet number adds one, then outlet of the random selection one as new flowlet in available outlet, and remembers
Record, then according to priority decisions 8) are carried out, finally forwards it to the port just selected in the domain path decision.
16) according to preset K priority and corresponding (K-1) a degradation threshold value, by flowlet sent number
It is successively compared with these degradation threshold values, when it is greater than i-th of degradation threshold value, then the priority flowed is reduced to (i+1), when it
It is then sent when greater than the last one degradation threshold value with lowest priority always.
Technical solution of the present invention is described in detail With reference to embodiment.Flow diagram of the invention such as Fig. 1
It is shown, specific steps are as follows:
Assuming that bottom-layer network topology as shown in Fig. 2, TCP transmitting terminal Server1 (IP:10.0.0.1 Port:3301) and
Reachable path between the receiving end TCP Server12 (IP:10.0.0.2 Port:3302) has two, is respectively as follows:With
5) number of queues K and corresponding priority promotion threshold value (a are initialized1,….,aK-1).Assuming that in total including 4 teams
Column, priority promotion threshold value is respectively a1=1, a2=16, a3=128.
6) timeout value is initialized, which it is a plurality of simultaneously to be generally greater than load balancing for distinguishing different flowlet
The maximum delay of walking along the street diameter is poor.Assume in this example that timeout value is 500us.
7) flowlet table is initialized, which includes 5 fields, it is respectively as follows: hash, timestamp, priority,
Path_decision and flowlet_number.Wherein hash is for uniquely identifying the corresponding flow table of a TCP flow
, timestamp is used to record the time that a data packet in the TCP flow reaches, and it is current that priority is used to record TCP flow
Priority, path_decision identify current exit port, and flowlet_number records the flowlet number sent.
8) data packet that transmitting terminal is sent to receiving terminal (by taking first three data packet as an example, and assumes that third data packet triggers
New flowlet) on interchanger S1 according to it is proposed that dispatching algorithm carry out the following processing (on other interchangers
Process flow is similar).
4.1.1) interchanger S1 receives first data packet of transmitting terminal, according to five-tuple (source IP address=
10.0.0.1, target ip address=10.0.0.2, source port=3301, target port=3302, inbound port=1) calculate the number
According to the hash_code value of the corresponding TCP flow of packet, it is assumed that hash_code=2019.Record the data packet reach interchanger when
Between arrive_time be 216053us.
4.1.2 the record that hash value is 2019) is searched in flowlet table, is not present at this time, is then flowlet
Table adds a new record, wherein hash=2019, timestamp=216053, flowlet_number=1
4.1.3) due to the packet that this is in first flowlet of the TCP flow, so flowlet_number=1, is less than
Equal to first degradation threshold value a1=1, so the priority priority=0 that the stream is current.
4.1.4 an exit port as the flowlet) is randomly choosed in available exit port, it is such as randomly selected
Output_port=3.3 are set by the path_decision of corresponding record in flowlet table.And by the data packet by
No. 3 ports are with the sending of priority 0.
4.2.1) interchanger S1 receives second data packet of transmitting terminal, according to five-tuple (source IP address=
10.0.0.1, target ip address=10.0.0.2, source port=3301, target port=3302, inbound port=1) calculate the number
According to the hash_code value of the corresponding TCP flow of packet, it is assumed that hash_code=2019.Record the data packet reach interchanger when
Between arrive_time be 216503us.
4.2.2 corresponding record) is found in flowlet table according to its hash value, it is known that a upper data packet
The time of arrival is timestamp=216053us.Calculate the time interval δ=arrive_time-of two data packets
- 216503=450 < 500 timestamp=216053.So data packet belongs to current flowlet, do not trigger newly
flowlet。
4.2.3 the timestamp=arrive_time=216503us in table record) is updated.
4.2.4) according to priority existing in record and forwarding port, priority=0, path_decision=3,
The data packet is issued with priority 0 from No. 3 ports.
4.3.1) interchanger S1 receives the third data packet of transmitting terminal, according to five-tuple (source IP address=
10.0.0.1, target ip address=10.0.0.2, source port=3301, target port=3302, inbound port=1) calculate the number
According to the hash_code value of the corresponding TCP flow of packet, it is assumed that hash_code=2019.Record the data packet reach interchanger when
Between arrive_time be 217024us.
4.3.2 corresponding record) is found in flowlet table according to its hash value, it is known that a upper data packet
The time of arrival is timestamp=216053us.Calculate-the 216503=521 of time interval δ=217024 of two data packets
>500.So data packet triggers new flowlet, it is immediately performed 4.3.3).
4.3.3 the timestamp=arrive_time=217024us, flowlet_number=in table record) are updated
2。
4.3.4) due to flowlet_number=1, a at this time1<flowlet_number≤a2, so current excellent of the stream
First grade priority=1.
4.3.5) due to triggering new flowlet, therefore a conduct is randomly choosed in available exit port should
The exit port of flowlet, such as randomly selected output_port=2.By the path_ of corresponding record in flowlet table
Decision is set as 2.And the data packet is issued by No. 3 ports with priority 1.
Claims (2)
1. a kind of data center's asymmetric topology down-off dispatching method based on packet set, characterized in that steps are as follows:
1) number of queues K and corresponding degradation threshold value are initialized；
2) the default time-out time-out of some set flowlet being made of the packet of correlation in the same TCP flow is initialized
Timeout value；
3) flowlet table (flowlet table) is initialized, for storing the correlation of every data stream flow in the process of running
Information, including following list item: cryptographic Hash hash code, timestamp timestamp, priority priority, Path selection path
Decision, flowlet number number, wherein hash code is the index of flow, and timestamp is for storing the flow
The time of the arrival interchanger of a upper data packet, priority is the priority of the flow, and path decision is flow
Exit port, flowlet number are the flowlet numbers that current flow has been sent；
4) when data packet reach interchanger when, according in data packet include source IP address, purpose IP address, source port, mesh
Port and inbound port five-tuple calculate the affiliated flow of the data packet hash value be hash code；
5) it is searched in flowlet table using hash code as major key, if the flow without corresponding hash value, it is believed that this
It is a new flow, creates list item for it；Operating process is the same with new flowlet is triggered at this time, according to 7) being operated simultaneously
And the hash code of flow is recorded, arrival time timestamp is wrapped, and determine its priority and select one for it
Exit port is denoted as path decision；
If 6) found corresponding list item, the value of delta of timestamp in current packet arrival time and table is calculated, and is made
The value of timestamp is updated with current packet arrival time；
7) if time interval value δ is greater than preset timeout value, it is believed that new flowlet is triggered, at this point, first will
The counting of flowlet number adds one, then outlet of the random selection one as new flowlet in available outlet, and remembers
Record, then according to priority decisions 8) are carried out, finally forwards it to the port just selected in the domain path decision；
8) according to preset K priority and corresponding (K-1) a degradation threshold value, successively by flowlet sent number
It is compared with these degradation threshold values, when it is greater than i-th of degradation threshold value, then the priority flowed is reduced to (i+1), when it is greater than
It is then sent when the last one degradation threshold value with lowest priority always.
2. data center's asymmetric topology down-off dispatching method as described in claim 1 based on packet set, characterized in that
For TCP transmitting terminal Server1 (IP:10.0.0.1 Port:3301) and the receiving end TCP Server12 (IP:10.0.0.2
Port:3302 the reachable path between) has two, is respectively as follows:WithThen specific steps are into one
Step refinement is as follows:
1) number of queues K and corresponding priority promotion threshold value (a are initialized1,....,aK-1), in total including 4 queues,
Priority promotion threshold value is respectively a1=1, a2=16, a3=128；
2) timeout value is initialized, which chooses a plurality of greater than load balancing for distinguishing different flowlet, timeout value
The maximum delay of parallel route is poor；
3) flowlet table is initialized, which includes 5 fields, it is respectively as follows: hash, timestamp, priority,
Path_decision and flowlet_number, wherein hash is for uniquely identifying the corresponding flow table of a TCP flow
, timestamp is used to record the time that a data packet in the TCP flow reaches, and it is current that priority is used to record TCP flow
Priority, path_decision identify current exit port, and flowlet_number records the flowlet number sent；
4) transmitting terminal be sent to the first three data packet of receiving terminal on interchanger S1 according to it is proposed that dispatching algorithm carry out with
Lower processing:
4.1.1) interchanger S1 receives first data packet of transmitting terminal, which is calculated according to five-tuple corresponding to
The hash_code value of TCP flow records the time arrive_ that the data packet reaches interchanger for hash_code=2019
Time is 216053us；
4.1.2 the record that hash value is 2019) is searched in flowlet table, is not present at this time, is then flowlet
Table adds a new record, wherein hash=2019, timestamp=216053, flowlet_number=1；
4.1.3) due to the packet that this is in first flowlet of the TCP flow, so flowlet_number=1, is less than or equal to
First degradation threshold value a1=1, so the priority priority=0 that the stream is current；
4.1.4 an exit port as the flowlet) is randomly choosed in available exit port, it is such as randomly selected
Output_port=3 sets 3 for the path_decision of corresponding record in flowlet table, and by the data packet by
No. 3 ports are with the sending of priority 0；
4.2.1) interchanger S1 receives second data packet of transmitting terminal, which is calculated according to five-tuple corresponding to
The hash_code value of TCP flow records the time arrive_ that the data packet reaches interchanger for hash_code=2019
Time is 216503us.
4.2.2 corresponding record) is found in flowlet table according to its hash value, it is known that a upper data packet reaches
Time be timestamp=216053us, calculate time interval δ=arrive_time-timestamp of two data packets
New flowlet is not triggered so data packet belongs to current flowlet in=216053-216503=450 < 500；
4.2.3 the timestamp=arrive_time=216503us in table record) is updated；
4.2.4) according to priority existing in record and forwarding port, priority=0, path_decision=3, by this
Data packet is issued with priority 0 from No. 3 ports；
4.3.1) interchanger S1 receives the third data packet of transmitting terminal, which is calculated according to five-tuple corresponding to
The hash_code value of TCP flow records the time arrive_ that the data packet reaches interchanger for hash_code=2019
Time is 217024us；
4.3.2 corresponding record) is found in flowlet table according to its hash value, it is known that a upper data packet reaches
Time be timestamp=216053us, calculate-the 216503=521 of time interval δ=217024 of two data packets >
500, so data packet triggers new flowlet, it is immediately performed 4.3.3).
4.3.3 the timestamp=arrive_time=217024us, flowlet_number=2 in table record) are updated；
4.3.4) due to flowlet_number=1, a at this time1<flowlet_number≤a2, so the priority that the stream is current
Priority=1；
4.3.5) due to triggering new flowlet, therefore one is randomly choosed in available exit port as the flowlet's
Exit port, such as randomly selected output_port=2, the path_decision of corresponding record in flowlet table is set
2 are set to, and the data packet is issued by No. 3 ports with priority 1.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910572054.8A CN110460537B (en) | 2019-06-28 | 2019-06-28 | Packet set-based data center asymmetric topology flow scheduling method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910572054.8A CN110460537B (en) | 2019-06-28 | 2019-06-28 | Packet set-based data center asymmetric topology flow scheduling method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110460537A true CN110460537A (en) | 2019-11-15 |
| CN110460537B CN110460537B (en) | 2023-01-24 |
Family
ID=68481805
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910572054.8A Active CN110460537B (en) | 2019-06-28 | 2019-06-28 | Packet set-based data center asymmetric topology flow scheduling method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110460537B (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111817973A (en) * | 2020-06-28 | 2020-10-23 | 电子科技大学 | Data center network load balancing method |
| CN113300873A (en) * | 2021-02-05 | 2021-08-24 | 阿里巴巴集团控股有限公司 | Five-tuple hash path-based fault bypassing method and device |
| WO2022067791A1 (en) * | 2020-09-30 | 2022-04-07 | 华为技术有限公司 | Data processing method, data transmission method, and related device |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20170048144A1 (en) * | 2015-08-13 | 2017-02-16 | Futurewei Technologies, Inc. | Congestion Avoidance Traffic Steering (CATS) in Datacenter Networks |
| CN108123878A (en) * | 2016-11-30 | 2018-06-05 | 华为技术有限公司 | A kind of method for routing, device and data transfer equipment |
| CN108337168A (en) * | 2018-02-11 | 2018-07-27 | 天津大学 | It flows cluster and exchanges routing mechanism OpenFlow group table selection methods |
| US20190052567A1 (en) * | 2018-06-29 | 2019-02-14 | Intel Corporation | Non-random flowlet-based routing |
-
2019
- 2019-06-28 CN CN201910572054.8A patent/CN110460537B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20170048144A1 (en) * | 2015-08-13 | 2017-02-16 | Futurewei Technologies, Inc. | Congestion Avoidance Traffic Steering (CATS) in Datacenter Networks |
| CN108123878A (en) * | 2016-11-30 | 2018-06-05 | 华为技术有限公司 | A kind of method for routing, device and data transfer equipment |
| CN108337168A (en) * | 2018-02-11 | 2018-07-27 | 天津大学 | It flows cluster and exchanges routing mechanism OpenFlow group table selection methods |
| US20190052567A1 (en) * | 2018-06-29 | 2019-02-14 | Intel Corporation | Non-random flowlet-based routing |
Non-Patent Citations (2)
| Title |
|---|
| SUCHANDRA CHAKRABORTY等: "A low-latency multipath routing without elephant flow detection for data centers", 《2016 IEEE 17TH INTERNATIONAL CONFERENCE ON HIGH PERFORMANCE SWITCHING AND ROUTING (HPSR)》 * |
| 陈飞: "网络架构演进下的高性能流量管理研究", 《中国优秀博硕士学位论文全文数据库（博士）信息科技辑》 * |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111817973A (en) * | 2020-06-28 | 2020-10-23 | 电子科技大学 | Data center network load balancing method |
| CN111817973B (en) * | 2020-06-28 | 2022-03-25 | 电子科技大学 | Data center network load balancing method |
| WO2022067791A1 (en) * | 2020-09-30 | 2022-04-07 | 华为技术有限公司 | Data processing method, data transmission method, and related device |
| CN113300873A (en) * | 2021-02-05 | 2021-08-24 | 阿里巴巴集团控股有限公司 | Five-tuple hash path-based fault bypassing method and device |
| CN113300873B (en) * | 2021-02-05 | 2024-05-24 | 阿里巴巴集团控股有限公司 | Fault detour method and device based on five-tuple hash path |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110460537B (en) | 2023-01-24 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110460537A (en) | Data center's asymmetric topology down-off dispatching method based on packet set | |
| CN110061929B (en) | Data center load balancing method for asymmetric network | |
| US8929372B2 (en) | Grid router | |
| WO2015127107A1 (en) | Control device discovery in networks having separate control and forwarding devices | |
| CN101789949B (en) | Method and router equipment for realizing load sharing | |
| WO2021147354A1 (en) | Service level configuration method and device | |
| Hu et al. | TLB: Traffic-aware load balancing with adaptive granularity in data center networks | |
| CN112565102B (en) | Load balancing method, device, equipment and medium | |
| Hu et al. | Adjusting switching granularity of load balancing for heterogeneous datacenter traffic | |
| CN111224888A (en) | Method for sending message and message forwarding equipment | |
| Alasmar et al. | Scdp: Systematic rateless coding for efficient data transport in data centers | |
| CN108337168B (en) | OpenFlow group table selection method of flow cluster exchange routing mechanism | |
| CN101478480B (en) | Method and apparatus for implementing load balance | |
| CN106101005B (en) | Jamming control method based on block length in a kind of data center network | |
| CN103795648A (en) | Method, device and system for scheduling queue | |
| CN110324255B (en) | Data center network coding oriented switch/router cache queue management method | |
| Liu et al. | Loss‐Aware CMT‐Based Multipathing Scheme for Efficient Data Delivery to Heterogeneous Wireless Networks | |
| Nithin et al. | Efficient load balancing for multicast traffic in data center networks using SDN | |
| CN108075955B (en) | Data processing method and device of backbone network | |
| Schupke | Packet transfer delay of the SRP ring | |
| Xia et al. | Multipath-aware TCP for data center traffic load-balancing | |
| CN118381771B (en) | RDMA data stream on-network reordering method based on switch | |
| Luo et al. | Multi-attribute aware data scheduling for multipath TCP | |
| CN113824781B (en) | Data center network source routing method and device | |
| Wu et al. | Flow-Level Rerouting in RDMA-Enabled Dragonfly Networks |
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 |