Resource allocation method and device, and computer-readable storage medium
By obtaining business requirements and reserved resource information in a deterministic network and determining business configuration information, the complex problem of resource orchestration is solved, resource allocation and level aggregation of multi-level services are realized, and network efficiency is improved.
Patent Information
- Application Number
- PCT/CN2024/079277
- Authority / Receiving Office
- WO · WO
- Patent Type
- Applications
- Current Assignee / Owner
- Priority Date
- 2023-06-28
- Filing Date
- 2024-02-29
- Publication Date
- 2025-01-02
AI Technical Summary
In deterministic networks, existing resource reservation solutions lead to complex resource orchestration in large-scale network scenarios, making it difficult to support deterministic services of multiple levels, and lack of aggregation solutions based on business levels, which affects the deployment and maintenance efficiency of services. .
By obtaining the reserved resource information corresponding to the business requirements and target business level of the target business, determining the business configuration information, indicating the path used by the target business and the reserved resources within each cycle, simplifying the resource orchestration process, and suitable for equal length The cyclic scheduling and forwarding mechanism of time slices.
This solution simplifies the complexity of resource orchestration in deterministic networks, provides resource allocation for deterministic services of multiple levels, improves the efficiency and flexibility of resource orchestration, and supports resource aggregation based on business level.
Smart Images

Figure CN2024079277_02012025_PF_FP_ABST
Abstract
Description
Resource allocation method, device, and computer-readable storage medium
[0001] This application claims priority to Chinese patent application No. 202310781977.0, filed on June 28, 2023, the entire contents of which are incorporated by reference into this application. Technical Field
[0002] The present disclosure relates to the field of communications, and in particular to a resource allocation method, device, and computer-readable storage medium. Background Art
[0003] Deterministic service is the ability to provide service-level agreement (SLA) guarantees in communication networks, including deterministic low packet loss rates, deterministic forwarding latency bounds, and deterministic jitter caps. To implement deterministic services, the Internet Engineering Task Force (IETF) standards organization has proposed deterministic networking (DetNet) technology. Deterministic networking uses resource reservation, explicit routing, and service protection to achieve bounded latency and jitter, extremely low packet loss rates, and capped out-of-order message delivery.
[0004] Summary of the Invention
[0005] In one aspect, embodiments of the present disclosure provide a resource allocation method, comprising: obtaining a service requirement of a target service; and determining service configuration information for the target service based on the service requirement and reserved resource information of at least one first path corresponding to a target service level of the target service. The first path is the path from the head node to the tail node of the target service; the service configuration information is used to configure a second path used by the target service and the reserved resource information of the target service; the second path is one of the at least one first path.
[0006] In another aspect, an embodiment of the present disclosure provides a resource allocation device, comprising: an acquisition unit and a processing unit. The acquisition unit is configured to acquire a service requirement of a target service. The processing unit is configured to determine service configuration information for the target service based on the service requirement and reserved resource information of at least one first path corresponding to a target service level of the target service. The first path is a path from a head node to an tail node of the target service; the service configuration information is used to configure a second path used by the target service, as well as reserved resource information for the target service, where the second path is one of the at least one first path.
[0007] In another aspect, an embodiment of the present disclosure provides a communication device, comprising: a memory and a processor. The memory and the processor are coupled; the memory is configured to store a computer program; and the processor implements the resource allocation method described above when executing the computer program.
[0008] On the other hand, an embodiment of the present disclosure provides a computer-readable storage medium having computer program instructions stored thereon. When the computer program instructions are executed by a processor, the resource allocation method according to the above aspect is implemented.
[0009] On the other hand, an embodiment of the present disclosure provides a computer program product, which includes computer program instructions. When the computer program instructions are executed by a processor, the resource allocation method of the above aspect is implemented. BRIEF DESCRIPTION OF THE DRAWINGS
[0010] To more clearly illustrate the technical solutions of the present disclosure, the following briefly introduces the drawings required for use in some embodiments of the present disclosure. Obviously, the drawings described below are only drawings of some embodiments of the present disclosure, and those skilled in the art can also derive other drawings based on these drawings. Furthermore, the drawings described below are schematic diagrams and are not intended to limit the actual dimensions of the products, actual processes of the methods, actual timing of signals, and the like involved in the embodiments of the present disclosure.
[0011] FIG1 is a schematic diagram of the architecture of a deterministic network system according to some embodiments of the present disclosure.
[0012] FIG2 is a flowchart of a resource allocation method according to some embodiments of the present disclosure.
[0013] FIG3 is a flowchart of another resource allocation method according to some embodiments of the present disclosure.
[0014] FIG4 is a flowchart of yet another resource allocation method according to some embodiments of the present disclosure.
[0015] FIG5 is a schematic diagram of a topological relationship of a deterministic network according to some embodiments of the present disclosure.
[0016] FIG6 is a schematic diagram of resource allocation on an egress port according to some embodiments of the present disclosure.
[0017] FIG7 is a schematic structural diagram of a resource allocation device according to some embodiments of the present disclosure.
[0018] FIG8 is a schematic structural diagram of another resource allocation device according to some embodiments of the present disclosure. DETAILED DESCRIPTION
[0019] To help those skilled in the art better understand the technical solutions of the embodiments of the present disclosure, the technical solutions in some embodiments of the present disclosure are clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some of the embodiments of the present disclosure, not all of them. All other embodiments obtained by those skilled in the art based on the embodiments provided by the present disclosure are within the scope of protection of the present disclosure.
[0020] Unless the context requires otherwise, throughout the specification and claims, the term "comprise" and its other forms, such as the third person singular form "comprises" and the present participle form "comprising", are to be interpreted as open and inclusive, that is, "including, but not limited to". In the description of the specification, the terms "one embodiment", "some embodiments", "exemplary embodiments", "example", "specific example" or "some examples" are intended to indicate that the particular features, structures, materials or characteristics associated with the embodiment or example are included in at least one embodiment or example of the present disclosure. The schematic representation of the above terms does not necessarily refer to the same embodiment or example. In addition, the particular features, structures, materials or characteristics may be included in any one or more embodiments or examples in any appropriate manner.
[0021] In the following, the terms "first," "second," etc., are used for descriptive purposes only and should not be understood to indicate or imply relative importance or implicitly specify the number of the technical features indicated. Thus, a feature defined as "first," "second," etc. may explicitly or implicitly include one or more of the features. In the description of the embodiments of the present disclosure, unless otherwise specified, "plurality" means two or more.
[0022] "At least one of A, B and C" has the same meaning as "at least one of A, B or C" and both include the following combinations of A, B and C: A only, B only, C only, A and B, A and C, B and C, and A, B and C.
[0023] "A and / or B" includes the following three combinations: A only, B only, and A and B.
[0024] The use of "adapted to" or "configured to" herein is intended to be open and inclusive language that does not exclude devices adapted or configured to perform additional tasks or steps.
[0025] Additionally, the use of “based on” is meant to be open and inclusive, as a process, step, calculation, or other action “based on” one or more stated conditions or values may, in practice, be based on additional conditions or values beyond those stated.
[0026] Deterministic service is the ability to provide service level agreement (SLA) guarantees such as deterministic low packet loss rate, deterministic forwarding delay bound, and deterministic jitter upper limit in communication networks.
[0027] Regarding the implementation of deterministic service technology at Layer 3 (L3), the Internet Engineering Task Force (IETF) standards organization has proposed deterministic networking (DetNet). RFC (Request For Comments) 8655 describes the architecture of deterministic networking and defines quality of service (QoS) objectives for deterministic forwarding. To achieve these objectives, deterministic networking employs resource reservation, explicit routing, and service protection.
[0028] Regarding the resource reservation mentioned above, DetNet requires that each DetNet node along the path from source to destination ensure sufficient buffering resources and strictly regulate its output so that it does not exceed the data rate of any DetNet flow. This is because any packets not sent in advance as planned may increase the buffer space required by the next-hop DetNet node, potentially exceeding the resources allocated for a specific DetNet flow.
[0029] The IETF DetNet Working Group's draft, draft-guo-detnet-vpfc-planning, provides a detailed resource reservation scheme based on a periodic scheduling queue mechanism, referred to as the VPFP / VPFC planning scheme. This scheme reserves resources for each deterministic service by determining resource conflicts within the corresponding period at each aggregation node along the service path. If a resource conflict occurs, the head node must reselect an appropriate designated period. Another scheme, draft-peng-detnet-packet-timeslot-mechanism, proposes a packet timeslot scheme that enables more flexible allocation of deterministic resources in the control plane and creates flexible timeslot mappings in the data plane.
[0030] Generally speaking, current industry resource reservation solutions are based on a hop-by-hop approach for each service flow. This means that when creating, updating, or deleting a service, the required resources are reserved, reclaimed, and updated hop by hop along the service path. Consequently, the control plane must maintain resource information for each node and service. This is particularly true in large-scale networks, where the need to support a large number of deterministic services further complicates control plane resource orchestration and creates a plethora of per-flow state information at each node, hindering the deployment and maintenance of deterministic services.
[0031] In addition, RFC8655 mentions that in order to support more DetNet flows, the DetNet data plane needs to support the aggregation of DetNet flows. For example, IP (Internet Protocol) DiffServ Code Point (DSCP) can be used for aggregation. The draft-ietf-detnet-scaling-requirements draft also mentions in the description of requirements for supporting large business volumes and supporting flow aggregation that deterministic services may provide different deterministic QoS capabilities based on different levels of application requirements. Therefore, supporting service-level-based aggregation in resource reservation solutions is a feasible approach that can better support the large-scale application of deterministic technologies. However, at this stage, the DetNet working group has not yet provided a corresponding solution for the aforementioned ideas.
[0032] To address the current challenge of reserving resources for deterministic services in deterministic networks to support the large-scale application of deterministic technologies, this disclosure provides a resource allocation method. In a deterministic network, the resource allocation method provided by this disclosure can determine service configuration information based on the service requirements of the target service and the reserved resource information on the first path corresponding to the service level of the target service. This service configuration information can indicate the first path used by the target service and the resources reserved for it during each cycle on the first path used by the target service. Consequently, this solution can simplify the complexity of resource orchestration in deterministic networks and provide resource allocation for deterministic services of multiple levels.
[0033] It should be noted that the resource allocation method provided in this disclosure is primarily applicable to the forwarding plane mechanism of cyclic scheduling of equal time slices. Different literatures describe equal time slices using different terms, such as cycles or time slots. For ease of description, this disclosure uniformly describes them as cycles.
[0034] The resource allocation method and apparatus provided by the present disclosure are described in detail below in conjunction with the accompanying drawings. It should be noted that the various embodiments of the present disclosure can refer to or draw on each other. For example, the same or similar steps, method embodiments, system embodiments, and apparatus embodiments can refer to each other without limitation.
[0035] The technical solutions provided by the embodiments of the present disclosure can be applied to deterministic network systems. For example, as shown in FIG1 , FIG1 is a schematic diagram of the architecture of a deterministic network system according to some embodiments of the present disclosure. The deterministic network system may include a controller 101 and a node 102.
[0036] Controller 101 is a module in a deterministic network that maintains resource information for each node and service. The creation, update, and deletion of deterministic services all involve node-by-node resource conflict determination, update, and reclaim along the service path. Controller 101 orchestrates these resources.
[0037] The controller 101 is configured to obtain service requirements of a target service and determine service configuration information for the target service based on the service requirements and reserved resource information of at least one first path corresponding to a target service level of the target service. The first path is the path from the head node to the tail node of the target service. The service configuration information is used to configure a second path used by the target service and reserved resource information for the target service. The second path is one of the at least one first path.
[0038] It should be noted that the resource allocation apparatus provided in the present disclosure can be implemented as a controller 101, or a head node device having controller functions, or the resource allocation apparatus can include a module having both controller 101 and head node functions. In some embodiments, the resource allocation apparatus can also have the functions that a head node on a path in a deterministic network can implement.
[0039] Nodes 102 are nodes in a deterministic network, and only three nodes 102 are shown in the figure.
[0040] In some embodiments, when node 102 is a head node, node 102 may be configured to maintain the orchestration period resource status of each service level. The orchestration period resource status of each service level may be found in Table 3 below.
[0041] In other embodiments, when the node 102 is a head node and is configured with a controller function, the node 102 can also execute the resource allocation method provided by the present disclosure.
[0042] It should be noted that Figure 1 is only an exemplary framework diagram. The number and names of the nodes included in Figure 1 are not limited. In addition to the functional nodes shown in Figure 1, the deterministic network system can also include other nodes, such as core network devices. This disclosure does not impose any restrictions on this.
[0043] The application scenarios of the embodiments of the present disclosure are not limited. The system architecture and business scenarios described in the embodiments of the present disclosure are intended to more clearly illustrate the technical solutions of the embodiments of the present disclosure and do not constitute a limitation on the technical solutions provided by the embodiments of the present disclosure. It is known to those skilled in the art that with the evolution of network architecture and the emergence of new business scenarios, the technical solutions provided by the embodiments of the present disclosure are also applicable to similar technical problems.
[0044] Exemplarily, as shown in FIG2 , an embodiment of the present disclosure provides a resource allocation method, including the following S201 and S202 .
[0045] In S201 , the business requirements of the target business are obtained.
[0046] Exemplarily, the target business is a deterministic business.
[0047] In some embodiments, the service demand of the target service indicates the resource demand of each period of the target service in at least one period. For example, the service period of the target service is 80 us, and the resource demand is 10,000 bits.
[0048] In S202 , service configuration information of the target service is determined according to the service demand and reserved resource information of at least one first path corresponding to the target service level of the target service.
[0049] The first path is a path from the head node of the target service to the tail node of the target service. The reserved resource information of the first path is used to indicate the reserved resource amount and the maximum reservable resource amount of each cycle of the first path in at least one cycle.
[0050] The service configuration information is used to configure a second path used by the target service and reserved resource information of the target service, where the second path is one of the at least one first path.
[0051] It is understood that the first path is an explicit path pre-established for each service level between a set of head nodes and tail nodes in the deterministic network. At each node in the first path, the resource allocation device allocates a reserved resource amount. Generally speaking, the reserved resource amount allocated by the resource allocation device to each node in the first path is no less than a lower limit on the reserved resource amount. For example, the lower limit on the reserved resource amount can be a maximum transmission unit (MTU).
[0052] In some embodiments, the first path is determined based on information about reserved resources for different service levels at the egress ports of each node in the deterministic network and network topology information of the deterministic network. After at least one first path is determined, configuration information for the first path can be obtained. The configuration information for the first path includes information about reserved resources for the first path.
[0053] In some embodiments, the configuration information of the first path also includes at least one of the following: a path identifier, a target service level identifier, a path head node identifier, a path tail node identifier, and path information, where the path information is used to indicate the forwarding operation of each hop of the path.
[0054] Exemplarily, the configuration information of the first path includes parameters such as shown in Table 1 below:
[0055] Table 1 Configuration information parameter introduction table of the first path
[0056] It should be noted that the maximum reservable resource amount of the second path in a cycle is greater than or equal to the resource demand of the target service in the same cycle. In some embodiments, the second path is determined based on the service demand of the target service and the configuration information of the first path.
[0057] In some embodiments, after the second path is determined, the service configuration information of the target service can be obtained. It should be noted that the process of the resource allocation device determining the service configuration information of the target service based on the service demand and the reserved resource information of at least one first path corresponding to the target service level of the target service is referred to in S301 to S303 below and will not be repeated here. In some embodiments, the service configuration information of the target service includes an identifier of the target service, an identifier of the second path, and reserved resource information of the target service. The reserved resource information of the target service is used to indicate the amount of reserved resources allocated by the second path to the target service in each period in the orchestration cycle, and the orchestration cycle includes the period corresponding to the target service level of the target service.
[0058] It should be noted that the orchestration period includes all periods involved in the target service. For example, the orchestration period can be the period corresponding to the service level supported by the egress port, or a super period (the super period is usually N times the period corresponding to the service level, N≥2).
[0059] For example, after the second path is determined, the service configuration information of the target service is obtained as shown in Table 2 below:
[0060] Table 2 Service configuration information parameter introduction table
[0061] It should be noted that the service configuration information of the target service will be sent to the head node of the second path. For example, the yang model can be defined to send the service configuration information of the target service to the head node through NETCONF (network configuration), which is not limited in this disclosure.
[0062] In some embodiments, the head node transmits service data for the target service based on the service configuration information of the target service. Specifically, after receiving the service data, the head node identifies the target service to which the service data corresponds and, based on the configuration information of the target service determined in S202 and the amount of resources allocated in the configuration information, supervises the forwarding of the service data to ensure that the amount of service data forwarded in each cycle does not exceed the amount of reserved resources.
[0063] Based on the above technical solutions of the embodiments of the present disclosure, in a deterministic network, service configuration information is determined for each deterministic service at different levels based on the service requirements of each deterministic service and the reserved resource information on the deterministic path for its corresponding service level. This service configuration information can indicate the deterministic path used by the deterministic service and the resources reserved for it during each cycle on the deterministic path used by the deterministic service. Thus, this solution can simplify the complexity of resource orchestration in deterministic networks and provide resource allocation for multiple levels of deterministic services.
[0064] For example, in conjunction with Figure 2, as shown in Figure 3, Figure 3 is a flow chart of another resource allocation method according to some embodiments of the present disclosure. In the resource allocation method provided by the present disclosure, determining the service configuration information of the target service based on the service demand and the reserved resource information of at least one first path corresponding to the target service level of the target service, for example, includes the following S301 to S303.
[0065] In S301, resource allocation information of at least one first path is obtained.
[0066] The resource allocation information of the first path is used to indicate the amount of allocated resources of the first path in each cycle in at least one cycle.
[0067] In some embodiments, resource allocation information of the first path can be obtained from configuration information of the first path.
[0068] In S302, available resource information of at least one first path is determined according to reserved resource information of at least one first path and resource allocation information of at least one first path.
[0069] The available resource information of the first path is used to indicate the amount of available resources of the first path in each cycle of at least one cycle. It is understood that the amount of available resources of the first path in the current cycle is obtained by subtracting the amount of allocated resources in each cycle from the amount of reserved resources of the first path in the cycle.
[0070] In S303 , service configuration information of the target service is determined according to the service demand and available resource information of at least one first path.
[0071] In some embodiments, the second path corresponding to the target service is first determined based on service requirements and available resource information of at least one first path.
[0072] Exemplarily, the second path may be determined by the following (a) to (e).
[0073] (a) The head node initializes the maximum reservable resources and available resources for each period within the corresponding orchestration period according to the reserved resource information of each first path.
[0074] In (a), the orchestration period includes all periods involved in the target service. For example, the orchestration period can be the period corresponding to the service level supported by the egress port, or a super period (the super period is usually N times the period corresponding to the service level, N ≥ 2).
[0075] The maximum reservable resource is the maximum reserved bandwidth allocated to the service level corresponding to the first path by the egress port of the node on the current first path.
[0076] (b) After receiving the target service request, the resource allocation device queries the first path corresponding to the target service level on the service head node according to the service requirements of the target service.
[0077] In the case that the first path corresponding to the target service level is not found, the first path of the target service level is established according to (1) to (5) described below.
[0078] (c) Allocate one or more cycles within the orchestration cycle to the target service based on the traffic-specification (T-Spec) of the target service.
[0079] (d) Determine whether the amount of resources allocated in each period within one or more periods allocated to the target service meets the resource requirements of all nodes on the path.
[0080] When the amount of resources allocated in each period meets the resource demands of all nodes on the path, it is determined that the resource allocation is completed, and the current first path is determined as the second path.
[0081] When the amount of resources allocated in each period fails to meet the resource demands of all nodes on the path, the above step (c) is repeated to select another period within the orchestration period for the target service.
[0082] (e) If, after traversing each cycle within the orchestration cycle of at least one first path, the resource requirements of the nodes on the path are still not met, the resource allocation fails. In other words, no second path can be determined in at least one first path.
[0083] At this time, the resources of at least one first path may be expanded, and the above step (b) may be repeated.
[0084] It should be noted that the head node can maintain orchestration cycle resource information for each service level. The orchestration cycle resource information includes at least one of the following: the number of cycles included in the orchestration cycle corresponding to the target service level, the rounds in which each cycle in the orchestration cycle is scheduled, and the maximum reservable resource amount and available resource amount for each cycle in the orchestration cycle.
[0085] In some embodiments, the head node may maintain the orchestration cycle resource information of each service level through Table 3 below.
[0086] Table 3: Orchestration cycle resource information for each service level
[0087] In Table 3, each column represents a cycle, corresponding one-to-one to the cycle of the first path, with M representing the number of cycles. Each row represents the round in which the cycle is scheduled. In the case of a super-cycle, there may be multiple rows. Each cycle is represented by S[n][m], where n represents the round and m represents the cycle. In the case of a super-cycle, n ≥ 2. Resource information maintained for each cycle includes the maximum reservable resources and the available resources. The available resources are subsequently updated based on the resource allocation and orchestration of the target service.
[0088] The above describes the determination of the second path. After the second path is determined, the service configuration information of the target service can be determined according to the second path corresponding to the target service. For example, the content of the service configuration information can be found in Table 3 above.
[0089] Based on the above technical solutions of the embodiments of the present disclosure, it is possible to determine the paths available for the target service based on the resource allocation and resource reservation status of each deterministic path in the deterministic network, and thereby determine the service configuration information of the target service.
[0090] For example, in combination with Figure 2, as shown in Figure 4, Figure 4 is a flowchart of another resource allocation method according to some embodiments of the present disclosure. The resource allocation method provided by the present disclosure further includes the following S401 and S402.
[0091] In S401 , network topology information of the communication network and reserved resource information of the egress port of each node for the target service level are obtained.
[0092] The reserved resource information of the egress port of each node for the target service level includes at least one of the following: the identifier of the egress port, the identifier of the target service level, the amount of reserved resources configured by the egress port for the target service level, and the amount of available resources configured by the egress port for the target service level in each cycle in at least one cycle.
[0093] In some embodiments, the reserved resource information of the egress port of each node for the target service level further includes at least one of the following: the length of the period corresponding to the target service level, the number of periods corresponding to the target service level, and the maximum reserved bandwidth allocated by the egress port to the target service level.
[0094] In some embodiments, the amount of reserved resources configured by the egress port for the target service level is determined based on the maximum reserved bandwidth allocated by the egress port to the target service level, the length of the period corresponding to the target service level, and the number of periods corresponding to the target service level. Exemplarily, the amount of reserved resources configured by the egress port for the target service level satisfies the following formula 1:
[0095] In the above formula, i represents the cycle number, res i Represents the maximum amount of reservable resources allocated for period i, resRate j Indicates the maximum reservable bandwidth specified by the port for service level j. T is the duration of each cycle in seconds. Rate is the port transmission rate. n is the number of rounds.
[0096] It should be understood that the total bandwidth reserved for all service levels on an egress port is less than the total port bandwidth. For example, if the total port bandwidth is 100 Gps, the bandwidth reserved for three service levels is 20 Gps, 15 Gps, and 30 Gps, respectively. The remaining 35 Gps of bandwidth can be used by other services. Furthermore, the unused bandwidth of the three service levels can also be provided to other services, such as best-effort (BE) services.
[0097] In other embodiments, the amount of reserved resources configured by the egress port for the target service level is determined based on the maximum reserved bandwidth allocated by the egress port to the target service level and the length of the period corresponding to the target service level. In this case, the amount of reserved resources configured by the egress port for the target service level satisfies the following formula 2: res = resRate j *T Formula 2
[0098] In the above formula, res represents the maximum amount of reservable resources allocated in each cycle, resRatej Indicates the maximum reservable bandwidth specified by the port for service level j. T indicates the duration of each cycle in seconds.
[0099] It should be understood that configuring the reserved resource amount for the target service level based on Formula 2 can adapt to the cycle characteristics of various service flows based on service levels and simplify the allocation strategy. In this case, all cycles corresponding to a service level are allocated the same resource amount.
[0100] For example, the reserved resource information of the egress port for the target service level is shown in Table 4 below:
[0101] Table 4: Parameters of reserved resource information for target service level of outbound port
[0102] In S402, configuration information of at least one path corresponding to the target service level is determined based on the reserved resource information of the egress port of each node for the target service level and the network topology information.
[0103] In some embodiments, the configuration information of the path includes reserved resource information of the path.
[0104] In some embodiments, the configuration information of the path also includes at least one of the following: an identifier of the path, an identifier of the target service level, an identifier of the head node of the path, an identifier of the tail node of the path, and path information, where the path information is used to indicate the forwarding operation of each hop of the path.
[0105] Exemplarily, the first path may be determined by the following (1) to (5).
[0106] (1) For each service level, starting from the head node, each node along the path is judged whether the amount of reservable resources in each cycle of the service level is greater than or equal to the amount of resources requested for reservation in one or more specified cycles or all cycles of this path until the tail node.
[0107] (2) If the reservable resource amounts of all nodes on a path meet the resource requirements of the nodes, it is determined that the resource allocation of the path is successful and the path is determined as the first path.
[0108] Furthermore, the amount of resources required by the deterministic path is deducted from the reserved resource information maintained at each node egress port along the first path, and the amount of available resources in the corresponding period is updated.
[0109] (3) If the resources on the nodes included in the path do not meet its resource requirements, the current node is switched to another path and (1) is repeated.
[0110] It should be noted that when changing the path, the end-to-end delay and jitter still need to meet the requirements of the current service level.
[0111] (4) If, in (3), all possible paths cannot satisfy the node's resource requirements, reduce the amount of resources requested for reservation by the path corresponding to the current service level in one or more specified periods or all periods, and repeat (1).
[0112] It should be noted that when reducing the amount of resources requested for reservation in one or more specified periods or all periods for the path corresponding to the current service level, the reduced requested amount of resources must not be less than the lower limit of the reserved amount of resources.
[0113] (5) If there is still no path that can satisfy the resource requirements of all nodes in (4), it is determined that the first path determination of the current service level has failed.
[0114] It should be noted that in order to avoid the occurrence of the situation where the first path determination fails in (5), the resources of the deterministic path can be expanded. For the resource expansion of the deterministic path, since the path between the head node and the tail node of the corresponding service level has been formed, it is only necessary to determine along the path whether the amount of resources requested for expansion is less than or equal to the amount of resources available for the service level on the egress port. If the amount of resources expanded is less than or equal to the amount of resources available for the service level on the egress port, the expansion is determined to be successful, and the available resources of the service level on the egress port of each node along the path are updated, and the periodic reserved resources corresponding to the path are updated. At the same time, it is also necessary to update the available resources of each period in the orchestration period resource table maintained by the head node.
[0115] The above describes the determination of the first path. It should be noted that during the first path determination process, the period selection and reserved resource amount for each deterministic path can be determined based on the traffic aggregation characteristics expected to use this deterministic path or the user's specific planning requirements. Traffic aggregation characteristics are used to characterize the aggregated traffic characteristics or latency and jitter requirements of the deterministic path.
[0116] For example, a user plans a deterministic path to carry only services with certain traffic characteristics, such as a video service with a traffic period of 125us. Then, based on the transmission period of this aggregated flow, one or more periods that meet its traffic characteristics can be selected on each exit port along the path and the resources required for the service can be reserved.
[0117] Alternatively, a deterministic path can be planned to carry services with specified end-to-end latency or jitter requirements, such as 20ms end-to-end latency and 30us jitter. In this case, a path that meets these requirements needs to be planned, and the resources required for the service should be evenly reserved throughout each cycle of the path.
[0118] It is understandable that after determining the first path, configuration information of the first path may be determined simultaneously. For example, the parameters included in the configuration information of the path may be referred to in Table 1 above.
[0119] Based on the above technical solution, the present invention can determine the configuration information of deterministic paths for different service levels through the network topology information of the communication network and the reserved resource information of the output ports of each node for the target service level, so as to allocate resources to the target service according to the configuration information of the deterministic paths for different service levels.
[0120] Exemplarily, the resource allocation method provided by the present disclosure is described below with reference to FIG5 , FIG6 and examples.
[0121] It should be noted that Figure 5 illustrates four nodes: R1, R2, R3, and R4. The outbound ports of these four nodes support three deterministic service levels: A, B, and C. With the exception of node R4, which has two outbound ports, If4 and If5, the remaining three nodes each have one outbound port. The following example uses the If3 outbound port of node R3 as the entry point, allocating resources for target services with service level A through S1 to S3.
[0122] In S1, the topology information of the communication network and the reserved resource information of the egress port If3 of the R3 node for the target service level are obtained.
[0123] It should be understood that the topology information of the communication network can be obtained from FIG. 5 .
[0124] Taking node R3 as an example, its egress port If3 has an outbound bandwidth of 100 Gbps and provides bandwidth resources for the three aforementioned deterministic service levels, all using a periodic scheduling mechanism. As shown in Figure 6, service level A supports 16 10-us cycles, allocating 30 Gbps of bandwidth; service level B supports 8 20-us cycles, allocating 20 Gbps of bandwidth; and service level C supports 4 40-us cycles, allocating 30 Gbps of bandwidth. This leaves 20 Gbps of bandwidth available for BE services.
[0125] For example, the reserved resource information for three service levels on the outbound port If3 is shown in Table 5 below:
[0126] Table 5: Reserved resource information table for each service level on the outbound port If3
[0127] It is understandable that in Table 5, the "periodic available resource amount" parameter of each service level is updated according to the resource demand of the subsequent deterministic path. If the bandwidth allocated to the deterministic service level is not fully used, it can be provided to other services.
[0128] In S2, configuration information of the path corresponding to service level A is determined.
[0129] First, a deterministic path Path1 is established from R1 to R4 with service level A. Path1 has R1 as the head node and R4 as the tail node. The end-to-end delay or jitter of Path1 meets the service level A requirement.
[0130] Deterministic path Path1 is used to carry services with specified end-to-end delay and jitter requirements. Therefore, all cycles are used and 60,000 bits of reserved resources are allocated per cycle.
[0131] Next, starting at node R1, the available resources for service level A are determined at each node's egress port along the path. Using the example in Table 5 of S1, if the available resources per cycle for service level A (300,000 bits) are greater than 60,000 bits, 60,000 bits are allocated for each cycle of Path1 on If1. Similarly, the resource determination for the egress ports of other nodes is similar. If the available resources per cycle for service level A at each node's egress port can meet the resource requirements of Path1, resource allocation for deterministic path Path1 is successful, and resource information for the egress ports along the path is updated.
[0132] In some embodiments, taking the egress port If3 of the R3 node as an example, the reserved resource information related to service level A is shown in Table 6 below:
[0133] Table 6: Reserved resource information table for service level A
[0134] Therefore, the configuration information of the deterministic path Path1 determined in this S2 is shown in Table 7 below:
[0135] Table 7 Configuration information table of Path1
[0136] Similarly, following the resource allocation process for deterministic path Path1, a deterministic path Path2 is established from node R2 to node R4 with service level A. Deterministic path Path2 uses all cycles and allocates 24,000 bits of reserved resources. Because both deterministic paths Path1 and Path2 pass through egress port If1 of node R3, the updated reserved resource information for service level A at egress port If3 of node R3 is shown in Table 8 below:
[0137] Table 8 Updated reserved resource information table for service level A
[0138] The configuration information of the deterministic path Path2 is shown in Table 9 below:
[0139] Table 9 Path2 configuration information table
[0140] It should be noted that the present disclosure does not limit the calculation of the explicit path information of the deterministic paths Path1 and Path2 in S2 and the manner of forming the periodic mapping relationship.
[0141] In S3, resources are allocated to the target business and the business configuration information of the target business is determined.
[0142] Exemplarily, the target services include service 1 and service 2.
[0143] Service 1 has a service level of A and a service requirement of requesting a path from node R1 to node R4. The requested resource volume is 20,000 bits and the service cycle is 800 μs.
[0144] Service 2 has a service level of A and a service requirement of requesting a path from node R1 to node R4. The requested resource volume is 10,000 bits and the service cycle is 80 μs.
[0145] In S2 above, a deterministic path Path1 for service level A has been established from node R1 to node R4. Deterministic path Path1 supports scheduling of 16 10µs cycles, with a maximum available resource of 60,000 bits per cycle. For example, using a service orchestration cycle of four times the device cycle on head node R1 as an example, the orchestration cycle resources for service level A initialized on node R1 are shown in Table 10 below:
[0146] Table 10 Initialized orchestration cycle resource information table for service level A
[0147] Based on Table 10 and the service requirements of Service 1, the deterministic path Path1 is found at the R1 node, and the available resources of the deterministic path Path1 within the orchestration cycle are determined. Combined with the service cycle characteristics, 10,000 bits of resources are finally allocated to Service 1 for 8 cycles, namely S[1][1], S[1][9], S[2][1], S[2][9], S[3][1], S[3][9], S[4][1], and S[4][9]. Finally, the service configuration information of Service 1 is shown in Table 11 below:
[0148] Table 11 Service configuration information for service 1
[0149] Based on Table 10 and the service requirements of Service 2, the deterministic path Path1 is found at node R1. The available resources of Path1 within the orchestration cycle are determined. Based on the service cycle characteristics, 20,000 bits of resources are allocated to Service 2 for the four cycles S[1][0], S[2][0], S[3][0], and S[4][0]. Finally, the service configuration information of Service 2 is shown in Table 12 below:
[0150] Table 12 Service configuration information for service 2
[0151] It should be noted that since the period of service 2 (800us) and the orchestration period of head node R1 (640us) are not multiples, the 20,000-bit bandwidth resources reserved for service 2 in the above four periods may not be used by service 2. In this case, the unused resources can be used by other services.
[0152] For example, after the resources for services 1 and 2 are allocated, the orchestration cycle resources for service level A on the head node R1 are as shown in Table 13 below:
[0153] Table 13: Service Level A Orchestration Cycle Resource Information Table
[0154] It should be understood that after the service configuration information of the service 1 and the service 2 is determined, the service data of the service 1 and the service 2 can be transmitted based on the service configuration information of the service 1 and the service 2.
[0155] The resource allocation method provided by the present disclosure is described above with reference to FIG. 5 , FIG. 6 , and the examples of service 1 and service 2 of service level A.
[0156] The embodiment of the present disclosure can divide the functional modules or functional units according to the resource allocation device generated by the above method example. For example, each functional module or functional unit can be divided according to each function, or two or more functions can be integrated into one processing module. The above-mentioned integrated module can be implemented in the form of hardware or in the form of software functional modules or functional units. The division of modules or units in the embodiment of the present disclosure is schematic and is only a logical functional division. There may be other division methods in actual implementation.
[0157] 7 , which is a schematic diagram of a resource allocation apparatus according to some embodiments of the present disclosure, includes an acquisition unit 701 and a processing unit 702 .
[0158] The acquisition unit 701 is configured to acquire the business requirements of the target business.
[0159] Processing unit 702 is configured to determine service configuration information for the target service based on the service demand and reserved resource information of at least one first path corresponding to the target service level of the target service. The first path is the path from the head node to the tail node of the target service. The service configuration information is used to configure a second path used by the target service, and the reserved resource information of the target service. The second path is one of the at least one first path.
[0160] In some embodiments, the acquiring unit 701 is further configured to acquire resource allocation information of at least one first path.
[0161] In some embodiments, the processing unit 702 is further configured to determine available resource information of the at least one first path according to the reserved resource information of the at least one first path and the resource allocation information of the at least one first path.
[0162] In some embodiments, the processing unit 702 is further configured to determine service configuration information of the target service according to service requirements and available resource information of at least one first path.
[0163] In some embodiments, the processing unit 702 is further configured to transmit service data of the target service based on service configuration information of the target service.
[0164] In some embodiments, the acquiring unit 701 is further configured to acquire network topology information of the communication network and reserved resource information of an egress port of each node for a target service level.
[0165] In some embodiments, the processing unit 702 is further configured to determine configuration information of at least one path corresponding to the target service level based on the reserved resource information of the egress ports of each node for the target service level and network topology information, where the configuration information of the path includes the reserved resource information of the path.
[0166] In some embodiments, the resource allocation device 700 may further include a storage unit (shown as a dotted box in FIG7 ), which stores a program or instruction. When the acquisition unit 701 and the processing unit 702 execute the program or instruction, the resource allocation device can execute the resource allocation method of the above-mentioned method embodiment.
[0167] In addition, the technical effects of the resource allocation device in FIG7 can refer to the technical effects of the resource allocation method in the above embodiment, which will not be described in detail here.
[0168] For example, Fig. 8 is a schematic diagram of the structure of another resource allocation device involved in the above embodiment. As shown in Fig. 8 , the resource allocation device 800 includes: a processor 802 .
[0169] The processor 802 is configured to control and manage the actions of the resource allocation device, for example, to execute the steps executed by the acquisition unit 701 and the processing unit 702, and / or to execute other processes of the technical solution described herein.
[0170] The processor 802 may implement or execute the various exemplary logic blocks, modules, and circuits described in conjunction with the present disclosure. The processor may be a central processing unit, a general-purpose processor, a digital signal processor, an application-specific integrated circuit, a field-programmable gate array, or other programmable logic device, a transistor logic device, a hardware component, or any combination thereof, and may implement or execute the various exemplary logic blocks, modules, and circuits described in conjunction with the present disclosure. The processor may also be a combination that implements computing functions, such as a combination of one or more microprocessors, a combination of a DSP and a microprocessor, and the like.
[0171] In some embodiments, the resource allocation apparatus 800 may further include a resource allocation interface 803, a memory 801, and a bus 804. The resource allocation interface 803 is used to support resource allocation between the resource allocation apparatus 800 and other network entities. The memory 801 is used to store program codes and data of the resource allocation apparatus.
[0172] Memory 801 may be a memory in a resource allocation device, which may include a volatile memory, such as a random access memory; the memory may also include a non-volatile memory, such as a read-only memory, a flash memory, a hard disk or a solid-state drive; the memory may also include a combination of the above types of memory.
[0173] Bus 804 may be an Extended Industry Standard Architecture (EISA) bus, etc. Bus 804 may be divided into an address bus, a data bus, a control bus, etc. For ease of illustration, FIG8 shows only one thick line, but this does not mean that there is only one bus or only one type of bus.
[0174] Through the description of the above embodiments, those skilled in the art will clearly understand that for the sake of convenience and brevity, only the division of the above functional modules is used as an example. In actual applications, the above functions can be assigned to different functional modules as needed, that is, the internal structure of the device can be divided into different functional modules to complete all or part of the functions described above. The working process of the above-described system, device, and module can refer to the corresponding process in the aforementioned method embodiment and will not be repeated here.
[0175] An embodiment of the present disclosure provides a computer program product containing instructions. When the computer program product is run on an electronic device of the present disclosure, the computer is enabled to execute the resource allocation method of the above method embodiment.
[0176] An embodiment of the present disclosure further provides a computer-readable storage medium, which may be a non-transitory computer-readable storage medium. Instructions are stored in the computer-readable storage medium. When a computer executes the instructions, the electronic device of the present disclosure executes the resource allocation method of the above method embodiment.
[0177] Computer-readable storage media may be, for example, but not limited to, electrical, magnetic, optical, electromagnetic, infrared, or semiconductor systems, devices, or components, or any combination thereof. Examples of computer-readable storage media (a non-exhaustive list) include: an electrical connection having one or more wires, a portable computer disk, a hard disk. Random Access Memory (RAM), Read-Only Memory (ROM), Erasable Programmable Read Only Memory (EPROM), registers, hard disks, optical fibers, portable compact disc read-only memory (CD-ROM), optical storage devices, magnetic storage devices, or any other form of computer-readable storage media known in the art in a suitable combination of the foregoing. An exemplary storage medium is coupled to a processor so that the processor can read information from the storage medium and write information to the storage medium. Of course, the storage medium may also be an integral part of the processor. The processor and the storage medium may be located in an application-specific integrated circuit (ASIC). In the embodiments of the present disclosure, a computer-readable storage medium may be any tangible medium that contains or stores a program that can be used by or in connection with an instruction execution system, apparatus, or device.
[0178] The technical solution provided in this disclosure determines service configuration information in a deterministic network based on the service requirements of a target service and the reserved resource information on the first path of the target service's corresponding service level. This service configuration information indicates the first path used by the target service and the resources reserved for it during each cycle on the first path used by the target service. This solution can thus simplify resource orchestration in deterministic networks and provide resource allocation for deterministic services of various levels.
[0179] The above is only a specific embodiment of the present disclosure, but the scope of protection of the present disclosure is not limited thereto. Any changes or replacements within the technical scope disclosed in the present disclosure should be included in the scope of protection of the present disclosure. Therefore, the scope of protection of the present disclosure should be based on the scope of protection of the claims.
Claims
1. A resource allocation method, comprising: Obtain the business needs of the target business; Determining service configuration information of the target service according to the service demand and reserved resource information of at least one first path corresponding to the target service level of the target service; The first path is a path from the head node of the target service to the tail node of the target service; the service configuration information is used to configure the second path used by the target service and the reserved resource information of the target service; The second path is one of the at least one first path.
2. The method according to claim 1, wherein: The reserved resource information of the first path is used to indicate a maximum amount of reservable resources of the first path in each cycle in at least one cycle.
3. The method according to claim 1, wherein: The service configuration information includes an identifier of the target service, an identifier of the second path, and reserved resource information of the target service.
4. The method according to claim 3, wherein: The reserved resource information of the target service is used to indicate the amount of reserved resources allocated by the second path to the target service in each period in an orchestration period, and the orchestration period includes a period corresponding to a target service level of the target service.
5. The method according to claim 4, wherein: The reserved resource information of the target service is determined according to the orchestration period resource information maintained by the head node; The scheduling cycle resource information includes at least one of the following: the number of cycles included in the scheduling cycle corresponding to the target service level, the rounds in which each cycle in the scheduling cycle is scheduled, and the maximum reservable resource amount and available resource amount of each cycle in the scheduling cycle.
6. The method according to claim 4, wherein: The service demand is used to indicate the resource demand of the target service in each period of the scheduling period.
7. The method according to claim 4, wherein: The maximum amount of reservable resources of the second path in a period is greater than or equal to the resource demand of the target service in the same period.
8. The method according to claim 2, wherein: The determining, according to the service demand and reserved resource information of at least one first path corresponding to the target service level of the target service, service configuration information of the target service includes: Acquire resource allocation information of the at least one first path; Determining available resource information of the at least one first path according to the reserved resource information of the at least one first path and the resource allocation information of the at least one first path; The service configuration information of the target service is determined according to the service demand and the available resource information of the at least one first path.
9. The method according to claim 8, wherein: The resource allocation information of the first path is used to indicate the amount of resources allocated to the first path in each cycle in the at least one cycle.
10. The method according to claim 9, wherein: The available resource information of the first path is used to indicate the available resource amount of the first path in each cycle of the at least one cycle.
11. The method according to claim 1, further comprising: Based on the service configuration information of the target service, the service data of the target service is transmitted.
12. The method according to claim 1, further comprising: Acquire network topology information of the communication network and reserved resource information of the outbound ports of each node for the target service level; Based on the reserved resource information of the egress ports of each node for the target service level and the network topology information, configuration information of at least one path corresponding to the target service level is determined, and the configuration information of the at least one path includes the reserved resource information of the at least one path.
13. The method according to claim 12, wherein: The reserved resource information of the egress port for the target service level includes at least one of the following: an identifier of the egress port, an identifier of the target service level, an amount of reserved resources configured by the egress port for the target service level, and an amount of available resources configured by the egress port for the target service level in each cycle in at least one cycle.
14. The method according to claim 13, wherein: The reserved resource information of the egress port for the target service level also includes at least one of the following: the length of the cycle corresponding to the target service level, the number of cycles corresponding to the target service level, and the maximum reserved bandwidth allocated by the egress port to the target service level.
15. The method according to claim 14, wherein: The amount of reserved resources configured by the egress port for the target service level is determined according to the maximum reserved bandwidth allocated by the egress port to the target service level and the length of the cycle corresponding to the target service level; or, The amount of reserved resources configured by the egress port for the target service level is determined according to the maximum reserved bandwidth allocated by the egress port to the target service level, the length of the cycle corresponding to the target service level, and the number of cycles corresponding to the target service level.
16. The method according to claim 12, wherein: The configuration information of the at least one path also includes at least one of the following: an identifier of the at least one path, an identifier of the target service level, an identifier of a head node of the at least one path, an identifier of a tail node of the at least one path, and path information, wherein the path information is used to indicate a forwarding operation of each hop of the at least one path.
17. A communication device, comprising: a processor and a memory for storing instructions executable by the processor; The processor is configured to execute the instruction so that the communication device performs the resource allocation method according to any one of claims 1-16.
18. A computer-readable storage medium, wherein: The computer-readable storage medium stores computer instructions, and when the computer instructions are executed on a computer, the computer is enabled to execute the resource allocation method according to any one of claims 1 to 16.
Citation Information
Patent Citations
Resource reservation method and device, terminal and node equipment
CN113810442A
Deterministic network system and transmission method of deterministic service
CN114363182A
Traffic engineering in fabric topologies with deterministic services
WO2023069757A1
Service message forwarding method, path establishment method, and storage medium
WO2023103478A1
Cited By
Computer resource allocation method and device for differentiated teaching scenes
CN120256150A
Cooperative scheduling method and system for general computing resources of master station layer
CN121056415A
