Multi-service data scheduling method and device, equipment, storage medium and product

Abstract

The invention relates to the technical field of communication, and discloses a multi-service data scheduling method and device, equipment, a storage medium and a product, and the method comprises the steps: formulating a multi-service capability set according to the multi-dimensional characteristic requirements of different services for network state information; determining network convergence information, and determining multi-service network connection edge data according to the network convergence information and the multi-service capability set; generating a multi-service atlas according to the multi-service network connection edge data; scheduling target service data according to the multi-service atlas; through the mode, after the multi-service capability set is formulated by utilizing the multi-dimensional characteristic requirement, the network convergence information is input into the multi-service capability set, then the multi-service atlas is generated by utilizing the multi-service network connection edge data, and the multi-service data is scheduled based on the multi-service atlas; therefore, business data scheduling under different business scenes can be realized, the scheduling capability is enriched, high-degree intelligent scheduling is realized, and the scheduling cost is reduced.

Description

Technical Field

[0001] The present invention relates to the field of communication technologies, and in particular to a multi-service data scheduling method, apparatus, device, storage medium, and product. Background Art

[0002] Currently, as a new form of current audio and video technologies, Real Time Communication (RTC) needs to have the ability to integrate multiple video services and evolve towards unified scheduling and transmission. However, the current RTC still has the following pain points. First, the scheduling ability is single. Each video service only manages its own service, and the scheduling systems of each video service are not interconnected. It can only handle a single scenario of its own service. Some functions of each scheduling system are repeated and the capabilities are similar, which will also cause duplicate construction and increase costs. Second, the intelligence level of the scheduling system is low. When planning and scheduling video services, there is a lack of an intelligent scheduling system and it is unable to perform dynamic planning based on real-time data, resulting in a single-point bottleneck at nodes and being unable to support large-scale business applications.

[0003] The above content is only used to assist in understanding the technical solution of the present invention and does not represent an admission that the above content is prior art. Summary of the Invention

[0004] The main purpose of the present invention is to provide a multi-service data scheduling method, apparatus, device, storage medium, and product, aiming to solve the technical problems of single scheduling ability and low intelligence level in the prior art.

[0005] To achieve the above object, the present invention provides a multi-service data scheduling method, and the multi-service data scheduling method includes the following steps:

[0006] Formulate a multi-service capability set according to the multi-dimensional characteristic requirements of different services for network status information;

[0007] Determine network aggregation information, and determine multi-service network connection edge data according to the network aggregation information and the multi-service capability set;

[0008] Generate a multi-service graph according to the multi-service network connection edge data;

[0009] Schedule target service data according to the multi-service graph.

[0010] Optionally, the determining network aggregation information includes:

[0011] After detecting that the deployment of each forwarding network element is completed, open the information interaction channel between the set of forwarding network elements and the scheduling center;

[0012] Obtain the basic information of each forwarding network element through a keep-alive reporting mechanism;

[0013] Open up the information exchange channels between each forwarding network element and obtain the connection information between each forwarding network element through the keep-alive reporting mechanism;

[0014] Generate a network element information table according to the basic information of each forwarding network element and the connection information;

[0015] Determine other forwarding network elements connected to the current forwarding network element;

[0016] Obtain network status information between the current forwarding network element and other forwarding network elements through information collection data packets;

[0017] Network convergence information is generated according to the network element information table and the network status information.

[0018] Optionally, the generating network convergence information according to the network element information table and the network status information includes:

[0019] Extracting the connection edge data with the same first and last network elements in the network element information table through the first and last network elements deduplication mechanism;

[0020] Filtering out connection edge data having the same first and last network elements in the network element information table from the network element information table;

[0021] Constructing a target network map based on the filtered network element information table;

[0022] Network convergence information is generated according to the target network map and network status information.

[0023] Optionally, generating a multi-service graph based on the network connection edge data of the multi-service includes:

[0024] Selecting a first network element from each forwarding network element based on the target connection edge strategy;

[0025] Determining a first forwarding network element corresponding to the minimum connection edge data connected to the first network element;

[0026] Determining a target transmission path set for different services based on the network connection edge data of the multiple services;

[0027] Including the first forwarding network element into the target transmission path set of the different services;

[0028] Calculating the distances from the first network element to the other network elements in the target transmission path set after the first inclusion;

[0029] Determining new minimum connection edge data according to the distance, and determining a second forwarding network element corresponding to the new minimum connection edge data;

[0030] Including the second forwarding network element into the target transmission path set of the different services;

[0031] After traversing all forwarding network elements, a multi-service graph is generated according to the set of target transmission paths incorporating multiple forwarding network elements.

[0032] Optionally, the scheduling of the target service data according to the multi-service graph includes:

[0033] Parse the target service data, and determine the service type according to the parsed identification information;

[0034] Select a target graph corresponding to the service type from the multi-service graph;

[0035] Obtain the set of target paths between any forwarding network elements under the target graph;

[0036] Determine the target scheduling information according to the set of target paths, the comparison result between the tail network element and the head network element, and / or the number of tail network elements;

[0037] Schedule the target service data according to the target scheduling information.

[0038] Optionally, the scheduling of the target service data according to the target scheduling information includes:

[0039] Obtain the next-hop network element information according to the target scheduling information;

[0040] Determine the number of next-hop network elements according to the next-hop network element information;

[0041] When the number of next-hop network elements is a preset value, schedule the target service data through a single path;

[0042] When the number of next-hop network elements is greater than or equal to the preset value, copy the target service data;

[0043] Distribute the assigned service data to the data engine modules of different forwarding network elements;

[0044] Use the data engine modules of the different forwarding network elements to adjust the target service data and the assigned service data through multiple paths respectively.

[0045] In addition, to achieve the above object, the present invention also proposes a multi-service data scheduling device, and the multi-service data scheduling device includes:

[0046] A formulation module, configured to formulate a multi-service capability set according to the multi-dimensional characteristic requirements of different services for network status information;

[0047] A determination module, configured to determine network aggregation information, and determine multi-service network connection edge data according to the network aggregation information and the multi-service capability set;

[0048] A generation module, configured to generate a multi-service graph according to the network connection edge data of the multi-service.

[0049] A scheduling module, configured to schedule target service data according to the multi-service graph.

[0050] In addition, to achieve the above object, the present invention further provides a multi-service data scheduling device, where the multi-service data scheduling device includes: a memory, a processor, and a multi-service data scheduling program stored on the memory and executable on the processor, and the multi-service data scheduling program is configured to implement the multi-service data scheduling method as described above.

[0051] In addition, to achieve the above object, the present invention further provides a storage medium, where a multi-service data scheduling program is stored on the storage medium, and when the multi-service data scheduling program is executed by a processor, it implements the multi-service data scheduling method as described above.

[0052] In addition, to achieve the above object, the present invention further provides a computer program product, where the computer program product includes a multi-service data scheduling program, and when the multi-service data scheduling program is executed by a processor, it implements the multi-service data scheduling method as described above.

[0053] The multi-service data scheduling method proposed by the present invention formulates a multi-service capability set according to the multi-dimensional characteristic requirements of different services for network status information; determines network aggregation information, and determines the network connection edge data of the multi-service according to the network aggregation information and the multi-service capability set; generates a multi-service graph according to the network connection edge data of the multi-service; schedules target service data according to the multi-service graph; through the above method, after formulating the multi-service capability set using the multi-dimensional characteristic requirements, the network aggregation information is input into the multi-service capability set, and then a multi-service graph is generated using the network connection edge data of the multi-service, and multi-service data scheduling is performed based on this multi-service graph, so as to be able to implement the scheduling of service data in different service scenarios, enrich the scheduling capabilities, and achieve highly intelligent scheduling and reduce the scheduling cost. BRIEF DESCRIPTION OF THE DRAWINGS

[0054] Figure 1 is a schematic structural diagram of a multi-service data scheduling device in a hardware operating environment related to the embodiment solution of the present invention;

[0055] Figure 2 is a schematic flowchart of the first embodiment of the multi-service data scheduling method of the present invention;

[0056] Figure 3 is a schematic structural diagram of a multi-service scheduling system in an embodiment of the multi-service data scheduling method of the present invention;

[0057] Figure 4 Schematic diagram of a target network map for an embodiment of the multi-service data scheduling method of the present invention;

[0058] Figure 5 Schematic diagram of the process of generating a multi-service map for an embodiment of the multi-service data scheduling method of the present invention;

[0059] Figure 6 Schematic diagram of the process for the second embodiment of the multi-service data scheduling method of the present invention;

[0060] Figure 7 Schematic diagram of the functional modules for the first embodiment of the multi-service data scheduling device of the present invention.

[0061] The realization, functional features and advantages of the object of the present invention will be further described with reference to the embodiments and the accompanying drawings. Detailed implementation manners

[0062] It should be understood that the specific embodiments described herein are only used to explain the present invention and are not used to limit the present invention.

[0063] Refer to Figure 1 , Figure 1 Schematic diagram of the structure of a multi-service data scheduling device for the hardware operating environment involved in the embodiment solution of the present invention.

[0064] As Figure 1 shown, the multi-service data scheduling device may include: a processor 1001, such as a central processing unit (CPU), a communication bus 1002, a user interface 1003, a network interface 1004, and a memory 1005. Among them, the communication bus 1002 is used to realize the connection and communication between these components. The user interface 1003 may include a display screen (Display), an input unit such as a keyboard (Keyboard), and optionally the user interface 1003 may further include a standard wired interface and a wireless interface. The network interface 1004 may optionally include a standard wired interface and a wireless interface (such as a wireless fidelity (Wireless-Fidelity, Wi-Fi) interface). The memory 1005 may be a high-speed random access memory (RandomAccess Memory, RAM), or a stable non-volatile memory (Non-Volatile Memory, NVM), such as a disk memory. The memory 1005 may optionally be a storage device independent of the aforementioned processor 1001.

[0065] Those skilled in the art can understand that Figure 1The structure shown does not constitute a limitation on the multi-service data scheduling device, and it may include more or fewer components than shown, or combine certain components, or have different component arrangements.

[0066] As Figure 1 shown, the memory 1005, as a storage medium, may include an operating system, a network communication module, a user interface module, and a multi-service data scheduling program.

[0067] In Figure 1 the multi-service data scheduling device shown, the network interface 1004 is mainly used for data communication with the network integrated platform workstation; the user interface 1003 is mainly used for data interaction with users; the processor 1001 and the memory 1005 in the multi-service data scheduling device of the present invention may be arranged in the multi-service data scheduling device. The multi-service data scheduling device calls the multi-service data scheduling program stored in the memory 1005 through the processor 1001 and executes the multi-service data scheduling method provided by the embodiments of the present invention.

[0068] Based on the above hardware structure, an embodiment of the multi-service data scheduling method of the present invention is proposed.

[0069] Referring to Figure 2 , Figure 2 is a schematic flowchart of the first embodiment of the multi-service data scheduling method of the present invention.

[0070] In the first embodiment, the multi-service data scheduling method includes the following steps:

[0071] Step S10, formulating a multi-service capability set according to the multi-dimensional characteristic requirements of different services for network status information.

[0072] It should be noted that the execution subject of this embodiment is a multi-service data scheduling device, and it may also be other devices that can achieve the same or similar functions, such as a multi-service scheduling system, etc. This embodiment does not limit this. In this embodiment, a multi-service scheduling system is used as an example for illustration.

[0073] It should be understood that referring to Figure 3 , Figure 3 is a schematic diagram of the multi-service scheduling system structure, which specifically includes: a scheduling center module and a forwarding network element. Among them, the scheduling center module includes a network management module, a real-time calculation module, and a fusion scheduling module, and the forwarding network element includes a data management module, a data engine module, and a transmission management module.

[0074] It can be understood that the multi-dimensional characteristic requirements include, but are not limited to, sensitivity and constraint requirements, etc. Different services have different sensitivity and constraint requirements for network status information. The real-time calculation module completes the formulation of the multi-service capability set to cope with the differences and requirements of different services. The service scenarios applicable to different service capabilities will also vary. For specific reference, see Table 1:

[0075] Table 1:

[0076]

[0077] It should be noted that the multi-service capability set includes, but is not limited to, single-index capabilities, multi-index capabilities, and custom capabilities, etc. Among them, single-index capabilities can be divided into minimum latency capabilities, minimum packet loss rate capabilities, etc. Minimum latency capability: The latency between forwarding network elements is used as the network connection edge data, with the goal of the minimum latency across the entire link, applicable to strongly interactive services such as video conferencing and interactive live streaming. Minimum packet loss rate capability: The packet loss rate between forwarding network elements is used as the network connection edge data, with the goal of the minimum packet loss rate across the entire link, applicable to services sensitive to packet loss such as financial transactions and video surveillance. Multi-index capability: The latency, packet loss rate, and other multi-indices between forwarding network elements are jointly calculated as the network connection edge data, with the calculated connection edge data as the goal, applicable to services between the two capabilities of latency and packet loss rate, such as video live streaming. Custom capability: The optimal transmission path can be calculated according to custom conditions of the service, applicable to services with user-defined conditions, such as when the service requires that the latency across the entire link is less than 100 ms, the packet loss rate across the entire link is less than 5%, and the number of path hops is less than 3, etc. When calculating the optimal path, it will be executed according to this custom condition. If there is no path that meets the custom condition, it will degrade to the multi-index capability to achieve the purpose of integrating multi-service scheduling capabilities and resources.

[0078] Step S20: Determine the network aggregation information, and determine the network connection edge data of multiple services according to the network aggregation information and the multi-service capability set.

[0079] It can be understood that the network aggregation information refers to the information that aggregates the network status information and network element information between all forwarding network elements. This network aggregation information is determined by the network management module and then passed to the real-time calculation module, which combines the multi-service capability set to determine the network connection edge data of multiple services.

[0080] Further, the determination of network aggregation information includes: after detecting that each forwarding network element is deployed, establishing an information interaction channel between the set of forwarding network elements and the scheduling center; obtaining the basic information of each forwarding network element through a keep-alive reporting mechanism; establishing an information interaction channel between each forwarding network element and obtaining the connection information between each forwarding network element through the keep-alive reporting mechanism; generating a network element information table based on the basic information and the connection information of each forwarding network element; determining other forwarding network elements connected to the current forwarding network element; obtaining the network status information between the current forwarding network element and other forwarding network elements through an information collection data packet; and generating network aggregation information based on the network element information table and the network status information.

[0081] It should be understood that the information interaction channels between the set of forwarding network elements and the scheduling center are established after each forwarding network element is deployed. Each forwarding network element corresponds to its own data management module. That is, the forwarding network element adopts a keep-alive reporting mechanism, and its data management module will actively transmit the basic information of the forwarding network element to the network management module of the scheduling center module. The basic information includes, but is not limited to, the IP address, ID identification, CPU scale, memory scale, and computing power scale of the forwarding network element, etc. The network management module will persistently store the basic information received from each forwarding network element.

[0082] It can be understood that after establishing the information interaction channels between each forwarding network element, the forwarding network element uses the keep-alive reporting mechanism again to add and fill in the connection information between each forwarding network element. The actually connected forwarding network elements will report, while the unconnected forwarding network elements do not need to report. After the network management module receives the connection information between each forwarding network element, it will persistently store the information. The network status information includes, but is not limited to, packet loss rate, latency, jitter, and bandwidth, etc. The network status information is obtained by the forwarding network element actively sending an information collection data packet request to the forwarding network element connected to the current forwarding network element.

[0083] Further, the generation of network aggregation information based on the network element information table and the network status information includes: extracting the connection edge data with the same start and end network elements in the network element information table through a start-end de-duplication mechanism; screening out the connection edge data with the same start and end network elements in the network element information table from the network element information table; constructing a target network graph based on the screened network element information table; and generating network aggregation information based on the target network graph and the network status information.

[0084] It can be understood that the start-end de-duplication mechanism refers to the mechanism for extracting the connection edge data with the same start and end network elements. That is, after extracting the connection edge data with the same start and end network elements in the network element information table, the connection edge data is screened out from the network element information table, and then a target network graph is constructed. Refer to Figure 4 , Figure 4It is a schematic diagram of the target network graph, specifically including: node A, node B, node C, node D, node E, and node F. Among them, node D is respectively connected to node A, node C, and node E; node A is respectively connected to node B and node D; node B is respectively connected to node A and node C; node C is respectively connected to node B, node F, and node D; node F is respectively connected to node E and node C; node E is respectively connected to node D, node F, and node C.

[0085] It should be understood that before determining the network connection edge data of multiple services based on the network aggregation information and the multi-service capability set, it is also necessary to clean the network aggregation information. Specifically: for the network status information in the network aggregation information, filter out the data whose delay, or packet loss rate, or bandwidth occupancy rate exceeds the threshold. For example, the delay is greater than 5 seconds, or the packet loss rate is greater than 50%, or the bandwidth occupancy rate is greater than 90%, and set the corresponding forwarding network element connection edge data to infinity; for the network element information in the network aggregation information, filter out the data whose CPU occupancy rate, or memory occupancy rate, or computing power occupancy rate exceeds the threshold. For example, the CPU occupancy rate reaches 90%, the memory occupancy rate reaches 90%, and the computing power occupancy rate reaches 90%, and set all the connection edge data connected to this forwarding network element to infinity. That is, after the cleaning is completed, the cleaned network aggregation information is input into the multi-service capability set to generate the network connection edge data of multiple services.

[0086] Step S30: Generate a multi-service graph according to the network connection edge data of the multiple services.

[0087] It should be understood that after determining the network connection edge data of multiple services, use this network connection edge data to generate a service graph.

[0088] Further, step S30 includes: selecting a first network element from each forwarding network element based on the target connection edge policy; determining a first forwarding network element corresponding to the smallest connection edge data connected to the first network element; determining a set of target transmission paths for different services according to the network connection edge data of the multiple services; incorporating the first forwarding network element into the set of target transmission paths for the different services; respectively calculating the distances from the first network element to other network elements through the network elements in the set of target transmission paths after the initial incorporation; determining new smallest connection edge data according to the distances, and determining a second forwarding network element corresponding to the new smallest connection edge data; incorporating the second forwarding network element into the set of target transmission paths for the different services; after traversing all the forwarding network elements, generating a multi-service graph according to the set of target transmission paths incorporating multiple forwarding network elements.

[0089] It can be understood that the target connection edge strategy can be the minimum connection edge strategy, and the target transmission path set refers to the set of optimal transmission paths. After determining the network connection edge data for multiple services, based on the target connection edge strategy, any two different forwarding network elements are randomly selected as the head network element and the tail network element respectively. The first forwarding network element refers to the forwarding network element corresponding to the minimum connection edge data. Then, the first forwarding network element is used as the next-hop network element of the head network element and is incorporated into the target transmission path sets of different services. Then, the distances from the head network element to other network elements through the network elements in the target transmission path set after the initial incorporation are calculated, and the minimum connection edge data is updated according to the distances, that is, the new minimum connection edge data replaces the original minimum connection edge data. Similarly, the second forwarding network element corresponding to the new minimum connection edge data is incorporated into the target transmission path set. After traversing all the forwarding network elements in the service capability set, the forwarding network elements that have been incorporated into the target transmission path set are the optimal paths, that is, the service graph is obtained. Then, after traversing all the multiple service capability sets, a multi-service graph is obtained, that is, the set of optimal paths between any forwarding network elements under multiple service scenarios.

[0090] It should be understood that, referring to Figure 5 , Figure 5 is a schematic flow diagram for generating a multi-service graph. Specifically: First, clean the network aggregation information, that is, for the network status information in the network aggregation information, filter out the data whose delay, or packet loss rate, or bandwidth occupancy rate exceeds the threshold. For the network element information in the network aggregation information, filter out the data whose CPU occupancy rate, or memory occupancy rate, or computing power occupancy rate exceeds the threshold. Then, determine the network connection edge data for multiple services in combination with the multiple service capability sets. For example, for the minimum delay capability, the network connection edge data is: DA is 3, AB is 7, BC is 3, CF is 10, FE is 2, ED is 5, DC is 8, EC is 3. For the minimum packet loss rate capability, DA is 3, AB is 6, BC is 5, CF is 3, FE is 6, ED is 2, DC is 5, EC is 10. Then, generate a multi-service graph according to the network connection edge data for multiple services. For example, First: The optimal paths from forwarding network element A to other forwarding network elements are A→D→E→F, A→B→C. The optimal paths from forwarding network element B to other forwarding network elements are B→A→D, B→C→E→F; Second: The optimal paths from forwarding network element A to other forwarding network elements are A→D→E→F, A→D→C, A→B. The optimal paths from forwarding network element B to other forwarding network elements are B→A→D→E, B→C→F.

[0091] Step S40, schedule the target service data according to the multi-service graph.

[0092] It is understandable that after obtaining the multi-service graph, the multi-service graph is used to schedule the target service data, and there can be multiple pieces of the target service data, which are called multi-service data.

[0093] In this embodiment, a multi-service capability set is formulated according to the multi-dimensional characteristic requirements of different services for network status information; network aggregation information is determined, and multi-service network connection edge data is determined according to the network aggregation information and the multi-service capability set; a multi-service graph is generated according to the multi-service network connection edge data; the target service data is scheduled according to the multi-service graph; by the above method, after formulating the multi-service capability set using the multi-dimensional characteristic requirements, the network aggregation information is input into the multi-service capability set, and then the multi-service graph is generated using the multi-service network connection edge data, and the multi-service data is scheduled based on this multi-service graph, so as to be able to achieve the scheduling of service data in different service scenarios, enrich the scheduling capabilities, and achieve highly intelligent scheduling and reduce the scheduling cost.

[0094] In one embodiment, as Figure 6 shown, based on the first embodiment, the second embodiment of the multi-service data scheduling method of the present invention is proposed, and the step S40 includes:

[0095] Step S401, analyze the target service data and determine the service type according to the parsed identification information.

[0096] It should be understood that in the service data transmission stage, the target service data will carry information such as the service type, the first network element, and the last network element, and request the optimal transmission path information from the fusion scheduling module of the scheduling center module. Before scheduling, it is necessary to analyze the target service data and then determine the service type according to the parsed identification information.

[0097] Step S402, select a target graph corresponding to the service type from the multi-service graph.

[0098] It is understandable that the target graph refers to the graph corresponding to the service type, and the target graph can be selected from the multi-service graph.

[0099] Step S403, obtain a target path set between any forwarding network elements under the target graph.

[0100] It should be understood that the target path set refers to the optimal transmission path set between forwarding network elements under the target graph, and the target path set can be requested from the fusion scheduling module of the scheduling center module.

[0101] Step S404, determine the target scheduling information according to the target path set, the comparison result between the last network element and the first network element, and / or the number of the last network elements.

[0102] It can be understood that the comparison result between the tail network element and the head network element includes that the tail network element is the same as the head network element and that the tail network element is different from the head network element. After obtaining the comparison result between the tail network element and the head network element, the target scheduling information is determined by combining the target path set and the number of tail network elements. For specific reference, see Table 2:

[0103] Table 2:

[0104]

[0105] It should be noted that when the tail network element is the same as the head network element, the data transmission is directly completed in this forwarding network element, and there is no need to obtain the service graph from the real-time computing module. When the tail network element is different from the head network element, the fusion scheduling module will query the optimal path between the head network element and the tail network element from the real-time computing module. When there are multiple tail network elements, the fusion scheduling module will first query and obtain multiple optimal paths from the head network element to different tail network elements from the real-time computing module, and then encapsulate the multiple optimal paths into a multi-path set to determine the target scheduling information.

[0106] It should be understood that the fusion scheduling module distributes the target scheduling information to the transmission management modules of each forwarding network element. The target scheduling information includes data such as service type, head network element, tail network element, and complete path. The transmission management modules of each forwarding network element persistently store the target scheduling information in the form of key-value pairs, construct the service type, head network element, and tail network element into a key, and use the next-hop network element of this forwarding network element in the complete path information from the head network element to the tail network element under this target service graph as the value. For example, in the minimum delay capability (assuming the type code is 1), the complete path information from the head network element A to the tail network element F is A-D-E-F, and this forwarding network element is D, then the key is "1-A-F" and the value is "E".

[0107] Step S405, schedule the target service data according to the target scheduling information.

[0108] It should be understood that after determining the target scheduling information, the target scheduling information is used to schedule and transmit the target service data.

[0109] Further, step S405 includes: obtaining the next-hop network element information according to the target scheduling information; determining the number of next-hop network elements according to the next-hop network element information; when the number of next-hop network elements is a preset value, scheduling the target service data through a single path; when the number of next-hop network elements is greater than or equal to the preset value, replicating the target service data; distributing the replicated service data to the data engine modules of different forwarding network elements; and using the data engine modules of the different forwarding network elements to schedule the target service data and the replicated service data through multiple paths respectively.

[0110] It can be understood that the preset value can be 1. After determining the number of next-hop network elements, it is necessary to determine whether the number of next-hop network elements is the preset value. If so, it is single-path distribution, and the data engine module of this forwarding network element directly transmits the target service data to the data engine module of the next-hop network element. If it is greater than or equal to the preset value, it is multi-path distribution. The data engine module will copy the target service data and then distribute and transmit the copied service data to the data engine modules of different forwarding network elements respectively, and then use multi-path to schedule and transmit the target service data and the assigned service data respectively. In addition, if the processing method of the intermediate forwarding network element is the same as that of the first network element, query the value of the transmission management module of this forwarding network element. If the value is empty, this forwarding network element is the last forwarding network element, and the transmission of the target service data ends. For example, in the minimum delay capability (assuming the type code is 1), the target service data needs to be transmitted from the first network element A to the last network element F. The target scheduling information stored in the first network element A is "key: 1-A-F, value: D", and the target service data will be transmitted to the forwarding network element D; the target scheduling information stored in the forwarding network element D is "key: 1-A-F, value: E", and the target service data is transmitted to the forwarding network element E; the target scheduling information stored in the forwarding network element E is "key: 1-A-F, value: F", and the target service data is transmitted to the forwarding network element F; the scheduling information stored in the forwarding network element F is "key: 1-A-F, value: NULL", and the scheduling and transmission of the data end.

[0111] In this embodiment, the target service data is parsed, and the service type is determined according to the parsed identification information; the target graph corresponding to the service type is selected from the multi-service graph; the target path set between any forwarding network elements under the target graph is obtained; the target scheduling information is determined according to the target path set, the comparison result between the last network element and the first network element, and / or the number of last network elements; the target service data is scheduled according to the target scheduling information; through the above method, the service type is determined according to the identification information of the target service data, the target graph corresponding to the service type is selected, and then the target scheduling information is determined in combination with the comparison result between the last network element and the first network element and / or the number of last network elements, and the target scheduling information is used for data scheduling, so as to be able to complete path information transmission and data distribution in each forwarding network element and realize the intelligence of scheduling.

[0112] In addition, an embodiment of the present invention also proposes a storage medium, on which a multi-service data scheduling program is stored. When the multi-service data scheduling program is executed by a processor, the steps of the multi-service data scheduling method described above are implemented.

[0113] Since this storage medium adopts all the technical solutions of the above-mentioned embodiments, it has at least all the beneficial effects brought by the technical solutions of the above-mentioned embodiments, which will not be elaborated here one by one.

[0114] In addition, referring to Figure 7 , an embodiment of the present invention further provides a multi-service data scheduling device, and the multi-service data scheduling device includes:

[0115] A formulation module 10, configured to formulate a multi-service capability set according to the multi-dimensional characteristic requirements of different services for network status information.

[0116] A determination module 20, configured to determine network aggregation information, and determine multi-service network connection edge data according to the network aggregation information and the multi-service capability set.

[0117] A generation module 30, configured to generate a multi-service graph according to the multi-service network connection edge data.

[0118] A scheduling module 40, configured to schedule target service data according to the multi-service graph.

[0119] In this embodiment, a multi-service capability set is formulated according to the multi-dimensional characteristic requirements of different services for network status information; network aggregation information is determined, and multi-service network connection edge data is determined according to the network aggregation information and the multi-service capability set; a multi-service graph is generated according to the multi-service network connection edge data; target service data is scheduled according to the multi-service graph; in the above manner, after formulating the multi-service capability set by using the multi-dimensional characteristic requirements, the network aggregation information is input into the multi-service capability set, and then a multi-service graph is generated by using the multi-service network connection edge data, and multi-service data scheduling is performed based on this multi-service graph, so as to be able to implement the scheduling of service data in different service scenarios, enrich the scheduling capabilities, and achieve highly intelligent scheduling and reduce the scheduling cost.

[0120] It should be noted that the above-described work process is only illustrative and does not limit the protection scope of the present invention. In actual applications, those skilled in the art can select some or all of them according to actual needs to achieve the purpose of the solution of this embodiment, and no limitation is made here.

[0121] In addition, for the technical details not described in detail in this embodiment, reference can be made to the multi-service data scheduling method provided in any embodiment of the present invention, which will not be elaborated here.

[0122] In one embodiment, the determining module 20 is further configured to, after detecting that all forwarding network elements are deployed, establish an information interaction channel between the set of forwarding network elements and the scheduling center; obtain the basic information of each forwarding network element through a keep-alive reporting mechanism; establish an information interaction channel between each forwarding network element, and obtain the connection information between each forwarding network element through the keep-alive reporting mechanism; generate a network element information table according to the basic information and the connection information of each forwarding network element; determine other forwarding network elements connected to the current forwarding network element; obtain the network status information between the current forwarding network element and other forwarding network elements through an information collection data packet; and generate network aggregation information according to the network element information table and the network status information.

[0123] In one embodiment, the determining module 20 is further configured to extract the connection edge data with the same head and tail network elements in the network element information table through a head and tail de-duplication mechanism; screen out the connection edge data with the same head and tail network elements in the network element information table from the network element information table; construct a target network graph according to the screened network element information table; and generate network aggregation information according to the target network graph and the network status information.

[0124] In one embodiment, the generating module 30 is further configured to select a head network element from each forwarding network element based on a target connection edge policy; determine a first forwarding network element corresponding to the minimum connection edge data connected to the head network element; determine a target transmission path set for different services according to the network connection edge data of the multi-services; include the first forwarding network element in the target transmission path set for different services; calculate the distances from the head network element to other network elements through the network elements in the target transmission path set after the initial inclusion respectively; determine new minimum connection edge data according to the distances, and determine a second forwarding network element corresponding to the new minimum connection edge data; include the second forwarding network element in the target transmission path set for different services; and after traversing all forwarding network elements, generate a multi-service graph according to the target transmission path set including multiple forwarding network elements.

[0125] In one embodiment, the scheduling module 40 is further configured to analyze the target service data, and determine the service type according to the parsed identification information; select a target graph corresponding to the service type from the multi-service graph; obtain a target path set between any forwarding network elements under the target graph; determine target scheduling information according to the target path set, the comparison result between the tail network element and the head network element, and / or the number of tail network elements; and schedule the target service data according to the target scheduling information.

[0126] In one embodiment, the scheduling module 40 is further configured to obtain next-hop network element information according to the target scheduling information; determine the number of next-hop network elements according to the next-hop network element information; when the number of next-hop network elements is a preset value, schedule the target service data through a single path; when the number of next-hop network elements is greater than or equal to the preset value, copy the target service data; distribute the assigned service data to the data engine modules of different forwarding network elements; and use the data engine modules of the different forwarding network elements to schedule the target service data and the assigned service data through multiple paths respectively.

[0127] For other embodiments or implementation methods of the multi-service data scheduling device of the present invention, reference may be made to the above method embodiments, which will not be elaborated herein.

[0128] It should be understood that although the steps in the flowchart in the embodiments of the present application are shown in sequence according to the indication of the arrows, these steps do not necessarily have to be executed in the order indicated by the arrows. Unless there is a clear indication in this article, the execution of these steps is not strictly limited in order, and they can be executed in other orders. Moreover, at least some of the steps in the figure may include multiple sub-steps or multiple stages. These sub-steps or stages do not necessarily have to be executed at the same time, but can be executed at different times, and their execution order does not necessarily have to be sequential, but can be executed alternately or alternately with at least a part of other steps or sub-steps or stages of other steps.

[0129] In addition, it should be noted that in this article, the term "comprising", "including" or any other variant thereof is intended to cover non-exclusive inclusion, so that a process, method, article or system including a series of elements not only includes those elements, but also includes other elements not expressly listed, or also includes elements inherent to such process, method, article or system. Without further limitation, an element defined by the statement "including one..." does not exclude the existence of additional identical elements in the process, method, article or system including that element.

[0130] The serial numbers of the above embodiments of the present invention are only for description and do not represent the advantages and disadvantages of the embodiments.

[0131] Through the description of the above embodiments, those skilled in the art can clearly understand that the above-described embodiment methods can be implemented by means of software plus a necessary general hardware platform. Of course, they can also be implemented by hardware, but in many cases the former is a better implementation. Based on such an understanding, the technical solution of the present invention, in essence, or the part that contributes to the prior art can be embodied in the form of a software product. This computer software product is stored in a storage medium (such as a read-only memory (ROM) / RAM, magnetic disk, optical disk), and includes several instructions for causing a terminal device (which can be a mobile phone, computer, integrated platform workstation, or network device, etc.) to execute the methods described in various embodiments of the present invention.

[0132] The above are only the preferred embodiments of the present invention, and do not limit the patent scope of the present invention. Any equivalent structure or equivalent process transformation made by using the content of the specification and drawings of the present invention, or directly or indirectly applied to other related technical fields, are equally included in the patent protection scope of the present invention.

Claims

1. A multi-service data scheduling method, characterized in that: The multi-service data scheduling method comprises the following steps: Develop a multi-service capability set based on the multi-dimensional characteristics of network status information required by different services; Determining network convergence information, and determining network connection edge data for multiple services based on the network convergence information and the multiple service capability set; Generate a multi-service graph based on the network connection edge data of the multi-service; The target service data is scheduled according to the multi-service graph.

2. The multi-service data scheduling method according to claim 1, wherein: The determining of network convergence information includes: After detecting that the deployment of each forwarding network element is complete, the information exchange channel between the forwarding network element set and the dispatching center is opened; Obtain basic information of each forwarding network element through the keep-alive reporting mechanism; Open up the information exchange channels between each forwarding network element and obtain the connection information between each forwarding network element through the keep-alive reporting mechanism; Generate a network element information table according to the basic information of each forwarding network element and the connection information; Determine other forwarding network elements connected to the current forwarding network element; Obtain network status information between the current forwarding network element and other forwarding network elements through information collection data packets; Network convergence information is generated according to the network element information table and the network status information.

3. The multi-service data scheduling method according to claim 2, wherein: The generating of network convergence information according to the network element information table and the network status information includes: Extracting the connection edge data with the same first and last network elements in the network element information table through the first and last network elements deduplication mechanism; Filtering out connection edge data having the same first and last network elements in the network element information table from the network element information table; Constructing a target network map based on the filtered network element information table; Network convergence information is generated according to the target network map and network status information.

4. The multi-service data scheduling method according to claim 1, wherein: Generating a multi-service graph based on the network connection edge data of the multi-service includes: Selecting a first network element from each forwarding network element based on the target connection edge strategy; Determining a first forwarding network element corresponding to the minimum connection edge data connected to the first network element; Determining a target transmission path set for different services based on the network connection edge data of the multiple services; Including the first forwarding network element into the target transmission path set of the different services; Calculating the distances from the first network element to the other network elements in the target transmission path set after the first inclusion; Determining new minimum connection edge data according to the distance, and determining a second forwarding network element corresponding to the new minimum connection edge data; Including the second forwarding network element into the target transmission path set of the different services; After traversing all forwarding network elements, a multi-service graph is generated based on a target transmission path set that includes multiple forwarding network elements.

5. The multi-service data scheduling method according to claim 1, wherein: The scheduling of target service data according to the multi-service graph includes: Parsing the target service data and determining the service type based on the parsed identification information; Selecting a target graph corresponding to the service type from the multiple service graphs; Obtaining a target path set between any forwarding network elements under the target graph; Determining target scheduling information according to the target path set, a comparison result between the tail network element and the head network element, and / or the number of the tail network elements; The target service data is scheduled according to the target scheduling information.

6. The multi-service data scheduling method according to claim 5, wherein: The scheduling of the target service data according to the target scheduling information includes: Acquire next-hop network element information according to the target scheduling information; Determine the number of next-hop network elements according to the next-hop network element information; When the number of the next-hop network elements is a preset value, the target service data is scheduled through a single path; When the number of the next-hop network elements is greater than or equal to a preset value, copying the target service data; Distribute the assigned service data to the data engine modules of different forwarding network elements; The data engine modules of the different forwarding network elements are used to schedule the target service data and the assigned service data respectively through multiple paths.

7. A multi-service data scheduling device, characterized in that: The multi-service data scheduling device includes: A development module is used to develop a multi-service capability set based on the multi-dimensional characteristics of network status information required by different services; a determination module, configured to determine network convergence information, and determine network connection edge data for multiple services based on the network convergence information and the multiple service capability set; A generation module, configured to generate a multi-service graph based on the network connection edge data of the multi-service; The scheduling module is used to schedule target business data according to the multi-business graph.

8. A multi-service data scheduling device, characterized in that: The multi-service data scheduling device includes: a memory, a processor, and a multi-service data scheduling program stored in the memory and executable on the processor, wherein the multi-service data scheduling program is configured to implement the multi-service data scheduling method according to any one of claims 1 to 6.

9. A storage medium, characterized in that: The storage medium stores a multi-service data scheduling program, which, when executed by a processor, implements the multi-service data scheduling method according to any one of claims 1 to 6.

10. A computer program product, characterized in that The computer program product comprises a multi-service data scheduling program, which implements the multi-service data scheduling method according to any one of claims 1 to 6 when executed by a processor.

Images