Resource management method

Abstract

The embodiments of the present disclosure provide a resource management method. The method comprises: creating a time-dimension-based resource, wherein the time-dimension-based resource indicates the amount of resources that can be carried on the basis of a time unit; and processing the time-dimension-based resource.

Description

Resource Management Methods

[0001] CROSS-REFERENCE TO RELATED APPLICATIONS

[0002] This disclosure is based on Chinese patent application 202311811979.6 filed on December 25, 2023, and claims the priority of the patent application, and all the disclosed contents thereof are incorporated into the present disclosure by reference. Technical Field

[0003] The present disclosure relates to the field of communications, and in particular to a resource management method. Background Art

[0004] Deterministic networking refers to the ability to provide forwarding capabilities within a network that are guaranteed by deterministic service SLAs (service-level agreements). The primary goal at this stage is to support deterministic low packet loss rates, deterministic forwarding delay boundaries, and deterministic jitter caps. To meet business needs for deterministic services and implement deterministic technology at the L3 layer, the IETF standards organization proposed Deterministic Networking (DetNet). RFC8655 defines the DetNet-related technical architecture, providing deterministic services for Layer 2 bridges and Layer 3 routing networks. DetNet Quality of Service (QoS) requirements include deterministic delay caps, low packet loss rates, reduced jitter, and high reliability. Deterministic networking uses resource reservation, explicit routing, and service protection to provide deterministic QoS.

[0005] Currently, IETF DetNet uses traffic engineering (TE) technology to ensure a certain level of QoS, employing a resource scheduling and management method that reserves bandwidth resources. However, in large-scale networking scenarios, there are problems such as large-scale dynamic concurrency of traffic, large-scale complex topologies, and long-distance latency. Reserving bandwidth alone cannot guarantee deterministic latency and jitter.

[0006] To meet the needs of large-scale networking, the IETF proposed Enhanced DetNet, which requires enhanced time-based queue scheduling mechanisms to ensure deterministic latency and jitter reduction. The IETF has currently proposed multiple queue scheduling mechanisms, each with varying latency and jitter reduction capabilities. In addition to traditional bandwidth resources, TE must manage and schedule multiple deterministic resources, such as queues and buffers. This complicates resource management and scheduling, and because various queue mechanisms lack a unified mechanism for scheduling and controlling these resources, they are incompatible and unable to meet the requirements of deterministic service transport.

[0007] Summary of the Invention

[0008] The embodiments of the present disclosure provide a resource management method to at least solve the problem in related technologies that, in addition to traditional bandwidth resources, TE also needs to manage and schedule multi-dimensional deterministic resources such as queues and caches, resulting in complex resource management and scheduling.

[0009] According to an embodiment of the present disclosure, a resource management method is provided, including:

[0010] Create time-based resources, which indicate the amount of resources that can be carried based on a time unit;

[0011] Process resources based on the time dimension.

[0012] According to another embodiment of the present disclosure, a computer-readable storage medium is provided, in which a computer program is stored. The computer program is configured to execute the steps of any one of the above method embodiments when running.

[0013] According to another embodiment of the present disclosure, an electronic device is provided, including a memory and a processor, wherein a computer program is stored in the memory, and the processor is configured to run the computer program to perform the steps in any one of the above method embodiments. BRIEF DESCRIPTION OF THE DRAWINGS

[0014] FIG1 is a hardware structure block diagram of a mobile terminal of a resource management method according to an embodiment of the present disclosure;

[0015] FIG2 is a flow chart of a resource management method according to an embodiment of the present disclosure;

[0016] FIG3 is a schematic diagram of subtype length values ​​of resource objects of a time container according to an embodiment of the present disclosure;

[0017] FIG4 is a schematic diagram of sub-subtype length values ​​of a delay-related time unit according to an embodiment of the present disclosure;

[0018] FIG5 is a schematic diagram of sub-subtype length values ​​of a jitter-like time unit according to an embodiment of the present disclosure;

[0019] FIG6 is a schematic diagram of resource capacity subtype length values ​​in the time dimension according to an embodiment of the present disclosure;

[0020] FIG7 is a schematic diagram of a time unit resource sub-subtype length value according to an embodiment of the present disclosure;

[0021] FIG8 is a diagram of a centralized deterministic network structure according to an embodiment of the present disclosure;

[0022] FIG9 is a diagram of a distributed deterministic network structure according to an embodiment of the present disclosure;

[0023] FIG10 is a diagram of a hybrid deterministic network structure according to an embodiment of the present disclosure. DETAILED DESCRIPTION

[0024] Hereinafter, embodiments of the present disclosure will be described in detail with reference to the accompanying drawings and in conjunction with embodiments.

[0025] It should be noted that the terms "first", "second", etc. in the specification and claims of the present disclosure and the above-mentioned drawings are used to distinguish similar objects, and are not necessarily used to describe a specific order or sequence.

[0026] The IETF has proposed various queue scheduling mechanisms, each with different delay and jitter mitigation capabilities. Examples include deadline-based queue mechanisms that guarantee bounded delay, rate- and priority-based queue mechanisms, and periodic and time-slot queue mechanisms that guarantee end-to-end jitter mitigation.

[0027] The queue scheduling mechanism needs to combine the corresponding buffer and bandwidth requirements to ensure the transmission delay and jitter of deterministic flows. When using the TSN ATS / CBS / ADN scheduling mechanism, different traffic classes (such as CDT, class A, and class B) can be allocated initial burst and bandwidth shares, and then the upper bound of the per-hop delay for each traffic class is obtained based on the "rate-delay" service curve. When using the Cyclic Queuing and Forwarding (CQF) / Cycle Specified Queuing and Forwarding (CSQF) scheduling mechanism, different cycle levels can be allocated different initial bandwidth resource shares, where the upper bound of the per-hop delay for each cycle level is related to the cycle length. When using the Earliest Deadline First (EDF) algorithm or the deadline scheduling mechanism, different latency levels can be allocated different initial burst and bandwidth resource shares to meet the schedulability conditions, and each latency level determines the upper bound of the per-hop delay. When using the Timeslot Queueing and Forwarding (TSQF) scheduling mechanism, different latency levels can be allocated different initial burst and bandwidth resource shares to meet the schedulability conditions, and each latency level determines the upper bound of the per-hop delay. For deterministic links using the Time Queuing Forwarding (TQF) scheduling mechanism, each time slot within the scheduling cycle has an initial burst resource, whose size does not exceed the time slot length multiplied by the link bandwidth. The upper bound on per-hop latency is determined by the offset between the incoming time slot and the reserved outgoing time slot. Therefore, queue scheduling mechanisms, bandwidth, buffers, and other resources are all used to ensure deterministic performance.

[0028] Traditional resource management targets bandwidth resources, which are average bit rates based on statistical probability. Currently, TE traffic engineering technology schedules bandwidth resources. However, deterministic delay and jitter, while only guaranteeing average bit rates, still cannot guarantee determinism. Bit rate allocation based on the time dimension needs to be considered. In addition to traditional bandwidth resources, TE needs to manage and schedule multi-dimensional deterministic resources such as queue scheduling and buffers. These multi-dimensional resources need to be converted into one-dimensional resources based on the time dimension. Furthermore, since various queue mechanisms lack a unified mechanism for scheduling and controlling these resources, they are incompatible with each other. To simplify resource management and scheduling, unified resource management based on the time dimension is needed to ensure deterministic resource management and scheduling based on delay and jitter.

[0029] However, the related technologies do not consider deterministic resource scheduling and management based on the time dimension, nor do they consider protocol extensions of deterministic resources based on the time dimension, and are unable to meet the deterministic business carrying requirements.

[0030] To address the aforementioned technical issues, the disclosed embodiments propose a resource management method that quantifies time-based resources into the maximum amount of bits that can be carried by a time unit. This addresses the issue in related technologies where, in addition to traditional bandwidth resources, TE also needs to manage and schedule multi-dimensional deterministic resources such as queues and caches, leading to complex resource management and scheduling. This method achieves the goal of scheduling time-based resources to meet differentiated deterministic service quality. Furthermore, processing is performed based on the quantized time resources, such as by extending the resource announcement protocol, to perform resource announcements based on time resources, thereby achieving deterministic delay and jitter protection.

[0031] The method embodiments provided in the embodiments of the present disclosure can be executed in a mobile terminal, a computer terminal or a similar computing device. Taking operation on a mobile terminal as an example, FIG1 is a hardware structure block diagram of a mobile terminal of a resource management method of an embodiment of the present disclosure. As shown in FIG1 , the mobile terminal may include one or more (only one is shown in FIG1 ) processors 102 (the processor 102 may include but is not limited to a processing device such as a microprocessor MCU or a programmable logic device FPGA) and a memory 104 for storing data, wherein the above-mentioned mobile terminal may also include a transmission device 106 and an input and output device 108 for communication functions. It can be understood by those skilled in the art that the structure shown in FIG1 is only for illustration and does not limit the structure of the above-mentioned mobile terminal. For example, the mobile terminal may also include more or fewer components than those shown in FIG1 , or have a configuration different from that shown in FIG1 .

[0032] The memory 104 can be used to store computer programs, for example, software programs and modules of application software, such as the computer program corresponding to the resource management method in the embodiment of the present disclosure. The processor 102 executes various functional applications and data processing by running the computer program stored in the memory 104, that is, implements the above-mentioned method. The memory 104 may include a high-speed random access memory, and may also include a non-volatile memory, such as one or more magnetic storage devices, flash memory, or other non-volatile solid-state memory. In some instances, the memory 104 may further include a memory remotely located relative to the processor 102, and these remote memories can be connected to the mobile terminal via a network. Examples of the above-mentioned network include but are not limited to the Internet, an intranet, a local area network, a mobile communication network, and combinations thereof.

[0033] The transmission device 106 is used to receive or send data via a network. A specific example of the aforementioned network may include a wireless network provided by the mobile terminal's communications provider. In one embodiment, the transmission device 106 includes a network interface controller (NIC), which can be connected to other network devices via a base station to enable communication with the Internet. In another embodiment, the transmission device 106 may be a radio frequency (RF) module, which is used to communicate with the Internet wirelessly.

[0034] In this embodiment, a resource management method is provided. FIG2 is a flow chart of the resource management method according to the embodiment of the present disclosure. As shown in FIG2 , the flow chart includes the following steps:

[0035] Step S201: creating resources based on a time dimension, where the resources based on a time dimension indicate the amount of resources that can be carried based on a time unit.

[0036] For example, the resources based on the time dimension may be quantified as the maximum amount of bits that can be carried based on a time unit, so as to quantify the deterministic capability.

[0037] In an exemplary embodiment, step S201 may include:

[0038] By adopting a containerized approach, resources are divided based on the time dimension to generate a time container for the resources.

[0039] As an example, resources can be divided into time containers in proportion based on the time dimension. A time container can be composed of multiple time units.

[0040] In an exemplary embodiment, the time container is used to quantify the deterministic capability of a resource object, and the type of the resource object includes at least one of the following types: a physical link, a node, and a virtual link.

[0041] For example, a time container can quantify the deterministic capability of a resource object, and the types of resource objects can include but are not limited to physical links, nodes, and virtual links. For example, a time container can quantify the deterministic capability of a physical link, and a physical link can have one time container.

[0042] In an exemplary embodiment, the type of resources based on the time dimension includes at least one of the following: bandwidth, buffer; the resource unit based on the amount of resources that can be carried by the time unit includes at least one of the following units: bits, bytes, and octets.

[0043] For example, the types of resources based on the time dimension may include but are not limited to bandwidth, buffer, etc.; the resource units based on the amount of resources that can be carried by a time unit may include but are not limited to bits, bytes, octets, etc.

[0044] Step S202: Process the time-based resources.

[0045] In the embodiment of the present disclosure, after the resources based on the time dimension are quantified into a time container, the resources based on the time dimension may be processed, that is, the resources of the time container may be processed.

[0046] In an exemplary embodiment, step S202 may include:

[0047] Processing the time-based resources; wherein the processing method includes at least one of the following methods: notification, reservation, and allocation.

[0048] Exemplarily, resources based on the time dimension may be announced, or may be reserved, or may be allocated based on the time dimension.

[0049] In an exemplary embodiment, the notifying the time-based resource includes:

[0050] The extended resource announcement protocol carries resource information based on a time dimension, where the resource information based on the time dimension is used to indicate resource capacity in the time dimension, and the resource information based on the time dimension includes the amount of resources that can be carried based on the time unit;

[0051] The resources based on the time dimension are announced based on a resource announcement protocol that carries the resource information based on the time dimension.

[0052] Exemplarily, the resource announcement protocol may be extended to carry resource information based on the time dimension, wherein the resource information based on the time dimension is used to indicate the resource capacity of the time dimension, and the resource information based on the time dimension may include the amount of resources that can be carried based on the time unit.

[0053] The time-based resources may be announced based on a resource announcement protocol that carries the time-based resource information.

[0054] In an exemplary embodiment, the notifying the time-based resource further includes:

[0055] The extended resource announcement protocol carries time container information, where the time container information is used to indicate a resource object of the time container;

[0056] The time dimension-based resource is announced based on a resource announcement protocol that carries the time container information.

[0057] Exemplarily, the resource announcement protocol may be extended to carry time container information, wherein the time container information is used to indicate the resource object of the time container. Time-based resources may be announced based on the resource announcement protocol carrying the time container information.

[0058] In an exemplary embodiment, the resource announcement protocol includes at least one of the following protocols: Interior Gateway Protocol IGP, and Border Gateway Protocol BGP-LS.

[0059] Exemplarily, the resource announcement protocol may include, but is not limited to, an Interior Gateway Protocol (IGP) and a Border Gateway Protocol-Link-state (BGP-LS).

[0060] IGP protocols include Intermediate System to Intermediate System (ISIS) and Open Shortest Path First (OSPF), both of which are used for routing.

[0061] As an example, resources in the time dimension can be flooded, and the IGP protocol can be used to flood and collect time container resource information on the link. The IGP protocol can be extended to carry the subtype length value of the resource object of the time container. The Time-based Resources Container sub-TLV is used to indicate the resource object of the time container, and the IGP protocol can be extended to carry the Time-based Resources Capacity sub-TLV to indicate the resource capacity of the time dimension. Among them, in the OSPF protocol, it can be carried in the TE Link TLV of the TE LSA; in the ISIS protocol, it can be carried in IS-IS TLVs 22, 23, 25, 141, 222 and 223.

[0062] For example, FIG3 is a schematic diagram of subtype length values ​​of resource objects of a time container according to an embodiment of the present disclosure. Referring to FIG3 :

[0063] Type / Length: 16 bits, used to indicate the type and length of the Time-based Resources Container sub-TLV.

[0064] Deterministic capability type (DT): 8 bits, which can be used to indicate the type of deterministic capability classification, such as delay type, jitter type, etc.

[0065] Deterministic capability subtype (Sub-DT, s-DT): 8 bits, can be used to indicate the sub-level of deterministic capability, such as jitter type 10us, delay type 100ms, etc.

[0066] Time container type (Container Type): 16 bits, can be used to indicate the type of time container, such as periodic type, time slot type, synchronous type, rate type, etc.

[0067] The sub-sub-TLV length value may carry delay-related time units and jitter-related time units, etc., according to different time container types.

[0068] For example, FIG4 is a schematic diagram of sub-subtype length values ​​of a delay-related time unit according to an embodiment of the present disclosure. Referring to FIG4 :

[0069] Type / Length: 16 bits, indicating the type and length of the latency-based time unit.

[0070] Priority (Traffic Class): 32 bits, which can be used to indicate the priority of the delay class.

[0071] For example, FIG5 is a schematic diagram of sub-subtype length values ​​of a jitter-type time unit according to an embodiment of the present disclosure. Referring to FIG5 :

[0072] Type / Length: 16 bits, used to indicate the type and length of the jitter-based time unit.

[0073] Allocation Type: 16 bits, used to indicate the resource allocation type, including continuous allocation and flexible allocation.

[0074] Start Time Unit ID: 16 bits, used to indicate the start time unit ID.

[0075] Offset: 16 bits, used to indicate the offset.

[0076] Time Unit Information: variable, used to indicate time slot array information, etc.

[0077] As an example, resource information based on the time dimension may be carried in the time-based resource capacity subtype length value Time-based Resources Capacity sub-TLV, which may include bandwidth and the amount of resources that can be carried based on the time unit.

[0078] For example, FIG6 is a schematic diagram of resource capacity subtype length values ​​in the time dimension according to an embodiment of the present disclosure. Referring to FIG6 :

[0079] Type / Length: 16 bits, used to indicate the type and length of the Jitter-based Time-Unit sub-sub-TLV.

[0080] Time Unit Length: 32 bits, used to indicate the length of the basic time unit.

[0081] Time Unit Number: 32 bits, used to indicate the number of basic time units.

[0082] There may be multiple types of allocatable basic time units carried in the sub-sub-TLV.

[0083] For example, FIG7 is a schematic diagram of a time unit resource sub-subtype length value according to an embodiment of the present disclosure. Referring to FIG7 :

[0084] Type / Length: 16 bits, used to indicate the type and length of the Jitter-based Time-Unit sub-sub-TLV.

[0085] Time Unit ID: 16 bits, used to indicate the time unit number.

[0086] Available Time Unit Size: 32 bits, used to indicate the available time unit size.

[0087] As an example, resources based on the time dimension can be reported. The BGP-LS protocol can carry the Time-based Resources Container sub-TLV and the Time-based Resources Capacity sub-TLV to report the time-based resource information to the controller and build a deterministic resource pool based on the time dimension.

[0088] For example, in a centralized or hybrid control plane scenario, a deterministic resource pool based on time containers can be built. Time-based resource information can be reported to the controller through the BGP-LS protocol. The Time-based Resources Container sub-TLV and Time-based Resources Capacity sub-TLV can be carried in the Link Attribute TLV of the BGP-LS protocol to build a time-based deterministic resource TED.

[0089] As an example, resources based on the time dimension can be collected. The time-based resource information can be carried to the controller through the network device configuration and management NETCONF / YANG protocol to build a deterministic resource pool based on the time dimension.

[0090] In an exemplary embodiment, the time container information includes at least one time unit, and the time unit includes at least one of the following types: a time slot unit, a rate unit, a cycle unit, and a synchronization time unit.

[0091] As an example, time units can be divided into multiple types, including time slot units (such as TQF queues), rate units (such as ADN / ATS / Deadline / CBS queues), period units (such as CSQF and T-CQF queues), synchronous time units (such as TAS queues), etc.

[0092] In an exemplary embodiment, the time container information includes container resource attributes, the container resource attributes include container resource parameters, and the container resource parameters include at least one of the following parameters: container type, container maximum resource capacity, time unit duration, time unit resource capacity, and time unit quantity.

[0093] As an example, the maximum resource capacity of a container may be quantified as a maximum amount of bits that can be carried based on a time unit, and the maximum amount of bits may be used as a numerical value for calculation.

[0094] In an exemplary embodiment, when the container type is the time slot unit, the maximum resource capacity of the container is the product of the time slot unit resource capacity and the number of time slot units; when the container type is the rate unit, the maximum resource capacity of the container is the delay upper limit of the rate unit; when the container type is the periodic unit, the maximum resource capacity of the container is the product of the periodic unit duration and the number of periodic units; when the container type is the synchronous time unit, the maximum resource capacity of the container is the time offset of the synchronous time unit.

[0095] As an example, when the container type is a time slot unit, the maximum resource capacity of the container can be the time slot unit resource capacity * the number of time slot units; when the container type is a rate unit, the maximum resource capacity of the container can be the delay upper limit of the current rate unit; when the container type is a periodic unit, the maximum resource capacity of the container can be the periodic unit duration * the number of periodic units; when the container type is a synchronous time unit, the maximum resource capacity of the container can be the time offset.

[0096] In an exemplary embodiment, the time container information includes a container time attribute, and the container time attribute is used to indicate a classification of the determined performance capability.

[0097] As an example, container time attributes can represent the classification of certain performance capabilities, such as latency class, jitter class, etc., and can be further subdivided into smaller classes based on different service level agreement (SLA) indicators, for example, latency class 10ms, 20ms, jitter class 10us, 20us, etc.

[0098] As an example, all time containers of the jitter class share the jitter class link bandwidth. All time containers of the jitter class can also share the time unit / time slot unit resources, which are carried in the time unit / time slot unit container, and other time containers can allocate time slot resources in the time unit / time slot unit resources.

[0099] In an exemplary embodiment, the time container information includes time unit resource parameters, and the time unit resource parameters include at least one of the following parameters: an allocation mode of a time unit, a time unit resource attribute, and an allocated time unit.

[0100] In an exemplary embodiment, the allocation mode of the time unit includes at least one of the following modes: a fixed mode and a floating mode.

[0101] As an example, the time unit resource parameters may include an allocation mode of the time unit, a time unit resource attribute, an allocated time unit, and the like.

[0102] As an example, the allocation mode of time units may include a fixed mode and a floating mode. Among them, the fixed mode needs to specify the number of allocations and the specific number, and the fixed mode may include continuous allocation and flexible allocation. The continuous allocation parameters may include the starting number of the time unit and the number of time units. The flexible allocation parameters may include an array of time units, such as a bitmap. The allocated time units may be represented as the end number to the starting number, or represented by an array, etc. The floating mode needs to specify the number of allocations, and its parameters may include the number of time units. The allocation of time units may be fixed or dynamically variable.

[0103] The present disclosure creates time-based resources, which indicate the amount of resources that can be carried based on a time unit; processes the time-based resources to solve the problem in related technologies that, in addition to traditional bandwidth resources, TE also needs to manage and schedule multi-dimensional deterministic resources such as queues and caches, which makes resource management and scheduling complex, so as to achieve the purpose of scheduling time-based resources to meet differentiated deterministic service quality.

[0104] To facilitate understanding of the disclosure process, several examples are provided below to further illustrate the disclosure process.

[0105] Example 1

[0106] Figure 8 is a diagram of a centralized deterministic network structure according to an embodiment of the present disclosure. As shown in Figure 8, devices within the deterministic network DetNet domain communicate via the IGP protocol. The controller can interact with the DetNet network via the netconf / yang protocol. Nodes within the DetNet domain communicate node information via the IGP protocol, construct resource TEDs, and centrally establish link state packets (LSPs) through the controller. Specifically, the following steps may be included:

[0107] Step 1: Create time-based resources. This specifies the maximum number of bits that can be carried by a time unit, which is used to quantify the deterministic capabilities of the H-node to the E-node and its intermediate nodes and links in the DetNet domain.

[0108] Step 2: Notify resources based on the time dimension. You can use Netconf / Yang and other tools to collect the time container resource status on the link and send it to the controller to build a deterministic resource pool based on the time dimension.

[0109] For example, the H node to the intermediate node supports CSQF's 10us and 20us queue scheduling, and its time container information is reported as follows:

[0110] 1) Time container 1, DT=1, s-DT=10us, the container type is periodic unit, the time unit length is 10us, and the number is 4.

[0111] 2) Time container 2, DT=1, s-DT=20us, the container type is periodic unit, the time unit length is 20us, and the number is 2.

[0112] 3) Resource capacity in the time dimension, maximum bandwidth 5G, DT=1.

[0113] Example 2

[0114] Figure 9 is a diagram of a distributed deterministic network structure according to an embodiment of the present disclosure. As shown in Figure 9, devices within the DetNet domain can flood nodes through the IGP protocol. In a fully distributed scenario, nodes within the DetNet domain flood node information through the IGP protocol to build resource TEDs. Paths can be distributedly calculated by nodes, and LSPs can be distributedly established through Resource Reservation Protocol (RSVP) signaling. Specifically, the following steps may be included:

[0115] Step 1: Create time-based resources. You can specify the maximum number of bits that can be carried based on a time unit to quantify the deterministic capabilities of the DetNet domain from H node to E node and its intermediate nodes and links.

[0116] Step 2: Flood resources based on the time dimension, use IGP (ISIS or OSPF protocol) to announce the time container resource information on the link, and form a deterministic resource pool based on the time dimension.

[0117] The Time-based Resources Container sub-TLV is used to indicate the resource object of the time container, and the Time-based Resources Capacity sub-TLV is used to indicate the resource capacity of the time dimension. For example, all nodes support TQF 10us and 20us queue scheduling, and their time container information and time dimension resource capacity are as follows:

[0118] 1) Link 1, time container 1, DT=1, s-DT=10us, container type is time slot unit, allocation type is continuous allocation, time unit starting number is 1, offset is 4.

[0119] 2) Link 2, time container 2, DT = 1, s-DT = 20 us, container type is time slot unit, allocation type is flexible allocation, time unit bitmap is 5, 7.

[0120] 3) Maximum bandwidth 5G, DT = 1, basic time slot length is 10us, and the number of basic time slots is 36.

[0121] Example 3

[0122] Figure 10 is a diagram of a hybrid deterministic network structure according to an embodiment of the present disclosure. As shown in Figure 10, devices within the DetNet domain communicate via the IGP protocol. In a hybrid scenario, nodes within the DetNet domain communicate node information via the IGP protocol, construct resource TEDs, calculate paths via the Path Computation Element (PCE), and establish LSPs in a distributed manner via RSVP signaling. Specifically, the following steps may be included:

[0123] Step 1: Create time-based resources. You can specify the maximum number of bits that can be carried based on a time unit to quantify the deterministic capabilities of the DetNet domain from H node to E node and its intermediate nodes and links.

[0124] Step 2: Flooding based on time dimension resources can utilize IGP (ISIS or OSPF protocol) flooding and time container resource information on the advertising link.

[0125] The Time-based Resources Container sub-TLV is used to indicate the resource object of the time container, and the Time-based Resources Capacity sub-TLV is used to indicate the resource capacity of the time dimension. For example, if all nodes support 100us and 10ms deadline queue scheduling, the time container information and time dimension resource capacity are as follows:

[0126] 1) Link 1, time container 1, DT=2, s-DT=100us, container type is rate unit, priority is 1.

[0127] 2) Link 2, time container 2, DT=2, s-DT=10ms, container type is rate unit, priority is 3.

[0128] 3) Maximum bandwidth 5G, DT=2.

[0129] Step 3: Use the BGP-LS protocol to announce the deterministic resources carrying the time container and build a deterministic resource pool based on the time dimension.

[0130] Through the description of the above implementation methods, those skilled in the art can clearly understand that the method according to the above embodiment can be implemented by means of software plus the necessary general hardware platform, and of course it can also be implemented by hardware, but in many cases the former is a better implementation method. Based on this understanding, the technical solution of the present disclosure is essentially or the part that contributes to the prior art can be embodied in the form of a software product, which is stored in a storage medium (such as ROM / RAM, magnetic disk, optical disk), including a number of instructions for enabling a terminal device (which can be a mobile phone, computer, server, or network device, etc.) to execute the methods described in each embodiment of the present disclosure.

[0131] An embodiment of the present disclosure further provides a computer-readable storage medium, in which a computer program is stored. The computer program is configured to execute the steps of any one of the above method embodiments when run.

[0132] In an exemplary embodiment, the computer-readable storage medium may include, but is not limited to, various media that can store computer programs, such as a USB flash drive, a read-only memory (ROM), a random access memory (RAM), a mobile hard disk, a magnetic disk, or an optical disk.

[0133] An embodiment of the present disclosure further provides an electronic device, including a memory and a processor, wherein the memory stores a computer program, and the processor is configured to run the computer program to perform the steps in any of the above method embodiments.

[0134] In an exemplary embodiment, the electronic device may further include a transmission device and an input / output device, wherein the transmission device is connected to the processor, and the input / output device is connected to the processor.

[0135] For specific examples in this embodiment, reference may be made to the examples described in the above embodiments and exemplary implementation modes, and this embodiment will not be described in detail here.

[0136] Obviously, those skilled in the art should understand that the modules or steps of the present disclosure described above can be implemented using a general-purpose computing device, they can be concentrated on a single computing device, or distributed across a network composed of multiple computing devices, they can be implemented using program code executable by the computing device, and thus, they can be stored in a storage device and executed by the computing device, and in some cases, the steps shown or described can be performed in a different order than herein, or they can be fabricated into separate integrated circuit modules, or multiple modules or steps can be fabricated into a single integrated circuit module for implementation. Thus, the present disclosure is not limited to any particular combination of hardware and software.

[0137] The foregoing is merely an exemplary embodiment of the present disclosure and is not intended to limit the present disclosure. Those skilled in the art will readily appreciate that the present disclosure is susceptible to various modifications and variations. Any modifications, equivalent substitutions, improvements, and the like made within the principles of the present disclosure shall be included within the scope of protection of the present disclosure.

Claims

1. A resource management method, comprising: Creating a time - dimension - based resource, where the time - dimension - based resource indicates the resource amount that can be carried based on a time unit; Processing the time - dimension - based resource.

2. The method according to claim 1, wherein, The creating of the time - dimension - based resource includes: Using a containerization method to divide resources based on the time dimension to generate a time container of the resources.

3. The method according to claim 2, wherein, The time container is used to quantify the deterministic capabilities of resource objects, and the types of the resource objects include at least one of the following types: physical link, node, virtual link.

4. The method according to claim 2, wherein The processing of the time - dimension - based resource includes: Processing the time - dimension - based resource; where the processing methods include at least one of the following methods: advertisement, reservation, allocation.

5. The method according to claim 1, wherein The types of the time - dimension - based resources include at least one of the following: bandwidth, buffer; the resource units of the resource amount that can be carried based on the time unit include at least one of the following units: bit (Bits), byte (Bytes), octet (Octes).

6. The method according to claim 4, wherein, The advertisement of the resources in the time container includes: Expanding a resource advertisement protocol to carry time - dimension - based resource information, where the time - dimension - based resource information is used to indicate the resource capacity in the time dimension, and the time - dimension - based resource information includes the resource amount that can be carried based on the time unit; Advertising the time - dimension - based resource based on the resource advertisement protocol carrying the time - dimension - based resource information.

7. The method according to claim 6, wherein, The advertisement of the time - dimension - based resource further includes: Expanding a resource advertisement protocol to carry time container information, where the time container information is used to indicate the resource objects of the time container; Advertising the time - dimension - based resource based on the resource advertisement protocol carrying the time container information.

8. The method according to claim 7, wherein The resource advertisement protocol includes at least one of the following protocols: Interior Gateway Protocol (IGP), Border Gateway Protocol - Link State (BGP - LS).

9. The method according to claim 7, characterized in that, The time container information includes at least one of the time units, and the time units include at least one of the following types: time slot unit, rate unit, period unit, synchronization time unit.

10. The method according to claim 9, wherein, The time container information includes container resource attributes, the container resource attributes include container resource parameters, and the container resource parameters include at least one of the following parameters: container type, container maximum resource capacity, time unit duration, time unit resource capacity, number of time units.

11. According to the method of claim 10, wherein, When the container type is the time slot unit, the container maximum resource capacity is the product of the time slot unit resource capacity and the number of time slot units; When the container type is the rate unit, the container maximum resource capacity is the upper limit of the delay of the rate unit; When the container type is the period unit, the container maximum resource capacity is the product of the period unit duration and the number of period units; When the container type is the synchronization time unit, the container maximum resource capacity is the time offset of the synchronization time unit.

12. The method according to claim 7, wherein, The time container information includes container time attributes, and the container time attributes are used to represent the classification of the deterministic capabilities.

13. The method according to claim 7, wherein, The time container information includes time unit resource parameters, and the time unit resource parameters include at least one of the following parameters: the allocation mode of the time unit, the time unit resource attributes, and the allocated time units.

14. The method according to claim 13, wherein, The allocation mode of the time unit includes at least one of the following modes: the fixed mode and the floating mode.

15. A computer-readable storage medium storing a computer program therein, wherein, When the computer program is executed by a processor, the steps of the method described in any one of claims 1 to 14 are implemented.

16. An electronic device, comprising a memory, a processor, and a computer program stored on the memory and executable on the processor, wherein when the processor executes the computer program, the steps of the method described in any one of claims 1 to 14 are implemented.

Images