Deterministic service flow scheduling method, apparatus, device, and storage medium

Abstract

The application provides a deterministic service flow scheduling method and device, equipment and a storage medium. The method responds to access application information sent by a service device end, identifies the service device end according to the access application information, and judges whether the service device end is a registered device. If the service device end is a registered device, linear programming solving processing is performed using an interior point method according to the recorded access application information and the access application information, to obtain scheduling configuration information. The scheduling configuration information is subjected to consistency inspection to judge whether there is a resource overflow condition. If there is no resource overflow condition, the scheduling configuration information and the access application information are sent to a target service device end and a target network forwarding device end corresponding to a predicted allocation resource combination, to realize service flow scheduling.

Description

TECHNICAL FIELD

[0001] The present application relates to the field of communication technology, in particular to a deterministic service flow scheduling method, device and equipment and storage medium. BACKGROUND

[0002] The deterministic network is relative to the traditional best effort network. The problem of the best effort network is that the stability of data transmission is not enough, such as the bandwidth is high sometimes and low sometimes; the time delay is long sometimes and short sometimes; the most typical best effort network is the Internet. The Internet can meet many life applications, such as browsing web pages, sending and receiving emails, watching network videos, etc. The requirement for transmission is not high. With the development of industrial Internet, such as remote control, remote medical treatment, industrial automation and Internet of vehicles, the best effort network cannot meet the demand, so the network is required to be deterministic. The deterministic network requires to provide bandwidth guarantee, time delay determination and other deterministic services for data transmission.

[0003] The traditional deterministic service flow scheduling mechanism usually works in a small-scale network, adopts a centralized offline scheduling mode: stopping all current service flow transmission before the deployment of service flow; the controller obtains the relevant information of all service flows before the scheduling starts; in the scheduling process, the path and time slot resource of all service flows are calculated at one time according to the setting of the target function (such as energy consumption, throughput, etc.); after the calculation is completed, the relevant configuration information (including the transmission path and time slot resource of each service flow) is sent to the service device and data plane device; the service flow is forwarded according to the configuration information obtained by calculation, to realize end-to-end deterministic transmission (i.e. end-to-end time delay, jitter and bounded bandwidth lossless transmission).

[0004] However, the current scheduling mode cannot adapt to the wide-area deterministic service flow scheduling scene, and it is difficult to guarantee the network performance. SUMMARY

[0005] The present application provides a deterministic service flow scheduling method, device, equipment and storage medium, thereby solving the technical problem that the current scheduling mode cannot adapt to the wide-area deterministic service flow scheduling scene and it is difficult to guarantee the network performance.

[0006] In a first aspect, the present application provides a deterministic service flow scheduling method, comprising:

[0007] In response to the access application information sent by the service device end, the service device end is identified according to the access application information, and it is judged whether the service device end is a registered device, wherein the access application information includes service flow identity number information, weight, arrival time information, source node information, destination node information, load information and sending cycle information;

[0008] If the service device end is a registered device, linear programming solving processing is performed on the recorded admission request information and the admission request information using the interior point method to obtain scheduling configuration information, wherein the recorded admission request information is historical admission request information or simulated admission request information;

[0009] Consistency verification is performed on the scheduling configuration information to determine whether there is a resource overflow situation;

[0010] If there is no resource overflow situation, the scheduling configuration information and the admission request information are sent to the target service device end and the target network forwarding device end corresponding to the predicted allocation resource combination to realize service flow scheduling.

[0011] Here, the present application can realize high-performance online scheduling of wide-area deterministic networks. According to the related information of the service flow, corresponding scheduling configuration information is generated. Specifically, the interior point method is used for linear programming solving processing on the admission request information sent by the service device end in combination with historical admission request information or simulated admission request information, the network resource utilization is determined, the access application of part of the service flow with low weight is rejected, resources are reserved for subsequent service flow with high weight, and consistency verification is performed on the scheduling configuration information to complete accurate screening of the scheduling configuration information, realize accurate resource allocation of the admitted service flow, guarantee the scheduling performance, and the online scheduling mode can adapt to the dynamic changing wide-area deterministic service flow scheduling scene, and can support the simultaneous scheduling of a large number of service flows.

[0012] Optionally, the linear programming solving processing using the interior point method on the recorded admission request information and the admission request information to obtain the scheduling configuration information comprises:

[0013] When the admission request information corresponds to a service flow, D-1 recorded service flow information is randomly obtained from the recorded admission request information to obtain a first set , wherein D is a positive integer;

[0014] The service flow information corresponding to the admission request information is added to the first set to obtain a second set including D service flow information;

[0015] Linear programming solving processing is performed on the service flow information in the second set using the interior point method to obtain at least one resource combination B;

[0016] The scheduling configuration information is determined according to the at least one resource combination B .

[0017] Wherein, the application adds to the set where the record service flow information is located, and multiple resource combinations can be obtained through linear programming solving processing by the interior point method, so that the resource scheduling scheme selected by the service flow can be determined comprehensively and accurately, the accuracy of the deterministic service flow scheduling and the feasibility of the scheme are further improved, the resource is reasonably configured, and the network performance is improved.

[0018] Optionally, the scheduling configuration information is determined according to the at least one resource combination B , comprising:

[0019] According to the result of the linear programming solving processing, the probability that the service flow corresponding to the admission application information selects each resource combination B is determined;

[0020] According to the probability random sampling, the scheduling configuration information is obtained .

[0021] Wherein, according to the probability random sampling, the scheduling configuration information is obtained, the suitable resource configuration path can be effectively screened, the accuracy of the deterministic service flow scheduling and the feasibility of the scheme are further improved, the resource is reasonably configured, and the network performance is improved.

[0022] Optionally, before the business device end is identified according to the admission application information, and it is judged whether the business device end is a registered device, the method further comprises:

[0023] For at least one of the possible entry, exit and trigger time of all service flows, all feasible resource allocation modes are exhausted.

[0024] Here, the offline service scheduling is performed before all service flows arrive, all feasible resource allocation modes are exhausted for the possible entry, exit and trigger time of all service flows, the scheduling of the offline deterministic service flow can be realized, the optional resource configuration mode is determined, and a foundation is provided for online scheduling.

[0025] Optionally, after the scheduling configuration information and the admission application information are sent to the target business device end and the target network forwarding device end corresponding to the predicted allocation resource combination to realize the service flow scheduling if there is no resource overflow, the method further comprises:

[0026] If there is a resource overflow, the service flow corresponding to the admission application information is rejected.

[0027] Optionally, after the business device end is identified according to the admission application information, and it is judged whether the business device end is a registered device in response to the admission application information sent by the business device end, the method further comprises:

[0028] If the service device end is an unregistered device, the service flow access corresponding to the access application information is rejected.

[0029] In a second aspect, the present application provides a deterministic service flow scheduling device, comprising:

[0030] A service flow security detection module is configured to identify the service device end according to the access application information sent by the service device end, and determine whether the service device end is a registered device, wherein the access application information comprises service flow identity number information, weight, arrival time information, source node information, destination node information, load information and sending period information.

[0031] A resource scheduling calculation module is configured to, if the service device end is a registered device, use interior point method for linear programming solution processing according to the record access application information and the access application information, to obtain scheduling configuration information, wherein the record access application information is historical access application information or simulated access application information.

[0032] A consistency checking module is configured to check the consistency of the scheduling configuration information, and determine whether there is resource overflow.

[0033] A scheduling configuration information issuing module is configured to, if there is no resource overflow, send the scheduling configuration information and the access application information to the target service device end and the target network forwarding device end corresponding to the predicted allocation resource combination, to realize service flow scheduling.

[0034] Optionally, the resource scheduling calculation module is specifically configured to:

[0035] When the service flow corresponding to the access application information arrives, D-1 record service flow information is randomly obtained from the record access application information, to obtain a first set , wherein D is a positive integer.

[0036] The service flow information corresponding to the access application information is added to the first set , to obtain a second set including D service flow information.

[0037] According to the service flow information in the second set , interior point method is used for linear programming solution processing, to obtain at least one resource combination B.

[0038] According to the at least one resource combination B, scheduling configuration information is determined.

[0039] Optionally, the resource scheduling calculation module is further specifically configured to:

[0040] determining a probability of selecting each of the resource combinations B by the service flow corresponding to the admission application information according to a result of the linear programming solution processing;

[0041] obtaining the scheduling configuration information by random sampling according to the probability .

[0042] Optionally, before the service flow security detection module identifies the service device end according to the admission application information and judges whether the service device end is a registered device, the apparatus further comprises:

[0043] The offline scheduling module is configured to exhaustively list all feasible resource allocation manners for at least one of possible entry, exit and trigger time of all service flows.

[0044] Optionally, after the scheduling configuration information issuing module sends the scheduling configuration information and the admission application information to the target service device end and the target network forwarding device end corresponding to the intended allocation resource combination to realize service flow scheduling if there is no resource overflow, the apparatus further comprises:

[0045] The first rejection access module is configured to reject the service flow corresponding to the admission application information if there is resource overflow.

[0046] Optionally, after the service flow security detection module identifies the service device end according to the admission application information and judges whether the service device end is a registered device in response to the admission application information sent by the service device end, the apparatus further comprises:

[0047] The second rejection access module is configured to reject the service flow corresponding to the admission application information if the service device end is an unregistered device.

[0048] In a third aspect, the present application provides a deterministic service flow scheduling device, comprising at least one processor and a memory.

[0049] The memory stores computer execution instructions.

[0050] The at least one processor executes the computer execution instructions stored in the memory, so that the at least one processor executes the deterministic service flow scheduling method as described in the above first aspect and various possible designs of the first aspect.

[0051] In a fourth aspect, the present application provides a computer readable storage medium, wherein the computer readable storage medium stores computer execution instructions, and when a processor executes the computer execution instructions, the deterministic service flow scheduling method as described in the above first aspect and various possible designs of the first aspect is realized.

[0052] In a fifth aspect, the present application provides a computer program product comprising a computer program which, when executed by a processor, implements the deterministic traffic flow scheduling method according to the first aspect and various possible designs of the first aspect.

[0053] The deterministic traffic flow scheduling method, device, equipment and storage medium provided by the present application can realize high-performance online scheduling of a wide-area deterministic network. According to the related information of a traffic flow, corresponding scheduling configuration information is generated. Specifically, the admission application information sent by a traffic device end is processed by using an interior point method for linear programming solving, the network resource utilization status is determined, the admission application of a traffic flow with a low weight is rejected, resources are reserved for a traffic flow with a high weight, and consistency verification is performed on the scheduling configuration information, so that accurate selection of the scheduling configuration information is completed, accurate resource allocation of an admitted traffic flow is realized, scheduling performance is guaranteed, and the online scheduling mode can adapt to a dynamically changing wide-area deterministic traffic flow scheduling scenario and support simultaneous scheduling of a large number of traffic flows. BRIEF DESCRIPTION OF DRAWINGS

[0054] In order to more clearly illustrate the technical solutions in the embodiments of the present application or the prior art, the drawings needed in the embodiments or prior art description will be briefly introduced. Obviously, the drawings in the following description are only some embodiments of the present application, and other drawings can be obtained by those skilled in the art without creative labor.

[0055] Figure 1 A schematic diagram of a deterministic traffic flow scheduling system architecture is provided for the embodiments of the present application.

[0056] Figure 2 A flowchart of a deterministic traffic flow scheduling method is provided for the embodiments of the present application.

[0057] Figure 3 A structure diagram of a deterministic traffic flow scheduling device is provided for the embodiments of the present application.

[0058] Figure 4 A structure diagram of a deterministic traffic flow scheduling device is provided for the embodiments of the present application.

[0059] The above-described drawings have shown the specific embodiments of the present disclosure, and will be described in more detail hereinafter. These drawings and textual descriptions are not intended to limit the scope of the present disclosure by any means, but to illustrate the concept of the present disclosure to those skilled in the art by referring to specific embodiments. DETAILED DESCRIPTION

[0060] The exemplary embodiments will be described in detail herein with reference to the attached drawings. In the following description, like reference numerals refer to like elements, unless the context clearly dictates otherwise. The following description of exemplary embodiments is not representative of all possible embodiments consistent with the present disclosure. Instead, it is merely intended to provide an example of devices and methods consistent with some aspects of the present disclosure as detailed in the appended claims.

[0061] The terms "first", "second", "third", and "fourth" and the like, if any, in the description and in the claims of the present disclosure, and above drawings if any, are used for distinguishing between similar elements and not necessarily for describing a particular sequential or chronological order. It is to be understood that the use of the terms so construed herein is merely for descriptive purposes and claims should be understood not to be limited to the described order or sequence, unless stated otherwise. Furthermore, the terms "comprise", "to comprise", "comprising", "include", "to include", "including", "contain", "to contain", "containing", "characterized by", "characterized by", "have", and "to have" and any variations thereof in the description and in the claims of the present disclosure, and above drawings if any, are intended to cover a non-exclusive inclusion, such that a process, method, system, product, or apparatus that comprises a list of elements is not necessarily limited to those elements but can include other elements not expressly listed or inherent to such process, method, system, product, or apparatus.

[0062] It should be noted that the user information (including but not limited to user equipment information, user personal information, etc.) and data (including but not limited to data for analysis, stored data, displayed data, etc.) involved in the present disclosure are all information and data authorized by the user or authorized by all parties, and the collection, use and processing of related data need to comply with relevant laws, regulations and standards, and provide corresponding operation portal for user to choose authorization or rejection.

[0063] Traditional deterministic traffic scheduling mechanism usually works in small-scale network, using centralized offline scheduling mode: stop all current traffic transmission before traffic deployment; controller obtains all traffic information before scheduling starts; according to the setting of objective function, calculate the path and time slot resource of all traffic at one time during scheduling; after calculation, send the related configuration information to traffic device and data plane device; traffic performs corresponding cyclic forwarding according to the configuration information obtained by calculation, to realize end-to-end deterministic transmission. Current scheduling mode cannot adapt to wide-area deterministic traffic scheduling scenario, the reasons include: in wide-area network transmission scenario, the number of traffic links is huge, traditional offline scheduling algorithm cannot support the simultaneous scheduling of massive traffic; in wide-area network transmission scenario, traffic is in dynamic change state for a long time, which is not suitable for offline scheduling mode.

[0064] Partially scheduled systems use heuristic online scheduling methods, which can achieve low complexity online scheduling. However, wide-area deterministic networks are usually used to support time-sensitive application scenarios (such as remote driving, remote surgery, and remote industrial control). Such scenarios have certain requirements for the scheduling performance of the network system. The current heuristic scheduling method cannot guarantee the scheduling performance and may cause serious performance degradation and resource waste. Therefore, there may be problems in supporting corresponding scenarios. Partial wide-area scheduling systems use a primal-dual algorithm framework for online resource allocation, which can balance the low complexity and analyzability of scheduling. However, in order to guarantee the worst-case algorithm performance, the resource allocation of such algorithms is usually too conservative, resulting in a large amount of resource waste in most cases and failing to achieve efficient service flow scheduling. In view of the above, the current scheduling mode cannot adapt to the wide-area deterministic service flow scheduling scenario and cannot guarantee the network performance.

[0065] To solve the above problems, the embodiments of the present application provide a deterministic service flow scheduling method, device and equipment and storage medium, wherein the method combines historical admission request information or simulated admission request information, uses interior point method for linear programming solution processing on the admission request information sent by the service device end, determines the network resource utilization, rejects the access application of the service flow with low weight according to the network resource utilization, reserves resources for the subsequent service flow with high weight, and performs consistency verification on the scheduling configuration information, completes accurate screening of the scheduling configuration information, realizes accurate resource allocation of the admitted service flow, guarantees the scheduling performance, and the online scheduling mode can adapt to the dynamic wide-area deterministic service flow scheduling scenario and support simultaneous scheduling of a large number of service flows.

[0066] Optionally, Figure 1 A deterministic service flow scheduling system architecture diagram is provided for the embodiments of the present application. In Figure 1 The above architecture includes a scheduling end 101, a first service device end 102, a first network forwarding device end 103, a second network forwarding device end 104, a third network forwarding device end 105, and a second service device end 106.

[0067] The scheduling end 101 includes a service flow security detection module 1011, a resource scheduling calculation module 1012, a consistency verification module 1013, and a scheduling configuration information issuing module 1014.

[0068] It can be understood that the number of service device ends (which can be source nodes or destination nodes) and network forwarding device ends can be determined according to actual conditions. Figure 1 The above is only an example.

[0069] It is understood that the implementation of the scheduling terminal 101 and its structure and internal module groups does not impose specific limitations. Figure 1 This is just an example.

[0070] The various devices and modules mentioned above can exchange information with each other. One possible connection relationship is shown below. Figure 1 .

[0071] Optionally, before transmitting a deterministic service flow, the service device sends a service flow admission request to the scheduling module, including service flow identity document (ID) information, weight, arrival time information, source node / destination node information, load information, transmission period information, etc. After receiving the admission request, the scheduling module obtains the service flow information, and based on the current device status and resource utilization in the network, obtains the transmission path and time slot according to the corresponding algorithm, and sends them to the service device and network forwarding device or user terminal. The service device and network forwarding device perform deterministic service flow transmission according to the sent scheduling configuration information. If the request is rejected, the service device leaves the network.

[0072] In one possible implementation, the functions of each part of the system are as follows:

[0073] Service equipment end: The service equipment end requests network resources from the scheduling end to transmit deterministic service flows and obtains end-to-end deterministic network services with bounded latency and jitter from the network.

[0074] Network forwarding device: Based on deterministic forwarding standards, the network forwarding device obtains forwarding configuration files from the scheduling end and performs time-slot-based deterministic service flow forwarding, providing end-to-end deterministic network services with bounded latency and jitter. Simultaneously, the forwarding device supports in-band network telemetry (INT) protocol capabilities.

[0075] Scheduling Terminal: The scheduling terminal is responsible for resource allocation for deterministic service flows. Based on network resource utilization, it rejects access requests from some low-weight service flows and reserves resources for subsequent high-weight service flows. It allocates resources for incoming service flows, generates corresponding scheduling configuration information based on the relevant information of the service flows, and informs the deterministic devices of the corresponding configuration information.

[0076] The scheduling module is specifically divided into a business flow security detection module, a resource scheduling calculation module, a consistency verification module, and a scheduling configuration information distribution module.

[0077] The business flow security detection module is responsible for determining whether a business flow has been registered in advance. If it has been registered in advance, the process proceeds to the resource scheduling stage; otherwise, the process terminates.

[0078] The resource scheduling calculation module is the core of the scheduling end, is responsible for running the online scheduling mechanism, and is also responsible for recording historical / simulated business flow data and providing data support to the resource scheduling calculation submodule. Optionally, the resource scheduling calculation module can include a resource scheduling calculation submodule and an observation recording function submodule. The resource scheduling calculation submodule is responsible for running the online scheduling mechanism, and the observation recording function submodule is responsible for recording historical / simulated business flow data and providing data support to the resource scheduling calculation submodule.

[0079] The consistency checking module is configured to check the consistency of the scheduling configuration information and determine whether there is resource overflow.

[0080] The scheduling configuration information issuing module is configured to issue the scheduling configuration information calculated by the resource scheduling calculation submodule to the corresponding forwarding device in the data plane and the source node / destination node of the business flow.

[0081] In the above modules, the business flow security detection module can directly follow the relevant standards of IEEE 802.1Qci to execute; the scheduling configuration information issuing module and the consistency checking module can directly follow the relevant standards of IEEE 802.1Qcc to execute.

[0082] Optionally, the scheduling end can be realized by a processor reading instructions in a memory and executing the instructions, or can be realized by a chip circuit. The scheduling end can be a server, a terminal device, or a processor of the server or the terminal device.

[0083] It can be understood that the structure illustrated in the embodiments of the present application does not constitute a specific limitation on the architecture of the deterministic business flow scheduling system. In other feasible embodiments of the present application, the above architecture can include more or fewer components than the illustrated components, or some components can be combined, or some components can be split, or different components can be arranged, and the specific arrangement can be determined according to the actual application scenario, which is not limited herein. Figure 1 The components shown can be realized in hardware, software, or a combination of software and hardware.

[0084] In addition, the network architecture and business scenarios described in the embodiments of the present application are used to more clearly illustrate the technical solutions of the embodiments of the present application, and do not constitute a limitation on the technical solutions provided by the embodiments of the present application. It can be known by those skilled in the art that, as the network architecture evolves and new business scenarios appear, the technical solutions provided by the embodiments of the present application are also applicable to similar technical problems.

[0085] The technical solutions of the present application will be described in detail below in combination with specific embodiments:

[0086] Optionally, Figure 2This is a flowchart illustrating a deterministic service flow scheduling method provided in an embodiment of this application. The execution entity of this embodiment can be... Figure 1 The scheduling terminal 101 in the code can be used as the specific execution entity, which can be determined based on the actual application scenario. For example... Figure 2 As shown, the method includes the following steps:

[0087] S201: In response to the access request information sent by the service device, identify the service device based on the access request information and determine whether the service device is a registered device.

[0088] The access application information includes business flow identification number information, weight, arrival time information, source node information, destination node information, load information, and transmission cycle information.

[0089] Optionally, after responding to the access request information sent by the service device, identifying the service device based on the access request information, and determining whether the service device is a registered device, the method further includes: if the service device is an unregistered device, then rejecting the access of the service flow corresponding to the access request information.

[0090] Optionally, before identifying the business device based on the access application information and determining whether the business device is a registered device, the method further includes: exhaustively listing all feasible resource allocation methods for at least one of the possible entry, exit and trigger time of all business flows.

[0091] Here, in this embodiment of the application, offline service scheduling is performed before all service flows arrive. For all possible entry points, exit points and trigger times of all service flows, all feasible resource allocation methods are exhaustively listed, which can realize the scheduling of offline deterministic service flows, determine the optional resource configuration methods, and also provide a basis for online scheduling.

[0092] S202: If the service device is a registered device, then based on the recorded access application information and access application information, use the interior point method to perform linear programming to obtain the scheduling configuration information.

[0093] Among them, the recorded access application information includes historical access application information or simulated access application information.

[0094] Optionally, based on the recorded access application information and the access application information, linear programming is performed using the interior-point method to obtain scheduling configuration information, including: when the business flow corresponding to the access application information arrives, D-1 records of business flow information are randomly selected from the recorded access application information to obtain a first set. Add the business flow information corresponding to the access application information to the first set. This yields a second set containing information on D business flows. According to the second set the service flow information in the first set, using the interior point method to perform linear programming solving processing, at least one resource combination B; determining the scheduling configuration information according to the at least one resource combination B , wherein D is a positive integer.

[0095] , wherein, is the first set, is the second set, B is a resource combination, is the scheduling configuration information.

[0096] According to the embodiments of the present application, the linear programming solving processing is performed by adding the record service flow information to the set, and multiple resource combinations are obtained, so that the resource scheduling scheme of the service flow is determined comprehensively and accurately, the accuracy of the deterministic service flow scheduling and the feasibility of the scheme are further improved, the resource is reasonably configured, and the network performance is improved.

[0097] Optionally, the scheduling configuration information is determined according to the at least one resource combination B , including: determining the probability of selecting each resource combination B by the service flow corresponding to the admission application information according to the result of the linear programming solving processing; and obtaining the scheduling configuration information according to the probability random sampling .

[0098] According to the embodiments of the present application, the scheduling configuration information is obtained according to the probability random sampling, the suitable resource configuration path is effectively screened, the accuracy of the deterministic service flow scheduling and the feasibility of the scheme are further improved, the resource is reasonably configured, and the network performance is improved.

[0099] S203: performing consistency verification on the scheduling configuration information, and judging whether there is a resource overflow situation.

[0100] S204: if there is no resource overflow situation, sending the scheduling configuration information and the admission application information to the target service device end and the target network forwarding device end corresponding to the predicted allocation resource combination, so as to implement the service flow scheduling.

[0101] ​Here, the embodiment of the application can realize high-performance online scheduling of wide-area deterministic network, generate corresponding scheduling configuration information according to related information of service flow, specifically, linear programming solving processing is performed on the admission application information sent by the service device end by using the interior point method in combination with historical admission application information or simulated admission application information, network resource utilization is determined, access application of service flow with low weight is rejected according to the network resource utilization, resources are reserved for subsequent service flow with high weight, consistency check is performed on the scheduling configuration information, accurate screening of the scheduling configuration information is completed, accurate resource allocation of the admitted service flow is realized, scheduling performance is guaranteed, and the online scheduling mode can adapt to the dynamic change of the wide-area deterministic service flow scheduling scene, and can support simultaneous scheduling of a large amount of service flow.

[0102] Optionally, if there is no resource overflow, the scheduling configuration information and the admission application information are sent to the target service device end and the target network forwarding device end corresponding to the predicted allocation resource combination, so that after the service flow scheduling, the method further includes: if there is a resource overflow, the service flow corresponding to the admission application information is rejected.

[0103] In a possible implementation, the scheduling end determines the deterministic service flow scheduling method as follows:

[0104] Step one: after receiving the admission application information, it is judged whether the service flow has been registered in advance through the service flow ID information in the admission application information. If yes, the resource scheduling link is entered, otherwise the process is terminated.

[0105] Step two: collect the admission application information submitted by the previous service flow, including service flow ID information, weight, arrival time information, source node / destination node information, load information, and sending period information. Before all service flows arrive, at least D admission application information of the previous service flow (which can be simulated service flow information or historically observed service flow information) is ensured in the sub-module.

[0106] Step three: service flow online scheduling process. The online scheduling algorithm is divided into offline part and online part:

[0107] The offline part (i.e. executed before all service flows arrive) is aimed at all possible entry / exit / trigger time of all service flows, exhaustively enumerates all feasible resource allocation modes, denoted as , (D represents the set of source nodes, represents the set of destination nodes, and C is the set of all trigger times) The specific steps are as follows:

[0108] Step 3.01: Enumerate all feasible paths from to using depth-first search algorithm, denoted as .

[0109] Step 3.02: For any path , calculate the occupied link slots hop-by-hop using different trigger times .

[0110] Therefore, can be represented as . Wherein, is the resource combination using transmission path , trigger time , denoted as:

[0111]

[0112] Wherein, is the time slot mapping function defined in the deterministic mechanism. Wherein, represents the link, represents the time slot index occupied by the service flow on the link .

[0113] In the online part (i.e. when the service flow arrives, the online part is executed), when the service flow arrives, the online part calculates the flow as follows:

[0114] Step 3.11: Randomly extract D-1 historical service flow data, denoted as the first set T1.

[0115] Step 3.12: Record the information of the current newly arrived service flow in the first set T1. At this time, there are D service flow information in the second set T2. At the same time, the newly arrived service flow information is saved.

[0116] Step 3.13: According to the service flow information in the second set T2, use the interior point method to solve the following linear programming problem:

[0117]

[0118] Wherein, the set is the feasible resource allocation mode of the service flow (matched from in the offline part according to the entry / exit / trigger time of the service flow ). The symbol represents whether the resource combination B involves the resource . If Then resource combination B contains resources Otherwise, resource combination B does not contain resources. .

[0119] Step 3.14: Based on business flow The result obtained in step 3.13 To obtain the corresponding expected resource allocation combination Specifically, will Treat as a business flow Select resource combination Based on the probability, random sampling is performed to obtain the expected resource allocation combination. .

[0120] Step 3.15: Combine the expected resource allocation As scheduling configuration information.

[0121] Step 3.16: Check scheduling configuration information Will the corresponding resources overflow? If overflow occurs, then the business flow will be rejected. Access; otherwise, integrate with the business flow. The submitted access application information is sent together with the scheduling configuration information. The involved business equipment and network forwarding equipment.

[0122] The following is combined Figure 1 An example is provided to illustrate a method for deterministic service flow scheduling by a scheduling terminal:

[0123] First, the network is initialized as a whole, including network device configuration, determination of deterministic forwarding mechanism, and determination of deterministic forwarding configuration information (including forwarding time slots). (etc.) Large resource allocation window wait.

[0124] Secondly, the scheduling terminal 101 collects historical observation data.

[0125] The resource scheduling calculation module 1012 in the scheduling terminal 101 exhaustively searches for all possible entry / exit / trigger times in the network. . Figure 1 In the process, possible entry points include the first service device terminal 102 and the second service device terminal 106, possible exit points include the first service device terminal 102 and the second service device terminal 106, and possible trigger times include... ,in .

[0126] When a service flow arrives online, the first service device 102 submits a service flow access application to the service flow security detection module 1011 in the scheduling terminal 101, including service flow ID information, weight, arrival time information, source node / destination node information, load information, and sending cycle information.

[0127] The service flow security detection module 1011 performs security checks on services based on the IEEE 802.1Qci protocol. If no security issues are found, the service flow admission request is forwarded to the resource scheduling calculation module 1012.

[0128] The resource scheduling calculation module 1012 queries D-1 random historical business flow information. Combined with the current business flow information, it forms the first set T1.

[0129] The resource scheduling calculation module 1012 uses the interior-point method to solve a linear programming problem based on D service flow information in the first set T1. It then randomly selects the corresponding service flow based on the linear programming result. and will Send to consistency verification module 1013.

[0130] Finally, the consistency check module 1013 performs the check. Check if the corresponding resources will overflow. If overflow occurs, the current service flow will be denied access; otherwise, the scheduling configuration information distribution module 1014 will distribute the information along with the access request submitted by the current service flow to [the relevant department / entity]. This involves both the service equipment and the network forwarding equipment. Finally, the service equipment begins data transmission.

[0131] Figure 3 A schematic diagram of a deterministic service flow scheduling device provided in an embodiment of this application is shown below. Figure 3 As shown, the apparatus in this embodiment includes: a service flow security detection module 1011, a resource scheduling calculation module 1012, a consistency verification module 1013, and a scheduling configuration information distribution module 1014. The deterministic service flow scheduling apparatus described above can be... Figure 1 The scheduling terminal 101 itself, or the chip or integrated circuit that implements the functions of the scheduling terminal 101, or the server. It should be noted that the division of the business flow security detection module 1011, resource scheduling calculation module 1012, consistency verification module 1013 and scheduling configuration information distribution module 1014 is only a logical functional division. Physically, the two can be integrated or independent.

[0132] The service flow security detection module is configured to, in response to the access application information sent by the service device end, identify the service device end according to the access application information, and determine whether the service device end is a registered device, wherein the access application information comprises service flow identity number information, weight, arrival time information, source node information, destination node information, load information and sending period information.

[0133] The resource scheduling calculation module is configured to, if the service device end is a registered device, perform linear programming solving processing on the recorded access application information and the access application information by using an interior point method, to obtain scheduling configuration information, wherein the recorded access application information is historical access application information or simulated access application information.

[0134] The consistency checking module is configured to perform consistency checking on the scheduling configuration information, and determine whether there is a resource overflow condition.

[0135] The scheduling configuration information issuing module is configured to, if there is no resource overflow condition, send the scheduling configuration information and the access application information to the target service device end and the target network forwarding device end corresponding to the predicted allocation resource combination, to implement service flow scheduling.

[0136] Optionally, the resource scheduling calculation module is specifically configured to:

[0137] When the service flow corresponding to the access application information arrives, D-1 recorded service flow information is randomly obtained from the recorded access application information, to obtain a first set , wherein D is a positive integer.

[0138] The service flow information corresponding to the access application information is added to the first set , to obtain a second set including D service flow information.

[0139] The service flow information in the second set is used to perform linear programming solving processing on at least one resource combination B by using an interior point method.

[0140] The scheduling configuration information is determined according to the at least one resource combination B.

[0141] Optionally, the resource scheduling calculation module is further specifically configured to:

[0142] The probability of each resource combination B selected by the service flow corresponding to the access application information is determined according to the result of the linear programming solving processing.

[0143] The scheduling configuration information is obtained by random sampling according to the probability.

[0144] ​​Optionally, before the service flow security detection module identifies the service device end according to the access application information and judges whether the service device end is a registered device, the apparatus further comprises:

[0145] The offline scheduling module is configured to exhaustively list all feasible resource allocation manners for at least one of the possible ingress, egress and trigger time of all service flows.

[0146] Optionally, after the scheduling configuration information issuing module sends the scheduling configuration information and the access application information to the target service device end and the target network forwarding device end corresponding to the predicted resource combination in case of no resource overflow, the apparatus further comprises:

[0147] The first access rejection module is configured to reject the service flow corresponding to the access application information in case of resource overflow.

[0148] Optionally, after the service flow security detection module identifies the service device end according to the access application information sent by the service device end and judges whether the service device end is a registered device, the apparatus further comprises:

[0149] The second access rejection module is configured to reject the service flow corresponding to the access application information in case that the service device end is an unregistered device.

[0150] Reference Figure 4 Fig. 4 shows a structural diagram of a deterministic service flow scheduling device 400 suitable for implementing the embodiments of the present disclosure. The deterministic service flow scheduling device 400 can be a terminal device or a server. The terminal device can include, but is not limited to, a mobile terminal such as a mobile phone, a notebook computer, a digital broadcast receiver, a Personal Digital Assistant (PDA), a Portable Android Device (PAD), a Portable Media Player (PMP), a vehicle-mounted terminal (e.g., a vehicle-mounted navigation terminal), and the like, and a fixed terminal such as a digital TV, a desktop computer, and the like. Figure 4 The deterministic service flow scheduling device shown is merely an example and should not impose any limitation on the functions and use range of the embodiments of the present disclosure.

[0151] As Figure 4As shown, the deterministic traffic flow scheduling device 400 can include a processing device (e.g., a central processing unit, a graphics processing unit, etc.) 401 that can perform various appropriate actions and processes according to programs stored in a Read Only Memory (ROM) 402 or loaded from a storage device 408 into a Random Access Memory (RAM) 403. Various programs and data required for the operation of the deterministic traffic flow scheduling device 400 are also stored in the RAM 403. The processing device 401, the ROM 402, and the RAM 403 are connected to each other through a bus 404. An input / output (I / O) interface 405 is also connected to the bus 404.

[0152] Generally, the following devices can be connected to the I / O interface 405: input devices 406 including, for example, a touch screen, a touch pad, a keyboard, a mouse, a camera, a microphone, an accelerometer, a gyroscope, etc.; output devices 407 including, for example, a Liquid Crystal Display (LCD), a speaker, a vibrator, etc.; storage devices 408 including, for example, a magnetic tape, a hard disk, etc.; and communication devices 409. The communication devices 409 can allow the deterministic traffic flow scheduling device 400 to communicate wirelessly or wired with other devices to exchange data. Although Figure 4 The deterministic traffic flow scheduling device 400 is shown with various devices, but it should be understood that not all of the shown devices are required to be implemented or present. More or fewer devices can alternatively be implemented or present.

[0153] In particular, the processes described above with reference to the flowcharts can be implemented as a computer software program according to embodiments of the present disclosure. For example, embodiments of the present disclosure include a computer program product comprising a computer program carried on a computer readable medium, the computer program containing program code for performing the methods illustrated by the flowcharts. In such embodiments, the computer program can be downloaded and installed from a network through the communication devices 409, or installed from the storage devices 408, or installed from the ROM 402. When the computer program is executed by the processing device 401, the above-mentioned functions defined in the methods of embodiments of the present disclosure are performed.

[0154] It is noted that the computer-readable medium described above can be a computer-readable signal medium or a computer-readable storage medium, or any combination thereof. The computer-readable storage medium can be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any suitable combination of the foregoing. More specific examples of a computer-readable storage medium can include, but are not limited to, an electrical connection having one or more wires, a portable computer diskette, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or Flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the present disclosure, a computer-readable storage medium can be any tangible medium that can contain or store a program for use by or in connection with an instruction execution system, apparatus, or device. In the present disclosure, a computer-readable signal medium can include a computer-readable storage medium in baseband or propagated as a carrier wave in a propagated data signal, which can contain or store a program for use by or in connection with an instruction execution system, apparatus, or device. The computer-readable signal medium can be any computer-readable medium that is not a computer-readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. Program code embodied on a computer-readable medium can be transmitted using any appropriate medium, including but not limited to wireless, wireline, optical fiber cable, RF, etc., or any suitable combination of the foregoing.

[0155] The computer-readable medium described above can be included in the deterministic traffic flow scheduling device described above, or can exist separately from the deterministic traffic flow scheduling device.

[0156] The computer-readable medium described above carries one or more programs, which, when executed by the deterministic traffic flow scheduling device, cause the deterministic traffic flow scheduling device to perform the methods described in the embodiments above.

[0157] Computer program code for carrying out operations of the present disclosure can be written in any combination of one or more programming languages, including an object oriented programming language such as Java, Smalltalk, C++ or the like and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code can execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the latter scenario, the remote computer can be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or the connection can be made to an external computer (for example, through the Internet using an Internet Service Provider).

[0158] The flow diagrams and the block diagrams in the drawings are meant as possible implementations of systems, methods, and computer program products according to various embodiments of the present disclosure. In this regard, each block in the flow diagrams and the block diagrams can represent a module, a segment, or a portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that in some alternative implementations, the functions noted in the blocks can occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently or the blocks can sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and / or flow diagrams, and combinations thereof, can be implemented by special purpose hardware-based systems that perform the specified functions or operations, or combinations of special purpose hardware and computer instructions.

[0159] The units described in the embodiments of the present disclosure can be implemented by software, or by hardware. In some cases, the name of the unit does not constitute a limitation on the unit itself. For example, the first obtaining unit can also be described as a unit for obtaining at least two Internet protocol addresses.

[0160] The functions described above in the specification of the present disclosure can be performed by one or more hardware logic components. For example, and without limitation, illustrative types of hardware logic components that can be used include Field-programmable Gate Arrays (FPGAs), Program-specific Integrated Circuits (ASICs), Program-specific Standard Products (ASSPs), System-on-a-chip systems (SOCs), Complex Programmable Logic Devices (CPLDs), etc.

[0161] In the context of the present disclosure, a machine-readable medium can be a tangible medium that contains or stores a program for use by or in connection with an instruction execution system, apparatus, or device. The machine-readable medium can be a machine-readable signal medium or a machine-readable storage medium. A machine-readable medium can include, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any suitable combination of the foregoing. More specific examples of the machine-readable storage medium will include one or more of: a portable computer diskette, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.

[0162] The deterministic service flow scheduling device of the embodiments of the present application can be used to implement the technical solutions in the method embodiments of the present application, and has similar principles and technical effects, which will not be described here.

[0163] The embodiments of the present application also provide a computer readable storage medium, which stores computer execution instructions. When the computer execution instructions are executed by a processor, the computer execution instructions are used to implement the data processing method of any one of the above.

[0164] The embodiments of the present application also provide a computer program product, which includes a computer program. When the computer program is executed by a processor, the computer program is used to implement the data processing method of any one of the above.

[0165] In several embodiments provided in the present application, it should be understood that the disclosed system, device and method can be implemented in other manners. For example, the described device embodiments are merely schematic. For example, the division of the units is only a logical function division. There can be another division manner for the actual implementation. For example, a plurality of units or components can be combined or integrated into another system, or some features can be ignored or not executed. In addition, the displayed or discussed mutual couplings or direct couplings or communication connections can be indirect couplings or communication connections through some interfaces, devices or units, and can be electrical, mechanical or other forms.

[0166] In addition, each function unit in the embodiments of the present application can be integrated into a processing unit, or each unit can exist alone physically, or two or more units can be integrated into one unit. The above integrated unit can be implemented in the form of hardware, or can be implemented in the form of a software function unit.

[0167] Other embodiments of the disclosure will be apparent to those skilled in the art from consideration of the specification and practice of the features disclosed herein. It is intended that the specification and examples be considered as exemplary only, with a true scope and spirit of the disclosure being indicated by the following claims.

[0168] It should be understood that the present disclosure is not limited to the precise structures as herein described and illustrated in the drawings, and that various modifications and changes can be made without departing from its scope. The scope of the present disclosure is limited only by the claims that follow.

Claims

1. A deterministic traffic flow scheduling method, characterized by, The method comprises the following steps: In response to the access application information sent by the service device end, the service device end is identified according to the access application information, and it is judged whether the service device end is a registered device, wherein the access application information comprises service flow identity number information, weight, arrival time information, source node information, destination node information, load information and sending period information; If the service device end is a registered device, then according to the recorded access application information and the access application information, linear programming solving processing is performed using the interior point method to obtain scheduling configuration information, wherein the recorded access application information is historical access application information or simulated access application information; The scheduling configuration information is subjected to consistency checking to determine whether there is a resource overflow condition; If there is no resource overflow condition, the scheduling configuration information and the access application information are sent to the target service device end and the target network forwarding device end corresponding to the expected allocation resource combination to realize service flow scheduling; The method comprises the following steps: When the service flow corresponding to the access application information arrives, D-1 record service flow information is randomly obtained from the record access application information, to obtain a first set wherein D is a positive integer; adding service flow information corresponding to the access application information to the first set , obtaining a second set including D service flow information ; According to the second set of service flow information, linear programming solution processing is performed using an interior point method to obtain at least one resource combination B; According to the result of the linear programming solving processing, the probability of each resource combination B selected by the service flow corresponding to the access application information is determined; According to probabilistic random sampling, obtain a predicted allocated resource combination transmit the predicted allocated resource combination as scheduling configuration information.

2. The method of claim 1, wherein, Before the service device end is identified according to the access application information and it is judged whether the service device end is a registered device, the following step is further included: For at least one of all possible entry, exit and trigger time of the service flow, all feasible resource allocation modes are exhausted.

3. The method of claim 1, wherein, After the scheduling configuration information and the access application information are sent to the target service device end and the target network forwarding device end corresponding to the expected allocation resource combination to realize service flow scheduling if there is no resource overflow condition, the following step is further included: If there is a resource overflow condition, the service flow corresponding to the access application information is refused to access.

4. The method of claim 1, wherein, After the service device end is identified according to the access application information and it is judged whether the service device end is a registered device, the following step is further included: If the service device end is an unregistered device, the service flow corresponding to the access application information is refused to access.

5. A deterministic traffic flow scheduling apparatus, characterized by, The method comprises the following steps: The service flow security detection module is used to identify the service device end according to the access application information sent by the service device end, and judge whether the service device end is a registered device, wherein the access application information comprises service flow identity number information, weight, arrival time information, source node information, destination node information, load information and sending period information; The resource scheduling calculation module is used to perform linear programming solving processing using the interior point method according to the recorded access application information and the access application information to obtain scheduling configuration information if the service device end is a registered device, wherein the recorded access application information is historical access application information or simulated access application information; The consistency checking module is used to perform consistency checking on the scheduling configuration information to determine whether there is a resource overflow condition; The scheduling configuration information issuing module is configured to: if there is no resource overflow, send the scheduling configuration information and the admission request information to a target service device end and a target network forwarding device end corresponding to the predicted allocation resource combination, so as to realize service flow scheduling. The resource scheduling calculation module is specifically configured to: When the service flow corresponding to the access application information arrives, D-1 record service flow information is randomly obtained from the record access application information, to obtain a first set wherein D is a positive integer; adding service flow information corresponding to the access application information to the first set , obtaining a second set including D service flow information ; According to the service flow information in the second set , a linear programming solution process is performed using an interior point method to obtain at least one resource combination B; determine a probability of selecting each resource combination B by the service flow corresponding to the admission request information according to a result of linear programming solution processing; According to probabilistic random sampling, obtain a predicted allocated resource combination The predicted allocated resource combination As scheduling configuration information.

6. A deterministic traffic flow scheduling device, characterized by comprise: at least one processor; and a memory connected with the at least one processor in communication; wherein the memory stores instructions executable by the at least one processor, and the instructions are executed by the at least one processor to enable the at least one processor to perform the deterministic service flow scheduling method of any one of claims 1 to 4.

7. A computer readable storage medium characterized in that, The computer-readable storage medium stores computer execution instructions, and the computer execution instructions are executed by the processor to implement the deterministic service flow scheduling method of any one of claims 1 to 4.

8. A computer program product comprising a computer program, characterized in that, The computer program is executed by the processor to implement the deterministic service flow scheduling method of any one of claims 1 to 4.

Images