A virtual graph construction method, device, equipment and storage medium

Abstract

The present invention discloses a method, apparatus, device and storage medium for constructing a virtual graph. The method includes: determining a target transmission time slot set based on the number of transmission time slots of the current physical link in a deterministic network resource model, the current transmission time slot, the target time deviation between the current physical link and the downstream physical link, the propagation delay of the current physical link, the length of the current transmission time slot and the number of gated queues of the downstream physical link; determining a time slot virtual node set based on the target transmission time slot set and the current transmission time slot, and determining a virtual terminal node set based on the physical terminal node set; determining a virtual edge set based on the time slot virtual node set, the physical terminal node set and the physical link set, and then constructing a deterministic network virtual graph based on the node set and the virtual edge set. The technical solution of the present invention can fuse the topological structure corresponding to the deterministic network resource model with the time slot information to achieve a global representation of deterministic network resources.

Description

Technical Field

[0001] Embodiments of the present invention relate to the field of computer technology, and in particular to a method, apparatus, device, and storage medium for constructing a virtual graph. Background Art

[0002] Many emerging businesses, such as smart grids, Internet of Vehicles, smart transportation, industrial control, smart agriculture, remote surgery, unmanned driving, VR gaming, and smart services, require end-to-end latency to be controlled at the microsecond to millisecond level, latency jitter to be controlled at the microsecond level, and reliability to be controlled above 99.9999%. To meet these requirements, it is necessary to establish a new generation of networks that can provide timely and accurate data transmission service quality. Therefore, deterministic networks (Quality of Service, QoS) have emerged. They can provide timely and accurate data transmission service quality and meet the requirements of low latency, low jitter, low packet loss rate, high bandwidth, and high reliability.

[0003] Deterministic networking is a new technology based on Ethernet that provides end-to-end deterministic quality of service (QoS) for a variety of services. Current mainstream deterministic networking technologies primarily utilize slot-based queuing mechanisms to ensure deterministic end-to-end transmission latency, such as cyclic queuing and forwarding (CQF), cycle specified queuing and forwarding (CQF), and large-scale deterministic networking (LDN). These mechanisms all guarantee an upper bound of end-to-end transmission delay jitter of twice the slot length by determining the hop-by-hop transmission slots of service flows, providing deterministic end-to-end latency assurance.

[0004] Based on the above-mentioned deterministic network queue mechanism, many researchers have studied the scheduling and orchestration of queue resources. In the process of abstracting queue resources, there are generally two solutions: the first is to combine traffic transmission paths and time slots into resource combinations, and then allocate the traffic to be transmitted to different resource combinations for transmission; the second is to treat traffic transmission path resources and time slot resources separately and make independent decisions. For example, pre-sorting the transmission path first, and then making the transmission time slot decision.

[0005] However, the aforementioned resource orchestration and scheduling methods have limitations. The resource combination model requires constructing resource combinations before scheduling begins, and the final solution space is affected by the resource combination construction method. For large networks, it is particularly difficult to enumerate all resource combinations, and sometimes the optimal solution cannot be found because it is not included in the feasible domain of the resource combination. Independent decision-making for path resources and time slot resources makes it difficult for the scheduling algorithm to solve the optimal transmission solution. Joint scheduling of path resources and time slot resources is required to achieve the optimal solution. These limitations make it impossible to efficiently represent deterministic network resources globally, and thus cannot support the flexible design of resource orchestration and scheduling within deterministic networks. Summary of the Invention

[0006] Embodiments of the present invention provide a virtual graph construction method, apparatus, device, and storage medium, which solve the problem that the resource orchestration and scheduling methods in the prior art have limitations and cannot effectively represent deterministic network resources globally.

[0007] According to one aspect of the present invention, a method for constructing a virtual graph is provided, comprising:

[0008] Acquire a deterministic network resource model, wherein the deterministic network resource model includes: a physical node set and a physical link set, and the physical node set includes at least: a physical terminal node set;

[0009] In the deterministic network resource model, a target transmission time slot set in the downstream physical link that is allowed to forward a data packet transmitted in the current transmission time slot is determined based on the number of transmission time slots of the current physical link, the current transmission time slot of the current physical link, a target time offset between the current physical link and a downstream physical link adjacent to the current link, a propagation delay of the current physical link, the length of the current transmission time slot, and the number of gated queues corresponding to the downstream physical link;

[0010] Determine a time slot virtual node set according to each target transmission time slot in the target transmission time slot set and the current transmission time slot, and determine a virtual terminal node set according to the physical terminal node set;

[0011] Determine a virtual edge set according to the time slot virtual node set, the physical terminal node set, and the physical link set;

[0012] A deterministic network virtual graph is constructed according to the time slot virtual node set, the virtual terminal node set, and the virtual edge set.

[0013] According to another aspect of the present invention, a virtual graph construction device is provided, the virtual graph construction device comprising:

[0014] A model acquisition module is used to acquire a deterministic network resource model, wherein the deterministic network resource model includes: a physical node set and a physical link set, and the physical node set includes at least: a physical terminal node set;

[0015] a time slot determination module configured to determine, in the deterministic network resource model, a target transmission time slot set in the downstream physical link that is allowed to forward a data packet transmitted in the current transmission time slot based on the number of transmission time slots of the current physical link, the current transmission time slot of the current physical link, a target time offset between the current physical link and a downstream physical link adjacent to the current link, a propagation delay of the current physical link, a length of the current transmission time slot, and a number of gated queues corresponding to the downstream physical link;

[0016] a node determination module, configured to determine a time slot virtual node set according to each target transmission time slot in the target transmission time slot set and a current transmission time slot, and determine a virtual terminal node set according to the physical terminal node set;

[0017] A virtual edge determination module, configured to determine a virtual edge set according to the time slot virtual node set, the physical terminal node set, and the physical link set;

[0018] A virtual graph determination module is used to construct a deterministic network virtual graph according to the time slot virtual node set, the virtual terminal node set and the virtual edge set.

[0019] According to another aspect of the present invention, an electronic device is provided, comprising:

[0020] at least one processor; and

[0021] a memory communicatively connected to the at least one processor; wherein,

[0022] The memory stores a computer program executable by the at least one processor, and the computer program is executed by the at least one processor so that the at least one processor can execute the virtual graph construction method described in any embodiment of the present invention.

[0023] According to another aspect of the present invention, a computer-readable storage medium is provided, wherein the computer-readable storage medium stores computer instructions, and the computer instructions are used to enable a processor to implement the virtual graph construction method described in any embodiment of the present invention when executed.

[0024] The embodiment of the present invention obtains a deterministic network resource model, wherein the deterministic network resource model includes: a physical node set and a physical link set, and the physical node set includes at least: a physical terminal node set; in the deterministic network resource model, according to the number of transmission time slots of the current physical link, the current transmission time slot of the current physical link, the target time deviation between the current physical link and the downstream physical link adjacent to the current link, the propagation delay of the current physical link, the length of the current transmission time slot and the number of gated queues corresponding to the downstream physical link, the target transmission time slot set that allows the forwarding of data packets transmitted in the current transmission time slot in the downstream physical link is determined; a time slot virtual node set is determined according to each target transmission time slot and the current transmission time slot in the target transmission time slot set, and a virtual terminal node set is determined according to the physical terminal node set; a virtual edge set is determined according to the time slot virtual node set, the physical terminal node set and the physical link set; The time slot virtual node set, the virtual terminal node set and the virtual edge set are used to construct a deterministic network virtual graph, which solves the problem that the deterministic network resources cannot be globally represented efficiently due to the limitations of the resource orchestration and scheduling methods in the existing technology. The transmission time slots can be abstracted as nodes in the deterministic network virtual graph, and the connection relationship between the transmission time slots is represented by the structure of the deterministic network virtual graph, which overcomes the problem of loss of solution space caused by constructing resource combinations during resource orchestration and scheduling. The global representation of the solution space is achieved through the constructed deterministic network virtual graph. At the same time, the deterministic network resource model is constructed as a virtual graph structure, which integrates the original topological connection information and transmission time slot information in the deterministic network resource model, and thus the problem of deterministic network resource scheduling can be converted into a routing scheduling problem. A large number of related algorithms for routing scheduling can be directly applied to the deterministic network virtual graph to realize resource scheduling, which helps to achieve end-to-end deterministic service quality assurance for computing network integration and business orientation.

[0025] It should be understood that the content described in this section is not intended to identify the key or important features of the embodiments of the present invention, nor is it intended to limit the scope of the present invention. Other features of the present invention will become readily understood through the following description. BRIEF DESCRIPTION OF THE DRAWINGS

[0026] In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the following briefly introduces the drawings required for use in the embodiments. It should be understood that the following drawings only illustrate certain embodiments of the present invention and therefore should not be regarded as limiting the scope. For ordinary technicians in this field, other relevant drawings can be obtained based on these drawings without paying any creative work.

[0027] Figure 1This is a flowchart of a method for constructing a virtual graph in Embodiment 1 of the present invention;

[0028] Figure 2 This is a schematic diagram of the structure of a virtual graph construction device in the second embodiment of the present invention;

[0029] Figure 3 It is a structural diagram of an electronic device in embodiment 3 of the present invention. DETAILED DESCRIPTION

[0030] In order to enable those skilled in the art to better understand the solutions of the present invention, the technical solutions in the embodiments of the present invention will be clearly and completely described below in conjunction with the drawings in the embodiments of the present invention. Obviously, the embodiments described are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without making creative efforts should fall within the scope of protection of the present invention.

[0031] It should be noted that the terms "first", "second", etc. in the description and claims of the present invention and the above-mentioned drawings are used to distinguish similar objects and are not necessarily used to describe a specific order or sequence. It should be understood that the numbers used in this way can be interchanged where appropriate, so that the embodiments of the present invention described herein can be implemented in an order other than those illustrated or described herein. In addition, the terms "including" and "having" and any variations thereof are intended to cover non-exclusive inclusions. For example, a process, method, system, product or device that includes a series of steps or units is not necessarily limited to those steps or units clearly listed, but may include other steps or units that are not clearly listed or inherent to these processes, methods, products or devices.

[0032] It is understandable that before using the technical solutions disclosed in the various embodiments of this disclosure, the type, scope of use, usage scenarios, etc. of the personal information involved in this disclosure should be informed to the user and the user's authorization should be obtained in an appropriate manner in accordance with relevant laws and regulations.

[0033] Example 1

[0034] Figure 1 This is a flowchart of a virtual graph construction method in the first embodiment of the present invention. This embodiment is applicable to the case where a deterministic network resource model is abstracted into a deterministic network virtual graph, and then resource scheduling of a deterministic network is calculated. This method can be executed by a virtual graph construction device in the embodiment of the present invention, which can be implemented in software and / or hardware. Figure 1 As shown, the method specifically includes the following steps:

[0035] S110 , obtaining a deterministic network resource model, wherein the deterministic network resource model includes: a physical node set and a physical link set, and the physical node set includes at least: a physical terminal node set.

[0036] The deterministic network resource model is an original network model, including a physical node set and a physical link set. The physical node set includes at least a physical terminal node set, and the physical node set also includes an intermediate node set.

[0037] Specifically, a deterministic network resource model is available Indicates that represents the set of physical nodes, ε represents the set of physical links, and the set of physical nodes includes the set of physical end nodes. and intermediate nodes Obviously The physical terminal node set includes a physical source terminal node and a physical destination terminal node. The terminal node is responsible for sending and receiving data; the intermediate node is responsible for forwarding data packets.

[0038] It should be noted that in the physical link set, the directed edge e=[v i ,v j ]∈ε represents the physical node v i To physical node v j For any physical link, e=[v i ,v j ]∈ε, its bandwidth is expressed as eb or [v i ,v j ].b, the propagation delay is ed or [v i ,v j ].d.

[0039] S120, in a deterministic network resource model, based on the number of transmission time slots of the current physical link, the current transmission time slot of the current physical link, the target time deviation between the current physical link and the downstream physical link adjacent to the current link, the propagation delay of the current physical link, the length of the current transmission time slot and the number of gated queues corresponding to the downstream physical link, determine the target transmission time slot set in the downstream physical link that is allowed to forward the data packets transmitted in the current transmission time slot.

[0040] It needs to be explained that in the deterministic network resource model In the example, the time on the physical source terminal node and each intermediate node's egress port can be divided into transmission slots of equal length. The length of the transmission slot is T. Each transmission slot can be used as the current transmission slot, and the target transmission slot set corresponding to the current transmission slot is then determined. Since there is a one-to-one correspondence between the egress port and the physical link, the transmission slot on the egress port is called the transmission slot of the physical link. If the current physical link is e = [v i ,v j ], the downstream physical link adjacent to the current link should be e′=[v j ,v k ], the intermediate node v j consistent.

[0041] The target time offset is the time offset between two different adjacent physical links. It should be noted that the transmission time slots on different physical links are not required to be synchronized. Therefore, the scheduling period (T hc =NT,T hc is the scheduling period, N is the number of transmission time slots, T is the length of the transmission time slot, and N consecutive transmission time slots on each physical link constitute a scheduling period). There is a time deviation, that is, the target time deviation. The target time deviation can be calculated by the transmission delay on two different adjacent physical links in the deterministic network resource model. That is, the target time deviation is a detectable and known positive value.

[0042] Among them, each transmission time slot corresponds to a gated queue on the egress port. For any link e∈ε, the total number of gated queues on the corresponding egress port is R e , and satisfy 3≤R e ≤ the number of transmission slots.

[0043] The target transmission time slot set is a transmission time slot set in a downstream physical link corresponding to the current physical link, which is allowed to forward a data packet transmitted in a current transmission time slot in the current physical link.

[0044] Specifically, in a deterministic network resource model, according to the number of transmission time slots of the current physical link, the current transmission time slot of the current physical link, the target time deviation between the current physical link and the downstream physical link adjacent to the current link, the propagation delay of the current physical link, the length of the current transmission time slot, and the number of gated queues corresponding to the downstream physical link, a method for determining the target transmission time slot set for allowing the forwarding of the data packet transmitted in the current transmission time slot in the downstream physical link can be: in a deterministic network resource model, the number of transmission time slots of the current physical link, the current transmission time slot of the current physical link, the target time deviation between the current physical link and the downstream physical link adjacent to the current link, the propagation delay of the current physical link, the length of the current transmission time slot, and the number of gated queues corresponding to the downstream physical link are obtained. The length of the slot and the number of gating queues corresponding to the downstream physical link are used to calculate the latest transmission slot in which the data packet transmitted from the current transmission slot will be received by the downstream physical link according to the number of transmission slots of the current physical link, the current transmission slot of the current physical link, the target time deviation between the current physical link and the downstream physical link adjacent to the current link, the propagation delay of the current physical link, the length of the current transmission slot and the number of gating queues corresponding to the downstream physical link. Then, based on the latest transmission slot, the number of transmission slots of the current physical link and the number of gating queues corresponding to the downstream physical link, all transmission slots in the downstream physical link that are allowed to forward the data packet transmitted in the current transmission slot are calculated to generate a target transmission slot set.

[0045] S130 , determining a time slot virtual node set according to each target transmission time slot in the target transmission time slot set and the current transmission time slot, and determining a virtual terminal node set according to the physical terminal node set.

[0046] The virtual nodes in the time slot virtual node set and the virtual terminal node set are all virtual nodes in a deterministic network virtual graph constructed subsequently.

[0047] Specifically, a time slot virtual node set is determined based on each target transmission time slot in the target transmission time slot set and the current transmission time slot, and a virtual terminal node set is determined based on the physical terminal node set. The method can be: abstracting the current transmission time slot as a time slot virtual node, abstracting each target transmission time slot in the target transmission time slot set as a time slot virtual node, and then constructing a time slot virtual node set; abstracting the physical source terminal node in the physical terminal node set as a virtual source terminal node, and abstracting the physical destination terminal node in the physical terminal node set as a virtual destination terminal node, and determining the virtual source terminal node and the virtual destination terminal node as a virtual terminal node set. It should be noted that when determining the time slot virtual node set and the virtual terminal node set, attribute information can be added to each virtual node in the set.

[0048] S140 , determining a virtual edge set according to the time slot virtual node set, the virtual terminal node set, and the physical link set.

[0049] The virtual edges in the virtual edge set are virtual edges in the subsequently constructed deterministic network virtual graph.

[0050] Specifically, the method of determining the virtual edge set based on the time slot virtual node set, the virtual terminal node set and the physical link set can be: each time slot virtual node in the time slot virtual node set determines the connection relationship based on the physical link corresponding to each time slot virtual node in the physical link set. Because each physical link in the physical link set is a directed edge, the connection relationship of each time slot virtual node can be determined based on the direction of each physical link in the physical link set, and then the virtual edges between the time slot virtual nodes can be established; the physical link set can be queried based on the physical source terminal node in the physical terminal node set to determine the physical link connected to the physical source terminal node, and then the time slot virtual node after the transmission time slot is abstracted on the physical link connected to the physical source terminal node is obtained, and the connection relationship between the time slot virtual node and the physical link connected to the physical source terminal node is determined based on the virtual source terminal node and the physical link connected to the physical source terminal node. A virtual edge is established based on the time slot virtual node after the transmission time slot is abstracted on the link; a physical link set is queried based on the physical destination terminal node in the physical terminal node set, the physical link connected to the physical destination terminal node is determined, and then the time slot virtual node after the transmission time slot is abstracted on the physical link connected to the physical destination terminal node is obtained; a virtual edge is established based on the virtual destination terminal node and the time slot virtual node after the transmission time slot is abstracted on the physical link connected to the physical destination terminal node; and a virtual edge set is generated based on the virtual edges between the time slot virtual nodes, the virtual edge established between the virtual source terminal node and the time slot virtual node after the transmission time slot is abstracted on the physical link connected to the physical source terminal node, and the virtual edge established between the virtual destination terminal node and the time slot virtual node after the transmission time slot is abstracted on the physical link connected to the physical destination terminal node. It should be noted that when determining the virtual edge set, attribute information can be added to each virtual edge in the set.

[0051] S150 , constructing a deterministic network virtual graph according to the time slot virtual node set, the virtual terminal node set, and the virtual edge set.

[0052] Specifically, the virtual nodes in the time slot virtual node set and the virtual terminal node set are connected according to the virtual edges in the virtual edge set to construct a deterministic network virtual graph.

[0053] Optionally, determining a target transmission time slot set in the downstream physical link that is allowed to forward a data packet transmitted in the current transmission time slot based on the number of transmission time slots of the current physical link, the current transmission time slot of the current physical link, a target time offset between the current physical link and a downstream physical link adjacent to the current link, a propagation delay of the current physical link, the length of the current transmission time slot, and the number of gated queues corresponding to the downstream physical link includes:

[0054] determining, based on the number of transmission time slots of the current physical link, the current transmission time slot of the current physical link, a target time offset between the current physical link and a downstream physical link adjacent to the current link, a propagation delay of the current physical link, and a length of the current transmission time slot, a first transmission time slot in the downstream physical link for receiving a data packet transmitted in the current transmission time slot;

[0055] A target transmission time slot set in the downstream physical link that is allowed to forward data packets transmitted in the current transmission time slot is determined based on the first transmission time slot, the number of transmission time slots of the current physical link, and the number of gated queues corresponding to the downstream physical link.

[0056] The first transmission time slot is the latest transmission time slot in which a data packet transmitted from the current transmission time slot on the current physical link can be received by the downstream physical link.

[0057] Specifically, based on the number of transmission time slots of the current physical link, the current transmission time slot of the current physical link, the target time offset between the current physical link and a downstream physical link adjacent to the current link, the propagation delay of the current physical link, and the length of the current transmission time slot, a calculation method for determining the first transmission time slot in the downstream physical link for receiving a data packet transmitted in the current transmission time slot may be:

[0058]

[0059] Among them, Φ e,e′ (c e,n ) is the first transmission time slot, mod(x,y) is equivalent to x mod y, Indicates that x is rounded down, e is the current physical link, and e′ is the downstream physical link adjacent to the current link. c e,n is the current transmission time slot of the current physical link, N is the number of transmission time slots of the current physical link, where N is a positive integer greater than or equal to three, T is the length of the current transmission time slot, ed is the propagation delay of the current physical link, The target time offset between the current physical link and the downstream physical link adjacent to the current link.

[0060] Specifically, based on the first transmission time slot, the number of transmission time slots of the current physical link, and the number of gated queues corresponding to the downstream physical link, a calculation method for determining a target transmission time slot set in the downstream physical link that is allowed to forward a data packet transmitted in the current transmission time slot may be:

[0061]

[0062] in, is the target transmission time slot set, Φ e,e′ (c e,n ) is the first transmission time slot, N is the number of transmission time slots of the current physical link, R e′ The number of gated queues corresponding to the downstream physical link.

[0063] By determining the first transmission time slot in the downstream physical link for receiving the data packet transmitted in the current transmission time slot based on the number of transmission time slots of the current physical link, the current transmission time slot of the current physical link, the target time deviation between the current physical link and the downstream physical link adjacent to the current link, the propagation delay of the current physical link and the length of the current transmission time slot; and determining the target transmission time slot set in the downstream physical link that is allowed to forward the data packet transmitted in the current transmission time slot based on the first transmission time slot, the number of transmission time slots of the current physical link and the number of gated queues corresponding to the downstream physical link, it is possible to determine to the maximum extent all transmission time slots in the downstream physical link that are allowed to forward the data packet transmitted in the current transmission time slot, laying the foundation for building a more accurate deterministic network virtual map.

[0064] Optionally, determining a virtual edge set according to the time slot virtual node set, the virtual terminal node set, and the physical link set includes:

[0065] Determine a first type of edge set according to the time slot virtual node set;

[0066] Determine a second type of edge set according to the virtual source terminal node in the virtual terminal node set and the physical link set;

[0067] Determine a third type of edge set according to the virtual destination terminal node in the virtual terminal node set and the physical link set;

[0068] A virtual edge set is determined according to the first-type edge set, the second-type edge set, and the third-type edge set.

[0069] Among them, each first-class edge in the first-class edge set is an edge between time slot virtual nodes, representing the connection relationship between transmission time slots; each second-class edge in the second-class edge set is an edge between time slot virtual nodes after abstraction of transmission time slots on the physical link connecting the virtual source terminal node and the physical source terminal node, representing the connection relationship of the transmission time slots on the physical source terminal node; each third-class edge in the third-class edge set is an edge between time slot virtual nodes after abstraction of transmission time slots on the physical link connecting the virtual destination terminal node and the physical destination terminal node, representing the connection relationship of the last hop in the deterministic network resource model.

[0070] Specifically, a method for determining the first type of edge set based on the time slot virtual node set may be: determining the current time slot virtual node based on the time slot virtual node set, and the target transmission time slot set corresponding to the transmission time slot corresponding to the current time slot virtual node, and then obtaining the time slot virtual node set corresponding to the target transmission time slot set based on the target transmission time slot set, and connecting each time slot virtual node in the time slot virtual node set corresponding to the current time slot virtual node and the target transmission time slot set to obtain the first type of edge set, wherein the first type of edge set can be expressed as:

[0071]

[0072] Among them, ε s ' lot-slot is the first type edge set, Current transmission time slot Mapped time slot virtual nodes, For the physical link [v i ,v j ]'s downstream physical link [v j ,v k ] allows forwarding of the current transmission slot The target transmission time slot set of the data packet transmitted in, is one of the transmission time slots in the target transmission time slot set, for Abstract time slot virtual node, ε is the set of physical links.

[0073] Specifically, the method for determining the second type of edge set based on the virtual source terminal node in the virtual terminal node set and the physical link set can be: querying the physical link set based on the physical source terminal node in the physical terminal node set, determining the physical link connected to the physical source terminal node, and then obtaining each time slot virtual node after abstraction of each transmission time slot on the physical link connected to the physical source terminal node; based on each time slot virtual node after abstraction of each transmission time slot on the physical link connected to the physical source terminal node, respectively construct a second type of edge with the virtual source terminal node to generate a second type of edge set, wherein the second type of edge set can be expressed as:

[0074]

[0075] Among them, ε e ' nd-slot is the second type of edge set, v i is the physical source terminal node, is the set of physical terminal nodes, v i ′ is a virtual source terminal node abstracted from the physical source terminal node, [v i ,v j ] is the physical link connected to the physical source terminal node, is the physical link connected to the physical source terminal node [v i ,v j ] on each transmission slot, for Abstract slotted virtual node.

[0076] Specifically, a method for determining the third type of edge set based on the virtual destination terminal node in the virtual terminal node set and the physical link set can be: querying the physical link set based on the physical destination terminal node in the physical terminal node set, determining the physical link connected to the physical destination terminal node, and then obtaining each time slot virtual node after abstraction of each transmission time slot on the physical link connected to the physical destination terminal node; and constructing third type edges with the virtual destination terminal node based on each time slot virtual node after abstraction of each transmission time slot on the physical link connected to the physical destination terminal node, thereby generating a third type of edge set. The third type of edge set can be expressed as:

[0077]

[0078] Among them, ε s ' lot-end is the third type of edge set, v j For physical purpose terminal node, v j ′ is the virtual destination terminal node abstracted from the physical destination terminal node, [v i ,v j] is the physical link connected to the physical destination terminal node, The physical link connected to the physical destination terminal node [v i ,v j ] on each transmission slot, for Abstract slotted virtual node.

[0079] Specifically, a method of determining the virtual edge set according to the first type edge set, the second type edge set, and the third type edge set may be:

[0080] ε′=ε′ slot-slot Uε′ end-slot Uε′ slot-end

[0081] Among them, ε′ is the set of virtual edges, and ∪ means taking the union.

[0082] By determining the first type of edge set based on the time slot virtual node set and the physical link set; determining the second type of edge set based on the virtual source terminal node and the physical link set in the virtual terminal node set; determining the third type of edge set based on the virtual destination terminal node and the physical link set in the virtual terminal node set; and determining the virtual edge set based on the first type of edge set, the second type of edge set and the third type of edge set, the connection edge relationship between the time slot virtual nodes, the virtual source terminal nodes and the virtual destination terminal nodes can be accurately determined, laying the foundation for the subsequent construction of a more accurate deterministic network virtual graph.

[0083] At the same time, in the process of constructing a deterministic network virtual graph based on the time slot virtual node set, the virtual terminal node set and the virtual edge set, not only the transmission time slot on each physical link in the deterministic network resource model is abstracted as a time slot virtual node, but also the physical source terminal node in the physical terminal node set is abstracted as a virtual source terminal node, and the physical destination terminal node in the physical terminal node set is abstracted as a virtual destination terminal node, which can fully reflect the transmission process from the physical source terminal node to the physical destination terminal node. If the physical source terminal node and the physical destination terminal node are not introduced, the transmission process of the resource in the deterministic network resource model to the physical destination terminal node cannot be reflected, because the data packet is no longer forwarded at the physical destination terminal node, and there is no resource for the transmission time slot. In addition, the deterministic network virtual graph includes edges from physical source terminal nodes to transmission time slots in order to incorporate the time slot selection of the physical source terminal nodes into the virtual graph, facilitating routing resource orchestration and scheduling. If the edges from the physical source terminal nodes to the transmission time slots are not included, the time slot selection of the physical source terminal nodes becomes the selection of the access node for the resources, which is no longer a node-to-node routing selection problem, and resource orchestration and scheduling will become extremely complicated.

[0084] Optionally, determining the first type of edge set according to the time slot virtual node set includes:

[0085] Determine a time slot virtual node corresponding to a current transmission time slot and a time slot virtual node corresponding to each target transmission time slot in the time slot virtual node set;

[0086] Determine a first type of edge according to the time slot virtual node corresponding to the current transmission time slot and the time slot virtual node corresponding to each target transmission time slot;

[0087] Determining a target delay attribute of the first type of edge according to an initial delay attribute between a current transmission time slot and each target transmission time slot;

[0088] A first-type edge set is determined according to the first-type edges and target delay attributes of the first-type edges.

[0089] The initial delay attribute is the delay attribute corresponding to the directed edge between the current transmission time slot and each target transmission time slot, and the target delay attribute is the delay attribute between the time slot virtual node corresponding to the current transmission time slot and the time slot virtual node corresponding to each target transmission time slot.

[0090] Specifically, the method for determining the time slot virtual node corresponding to the current transmission time slot and the time slot virtual node corresponding to each target transmission time slot in the time slot virtual node set can be: query and determine the time slot virtual node corresponding to the current transmission time slot and the time slot virtual node corresponding to each target transmission time slot in the time slot virtual node set.

[0091] Specifically, the method for determining the first type of edge based on the time slot virtual node corresponding to the current transmission time slot and the time slot virtual node corresponding to each target transmission time slot can be: the physical link corresponding to each target transmission time slot is the downstream link of the physical link corresponding to the current transmission time slot, and based on this relationship, the time slot virtual node corresponding to the current transmission time slot is connected to the time slot virtual node corresponding to each target transmission time slot to obtain the first type of edge between the time slot virtual node corresponding to the current transmission time slot and each target transmission time slot.

[0092] Specifically, the method for determining the target delay attribute of the first type of edge based on the initial delay attribute between the current transmission time slot and each target transmission time slot can be: determining the initial delay attribute between the current transmission time slot and each target transmission time slot based on the current transmission time slot, the target transmission time slot, the propagation delay of the current physical link, the length of the current transmission time slot, the target time deviation, the first transmission time slot and the number of transmission time slots of the current physical link, and determining the initial delay attribute as the target delay attribute of the first type of edge corresponding to each target transmission time slot.

[0093] Specifically, the method for determining the first-class edge set based on the first-class edges and the target delay attributes of the first-class edges can be: each first-class edge carries the target delay attribute of the first-class edge, and then the first-class edge set is generated based on each first-class edge carrying the target delay attribute.

[0094] Optionally, determining the target delay attribute of the first-type edge according to the initial delay attribute between the current transmission time slot and each target transmission time slot includes:

[0095] Determining the initial delay attribute based on the current transmission time slot, the target transmission time slot, the propagation delay of the current physical link, the length of the current transmission time slot, the target time offset, the first transmission time slot, and the number of transmission time slots of the current physical link;

[0096] The initial delay attribute is determined as the target delay attribute of the first type of edge.

[0097] Specifically, the calculation method for determining the initial delay attribute according to the current transmission time slot, the target transmission time slot, the propagation delay of the current physical link, the length of the current transmission time slot, the target time offset, the first transmission time slot, and the number of transmission time slots of the current physical link is:

[0098]

[0099] in, is the current transmission time slot c e,n With the target transmission time slot c e′,n′ The value corresponding to the initial delay attribute between, ed is the propagation delay of the current physical link, T is the length of the current transmission time slot, is the target time deviation, Φ e,e′ (c e,n ) is the first transmission time slot, N is the number of transmission time slots of the current physical link, and frac(x) represents the fractional part of x.

[0100] Specifically, determining the initial delay attribute as the target delay attribute of the first-class edge can be understood as: each first-class edge has a target delay attribute, wherein the value of the target delay attribute is the value corresponding to the initial delay attribute between the current transmission time slot and each target transmission time slot.

[0101] Optionally, determining a third type of edge set according to the virtual destination terminal node in the virtual terminal node set and the physical link set includes:

[0102] Determine a third type of edge according to a virtual destination terminal node in the virtual terminal node set and a time slot virtual node corresponding to each transmission time slot on a physical link connected to the physical destination terminal node;

[0103] Determining a target delay attribute of the third type edge according to a propagation delay of a physical link connected to the physical destination terminal node;

[0104] A third type edge set is determined according to the third type edges and the target delay attributes of the third type edges.

[0105] Specifically, the method for determining the third type of edge based on the virtual destination terminal node in the virtual terminal node set and the time slot virtual node corresponding to each transmission time slot on the physical link connected to the physical destination terminal node can be: connecting the virtual destination terminal node and the time slot virtual node abstracted for each transmission time slot on the physical link connected to the physical destination terminal node, and obtaining the third type of edge between the time slot virtual node abstracted for each transmission time slot on the physical link connected to the virtual destination terminal node and the physical destination terminal node.

[0106] Specifically, the method for determining the target delay attribute of the third type of edge based on the propagation delay of the physical link connected to the physical destination terminal node can be: directly determining the value corresponding to the propagation delay of the physical link connected to the physical destination terminal node as the value corresponding to the target delay attribute of the third type of edge, and then setting the target delay attribute for the third type of edge.

[0107] Specifically, the method for determining the third type edge set based on the third type edge and the target delay attribute of the third type edge can be: each third type edge carries the target delay attribute, and then the third type edge set is generated based on each third type edge carrying the target delay attribute.

[0108] Optionally, determining a time slot virtual node set according to each target transmission time slot in the target transmission time slot set and the current transmission time slot includes:

[0109] Determine the time slot virtual node corresponding to the current transmission time slot according to the current transmission time slot, the bandwidth of the current physical link, and the length of the current transmission time slot;

[0110] Determine a time slot virtual node corresponding to each target transmission time slot according to each target transmission time slot, a bandwidth of a downstream physical link of the current physical link, and a length of the target transmission time slot;

[0111] A time slot virtual node set is determined according to the time slot virtual node corresponding to each target transmission time slot and the time slot virtual node corresponding to the current transmission time slot.

[0112] Specifically, the method for determining the time slot virtual node corresponding to the current transmission time slot based on the current transmission time slot, the bandwidth of the current physical link, and the length of the current transmission time slot may be: determining the initial transmission capacity of the current transmission time slot based on the bandwidth of the current physical link and the length of the current transmission time slot; determining the time slot virtual node corresponding to the current transmission time slot based on the current transmission time slot and the initial transmission capacity of the current transmission time slot, wherein the initial transmission capacity of the current transmission time slot is the maximum transmission capacity corresponding to the current transmission time slot, and may also be the remaining transmission capacity. Specifically, the method for determining the initial transmission capacity of the current transmission time slot based on the bandwidth of the current physical link and the length of the current transmission time slot may be:

[0113] c e,n .u=eb×T;

[0114] Among them, c e,n .u is the current transmission time slot c e,n , eb is the bandwidth of the current physical link, and T is the length of the current transmission time slot. Specifically, the method for determining the time slot virtual node corresponding to the current transmission time slot based on the current transmission time slot and the initial transmission capacity of the current transmission time slot can be: abstracting the current transmission time slot into a time slot virtual node, and setting a transmission capacity attribute for the time slot virtual node abstracted from the current transmission time slot based on the initial transmission capacity of the current transmission time slot. That is, each time slot virtual node can carry a transmission capacity attribute, and the time slot virtual node abstracted from the current transmission time slot and the transmission capacity attribute carried by the time slot virtual node constitute the time slot virtual node corresponding to the current transmission time slot.

[0115] Specifically, the method of determining the time slot virtual node corresponding to each target transmission time slot based on each target transmission time slot, the bandwidth of the downstream physical link of the current physical link, and the length of the target transmission time slot is similar to the method of determining the time slot virtual node corresponding to the current transmission time slot based on the current transmission time slot, the bandwidth of the current physical link, and the length of the current transmission time slot, and will not be repeated here.

[0116] Specifically, a time slot virtual node set is generated by combining the time slot virtual node corresponding to each target transmission time slot and the time slot virtual node corresponding to the current transmission time slot.

[0117] The technical solution of this embodiment is to obtain a deterministic network resource model, wherein the deterministic network resource model includes: a physical node set and a physical link set, and the physical node set includes at least: a physical terminal node set; in the deterministic network resource model, according to the number of transmission time slots of the current physical link, the current transmission time slot of the current physical link, the target time deviation between the current physical link and the downstream physical link adjacent to the current link, the propagation delay of the current physical link, the length of the current transmission time slot and the number of gated queues corresponding to the downstream physical link, determine the target transmission time slot set in the downstream physical link that is allowed to forward the data packet transmitted in the current transmission time slot; determine the time slot virtual node set according to each target transmission time slot and the current transmission time slot in the target transmission time slot set, and determine the virtual terminal node set according to the physical terminal node set; determine the virtual edge set according to the time slot virtual node set, the physical terminal node set and the physical link set; based on A deterministic network virtual graph is constructed based on the time slot virtual node set, the virtual terminal node set and the virtual edge set, which solves the problem of being unable to efficiently globally represent deterministic network resources due to the limitations of the resource orchestration and scheduling methods in the existing technology. The transmission time slots can be abstracted as nodes in the deterministic network virtual graph, and the connection relationship between the transmission time slots is represented by the structure of the deterministic network virtual graph, which overcomes the problem of loss of solution space caused by constructing resource combinations during resource orchestration and scheduling. The global representation of the solution space is achieved through the constructed deterministic network virtual graph, and the deterministic network resource model is constructed as a virtual graph structure, which integrates the original topological connection information and transmission time slot information in the deterministic network resource model, thereby converting the problem of deterministic network resource scheduling into a routing scheduling problem. A large number of related algorithms for routing scheduling can be directly applied to the deterministic network virtual graph to realize resource scheduling, which helps to achieve end-to-end deterministic service quality assurance for computing network integration and business orientation.

[0118] Example 2

[0119] Figure 2 This is a schematic diagram of the structure of a virtual graph construction device in the second embodiment of the present invention. This embodiment is applicable to the case where a deterministic network resource model is abstracted into a deterministic network virtual graph, and then resource scheduling of a deterministic network is calculated. The device can be implemented in software and / or hardware, and can be integrated into any device that provides the function of virtual graph construction, such as Figure 2 As shown, the virtual graph construction device specifically includes: a model acquisition module 210, a time slot determination module 220, a node determination module 230, a virtual edge determination module 240 and a virtual graph determination module 250.

[0120] The model acquisition module 210 is configured to acquire a deterministic network resource model, wherein the deterministic network resource model includes: a physical node set and a physical link set, and the physical node set includes at least: a physical terminal node set;

[0121] a timeslot determination module 220 configured to determine, in the deterministic network resource model, a target transmission timeslot set in the downstream physical link that is allowed to forward a data packet transmitted in the current transmission timeslot based on the number of transmission timeslots in the current physical link, the current transmission timeslot of the current physical link, a target time offset between the current physical link and a downstream physical link adjacent to the current link, a propagation delay of the current physical link, a length of the current transmission timeslot, and a number of gated queues corresponding to the downstream physical link;

[0122] a node determination module 230 configured to determine a time slot virtual node set based on each target transmission time slot in the target transmission time slot set and the current transmission time slot, and to determine a virtual terminal node set based on the physical terminal node set;

[0123] A virtual edge determination module 240 is configured to determine a virtual edge set based on the time slot virtual node set, the physical terminal node set, and the physical link set;

[0124] The virtual graph determining module 250 is configured to construct a deterministic network virtual graph according to the time slot virtual node set, the virtual terminal node set, and the virtual edge set.

[0125] Optionally, the time slot determination module is specifically configured to:

[0126] determining, based on the number of transmission time slots of the current physical link, the current transmission time slot of the current physical link, a target time offset between the current physical link and a downstream physical link adjacent to the current link, a propagation delay of the current physical link, and a length of the current transmission time slot, a first transmission time slot in the downstream physical link for receiving a data packet transmitted in the current transmission time slot;

[0127] A target transmission time slot set in the downstream physical link that is allowed to forward data packets transmitted in the current transmission time slot is determined based on the first transmission time slot, the number of transmission time slots of the current physical link, and the number of gated queues corresponding to the downstream physical link.

[0128] Optionally, the virtual edge determination module is specifically configured to:

[0129] Determine a first type of edge set according to the time slot virtual node set;

[0130] Determine a second type of edge set according to the virtual source terminal node in the virtual terminal node set and the physical link set;

[0131] Determine a third type of edge set according to the virtual destination terminal node in the virtual terminal node set and the physical link set;

[0132] A virtual edge set is determined according to the first-type edge set, the second-type edge set, and the third-type edge set.

[0133] Optionally, the virtual edge determination module is specifically configured to:

[0134] Determine a time slot virtual node corresponding to a current transmission time slot and a time slot virtual node corresponding to each target transmission time slot in the time slot virtual node set;

[0135] Determine a first type of edge according to the time slot virtual node corresponding to the current transmission time slot and the time slot virtual node corresponding to each target transmission time slot;

[0136] Determining a target delay attribute of the first type of edge according to an initial delay attribute between a current transmission time slot and each target transmission time slot;

[0137] A first-type edge set is determined according to the first-type edges and target delay attributes of the first-type edges.

[0138] Optionally, the virtual edge determination module is specifically configured to:

[0139] Determining the initial delay attribute based on the current transmission time slot, the target transmission time slot, the propagation delay of the current physical link, the length of the current transmission time slot, the target time offset, the first transmission time slot, and the number of transmission time slots of the current physical link;

[0140] The initial delay attribute is determined as the target delay attribute of the first type of edge.

[0141] Optionally, the virtual edge determination module is specifically configured to:

[0142] Determine a third type of edge according to a virtual destination terminal node in the virtual terminal node set and a time slot virtual node corresponding to each transmission time slot on a physical link connected to the physical destination terminal node;

[0143] Determining a target delay attribute of the third type edge according to a propagation delay of a physical link connected to the physical destination terminal node;

[0144] A third type edge set is determined according to the third type edges and the target delay attributes of the third type edges.

[0145] Optionally, the node determination module is specifically configured to:

[0146] Determine the time slot virtual node corresponding to the current transmission time slot according to the current transmission time slot, the bandwidth of the current physical link, and the length of the current transmission time slot;

[0147] Determine a time slot virtual node corresponding to each target transmission time slot according to each target transmission time slot, a bandwidth of a downstream physical link of the current physical link, and a length of the target transmission time slot;

[0148] A time slot virtual node set is determined according to the time slot virtual node corresponding to each target transmission time slot and the time slot virtual node corresponding to the current transmission time slot.

[0149] The above-mentioned product can execute the method provided by any embodiment of the present invention, and has the corresponding functional modules and beneficial effects of the execution method.

[0150] Example 3

[0151] Figure 3 : is a structural diagram of an electronic device in embodiment three of the present invention. The electronic device is intended to represent various forms of digital computers, such as laptop computers, desktop computers, workstations, personal digital assistants, servers, blade servers, mainframe computers, and other suitable computers. The electronic device may also represent various forms of mobile devices, such as personal digital processing, cellular phones, smart phones, wearable devices (such as helmets, glasses, watches, etc.) and other similar computing devices. The components shown herein, their connections and relationships, and their functions are merely examples and are not intended to limit the implementation of the present invention described and / or required herein.

[0152] like Figure 3 As shown, the electronic device 10 includes at least one processor 11, and a memory connected to the at least one processor 11, such as a read-only memory (ROM) 12, a random access memory (RAM) 13, etc., wherein the memory stores a computer program that can be executed by the at least one processor, and the processor 11 can perform various appropriate actions and processes according to the computer program stored in the read-only memory (ROM) 12 or the computer program loaded from the storage unit 18 to the random access memory (RAM) 13. Various programs and data required for the operation of the electronic device 10 can also be stored in the RAM 13. The processor 11, ROM 12 and RAM 13 are connected to each other via a bus 14. An input / output (I / O) interface 15 is also connected to the bus 14.

[0153] Multiple components in the electronic device 10 are connected to the I / O interface 15, including an input unit 16, such as a keyboard, a mouse, etc.; an output unit 17, such as various types of displays, speakers, etc.; a storage unit 18, such as a magnetic disk, an optical disk, etc.; and a communication unit 19, such as a network card, a modem, a wireless communication transceiver, etc. The communication unit 19 allows the electronic device 10 to exchange information / data with other devices via a computer network such as the Internet and / or various telecommunication networks.

[0154] The processor 11 may be any general-purpose and / or specialized processing component with processing and computing capabilities. Examples of the processor 11 include, but are not limited to, a central processing unit (CPU), a graphics processing unit (GPU), various specialized artificial intelligence (AI) computing chips, various processors for running machine learning model algorithms, a digital signal processor (DSP), and any appropriate processor, controller, microcontroller, etc. The processor 11 executes the various methods and processes described above, such as the virtual graph construction method.

[0155] In some embodiments, the virtual graph construction method can be implemented as a computer program that is tangibly contained in a computer-readable storage medium, such as the storage unit 18. In some embodiments, part or all of the computer program can be loaded and / or installed on the electronic device 10 via the ROM 12 and / or the communication unit 19. When the computer program is loaded into the RAM 13 and executed by the processor 11, one or more steps of the virtual graph construction method described above can be performed. Alternatively, in other embodiments, the processor 11 can be configured to execute the virtual graph construction method in any other appropriate manner (e.g., by means of firmware).

[0156] Various embodiments of the systems and techniques described herein can be implemented in digital electronic circuit systems, integrated circuit systems, field programmable gate arrays (FPGAs), application specific integrated circuits (ASICs), application specific standard products (ASSPs), system-on-chip systems (SOCs), programmable logic devices (CPLDs), computer hardware, firmware, software, and / or combinations thereof. These various embodiments can include being implemented in one or more computer programs that are executable and / or interpreted on a programmable system that includes at least one programmable processor, which can be a special purpose or general purpose programmable processor that can receive data and instructions from a storage system, at least one input device, and at least one output device, and transmit data and instructions to the storage system, the at least one input device, and the at least one output device.

[0157] Computer programs for implementing the methods of the present invention may be written in any combination of one or more programming languages. These computer programs may be provided to a processor of a general-purpose computer, a special-purpose computer, or other programmable data processing device, such that when the computer program is executed by the processor, the functions / operations specified in the flowcharts and / or block diagrams are implemented. The computer program may be executed entirely on the machine, partially on the machine, as a stand-alone software package, partially on the machine and partially on a remote machine, or entirely on a remote machine or server.

[0158] In the context of the present invention, computer-readable storage media can be tangible media that can contain or store a computer program for use with an instruction execution system, device or equipment or used in combination with an instruction execution system, device or equipment. Computer-readable storage media can include but are not limited to electronic, magnetic, optical, electromagnetic, infrared or semiconductor systems, devices or equipment, or any suitable combination of the foregoing. Alternatively, computer-readable storage media can be machine-readable signal media. More specific examples of machine-readable storage media can include electrical connections based on one or more lines, portable computer disks, hard disks, random access memories (RAM), read-only memories (ROM), erasable programmable read-only memories (EPROM or flash memory), optical fibers, portable compact disk read-only memories (CD-ROM), optical storage devices, magnetic storage devices, or any suitable combination of the foregoing.

[0159] To provide interaction with a user, the systems and techniques described herein can be implemented on an electronic device having: a display device (e.g., a CRT (cathode ray tube) or LCD (liquid crystal display) monitor) for displaying information to the user; and a keyboard and pointing device (e.g., a mouse or trackball) through which the user can provide input to the electronic device. Other types of devices can also be used to provide interaction with the user; for example, the feedback provided to the user can be any form of sensory feedback (e.g., visual feedback, auditory feedback, or tactile feedback); and input from the user can be received in any form (including acoustic input, voice input, or tactile input).

[0160] The systems and techniques described herein can be implemented in a computing system that includes back-end components (e.g., as a data server), or a computing system that includes middleware components (e.g., an application server), or a computing system that includes front-end components (e.g., a user computer with a graphical user interface or web browser through which a user can interact with implementations of the systems and techniques described herein), or a computing system that includes any combination of such back-end components, middleware components, or front-end components. The components of the system can be interconnected by any form or medium of digital data communication (e.g., a communication network). Examples of communication networks include: a local area network (LAN), a wide area network (WAN), a blockchain network, and the Internet.

[0161] A computing system may include clients and servers. The clients and servers are typically remote from each other and typically interact via a communication network. This client-server relationship arises through computer programs running on the respective computers, creating a client-server relationship. The server may be a cloud server, also known as a cloud computing server or cloud host. This server is a hosting product within the cloud computing service ecosystem that addresses the management difficulties and limited scalability of traditional physical hosting and VPS services.

[0162] It should be understood that the various forms of the processes shown above can be used to reorder, add, or delete steps. For example, the steps described in the present invention can be performed in parallel, sequentially, or in a different order, as long as the desired results of the technical solution of the present invention can be achieved. This is not limited herein.

[0163] The above specific embodiments do not limit the scope of protection of the present invention. Those skilled in the art will appreciate that various modifications, combinations, sub-combinations, and substitutions may be made based on design requirements and other factors. Any modifications, equivalent substitutions, and improvements made within the spirit and principles of the present invention are intended to be included within the scope of protection of the present invention.

Claims

1. A method for constructing a virtual graph, characterized in that: include: Acquire a deterministic network resource model, wherein the deterministic network resource model includes: a physical node set and a physical link set, and the physical node set includes at least: a physical terminal node set; In the deterministic network resource model, a first transmission time slot in the downstream physical link for receiving a data packet transmitted in the current transmission time slot is determined based on the number of transmission time slots in the current physical link, the current transmission time slot of the current physical link, the target time offset between the current physical link and a downstream physical link adjacent to the current link, the propagation delay of the current physical link, and the length of the current transmission time slot; the first transmission time slot being the latest transmission time slot in which a data packet transmitted from the current transmission time slot on the current physical link will be received by the downstream physical link; determining, based on the first transmission time slot, the number of transmission time slots of the current physical link, and the number of gated queues corresponding to the downstream physical link, a target transmission time slot set in the downstream physical link that is allowed to forward the data packet transmitted in the current transmission time slot; Abstracting the current transmission time slot into a time slot virtual node, abstracting each target transmission time slot in the target transmission time slot set into a time slot virtual node, and then constructing a time slot virtual node set; and determining a virtual terminal node set based on the physical terminal node set; Determine a virtual edge set according to the time slot virtual node set, the virtual terminal node set, and the physical link set; A deterministic network virtual graph is constructed according to the time slot virtual node set, the virtual terminal node set, and the virtual edge set.

2. The method according to claim 1, characterized in that Determining a virtual edge set according to the time slot virtual node set, the virtual terminal node set, and the physical link set includes: Determine a first type of edge set according to the time slot virtual node set; Determine a second type of edge set according to the virtual source terminal node in the virtual terminal node set and the physical link set; Determine a third type of edge set according to the virtual destination terminal node in the virtual terminal node set and the physical link set; A virtual edge set is determined according to the first-type edge set, the second-type edge set, and the third-type edge set.

3. The method according to claim 2, characterized in that Determining a first type of edge set according to the time slot virtual node set includes: Determine a time slot virtual node corresponding to a current transmission time slot and a time slot virtual node corresponding to each target transmission time slot in the time slot virtual node set; Determine a first type of edge according to the time slot virtual node corresponding to the current transmission time slot and the time slot virtual node corresponding to each target transmission time slot; Determining a target delay attribute of the first type of edge according to an initial delay attribute between a current transmission time slot and each target transmission time slot; A first-type edge set is determined according to the first-type edges and target delay attributes of the first-type edges.

4. The method according to claim 3, characterized in that Determining a target delay attribute of the first-type edge according to an initial delay attribute between a current transmission time slot and each target transmission time slot includes: Determining the initial delay attribute based on the current transmission time slot, the target transmission time slot, the propagation delay of the current physical link, the length of the current transmission time slot, the target time offset, the first transmission time slot, and the number of transmission time slots of the current physical link; The initial delay attribute is determined as the target delay attribute of the first type of edge.

5. The method according to claim 2, characterized in that Determining a third type of edge set according to the virtual destination terminal node in the virtual terminal node set and the physical link set includes: Determine a third type of edge according to a virtual destination terminal node in the virtual terminal node set and a time slot virtual node corresponding to each transmission time slot on a physical link connected to the physical destination terminal node; Determining a target delay attribute of the third type edge according to a propagation delay of a physical link connected to the physical destination terminal node; A third type edge set is determined according to the third type edges and the target delay attributes of the third type edges.

6. The method according to claim 1, characterized in that Determining a time slot virtual node set according to each target transmission time slot in the target transmission time slot set and the current transmission time slot includes: Determine the time slot virtual node corresponding to the current transmission time slot according to the current transmission time slot, the bandwidth of the current physical link, and the length of the current transmission time slot; Determine a time slot virtual node corresponding to each target transmission time slot according to each target transmission time slot, a bandwidth of a downstream physical link of the current physical link, and a length of the target transmission time slot; A time slot virtual node set is determined according to the time slot virtual node corresponding to each target transmission time slot and the time slot virtual node corresponding to the current transmission time slot.

7. A virtual graph construction device, characterized in that: include: A model acquisition module is used to acquire a deterministic network resource model, wherein the deterministic network resource model includes: a physical node set and a physical link set, and the physical node set includes at least: a physical terminal node set; a time slot determination module configured to determine, in the deterministic network resource model, a target transmission time slot set in the downstream physical link that is allowed to forward a data packet transmitted in the current transmission time slot based on the number of transmission time slots of the current physical link, the current transmission time slot of the current physical link, a target time offset between the current physical link and a downstream physical link adjacent to the current link, a propagation delay of the current physical link, a length of the current transmission time slot, and a number of gated queues corresponding to the downstream physical link; a node determination module, configured to determine a time slot virtual node set according to each target transmission time slot in the target transmission time slot set and a current transmission time slot, and determine a virtual terminal node set according to the physical terminal node set; A virtual edge determination module, configured to determine a virtual edge set according to the time slot virtual node set, the virtual terminal node set, and the physical link set; A virtual graph determination module, configured to construct a deterministic network virtual graph based on the time slot virtual node set, the virtual terminal node set, and the virtual edge set; The time slot determination module is specifically configured to: determining, based on the number of transmission time slots of the current physical link, the current transmission time slot of the current physical link, a target time offset between the current physical link and a downstream physical link adjacent to the current link, a propagation delay of the current physical link, and a length of the current transmission time slot, a first transmission time slot in the downstream physical link for receiving a data packet transmitted in the current transmission time slot; the first transmission time slot being the latest transmission time slot in which a data packet transmitted from the current transmission time slot on the current physical link will be received by the downstream physical link; determining, based on the first transmission time slot, the number of transmission time slots of the current physical link, and the number of gated queues corresponding to the downstream physical link, a target transmission time slot set in the downstream physical link that is allowed to forward the data packet transmitted in the current transmission time slot; The node determination module is specifically used for: The current transmission time slot is abstracted as a time slot virtual node, each target transmission time slot in the target transmission time slot set is abstracted as a time slot virtual node, and then a time slot virtual node set is constructed; and a virtual terminal node set is determined according to the physical terminal node set.

8. An electronic device, characterized in that: The electronic device comprises: at least one processor; and a memory communicatively connected to the at least one processor; wherein, The memory stores a computer program executable by the at least one processor. The computer program is executed by the at least one processor to enable the at least one processor to execute the virtual graph construction method according to any one of claims 1 to 6.

9. A computer-readable storage medium, characterized in that The computer-readable storage medium stores computer instructions, and the computer instructions are used to enable a processor to implement the virtual graph construction method according to any one of claims 1 to 6 when executed.

Images