Network resource scheduling method and system, network controller, device and storage medium

Abstract

The application discloses a network resource scheduling method and system, a network controller, equipment and a storage medium, and belongs to the technical field of network communication. The network resource scheduling method comprises the following steps: setting corresponding access control information according to the cyclic queue queuing forwarding mechanism related parameters of each slice in the deterministic network and the access packet length interval; returning a slice access information table to an edge device sending an access request; receiving target slice identification and time-sensitive flow information sent by the edge device; the target slice identification is determined according to the slice access information table; judging whether the target slice corresponding to the target slice identification meets the constraint condition in the time-sensitive flow information; if yes, sending resource scheduling information to the target slice and allowing the edge device to access the target slice. The application can realize the efficient scheduling of the whole network resource under the premise of guaranteeing the deterministic requirement of the edge device business.

Description

TECHNICAL FIELD

[0001] The present application relates to the technical field of network communication, in particular to a network resource scheduling method and system, a network controller, a device and a storage medium. BACKGROUND

[0002] In order to meet the low-latency jitter, high reliability and other service requirements of network in the field of safety-critical and real-time applications, related technologies provide deterministic network technology, such as TSN (Time-sensitive Network) defined by IEEE 802.1 standard organization and DetNet (Deterministic Networking) proposed by IETF. In these deterministic implementation technologies, the cyclic queue queuing and forwarding technology is widely studied due to its simple and efficient traffic shaping and scheduling method.

[0003] The technology based on cyclic queue queuing and forwarding has the problem of needing to consider both the queue cycle period and the number of scheduled packets. That is, under the condition that the port rate and the number of queues are determined, if the queue cycle period value is reduced, the queue becomes shorter, although the node queue forwarding delay is reduced, but the long packet blocking queue will cause the packet to be unschedulable, reducing the number of schedulable packets; if the cycle period is increased, the queue becomes longer, although the tolerance to long packet bursts is increased, the number of schedulable packets is increased, but the node queuing and forwarding delay is increased, thereby causing the end-to-end delay to fail to meet the service requirements.

[0004] Therefore, how to realize efficient scheduling of the overall network resources while guaranteeing the determinacy requirements of edge device services is a technical problem that needs to be solved by those skilled in the art at present. SUMMARY

[0005] The purpose of the present application is to provide a network resource scheduling method, a network resource scheduling system, a network controller, an edge device, an electronic device and a storage medium, which can realize efficient scheduling of the overall network resources while guaranteeing the determinacy requirements of edge device services.

[0006] To solve the above technical problems, the present application provides a network resource scheduling method applied to a central network controller, the network resource scheduling method comprising:

[0007] Setting corresponding access control information according to the cyclic queue queuing and forwarding mechanism related parameters of each slice in the deterministic network and the access packet length interval;

[0008] Returning a slice access information table to the edge device sending the access request; the slice access information table includes the access control information of each slice;

[0009] receiving target slice identification and time sensitive flow information sent by the edge device; the target slice identification is determined according to the slice access information table;

[0010] judging whether the target slice corresponding to the target slice identification meets the constraint condition in the time sensitive flow information;

[0011] if yes, sending resource scheduling information to the target slice, and allowing the edge device to access the target slice.

[0012] Optionally, the access control information comprises slice identification, the access packet length interval, the type of the cyclic queue queuing forwarding mechanism, the access packet type and the maximum forwarding delay of nodes in the slice.

[0013] Optionally, before setting the corresponding access control information according to the cyclic queue queuing forwarding mechanism related parameters and the access packet length interval of each slice, the method further comprises:

[0014] obtaining the port transmission rate of nodes in each slice and the cyclic queue queuing forwarding mechanism related parameters from the deterministic network;

[0015] determining the access packet length interval according to the port transmission rate and the cyclic queue queuing forwarding mechanism related parameters.

[0016] Optionally, determining the access packet length interval according to the port transmission rate and the cyclic queue queuing forwarding mechanism related parameters comprises:

[0017] determining the maximum packet length that can be accessed according to the minimum schedulable packet number when the queue space is full, the queue cycle scheduling period in the cyclic queue queuing forwarding mechanism related parameters and the port transmission rate of nodes in the slice;

[0018] determining the access packet length interval according to the maximum packet length and the set minimum packet length.

[0019] Optionally, before judging whether the target slice corresponding to the target slice identification meets the constraint condition in the time sensitive flow information, the method further comprises:

[0020] determining the optimal path between the packet destination address and the source address in the time sensitive flow information based on a path search algorithm according to the slice topology and the queue resource occupation of the node outport in the slice;

[0021] calculating the packet end-to-end maximum delay according to the optimal path;

[0022] Correspondingly, judging whether the target slice corresponding to the target slice identification meets the constraint condition in the time sensitive flow information comprises:

[0023] determining whether the packet end-to-end maximum delay conforms to a packet end-to-end delay constraint in the time-sensitive flow information.

[0024] Optionally, the path search algorithm is used to determine an optimal path between a destination address and a source address in the time-sensitive flow information, comprising:

[0025] generating a directed graph of the target slice according to a slice topology and a node egress port queue resource occupation in the slice, wherein a weight of an edge of the directed graph is a number of allocatable node egress port queue resources in the target slice;

[0026] determining the optimal path between the destination address and the source address in the time-sensitive flow information based on the directed graph according to the path search algorithm;

[0027] Correspondingly, after determining that the packet end-to-end maximum delay conforms to the packet end-to-end delay constraint in the time-sensitive flow information, comprising:

[0028] decrementing the number of allocatable node egress port queue resources in the optimal path in the target slice by 1, and updating the directed graph of the target slice.

[0029] Optionally, after sending the resource scheduling information to the target slice, further comprising:

[0030] starting a resource occupation timer according to a packet transmission duration in the time-sensitive flow information;

[0031] if the started resource occupation timer expires, sending a re-access control command to the edge device.

[0032] The application further provides a network resource scheduling method applied to an edge device, comprising:

[0033] sending an access request to a central network controller so that the central network controller returns a slice access information table, wherein the slice access information table comprises access control information of each slice in a deterministic network, and the access control information is set according to a cyclic queue queuing and forwarding mechanism related parameter and an access packet length interval of each slice;

[0034] determining a target slice identifier according to the slice access information table, and sending the target slice identifier and time-sensitive flow information of a to-be-forwarded packet to the central network controller, so that the central network controller sends resource scheduling information to the target slice and allows the edge device to access the target slice after determining that the target slice corresponding to the target slice identifier conforms to a constraint condition in the time-sensitive flow information.

[0035] The application also provides a central network controller, comprising:

[0036] a slice access information control module, configured to set corresponding access control information according to the cyclic queue queuing forwarding mechanism related parameters of each slice in the deterministic network and the access packet length interval;

[0037] an access control module, configured to return a slice access information table to an edge device sending an access request, wherein the slice access information table comprises access control information of each slice; and further configured to receive target slice identification and time-sensitive flow information sent by the edge device, wherein the target slice identification is determined according to the slice access information table;

[0038] a slice resource scheduling control module, configured to determine whether a target slice corresponding to the target slice identification meets a constraint condition in the time-sensitive flow information; and further configured to send resource scheduling information to the target slice and allow the edge device to access the target slice if the target slice meets the constraint condition.

[0039] The application also provides an edge device, comprising:

[0040] a request module, configured to send an access request to a central network controller so that the central network controller returns a slice access information table, wherein the slice access information table comprises access control information of each slice in a deterministic network, and the access control information is set according to the cyclic queue queuing forwarding mechanism related parameters of each slice and the access packet length interval;

[0041] an information feedback module, configured to determine target slice identification according to the slice access information table, and send the target slice identification and time-sensitive flow information of a to-be-forwarded packet to the central network controller, so that the central network controller sends resource scheduling information to the target slice and allows the edge device to access the target slice after determining that a target slice corresponding to the target slice identification meets a constraint condition in the time-sensitive flow information.

[0042] The application also provides a network resource scheduling system, comprising the central network controller and the edge device as described above.

[0043] The application also provides an electronic device comprising a memory and a processor, wherein the memory stores a computer program, and the processor invokes the computer program in the memory to implement the steps of the network resource scheduling method as described above.

[0044] The application also provides a storage medium storing a computer program, wherein the computer program is executed to implement the steps of the network resource scheduling method as described above.

[0045] The application provides a network resource scheduling method applied to a central network controller, and the network resource scheduling method comprises the following steps: setting access control information of each slice in a deterministic network according to a cyclic queue queuing forwarding mechanism related parameter of each slice in the deterministic network and an access packet length interval; returning a slice access information table to an edge device which sends an access request; the slice access information table comprises access control information of each slice; receiving target slice identification and time sensitive flow information sent by the edge device; the target slice identification is determined according to the slice access information table; judging whether a target slice corresponding to the target slice identification meets a constraint condition in the time sensitive flow information; if yes, sending resource scheduling information to the target slice, and allowing the edge device to access the target slice.

[0046] The application sets access control information of each slice in a deterministic network, so that the edge device selects a target slice by using access control information in a slice access information table, and judges whether the target slice meets a constraint condition corresponding to a packet. In the case of meeting the constraint condition, the edge device accesses a network slice, and therefore the application can realize efficient scheduling of the whole network resource under the premise of guaranteeing the deterministic requirement of the edge device service.

[0047] The application also provides a central network controller, an edge device, a network resource scheduling system, an electronic device and a storage medium, which have the above beneficial effects, and details are not repeated here. BRIEF DESCRIPTION OF DRAWINGS

[0048] In order to more clearly illustrate the embodiments of the application, the drawings needed in the embodiments will be briefly introduced. Obviously, the drawings in the following description are only some embodiments of the application, and other drawings can be obtained by those skilled in the art without creative effort on the basis of these drawings.

[0049] Figure 1 A flow chart of a network resource scheduling method provided by an embodiment of the application;

[0050] Figure 2 A scene schematic diagram to which a network resource scheduling method provided by an embodiment of the application is applied;

[0051] Figure 3 A structure schematic diagram of a central network controller provided by an embodiment of the application;

[0052] Figure 4 A structure schematic diagram of an edge device provided by an embodiment of the application. DETAILED DESCRIPTION

[0053] In order to make the purposes, technical solutions and advantages of the embodiments of the present application clearer, the technical solutions in the embodiments of the present application will be described clearly and completely below with reference to the drawings in the embodiments of the present application. Obviously, the described embodiments are some but not all of the embodiments of the present application. Based on the embodiments in the present application, all other embodiments obtained by a person of ordinary skill in the art without creative work fall within the protection scope of the present application.

[0054] The following will be seen Figure 1 , Figure 1 A flowchart of a network resource scheduling method provided by the embodiments of the present application.

[0055] The specific steps can include:

[0056] S101: setting corresponding access control information according to the cyclic queue queuing forwarding mechanism related parameters of each slice in the deterministic network and the access packet length interval.

[0057] The embodiments can be applied to a central network controller CNC, which is connected with an edge device and a slice controller of a deterministic network. The deterministic network includes multiple slices, and the above slice is a deterministic network slice based on a cyclic queue queuing forwarding mechanism. Each network slice uses the same cyclic queue queuing forwarding mechanism. The cyclic queue queuing forwarding mechanism has the following characteristics: multiple queues are maintained at each node egress port, and the cyclic queue queuing forwarding mechanism processes packets in the L2 layer (data link layer) or the L3 layer (network layer).

[0058] The central network controller can obtain the cyclic queue queuing forwarding mechanism related parameters from the slice controller through a southbound API interface, and can also determine the access packet length interval according to the cyclic queue queuing forwarding mechanism related parameters, and then set corresponding access control information according to the cyclic queue queuing forwarding mechanism related parameters of the slice and the access packet length interval. The embodiments can construct a slice access information table according to the access control information of all slices in the deterministic network, and store it locally.

[0059] Packet is a network-specific term. Most computer networks cannot continuously transmit data of any length, so in fact the network system divides data into small blocks and sends them block by block. Such small blocks are called packets, also known as protocol data units, abbreviated as PDU (Protocol Data Unit). The packet in the embodiments is a protocol data unit PDU of the L2 layer or the L3 layer.

[0060] The PDUs of each layer of the network model are as follows:

[0061] Physical layer PDU: data bit (bit);

[0062] Data link layer PDU: data frame;

[0063] Network layer PDU: data packet;

[0064] Transport layer PDU: data segment;

[0065] Higher layer PDU: message.

[0066] S102: returning a slice access information table to the edge device sending an access request;

[0067] The network resource scheduling scheme provided in the embodiment is applied to a scenario including a central network controller, an edge device, and a deterministic network based on a cyclic queue queuing forwarding mechanism. The edge device sends an access request for accessing a network to the central network controller. The central network controller can determine resource scheduling information of a slice, so as to allow the edge device to access a specific slice.

[0068] After receiving the access request sent by the edge device, the central network controller can return a slice access information table to the edge device. The slice access information table includes the access control information of each slice set in S101. Therefore, the edge device can select a slice to be accessed according to the access control information based on a local optimal strategy. The local optimal strategy can be a pre-set rule, for example, judging whether the length of a to-be-sent packet meets a packet length interval, or judging whether a slice meets an end-to-end delay requirement of a to-be-sent packet based on a maximum forwarding delay of a node in the slice, and selecting a slice to be accessed. The pre-set rule is not limited to the foregoing two kinds, and can be set according to an actual application scenario.

[0069] S103: receiving target slice identification and time-sensitive flow information sent by the edge device;

[0070] The edge device determines the target slice identification according to the access control information in the slice access information table. The target slice identification is the identification of a slice to be accessed by the edge device. The time-sensitive flow information of the edge device includes a packet sending duration, a packet end-to-end delay constraint (i.e., an upper limit of a packet end-to-end delay), and destination / source address information. The target slice identification and the time-sensitive flow information are used to describe the requirements of the slice to be accessed by the edge device. Therefore, a constraint condition can be determined according to the target slice identification and the time-sensitive flow information, so as to judge whether the target slice in the deterministic network can be accessed based on the constraint condition. The time-sensitive flow information is used to describe the sensitivity requirement of a packet to an end-to-end transmission delay and a sending duration and other time parameter related index values. The meaning of the upper limit of the packet end-to-end delay value is that the maximum upper limit of the end-to-end delay of a packet in the deterministic network.

[0071] S104: determining whether the target slice corresponding to the target slice identifier meets the constraint condition in the time sensitive flow information;

[0072] In the embodiment, the target slice corresponding to the target slice identifier can be determined, and then it is determined whether the target slice meets the constraint condition in the time sensitive flow information. In the embodiment, the constraint condition is the packet end-to-end delay constraint. If the constraint condition is met, the step S105 can be entered. If all target slices do not meet the constraint condition, the edge device is instructed to access the public network slice without delay deterministic guarantee.

[0073] S105: sending resource scheduling information to the target slice, and allowing the edge device to access the target slice.

[0074] In the embodiment, after the target slice meets the constraint condition, the resource scheduling information can be sent to the target slice, so that the target slice reserves resources for the edge device, and the edge device accesses the target slice, so that the edge device performs packet forwarding operation with the target slice.

[0075] In the embodiment, the access control information corresponding to the cycle queue queuing forwarding mechanism related parameters and the access packet length interval of each slice in the deterministic network is set, and the slice access information table is returned after receiving the access request sent by the edge device, so that the edge device sends the target slice identifier and the time sensitive flow information according to the access control information of each slice recorded in the slice access information table. In the embodiment, the edge device is accessed to the target slice when the target slice corresponding to the target slice identifier meets the constraint condition in the time sensitive flow information. In the embodiment, the central network controller maintains the slice access information table according to the cycle queue queuing forwarding mechanism related parameters and the access packet length interval of each slice in the deterministic network, so that the edge device accesses the network by using the slice access information table. Therefore, the embodiment can realize the efficient scheduling of the whole network resource under the premise of guaranteeing the deterministic requirement of the edge device service, that is, the target slice is selected according to the packet, and the long packet burst situation can be avoided under the condition of guaranteeing the end-to-end delay requirement of the packet.

[0076] As for Figure 1 For further introduction of the corresponding embodiment, the access control information in the slice access information table includes: slice identifier, access packet length interval, type of cycle queue queuing forwarding mechanism, access packet type and maximum forwarding delay of nodes in the slice. The access packet length interval is the length interval of L2 layer or L3 layer packet in the cycle queue. The access packet type includes L2 layer packet and L3 layer packet. The maximum forwarding delay of nodes in the slice is the delay experienced by the packet from entering the node to leaving the node in the node in the slice.

[0077] As a feasible implementation, before setting the corresponding access control information according to the queuing forwarding mechanism related parameters of the cyclic queue of each slice and the access packet length interval, the access packet length interval can also be determined according to the queuing forwarding mechanism parameters in the following manner: obtaining the port transmission rate of the nodes in each slice and the queuing forwarding mechanism related parameters of the cyclic queue from the deterministic network; determining the access packet length interval according to the port transmission rate and the queuing forwarding mechanism related parameters of the cyclic queue.

[0078] Specifically, the embodiment can determine the access packet length interval according to the minimum schedulable packet number P when the queue space is full, the queue cycle scheduling period T (i.e., the time interval of queue alternation) in the queuing forwarding mechanism related parameters of the cyclic queue, and the port transmission rate B of the nodes in the slice w determining the maximum packet length that can be accessed; determining the access packet length interval according to the maximum packet length and the set minimum packet length. The above-mentioned maximum packet length L that the slice can access is determined according to the following formula: max L max = B w *T / P.

[0079] Please refer to Figure 2 , Figure 2 , which is a scene diagram applied by a network resource scheduling method provided by the embodiment of the present application. In the diagram, the edge device performs admission negotiation with the central network controller, and the central network controller includes an access control module, a slice access information control module, and a slice resource scheduling control module; and is connected with the slice controller through a southbound API interface. The deterministic network based on the queuing forwarding mechanism of the cyclic queue includes multiple slices, each network slice uses the same queuing forwarding mechanism of the cyclic queue, and there are multiple cyclic queues Q1, Q2, …, Qm in the mechanism. In the diagram, T N and T M represent the queue cycle scheduling period of the slice N and the slice M. The central network controller is used to calculate the maximum packet length that the slice can access, and then determine the packet length interval. The access request of the edge device is subjected to admission control. The edge device is used to select and access the slice.

[0080] Based on the application scenario shown in Figure 2 , the process of the edge device access request and the central network controller access control is as follows: the edge device sends an access request to the central network controller through an API interface; the central network controller returns a five-tuple list to the edge device, i.e., a slice access information table; the edge device selects one or more slices as target slices to be accessed according to the slice access information table, and provides time-sensitive flow information, including: packet sending duration (i.e., user's reservation occupancy time of resources), packet end-to-end delay constraint (i.e., packet end-to-end delay upper bound), destination / source address information;

[0081] The central network controller can determine the optimal path between the source address and the destination address in the time-sensitive flow information according to the slice topology and node egress port queue resource occupation provided by the slice controller, based on a heuristic path search algorithm (for example, the shortest path algorithm Dijkstra algorithm, the best-first search algorithm, A-Star and its derivative algorithms) or other path search algorithms, according to the source and destination addresses, and output the link forwarding path if the slice network type is L2 layer, or output the network routing path if the slice network type is L3 layer. The edge device slice access request is controlled according to the end-to-end delay constraint of the packet (i.e., the upper bound of the end-to-end delay of the packet), the slice identifier is returned, and the resource scheduling information along the optimal path is transmitted to the corresponding slice through the slice controller; the edge device performs slice access.

[0082] The edge device slice access request is controlled according to the end-to-end delay constraint of the packet, and specifically, the end-to-end maximum delay of the packet is calculated according to the optimal path. If the delay meets the end-to-end delay constraint condition of the packet in the time-sensitive flow information sent by the edge device, it means that the network slice can provide deterministic service, so the access of the edge device is allowed; if it does not meet, it means that the network slice cannot provide deterministic service, and it is judged whether the network target slice expected to be accessed by other edge devices meets the constraint condition. If none of them meets the constraint condition, the edge device accesses the public network slice.

[0083] The embodiment can also associate the slice with the packet length in the following way: the central network controller obtains the topology information of the slice and the related parameters of the cyclic queue queuing and forwarding mechanism through the slice controller, calculates the maximum packet length accessing the slice, determines the accessible packet length interval, associates the slice information with the accessible packet length interval, and constructs a five-tuple list consisting of slice identifier, accessible packet length interval, cyclic queue queuing and forwarding mechanism type, accessible packet type and maximum forwarding delay in the slice, i.e., a slice access information table.

[0084] Specifically, the packet shaping and scheduling mechanism based on cyclic queuing forwarding is used in the slice to provide deterministic service, wherein the number of cyclic queues is Q, the queue cyclic scheduling period is T, the type of cyclic queue queuing forwarding mechanism is cType, and the type of access packet is aType. The type of cyclic queue queuing forwarding mechanism cType includes cyclic queuing forwarding CQF (Cyclic Queuing and Forwarding), scalable deterministic forwarding SDF (Scalable Deterministic Forwarding), cycle specified queuing forwarding CSQF (Cycle Specified Queuing and Forwarding), etc. The type of access packet aType includes L2 layer or L3 layer.

[0085] The central network controller obtains the slice information from the slice controller through the southbound API interface, wherein the slice topology information includes: slice topology structure and port transmission rate B w ; the cyclic queue queuing forwarding mechanism related parameters of the slice application include: Q, T, cType and aType.

[0086] The central network controller slice access information control module calculates the maximum packet length L max accessing the slice. The central network controller can determine L max based on network service quality agreement conditions or historical statistical information, expert system prediction, etc. L max can also be calculated based on the constraint of the minimum number of schedulable packets P per queue space of the network single node being full max , the maximum packet length that the slice can access is: L w = B min *T / P. In order to more accurately control the length of the access deterministic network packet, the central network controller can increase the lower bound L min for the packet length, the access packet length interval L is an interval value [L max , L min ]. The default value of L i is 1.

[0087] It can be understood that when the minimum number of schedulable packets P increases, the number of users accessing the deterministic network can be indirectly increased.

[0088] The central network controller stores a slice access information table in the slice access information control module, and each table entry A[i] in the table records the access control information of slice i. Each table entry is a five-tuple composed of <S iThe unique identifier of a slice, i.e., the identifier of the slice, and D is the maximum forwarding delay of nodes in the slice, obtained by the formula D = Q*T.

[0089] As for Figure 1 For further introduction of the corresponding embodiments, the central network controller can also obtain the topology of each slice and the node egress port queue resource occupation in the slice from the slice controller of the deterministic network through the southbound API interface, and generate a directed graph G(V, E) of the slice, where V is a set of nodes in the network topology, E is a set of directed links between nodes, i.e., a set of edges, and the weight on the edge is: the allocable number of node egress port queue resources in the slice. Based on the directed graph of the target slice, the optimal path between the source address and the destination address of the packet in the time-sensitive flow information is determined by a heuristic path search algorithm. After determining that the target slice meets the constraint condition in the time-sensitive flow information, the allocable number of node egress port queue resources R in the optimal path in the target slice can be reduced by 1, and the directed graph of the target slice is updated.

[0090] For example, the initial value of the allocable resource amount R of the egress port queue of the node is Q*P. Each time the node allocates the queue resource of a port to an edge device, the value of R is reduced by 1. When R = 0, it indicates that the node has no queue resource to allocate to a new edge device, and the directed edge representing the egress port queue resource is deleted from G.

[0091] The central network controller determines the optimal path based on the directed graph G of the slice S i and the heuristic path search algorithm described above, in response to the resource request of the edge device to the slice S i . According to the maximum forwarding delay of nodes in the slice S i and the number of nodes in the optimal path, the end-to-end maximum delay of packets in the slice S e2em can be determined. If the delay is less than the upper bound D i of the end-to-end delay of packets required by the edge device, i.e., the end-to-end delay constraint condition of the packets is met, the target slice S i meets the requirements.

[0092] Correspondingly, after sending the resource scheduling information to the target slice, a resource occupation timer can also be started according to the packet transmission duration in the time-sensitive flow information; if the started resource occupation timer expires, a control command for re-accessing is sent to the edge device.

[0093] As for Figure 1 For further introduction of the corresponding embodiments, the access request of the edge device and the access control of the central network controller are as follows:

[0094] The edge device sends an access request to the central network controller through an API interface; the central network controller returns a slice access information table composed of a five-tuple list to the edge device; the edge device returns one or more target slice identifiers expected to be accessed to the central network controller according to an optimal strategy, and provides time-sensitive flow information of a packet to be sent; the central network controller determines whether the edge device can access the target slice according to the target slice identifier expected to be accessed and the time-sensitive flow information provided by the edge device. The central network controller determines an optimal path for packet forwarding based on the destination / source address information of the packet, slice topology information, and queue resource allocatable conditions of a slice node egress port, and according to a heuristic path search algorithm. When the end-to-end delay constraint of the packet is met, the slice is determined to be an access slice. The central network controller reserves queue resources of nodes on the forwarding path of the slice, and starts a resource occupation timer. The central network controller, on one hand, sends resource scheduling information of the optimal path to the corresponding slice through a slice controller, and on the other hand, sends a slice identifier S i .

[0095] The embodiment of the present application also provides a network resource scheduling method applied to an edge device, and the network resource scheduling method comprises the following steps:

[0096] sending an access request to a central network controller so that the central network controller returns a slice access information table; determining a target slice identifier according to the slice access information table, and sending the target slice identifier and time-sensitive flow information of a packet to be forwarded to the central network controller, so that the central network controller sends resource scheduling information to the target slice and allows the edge device to access the target slice when it is determined that the target slice corresponding to the target slice identifier meets a constraint condition in the time-sensitive flow information. The slice access information table comprises access control information of each slice in a deterministic network, and the access control information is set according to a circulating queue queuing and forwarding mechanism related parameter and an access packet length interval of each slice; and the constraint condition is an end-to-end delay constraint of a packet.

[0097] The edge device applied by the embodiment accesses a network by using a slice access information table, and therefore the embodiment can realize efficient scheduling of the whole network resource under the premise of guaranteeing the deterministic requirement of edge device service.

[0098] The above-described flow is described by an embodiment in actual application.

[0099] One key factor affecting the cycle period is the queue length, and one important factor affecting the design of the queue length is the packet length. In order to reduce the impact of packet length burst on queue scheduling, the technical scheme designs a central network controller (CNC) to obtain network slice topology information and a cyclic queue queuing forwarding mechanism for providing deterministic service through a slice controller of a live network, calculate the maximum packet length that can be admitted by the slice, determine the access packet length interval, and then form a slice access information table composed of a slice identifier, an access packet length interval, a cyclic queue queuing forwarding mechanism type, an access packet type, and a maximum forwarding delay of nodes in the slice.

[0100] The specific implementation process of the embodiment is as follows:

[0101] The edge device sends an access request to the central network controller through an API interface.

[0102] The central network controller sends a slice access information A[i] list composed of a five-tuple of <S i , L, cType, aType, D> to the edge device.

[0103] The edge device selects according to the local optimal strategy, and returns the S i information expected to be accessed to the central network controller, and time-sensitive flow information of the packet to be sent, including: packet sending duration Dur m , packet end-to-end delay upper bound D e2em , destination / source address information (DesAdd / SourAdd) m .

[0104] The central network controller determines whether the edge device can access the slice one by one according to the target access slice identifier provided by the edge device. The central network controller determines the optimal path of packet forwarding based on (DesAdd / SourAdd) m and topology information and node egress port queue resource occupation, and according to an optimal path algorithm. When the end-to-end delay constraint is met, the central network controller reserves resources in the queue of the node on the forwarding path of the slice, and starts a resource occupation timer. The central network controller, on the one hand, issues scheduling information of the reserved resources on the optimal path to the corresponding slice, and on the other hand, sends the slice identifier S i that allows access to the edge device.

[0105] When the central network controller tries to access all the expected access slices provided by the edge device and cannot meet the end-to-end delay constraint, the central network controller can instruct the edge device to access the public network without delay deterministic guarantee.

[0106] When the edge device service flow is sent, a service end message is sent to the center network controller, and the center network controller releases the corresponding node occupied resources.

[0107] When the resource occupation timer expires, the center network controller sends a re-access control command to the edge device.

[0108] The center network controller in the embodiment calculates the maximum length of the supported packet of each slice, thereby determining the access packet length interval. In the case that there is a large difference in the packet length sent by the edge device, the edge device uses the information to access the network, and the slice network can achieve the goal of efficient scheduling while ensuring the business certainty for time-sensitive flow service.

[0109] Please refer to Figure 3 , Figure 3 The center network controller provided by the embodiment of the application has the structure as shown in the figure, and the center network controller comprises:

[0110] The slice access information control module 301 is configured to set the access control information of each slice according to the related parameters of the cyclic queue queuing and forwarding mechanism of each slice in the deterministic network and the access packet length interval.

[0111] The access control module 302 is configured to return a slice access information table to the edge device sending an access request, wherein the slice access information table comprises the access control information of each slice, and is further configured to receive the target slice identifier and the time-sensitive flow information sent by the edge device, wherein the target slice identifier is determined according to the slice access information table.

[0112] The slice resource scheduling control module 303 is configured to judge whether the target slice corresponding to the target slice identifier meets the constraint condition in the time-sensitive flow information, and is further configured to send resource scheduling information to the target slice and allow the edge device to access the target slice if the target slice meets the constraint condition.

[0113] The embodiment sets the corresponding access control information according to the cyclic queue queuing forwarding mechanism related parameters of each slice in the deterministic network and the access packet length interval, returns the slice access information table after receiving the access request sent by the edge device, so that the edge device sends the target slice identifier and the time sensitive flow information according to the access control information of each slice recorded in the slice access information table. The embodiment accesses the target slice corresponding to the target slice identifier when the target slice meets the constraint condition in the time sensitive flow information. The central network controller applied in the embodiment maintains the slice access information table according to the cyclic queue queuing forwarding mechanism related parameters of each slice in the deterministic network and the access packet length interval, so that the edge device accesses the network by using the slice access information table. Therefore, the embodiment can realize the efficient scheduling of the whole network resource under the premise of guaranteeing the deterministic requirement of the edge device service, that is, the application selects the target slice according to the packet, and can avoid the long packet burst under the condition of guaranteeing the end-to-end delay requirement of the packet.

[0114] Further, the access control information includes the slice identifier, the access packet length interval, the type of the cyclic queue queuing forwarding mechanism, the access packet type and the maximum forwarding delay of the nodes in the slice.

[0115] Further, it further includes:

[0116] The length interval determination module is configured to obtain the port transmission rate of the nodes in each slice and the cyclic queue queuing forwarding mechanism related parameters from the deterministic network, and determine the access packet length interval according to the port transmission rate and the cyclic queue queuing forwarding mechanism related parameters.

[0117] Further, the process of determining the access packet length interval by the length interval determination module according to the port transmission rate and the cyclic queue queuing forwarding mechanism related parameters includes: determining the maximum accessible packet length according to the minimum schedulable packet number when the queue space is full, the queue cycle scheduling period in the cyclic queue queuing forwarding mechanism related parameters and the port transmission rate of the nodes in the slice; and determining the access packet length interval according to the maximum packet length and the set minimum packet length.

[0118] Further, it further includes:

[0119] The path determination module is configured to determine the optimal path between the destination address and the source address in the time sensitive flow information according to the slice topology and the out-port queue resource occupation of the nodes in the slice based on a path search algorithm.

[0120] The delay determination module is configured to calculate the end-to-end maximum delay of the packet according to the optimal path.

[0121] Correspondingly, the process that the slice resource scheduling control module 303 judges whether the target slice corresponding to the target slice identifier meets the constraint condition in the time-sensitive flow information includes: judging whether the packet end-to-end maximum delay meets the packet end-to-end delay constraint in the time-sensitive flow information.

[0122] Further, the process that the path determination module determines the optimal path between the packet destination address and the source address in the time-sensitive flow information based on the path search algorithm includes: generating a directed graph of the target slice according to the slice topology and the node egress port queue resource occupation in the slice, the weight of the edge of the directed graph being the allocable quantity of the node egress port queue resource in the target slice; determining the optimal path between the packet destination address and the source address in the time-sensitive flow information based on the directed graph according to the path search algorithm.

[0123] Correspondingly, it further includes:

[0124] The directed graph updating module is configured to reduce the allocable quantity of the node egress port queue resource in the optimal path in the target slice by 1 and update the directed graph of the target slice.

[0125] Further, it further includes:

[0126] The timeout reconnection module is configured to start a resource occupation timer according to the packet sending duration in the time-sensitive flow information, and further configured to send a reaccess control command to the edge device if the started resource occupation timer is timed out.

[0127] Please refer to Figure 4 , Figure 4 A structure schematic diagram of an edge device provided by the embodiment of the application, the edge device includes:

[0128] The request module 401 sends an access request to a central network controller so that the central network controller returns a slice access information table, the slice access information table including access control information of each slice in a deterministic network, the access control information being set according to the cyclic queue queuing forwarding mechanism related parameters and the access packet length interval of each slice.

[0129] The information feedback module 402 determines a target slice identifier according to the slice access information table and sends the target slice identifier and the time-sensitive flow information of a to-be-forwarded packet to the central network controller, so that the central network controller sends resource scheduling information to the target slice and allows the edge device to access the target slice after judging that the target slice corresponding to the target slice identifier meets the constraint condition in the time-sensitive flow information.

[0130] Specifically, the edge device can determine a target slice to be accessed according to the optimal strategy.

[0131] The embodiment of the present application further provides a network resource scheduling system, comprising the center network controller and the edge device, and the number of the edge devices in the network resource scheduling system can be any.

[0132] Since the embodiments of the device and system part correspond to the embodiments of the method part, the embodiments of the device and system part are described in the description of the embodiments of the method part, and are not described here.

[0133] The present application further provides an electronic device, which can include a memory and a processor, the memory has a computer program stored therein, and the processor can implement the steps provided by the network resource scheduling method applied to the center network controller or the edge device when invoking the computer program in the memory. Of course, the electronic device can also include various network interfaces, power supplies and other components.

[0134] The present application further provides a storage medium having a computer program stored thereon, and the computer program can implement the steps provided by the embodiments when executed. The storage medium can include a U disk, a mobile hard disk, a read-only memory (ROM), a random access memory (RAM), a magnetic disk or an optical disk, and various media that can store program codes.

[0135] The embodiments in the specification are described in a progressive manner, and each embodiment focuses on the difference from other embodiments. The same or similar parts of each embodiment can be referred to each other. For the system disclosed in the embodiments, since it corresponds to the method disclosed in the embodiments, the description is relatively simple, and the related parts can be referred to the method part. It should be pointed out that for ordinary skilled in the art, without departing from the principles of the present application, the present application can be improved and modified, and these improvements and modifications also fall within the protection scope of the claims of the present application.

[0136] It is further noted that the terminology "first", "second" and the like used in the specification are merely used for differentiating one entity or action from another, and do not necessarily imply any actual physical or logical relationship or order between such entities or actions. Moreover, the use of the term "including", "containing" or any other variant thereof is intended to cover non-exclusive inclusion, such that a process, method, article or apparatus that comprises a list of elements is not required to comprise only those elements but can include other elements not expressly listed or inherent to such process, method, article or apparatus. An element preceded by "comprises a..." does not, without further restriction, preclude the existence of additional elements of the same nature as those recited.

Claims

1. A network resource scheduling method, characterized by, The network resource scheduling method is applied to a central network controller and comprises the following steps: According to the cyclic queue queuing forwarding mechanism related parameters of each slice in the deterministic network and the access packet length interval, corresponding access control information is set; wherein, the cyclic queue queuing forwarding mechanism related parameters comprise: the number of cyclic queues, the queue cycle scheduling period, the type of the cyclic queue queuing forwarding mechanism and the access packet type; the access control information comprises the slice identifier, the access packet length interval, the type of the cyclic queue queuing forwarding mechanism, the access packet type and the maximum forwarding delay of the nodes in the slice; The slice access information table is returned to the edge device sending the access request; the slice access information table comprises the access control information of each slice; The target slice identifier and the time-sensitive flow information sent by the edge device are received; the target slice identifier is determined according to the slice access information table; It is judged whether the target slice corresponding to the target slice identifier meets the constraint condition in the time-sensitive flow information; If yes, the resource scheduling information is sent to the target slice, and the edge device is allowed to access the target slice.

2. The method of claim 1, wherein, Before the corresponding access control information is set according to the cyclic queue queuing forwarding mechanism related parameters of each slice and the access packet length interval, the following steps are further included: The port transmission rate of the nodes in each slice and the cyclic queue queuing forwarding mechanism related parameters are obtained from the deterministic network; The access packet length interval is determined according to the port transmission rate and the cyclic queue queuing forwarding mechanism related parameters.

3. The method of claim 2, wherein, The access packet length interval is determined according to the port transmission rate and the cyclic queue queuing forwarding mechanism related parameters, comprising: According to the minimum schedulable packet number when the queue space is full, the queue cycle scheduling period in the cyclic queue queuing forwarding mechanism related parameters and the port transmission rate of the nodes in the slice, the maximum packet length that can be accessed is determined; The access packet length interval is determined according to the maximum packet length and the set minimum packet length.

4. The method of claim 1, wherein, Before it is judged whether the target slice corresponding to the target slice identifier meets the constraint condition in the time-sensitive flow information, the following steps are further included: According to the slice topology and the out-port queue resource occupation of the nodes in the slice, the optimal path between the source address and the destination address of the packet in the time-sensitive flow information is determined based on a path search algorithm; The end-to-end maximum delay of the packet is calculated according to the optimal path; Correspondingly, it is judged whether the target slice corresponding to the target slice identifier meets the constraint condition in the time-sensitive flow information, comprising: It is judged whether the end-to-end maximum delay of the packet meets the end-to-end delay constraint of the packet in the time-sensitive flow information.

5. The method of claim 4, wherein, The optimal path between the source address and the destination address of the packet in the time-sensitive flow information is determined based on the path search algorithm, comprising: According to the slice topology and the out-port queue resource occupation of the nodes in the slice, a directed graph of the target slice is generated, and the weight of the edge of the directed graph is the allocatable number of the out-port queue resource of the nodes in the target slice; determine the optimal path between the destination address and the source address in the packet in the time-sensitive flow information based on the directed graph according to the path search algorithm; Accordingly, after judging that the end-to-end maximum delay of the packet meets the end-to-end delay constraint of the packet in the time-sensitive flow information, further comprising: decrement the allocatable number of node egress port queue resources in the optimal path in the target slice by 1, and update the directed graph of the target slice.

6. The method of claim 1 to 5, wherein, After sending the resource scheduling information to the target slice, further comprising: start a resource occupation timer according to the packet transmission duration in the time-sensitive flow information; if the started resource occupation timer expires, send a re-access control command to the edge device.

7. A network resource scheduling method, characterized by, Applied to an edge device, the network resource scheduling method comprises: sending an access request to a central network controller so that the central network controller returns a slice access information table; the slice access information table includes access control information of each slice in the deterministic network, and the access control information is set according to the cyclic queue queuing forwarding mechanism related parameters and the access packet length interval of each slice; wherein the cyclic queue queuing forwarding mechanism related parameters include: the number of cyclic queues, the queue cycle scheduling period, the type of cyclic queue queuing forwarding mechanism and the type of access packet; the access control information includes slice identification, access packet length interval, type of cyclic queue queuing forwarding mechanism, type of access packet and maximum forwarding delay of nodes in the slice; determining a target slice identification according to the slice access information table, and sending the target slice identification and time-sensitive flow information of the to-be-forwarded packet to the central network controller, so that the central network controller sends resource scheduling information to the target slice and allows the edge device to access the target slice after judging that the target slice meets the constraint condition in the time-sensitive flow information.

8. A central network controller, characterized by comprise: a slice access information control module for corresponding access control information according to the cyclic queue queuing forwarding mechanism related parameters and the access packet length interval setting of each slice in the deterministic network; wherein the cyclic queue queuing forwarding mechanism related parameters include: the number of cyclic queues, the queue cycle scheduling period, the type of cyclic queue queuing forwarding mechanism and the type of access packet; the access control information includes slice identification, access packet length interval, type of cyclic queue queuing forwarding mechanism, type of access packet and maximum forwarding delay of nodes in the slice; an access control module for returning a slice access information table to the edge device sending an access request; the slice access information table includes access control information of each slice; also used for receiving a target slice identification and time-sensitive flow information sent by the edge device; the target slice identification is determined according to the slice access information table; The slice resource scheduling control module is configured to determine whether a target slice corresponding to the target slice identifier meets a constraint condition in the time-sensitive flow information, and to send resource scheduling information to the target slice and allow the edge device to access the target slice if the target slice meets the constraint condition.

9. An edge device, characterized by The method comprises the following steps: The request module sends an access request to the central network controller to obtain a slice access information table returned by the central network controller, wherein the slice access information table comprises access control information of each slice in the deterministic network, and the access control information is set according to a cyclic queue queuing and forwarding mechanism related parameter and an access packet length interval; wherein the cyclic queue queuing and forwarding mechanism related parameter comprises a cyclic queue number, a queue cycle scheduling period, a type of the cyclic queue queuing and forwarding mechanism and an access packet type; and the access control information comprises a slice identifier, the access packet length interval, the type of the cyclic queue queuing and forwarding mechanism, the access packet type and a maximum forwarding delay of a node in the slice. The information feedback module determines a target slice identifier according to the slice access information table, and sends the target slice identifier and time-sensitive flow information of a to-be-forwarded packet to the central network controller, so that the central network controller sends resource scheduling information to the target slice and allows the edge device to access the target slice after determining that a target slice corresponding to the target slice identifier meets a constraint condition in the time-sensitive flow information.

10. A network resource scheduling system, characterized by, The central network controller and the edge device are as claimed in claims 9 and 9.

11. An electronic device, comprising: The memory stores a computer program, and the processor invokes the computer program in the memory to implement the steps of the network resource scheduling method according to any one of claims 1 to 7.

12. A storage medium, characterized by The storage medium stores computer executable instructions, and the computer executable instructions are loaded and executed by the processor to implement the steps of the network resource scheduling method according to any one of claims 1 to 7.

Images