CN112787943A - Traffic scheduling method and device and computer readable storage medium - Google Patents

Traffic scheduling method and device and computer readable storage medium Download PDF

Info

Publication number
CN112787943A
CN112787943A CN201911089793.8A CN201911089793A CN112787943A CN 112787943 A CN112787943 A CN 112787943A CN 201911089793 A CN201911089793 A CN 201911089793A CN 112787943 A CN112787943 A CN 112787943A
Authority
CN
China
Prior art keywords
new path
scheduled
transmission
traffic
path
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.)
Withdrawn
Application number
CN201911089793.8A
Other languages
Chinese (zh)
Inventor
黄超
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
ZTE Corp
Original Assignee
ZTE Corp
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by ZTE Corp filed Critical ZTE Corp
Priority to CN201911089793.8A priority Critical patent/CN112787943A/en
Publication of CN112787943A publication Critical patent/CN112787943A/en
Withdrawn legal-status Critical Current

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic control in data switching networks
    • H04L47/10Flow control; Congestion control
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic control in data switching networks
    • H04L47/10Flow control; Congestion control
    • H04L47/12Avoiding congestion; Recovering from congestion
    • H04L47/125Avoiding congestion; Recovering from congestion by balancing the load, e.g. traffic engineering
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic control in data switching networks
    • H04L47/50Queue scheduling
    • H04L47/62Queue scheduling characterised by scheduling criteria
    • H04L47/625Queue scheduling characterised by scheduling criteria for service slots or service orders
    • H04L47/6275Queue 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 embodiment of the invention provides a traffic scheduling method, a traffic scheduling device and a computer readable storage medium, wherein a new path corresponding to a path to be scheduled is determined, wherein nodes at two ends of the path to be scheduled and nodes at two ends of the new path are the same; transmitting a mirror image of service flow to be scheduled on the new path, wherein the service flow to be scheduled is the service flow borne on the path to be scheduled; in the transmission process of the mirror image, when the transmission performance of the new path meets the preset requirement, the service flow to be scheduled is scheduled to the new path for transmission, in some implementation processes, the mirror image of the service flow on the path to be scheduled is transmitted on the new path before the service flow on the path to be scheduled is scheduled to the new path, and in the transmission process of the mirror image, when the transmission performance of the new path meets the requirement, the service flow to be scheduled is scheduled to the new path for transmission, so that the transmission performance of the service flow to be scheduled on the new path can be ensured.

Description

Traffic scheduling method and device and computer readable storage medium
Technical Field
The embodiments of the present invention relate to, but are not limited to, the field of communications, and in particular, to, but not limited to, a traffic scheduling method, apparatus, and computer-readable storage medium.
Background
In the related art, in order to optimize the performance index of the service, a forwarding path of the service traffic may be scheduled. The scheduling mode comprises two modes: an automatic scheduling mode and a manual scheduling mode. The automatic scheduling mode is to determine scheduling time and a new path according to the network running performance status, the performance index threshold, the analysis of historical performance data and the like, and deploy the scheduling time and the new path to the network equipment to complete the scheduling of the service flow. And the manual scheduling mode is used for manually planning the path of the service flow for the user to perform the deployment of flow scheduling.
In the automatic scheduling mode, after traffic scheduling, whether the performance of service traffic can be optimized completely depends on a scheduling algorithm of the SDN controller, and if the scheduling algorithm is not accurate enough, performance indexes after scheduling may be worse, even affecting the existing service. Although the manual scheduling mode is manually confirmed and adjusted, the flow scheduling effect depends on the experience and analysis capability of an operator, and whether the service performance is influenced after scheduling is difficult to guarantee.
Therefore, in the related art, no matter in the automatic scheduling mode or the manual scheduling mode, the problem that the service performance after scheduling cannot be guaranteed exists.
Disclosure of Invention
The embodiment of the invention provides a method and a device for scheduling service traffic and a computer-readable storage medium, and mainly solves the technical problem that service performance cannot be guaranteed after service traffic is scheduled.
To solve the foregoing technical problem, an embodiment of the present invention provides a traffic scheduling method, including:
determining a new path corresponding to a path to be scheduled, wherein the path to be scheduled and nodes at two ends of the new path are the same;
transmitting a mirror image of service flow to be scheduled on the new path, wherein the service flow to be scheduled is the service flow borne on the path to be scheduled;
and when the transmission performance of the new path meets a preset requirement in the transmission process of the mirror image, scheduling the service flow to be scheduled to the new path for transmission.
The embodiment of the invention also provides a flow scheduling device, which comprises a processor, a memory and a communication bus;
the communication bus is used for realizing connection communication between the processor and the memory;
the processor is configured to execute one or more computer programs stored in the memory to implement the steps of the traffic scheduling method described above.
Embodiments of the present invention also provide a computer-readable storage medium, where one or more computer programs are stored, and the one or more computer programs are executable by one or more processors to implement the steps of the traffic scheduling method.
The invention has the beneficial effects that:
according to the traffic scheduling method, the traffic scheduling device and the computer readable storage medium provided by the embodiment of the invention, a new path corresponding to a path to be scheduled is determined, wherein nodes at two ends of the path to be scheduled and nodes at two ends of the new path are the same; transmitting a mirror image of service flow to be scheduled on the new path, wherein the service flow to be scheduled is the service flow borne on the path to be scheduled; in the transmission process of the mirror image, when the transmission performance of the new path meets the preset requirement, the service flow to be scheduled is scheduled to the new path for transmission, in some implementation processes, the mirror image of the service flow on the path to be scheduled is transmitted on the new path before the service flow on the path to be scheduled is scheduled to the new path, and in the transmission process of the mirror image, when the transmission performance of the new path meets the requirement, the service flow to be scheduled is scheduled to the new path for transmission, so that the transmission performance of the service flow to be scheduled on the new path can be ensured.
Additional features and corresponding advantages of the invention will be set forth in part in the description which follows, and in part will be obvious from the description, or may be learned by practice of the invention.
Drawings
Fig. 1 is a flowchart of a traffic scheduling method according to a first embodiment of the present invention;
fig. 2 is a flowchart of a traffic grouping method to be scheduled according to a first embodiment of the present invention;
fig. 3 is a flowchart of a traffic scheduling method according to a second embodiment of the present invention;
fig. 4 is a structural diagram of a traffic scheduling apparatus according to a third embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more apparent, embodiments of the present invention are described in detail below with reference to the accompanying drawings. It should be understood that the specific embodiments described herein are merely illustrative of the invention and are not intended to limit the invention.
The first embodiment is as follows:
in the related art, no matter in an automatic scheduling mode or a manual scheduling mode, after traffic is scheduled to a new transmission path, the problem that service performance cannot be guaranteed after scheduling exists. In order to solve the above technical problem, an embodiment of the present invention provides a traffic scheduling method, please refer to fig. 1, where the traffic scheduling method includes:
s101, determining a new path corresponding to a path to be scheduled.
In the embodiment of the invention, the scheduling time can be determined according to the performance condition of network operation, the performance index threshold value, the analysis of historical performance data and the like, and a new path corresponding to the path to be scheduled is calculated. The new path instruction can also be received, the new path corresponding to the path to be scheduled is determined according to the new path instruction, that is, an operator can determine the new path corresponding to the path to be scheduled according to experience and analysis of related data, and issue the new path instruction, so as to determine the new path corresponding to the path to be scheduled.
It should be understood that the path to be scheduled is the same as the nodes at both ends of the new path, for example, assuming that both ends of the path to be scheduled are an a node and a B node, respectively, then both ends of the new path are also an a node and a B node, respectively.
And S102, transmitting the mirror image of the service flow to be scheduled on the new path.
The service flow to be scheduled is the service flow borne on the path to be scheduled. That is to say, in the embodiment of the present invention, after determining the new path corresponding to the path to be scheduled, the mirror image of the service traffic carried on the path to be scheduled is obtained, and the obtained mirror image is transmitted on the new path.
S103, when the transmission performance of the new path meets the preset requirement in the transmission process of the mirror image, scheduling the traffic to be scheduled to the new path for transmission.
In the embodiment of the invention, when the mirror image is in the transmission process of the new path and the performance of the new path meets the preset requirement, the service flow to be scheduled is scheduled to the new path for transmission. When the performance of the new path does not meet the preset requirement in the transmission process of the mirror image in the new path, the new path may be deleted, and at this time, S101 may be turned to, and a new path is re-determined.
In the transmission process of the mirror image, the transmission performance of the new path meeting the preset requirement includes but is not limited to at least one of the following modes:
the first method comprises the following steps: in the transmission process of the mirror image, the data of the sending end of the new path is matched with the data of the receiving end of the new path, that is, in the transmission process of the mirror image of the service flow to be scheduled for transmission on the new path, the data of the mirror image sent by the sending end and the data of the mirror image received by the receiving end can be obtained and compared, if the data of the mirror image and the data of the mirror image are matched, the transmission performance of the new path is judged to meet the preset requirement, and the service flow to be scheduled is scheduled to the new path for transmission. In order to reduce the comparison amount of data, the mirror images can be sampled at the sending end and the receiving end of the new path respectively, then the sampled data of the sending end and the sampled data of the receiving end are compared, if the sampled data of the sending end and the sampled data of the receiving end are matched, the transmission performance of the new path is judged to meet the preset requirement, and the traffic flow to be scheduled is scheduled to the new path for transmission. When sampling, the mirror image of the service flow to be scheduled can be sampled according to the characteristics of the service flow to be scheduled.
And the second method comprises the following steps: in the transmission process of the mirror image, the performance parameter of the new path is in a preset first range, that is, in the process of transmitting the mirror image of the service traffic to be scheduled on the new path, the performance parameter of the new path is measured, whether the performance parameter of the new path is in the preset first range is judged, if yes, the transmission performance of the new path is judged to meet the preset requirement, and the service traffic to be scheduled is scheduled to the new path for transmission. The performance parameter of the new path includes, but is not limited to, at least one of performance parameters such as link load, transmission delay, bit error rate, packet loss rate, and the like. It should be appreciated that the different types of performance parameters, which correspond to the preset first ranges, are different. Therefore, the transmission performance of the new path can meet the preset requirement in the transmission process of the mirror image of the traffic flow to be processed on the new path, and the transmission performance of the new path is guaranteed. The preset first range can be flexibly set according to actual needs. For example, the preset first range may be set by a developer empirically, and for the error rate, it may be smaller than the preset first error rate; for the transmission delay, it may be smaller than the preset first transmission delay, so that it may be ensured that the transmission performance of the new path is in a better state. The preset first range may also be obtained by predicting according to the size of the traffic to be scheduled and/or the performance parameter of the new path, that is, when the mirror image of the traffic to be scheduled is transmitted on the new path, the performance parameter of the new path may be predicted according to the size of the traffic to be scheduled and/or the performance parameter of the new path, and the predicted performance parameter is used as the preset first range. For example, according to the size of the traffic to be scheduled, when the mirror image of the traffic to be scheduled is transmitted on the new path, the change range of the link load of the new path may be estimated, it should be noted that, subsequently, when it is determined whether the change value of the link load is within the change range of the link load estimated here, the change value of the link load of the new path is the link load of the new path at the time of mirror image transmission — the link load of the new path before mirror image transmission, for example, assuming that the estimated change range of the traffic is 0-100 (i.e., the first change range of the link load), if the link load of the new path is 50 before the mirror image of the traffic to be scheduled is transmitted on the new path, and when the mirror image of the traffic to be scheduled is transmitted on the new path, the link load of the new path is 120, the change value of the link load of the new path is 70, and is within, therefore, the transmission performance of the new path meets the preset requirement; the transmission delay range of the whole section of the new path can be estimated according to the transmission delay of each section of the new path. And estimating the link load range of the new path when the mirror image of the traffic to be scheduled is transmitted on the new path according to the size of the traffic to be scheduled and the current link load of the new path. In the embodiment of the invention, the first range can be determined before the mirror image of the service flow to be scheduled is transmitted on the new path.
In this embodiment of the present invention, in order to avoid affecting the transmission performance of the specified service traffic when the traffic to be scheduled is scheduled to be transmitted on the new path, when the traffic to be scheduled is transmitted on the new path in S102, the method may further include the following steps: and monitoring the transmission condition of the specified service flow. In step S103, when the transmission performance of the new path meets the preset requirement and the specified traffic is normally transmitted during the mirror image transmission process, the traffic to be scheduled is scheduled to the new path for transmission; if the specified traffic is not transmitted normally, the new path may be deleted. Therefore, the influence on the transmission of other service flows after the flow to be scheduled is scheduled to a new path can be avoided. The specified service traffic is the service traffic in which the transmission path and the new path intersect, for example, it is assumed that the new path is: the method comprises the steps of C node, D node, E node and F node, wherein a transmission path of a certain service flow is the E node, the F node and the G node, and the service flow is the designated service flow because an intersection (the E node and the F node) exists between the transmission path of the service flow and a new path. Wherein, judging whether the designated service traffic is normally transmitted may include: judging whether the transmission performance of the appointed service flow is reduced or not before the service flow to be scheduled is transmitted on the new path, and if so, judging that the transmission of the appointed service flow is abnormal; if not, the transmission of the specified service flow is judged to be normal. Or, it may also be determined whether the transmission performance of the specified traffic is in the preset transmission performance standard during the transmission of the traffic to be scheduled on the new path, if so, the transmission performance is determined to be normal, and if not, the transmission performance is determined to be abnormal, where the preset transmission performance standard may be flexibly set according to actual needs, so as to ensure that the transmission performance of the specified traffic is always maintained in a better state.
In the embodiment of the invention, the traffic to be scheduled can be scheduled to a new path at one time. Or, the traffic to be scheduled may be scheduled to a new path step by step. In the step scheduling, before S102, the following steps may be included:
s201, dividing all the service flow to be scheduled into at least two groups.
I.e. all traffic carried on the path to be scheduled is divided into at least two packets. The service traffic carried on the path to be scheduled can be divided into at least two groups according to a preset policy. For example, traffic flows belonging to the same service may be divided into one packet; or, according to the mode that the service flow of each group is equal in size, dividing all the service flows borne on the path to be scheduled into at least two groups.
S202, determining the scheduling sequence of each group.
Wherein, the scheduling order of each group can be determined according to a preset strategy. For example, the scheduling order of each packet is determined according to the priority of each traffic flow.
And after the scheduling sequence of each packet is determined, the service flow of each packet is sequentially scheduled to a new path according to the scheduling mode. That is, the mirror image of the first packet is transmitted on the new path, and when the transmission performance of the new path meets the preset requirement in the transmission process of the mirror image of the first packet, the first packet is scheduled to the new path for transmission, and the service flows of the remaining packets are sequentially scheduled to the new path for transmission.
In the embodiment of the present invention, the service traffic to be scheduled may be scheduled to a new path for transmission by deploying pbr (Policy Based Routing) or bgp-fs (Border Gateway Protocol).
In the embodiment of the invention, in order to further ensure the transmission performance of the traffic to be scheduled on the new path, after the traffic to be scheduled is scheduled on the new path, in the process of transmitting the traffic to be scheduled on the new path, the performance parameters of the new path can be monitored in real time, and whether the performance parameters of the new path are in the preset second range or not is judged; and deleting the new path when the performance parameter of the new path is not in the preset second range in the process of transmitting the traffic to be scheduled on the new path. The second range may be flexibly set according to actual needs, for example, may be set by a developer according to experience; or, before the mirror image of the service traffic to be scheduled is transmitted on the new path, the performance parameter range of the new path after the service traffic to be scheduled is scheduled on the new path for transmission is estimated, and the estimated range is used as the second range. It should be understood that the different performance parameters, corresponding to the different second ranges, may include at least one of link load, transmission delay, bit error rate, packet loss rate, and the like. When the pre-estimation is carried out, the performance parameters of the new path when the traffic to be scheduled is scheduled to the new path for transmission can be pre-estimated according to the size of the traffic to be scheduled and/or the performance parameters of the new path, and the pre-estimated performance parameters are used as a preset second range. For a specific estimation manner, reference may be made to the aforementioned records for determining the first range, which is not described herein again.
In the embodiment of the invention, after all the traffic to be scheduled is scheduled to the new path, the traffic to be scheduled can be scheduled to the new path for transmission, wherein the traffic to be scheduled is the traffic carried on the path to be scheduled. That is, after all the service traffic carried on the path to be scheduled is scheduled to the new path, the service carried on the path to be scheduled is scheduled to the new path, so that the switching of the service traffic is converted into the tunnel path switching deployment of the service.
The traffic scheduling method provided by the embodiment of the invention determines a new path corresponding to a path to be scheduled, wherein the path to be scheduled and nodes at two ends of the new path are the same; transmitting a mirror image of service flow to be scheduled on the new path, wherein the service flow to be scheduled is the service flow borne on the path to be scheduled; in the transmission process of the mirror image, when the transmission performance of the new path meets the preset requirement, the service flow to be scheduled is scheduled to the new path for transmission, in some implementation processes, the mirror image of the service flow on the path to be scheduled is transmitted on the new path before the service flow on the path to be scheduled is scheduled to the new path, and in the transmission process of the mirror image, when the transmission performance of the new path meets the requirement, the service flow to be scheduled is scheduled to the new path for transmission, so that the transmission performance of the service flow to be scheduled on the new path can be ensured.
Example two:
for a better understanding of the present invention, embodiments of the present invention are described with reference to more specific examples. Referring to fig. 3, the traffic scheduling method includes:
s301, determining a new path corresponding to the path to be scheduled.
In the embodiment of the invention, the new path corresponding to the path to be scheduled can be determined based on the automatic scheduling mode, and the new path corresponding to the path to be scheduled can also be determined based on the manual scheduling mode. When determining a new path corresponding to a path to be scheduled based on the automatic scheduling mode, a scheduling opportunity may be determined based on an operating state of the entire network, a performance index threshold, analysis of historical performance data, and the like, and the new path corresponding to the path to be scheduled is calculated. It should be understood that the end nodes of the path to be scheduled are the same as the end nodes of the new path.
S302, dividing all the service flow to be scheduled into n groups.
In the embodiment of the invention, the service flow on the path to be scheduled is scheduled to a new path in a step-by-step scheduling mode. Therefore, before scheduling, all the traffic to be scheduled is divided into n packets, where the traffic to be scheduled is the traffic carried on the path to be scheduled, and n is an integer greater than or equal to 2.
In the embodiment of the present invention, all the traffic flows to be scheduled may be divided into at least two groups according to a preset policy, for example, the traffic flows belonging to the same service may be divided into one group. Of course, there may be other strategies for dividing the packets.
S303, determining the scheduling sequence of each group.
In the embodiment of the invention, the scheduling sequence of each group can be determined according to a preset strategy. For example, a packet corresponding to a service with the highest priority may be used as the first packet according to the priority of each service. Of course, there may be other strategies for determining the scheduling order of packets.
S304, determining a first range and a second range corresponding to each group.
In the embodiment of the invention, when a first range corresponding to a certain packet is determined, performance parameters of a new path are estimated when the mirror image of the packet is transmitted on the new path according to the size of the service flow of the packet, the performance parameters of the new path and the like, and the estimated performance parameters are used as the first range corresponding to the packet. When a second range corresponding to a certain packet is determined, the performance parameters of the new path are estimated when the packet is scheduled to the new path for transmission according to the size of the service flow of the packet, the performance parameters of the new path and the like, and the estimated performance parameters are used as the second range corresponding to the packet. It should be noted that the performance parameter includes, but is not limited to, at least one of performance parameters such as link load, transmission delay, bit error rate, packet loss rate, and the like. It should be understood that different performance parameters, which correspond to different first ranges, also correspond to different second ranges.
For better understanding, two performance parameters are exemplified herein. Assuming that the performance parameter is a link load, when a first link load change range corresponding to a certain packet is determined, the link load change range of a new path can be estimated when a subsequent mirror image of the packet is transmitted on the new path according to the flow of the packet, and the estimated link load change range is used as the first link load change range; when determining the second link load change range corresponding to a certain packet, the link load change range of the new path may be estimated according to the traffic of the packet when the packet is scheduled to the new path for transmission, and the estimated link load change range may be used as the second link load change range. Assuming that the performance parameter is transmission delay, when a first transmission delay range corresponding to a certain packet is determined, the transmission delay range of a new path can be estimated according to the transmission delay of each section of the new path, and the estimated transmission delay range is used as the first transmission delay range; when determining the second transmission delay range corresponding to a certain packet, the transmission delay range of the new path may be estimated according to the transmission delay of each segment of the new path, and the estimated transmission delay range may be used as the second transmission delay range.
S305、i=1。
The initial value of i is set to 1, and the 1 st, 2 nd, … … n packets are subsequently scheduled to the new path in turn.
S306, transmitting the mirror image of the ith packet on the new path.
In the embodiment of the invention, the mirror image of the ith packet is acquired, and the mirror image of the ith packet is transmitted on a new path.
And S307, respectively sampling the mirror image of the ith packet at the transmitting end and the receiving end of the new path.
In the embodiment of the invention, the mirror image of the ith packet is sampled at the sending end and the receiving end of the new path respectively.
S308, monitoring the performance parameters of the new path in the transmission process of the mirror image of the ith packet.
The performance parameter includes, but is not limited to, at least one of link load, transmission delay, packet loss rate, bit error rate, and the like.
S309, in the transmission process of the mirror image of the ith packet, monitoring the transmission condition of the specified service flow.
The specified service flow is a service flow in which the transmission path intersects with the new path, and monitoring the transmission condition of the specified service flow may be monitoring a transmission performance parameter of the specified service flow.
S310, matching the sampling data of the sending end with the sampling data of the receiving end, wherein the performance parameter of the new path is in a first range corresponding to the ith packet, and the specified service flow is transmitted normally.
In the embodiment of the present invention, in the transmission process of transmitting the mirror image of the ith packet on the new path, if the sampled data of the sending end is matched with the sampled data of the receiving end, the performance parameter of the new path is in the first range corresponding to the ith packet, and the designated service traffic is transmitted normally, go to S311; in other cases, the new path is deleted, and at this time, S301 may be turned to determine a new path again.
In order to better understand that the performance parameter of the new path is in the first range corresponding to the ith packet, two examples are described here, and assuming that the performance parameter is a link load change value, the fact that the performance parameter of the new path is in the first range corresponding to the ith packet includes: and the link load change value of the new path is in a first link change range corresponding to the ith packet, wherein the link load change value is the link load of the new path during the mirror image transmission of the ith packet-the link load of the new path before the mirror image transmission of the ith packet. Assuming that the performance parameter is transmission delay, the performance parameter of the new path in the first range corresponding to the ith packet includes: and the transmission delay of the new path is in the first transmission delay range when the mirror image of the ith packet is transmitted.
Wherein, judging whether the specified service flow is transmitted normally can be determined according to the following modes: judging whether the transmission performance of the appointed service flow is reduced or not before the service flow to be scheduled is transmitted on the new path, and if so, judging that the transmission of the appointed service flow is abnormal; if not, the transmission of the specified service flow is judged to be normal. Or, it may also be determined whether the transmission performance of the specified traffic is in the preset transmission performance standard during the transmission of the traffic to be scheduled on the new path, if so, the transmission performance is determined to be normal, and if not, the transmission performance is determined to be abnormal, where the preset transmission performance standard may be flexibly set according to actual needs, so as to ensure that the transmission performance of the specified traffic is always maintained in a better state.
S311, the ith packet is scheduled to a new path for transmission.
At this time, the transmission of the mirror image of the ith packet on the new path may be cancelled, and the ith packet may be scheduled to the new path for transmission.
S312, in the transmission process of the ith packet, the performance parameter of the new path is in a second range corresponding to the ith packet.
In the embodiment of the present invention, after scheduling the ith packet to the new path for transmission, monitoring the performance parameter of the new path, and determining whether the performance parameter of the new path is in the second range corresponding to the ith packet when the ith packet is transmitted on the new path, if yes, turning to S312; if not, deleting the new path, and at this time, turning to S301 to re-determine a new path.
For the manner of determining whether the performance parameter of the new path is in the second range corresponding to the ith packet when the ith packet is transmitted on the new path, reference may be made to the manner of determining whether the performance parameter of the new path is in the first range corresponding to the ith packet when the mirror image of the ith packet is transmitted on the new path.
And S313, judging whether i is smaller than n.
If yes, go to S314, otherwise, go to S315.
If i is less than n, it indicates that there are more packets not scheduled on the new path, so go to S314; if i is equal to n, it indicates that all packets have been scheduled onto the new path, and therefore, a transition is made to S315.
S314、i=i+1。
i +1, and then goes to S306.
And S315, scheduling the service to be scheduled to a new path.
And scheduling all the packets to the new path, and scheduling the service to be scheduled to the new path. The service to be scheduled is a service carried on a path to be scheduled. That is, after all the service traffic carried on the path to be scheduled is scheduled to the new path, the service carried on the path to be scheduled is scheduled to the new path, so that the switching of the service traffic is converted into the tunnel path switching deployment of the service.
The traffic scheduling method provided by the embodiment of the invention determines a new path corresponding to a path to be scheduled, wherein the path to be scheduled and nodes at two ends of the new path are the same; transmitting a mirror image of service flow to be scheduled on the new path, wherein the service flow to be scheduled is the service flow borne on the path to be scheduled; in the transmission process of the mirror image, when the transmission performance of the new path meets the preset requirement, the service flow to be scheduled is scheduled to the new path for transmission, in some implementation processes, the mirror image of the service flow on the path to be scheduled is transmitted on the new path before the service flow on the path to be scheduled is scheduled to the new path, and in the transmission process of the mirror image, when the transmission performance of the new path meets the requirement, the service flow to be scheduled is scheduled to the new path for transmission, so that the transmission performance of the service flow to be scheduled on the new path can be ensured.
Example three:
an embodiment of the present invention further provides a traffic scheduling apparatus, as shown in fig. 4, which includes a processor 401, a memory 402, and a communication bus 403, where:
the communication bus 403 is used for realizing connection communication between the processor 401 and the memory 402;
the processor 401 is configured to execute one or more computer programs stored in the memory 402 to implement at least one step of the traffic scheduling method in the first and second embodiments.
It should be noted that, in the embodiment of the present invention, the traffic scheduling device may be any device, and for example, may be an SDN (Software Defined Network) controller. The SDN controller may collect network topology and network device protocol states, and obtain a forwarding path of user traffic in the network. At least one step of the flow scheduling method is realized through the SDN controller based on topology collection, service control capability and the like of the SDN controller.
Embodiments of the present invention also provide a storage medium including volatile or nonvolatile, removable or non-removable media implemented in any method or technology for storage of information such as computer readable instructions, data structures, computer program modules or other data. Storage media includes, but is not limited to, RAM (Random Access Memory), ROM (Read-Only Memory), EEPROM (Electrically Erasable Programmable Read-Only Memory), flash Memory or other Memory technology, CD-ROM (Compact disk Read-Only Memory), Digital Versatile Disks (DVD) or other optical disk storage, magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other medium which can be used to store the desired information and which can be accessed by a computer.
The readable storage medium in the embodiment of the present invention may be used to store one or more computer programs, and the stored one or more computer programs may be executed by the processor to implement at least one step of the traffic scheduling method in the first and second embodiments.
The traffic scheduling device and the computer readable storage medium provided by the embodiment of the invention determine a new path corresponding to a path to be scheduled, wherein nodes at two ends of the path to be scheduled and nodes at two ends of the new path are the same; transmitting a mirror image of service flow to be scheduled on the new path, wherein the service flow to be scheduled is the service flow borne on the path to be scheduled; in the transmission process of the mirror image, when the transmission performance of the new path meets the preset requirement, the service flow to be scheduled is scheduled to the new path for transmission, in some implementation processes, the mirror image of the service flow on the path to be scheduled is transmitted on the new path before the service flow on the path to be scheduled is scheduled to the new path, and in the transmission process of the mirror image, when the transmission performance of the new path meets the requirement, the service flow to be scheduled is scheduled to the new path for transmission, so that the transmission performance of the service flow to be scheduled on the new path can be ensured.
It will be apparent to those skilled in the art that all or some of the steps of the methods, systems, functional modules/units in the devices disclosed above may be implemented as software (which may be implemented in computer program code executable by a computing device), firmware, hardware, and suitable combinations thereof. In a hardware implementation, the division between functional modules/units mentioned in the above description does not necessarily correspond to the division of physical components; for example, one physical component may have multiple functions, or one function or step may be performed by several physical components in cooperation. Some or all of the physical components may be implemented as software executed by a processor, such as a central processing unit, digital signal processor, or microprocessor, or as hardware, or as an integrated circuit, such as an application specific integrated circuit.
In addition, communication media typically embodies computer readable instructions, data structures, computer program modules or other data in a modulated data signal such as a carrier wave or other transport mechanism and includes any information delivery media as known to one of ordinary skill in the art. Thus, the present invention is not limited to any specific combination of hardware and software.
The foregoing is a more detailed description of embodiments of the present invention, and the present invention is not to be considered limited to such descriptions. For those skilled in the art to which the invention pertains, several simple deductions or substitutions can be made without departing from the spirit of the invention, and all shall be considered as belonging to the protection scope of the invention.

Claims (13)

1. A traffic scheduling method comprises the following steps:
determining a new path corresponding to a path to be scheduled, wherein the path to be scheduled and nodes at two ends of the new path are the same;
transmitting a mirror image of service flow to be scheduled on the new path, wherein the service flow to be scheduled is the service flow borne on the path to be scheduled;
and when the transmission performance of the new path meets a preset requirement in the transmission process of the mirror image, scheduling the service flow to be scheduled to the new path for transmission.
2. The traffic scheduling method according to claim 1, wherein the scheduling the traffic to be scheduled to the new path for transmission when the transmission performance of the new path meets a preset requirement in the transmission process of the mirror image comprises:
and when the sampling data obtained by sampling the mirror image by the sending end of the new path is matched with the sampling data obtained by sampling the mirror image by the receiving end of the new path in the transmission process of the mirror image, scheduling the service flow to be scheduled to the new path for transmission.
3. The traffic scheduling method according to claim 1, wherein the scheduling the traffic to be scheduled to the new path for transmission when the transmission performance of the new path meets a preset requirement in the transmission process of the mirror image comprises:
and when the performance parameters of the new path are in a preset first range in the transmission process of the mirror image, scheduling the service traffic to be scheduled to the new path for transmission, wherein the performance parameters comprise at least one of link load, transmission delay, packet loss rate and bit error rate.
4. The traffic scheduling method of claim 3, wherein before transmitting the mirror image of the traffic to be scheduled on the new path, further comprising:
and estimating the performance parameter of the new path as the first range in the process of transmitting the mirror image of the service flow to be scheduled on the new path according to the size of the service flow to be scheduled and/or the performance parameter of the new path.
5. The traffic scheduling method according to claim 1, wherein when the mirror image of the traffic to be scheduled is transmitted on the new path, further comprising:
monitoring the transmission condition of the specified service flow, wherein the specified service flow is the service flow with intersection between the transmission path and the new path;
when the transmission performance of the new path meets a preset requirement in the transmission process of the mirror image, scheduling the service traffic to be scheduled to the new path for transmission comprises:
and when the transmission performance of the new path meets the preset requirement and the specified service flow is normally transmitted in the mirror image transmission process, scheduling the service flow to be scheduled to the new path for transmission.
6. The traffic scheduling method according to claim 1, wherein after scheduling the traffic to be scheduled to the new path for transmission, the method further comprises:
monitoring the performance parameters of the new path in the process of transmitting the traffic to be scheduled on the new path;
when the performance parameter of the new path is in a preset second range in the process of transmitting the service traffic to be scheduled on the new path, continuing to transmit the service traffic to be scheduled on the new path;
and deleting the new path when the performance parameter of the new path is not in the preset second range in the process of transmitting the traffic to be scheduled on the new path.
7. The traffic scheduling method of claim 6, wherein before transmitting the mirror image of the traffic to be scheduled on the new path, further comprising:
and estimating the performance parameter of the new path as a second range when the traffic to be scheduled is scheduled to the new path for transmission according to the size of the traffic to be scheduled and/or the performance parameter of the new path.
8. The traffic scheduling method according to claim 1, wherein after scheduling all the traffic to be scheduled to the new path for transmission, further comprising:
and scheduling the service to be scheduled to the new path for transmission, wherein the service to be scheduled is the service borne by the path to be scheduled.
9. The traffic scheduling method of claim 1, wherein before transmitting the mirror image of the traffic to be scheduled on the new path, further comprising:
dividing all the service traffic to be scheduled into at least two groups;
determining the scheduling sequence of each group;
the mirror image of the service flow to be scheduled is transmitted on the new path, and when the transmission performance of the new path meets the preset requirement in the transmission process of the mirror image, the scheduling of the service flow to be scheduled to the new path for transmission comprises the following steps:
and transmitting the mirror image of the first packet on the new path according to the scheduling sequence, scheduling the first packet to the new path for transmission when the transmission performance of the new path meets a preset requirement in the transmission process of the mirror image of the first packet, and scheduling the rest packets to the new path for transmission in sequence.
10. The traffic scheduling method according to any of claims 1-9, further comprising:
and deleting the new path when the transmission performance of the new path does not meet the preset requirement in the transmission process of the mirror image.
11. A traffic scheduling device, comprising a processor, a memory and a communication bus;
the communication bus is used for realizing connection communication between the processor and the memory;
the processor is configured to execute one or more computer programs stored in the memory to implement the steps of the traffic scheduling method according to any of claims 1 to 10.
12. The traffic scheduling device of claim 11, wherein the traffic scheduling device is a Software Defined Network (SDN) controller.
13. A computer readable storage medium storing one or more computer programs, the one or more computer programs being executable by one or more processors to implement the steps of the traffic scheduling method according to any one of claims 1 to 10.
CN201911089793.8A 2019-11-08 2019-11-08 Traffic scheduling method and device and computer readable storage medium Withdrawn CN112787943A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201911089793.8A CN112787943A (en) 2019-11-08 2019-11-08 Traffic scheduling method and device and computer readable storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201911089793.8A CN112787943A (en) 2019-11-08 2019-11-08 Traffic scheduling method and device and computer readable storage medium

Publications (1)

Publication Number Publication Date
CN112787943A true CN112787943A (en) 2021-05-11

Family

ID=75748567

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201911089793.8A Withdrawn CN112787943A (en) 2019-11-08 2019-11-08 Traffic scheduling method and device and computer readable storage medium

Country Status (1)

Country Link
CN (1) CN112787943A (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115174403A (en) * 2022-07-02 2022-10-11 华北电力大学 Resource scheduling and routing management method for multi-mode communication network in low-carbon park

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101159669A (en) * 2007-10-09 2008-04-09 华为技术有限公司 Service flow switching method and apparatus
CN101471759A (en) * 2007-12-28 2009-07-01 中国移动通信集团公司 Method for improving business data transmission quality and business data transmission device
CN103051546A (en) * 2012-12-12 2013-04-17 中国科学院计算技术研究所 Delay scheduling-based network traffic conflict prevention method and delay scheduling-based network traffic conflict prevention system
WO2017028915A1 (en) * 2015-08-19 2017-02-23 Telefonaktiebolaget Lm Ericsson (Publ) Routing communications traffic packets across a communications network
CN108400944A (en) * 2018-05-31 2018-08-14 深圳市零度智控科技有限公司 Method for controlling network flow, device and computer readable storage medium

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101159669A (en) * 2007-10-09 2008-04-09 华为技术有限公司 Service flow switching method and apparatus
CN101471759A (en) * 2007-12-28 2009-07-01 中国移动通信集团公司 Method for improving business data transmission quality and business data transmission device
CN103051546A (en) * 2012-12-12 2013-04-17 中国科学院计算技术研究所 Delay scheduling-based network traffic conflict prevention method and delay scheduling-based network traffic conflict prevention system
WO2017028915A1 (en) * 2015-08-19 2017-02-23 Telefonaktiebolaget Lm Ericsson (Publ) Routing communications traffic packets across a communications network
CN108400944A (en) * 2018-05-31 2018-08-14 深圳市零度智控科技有限公司 Method for controlling network flow, device and computer readable storage medium

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
余翔;易明敏;杨路;: "一种SDN架构下业务属性相关的多径路由算法", 电信科学, no. 11 *
李旭;仇颂清;彭进霖;王聪;: "一种改进的移动自组织网多路径路由协议", 兵工学报, no. 11 *

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115174403A (en) * 2022-07-02 2022-10-11 华北电力大学 Resource scheduling and routing management method for multi-mode communication network in low-carbon park
CN115174403B (en) * 2022-07-02 2024-03-12 华北电力大学 Method and device for resource scheduling and route management of multi-mode communication network in low-carbon park

Similar Documents

Publication Publication Date Title
EP3245762B1 (en) Method and apparatus for router maintenance
US9838311B2 (en) Node, network controller, and associated methods for routing data packets in a network
CN106209623B (en) Method and control device for determining forwarding path
EP4087202A1 (en) Data stream type identification model updating method and related device
US20130286834A1 (en) Traffic management apparatus for controlling traffic congestion and method thereof
US8767546B2 (en) Traffic load and transmission retry management
US10044770B2 (en) Method and apparatus for managing a plurality of sessions in a multi-path routing based network
CN114286413A (en) TSN network combined routing and stream distribution method and related equipment
CN112887217B (en) Control data packet sending method, model training method, device and system
CN108476175B (en) Transfer SDN traffic engineering method and system using dual variables
WO2022121080A1 (en) Network configuration method, controller, and traffic guide system
CN112769696B (en) Routing method, network controller, system and storage medium
CN112787943A (en) Traffic scheduling method and device and computer readable storage medium
CN109617806B (en) Data traffic scheduling method and device
US10028168B2 (en) Method and apparatus for remote buffer status maintenance
EP2787699A1 (en) Data transmission method, device, and system
EP2996293B1 (en) A packet scheduling networking device for deadline aware data flows
CN112585904A (en) Background data transfer processing
US10819582B2 (en) Traffic optimization device and traffic optimization method
US20170250929A1 (en) Method and apparatus for active queue management for wireless networks using shared wireless channel
CN110192378B (en) Apparatus and method for controlling use of non-optimal path
CN115941451A (en) Method, apparatus and storage medium for redundant switching in an industrial control network
CN113852554B (en) Data transmission method, device and equipment
EP2637467B1 (en) Traffic load and transmission retry management
EP3616371B1 (en) Methods and apparatus for scheduling of services in a traffic-engineering 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
WW01 Invention patent application withdrawn after publication

Application publication date: 20210511

WW01 Invention patent application withdrawn after publication