Resource allocation methods, electronic device and computer-readable storage medium

Abstract

The present application relates to, but is not limited to, the technical field of communications. Provided are resource allocation methods, an electronic device and a computer-readable storage medium. A resource allocation method comprises: receiving a first path message, wherein the first path message comprises a segment identifier (SID) list and resource demand information, the SID list comprises at least one SID, and each SID comprises a resource allocation instruction flag bit; then, acquiring from the SID list a target SID corresponding to the present node; and thus performing resource allocation on the basis of a resource allocation instruction flag bit in the target SID and the resource demand information.

Description

Resource allocation method, electronic device, and computer-readable storage medium

[0001] CROSS-REFERENCE TO RELATED APPLICATIONS

[0002] This application claims priority to the Chinese patent application filed with the China Patent Office on February 8, 2024, with application number 202410178086.0 and invention name “Resource Allocation Method, Electronic Device and Computer-Readable Storage Medium”. The entire contents of the Chinese patent application are incorporated herein by reference. Technical Field

[0003] The embodiments of the present application relate to the field of communication technologies, and in particular to a resource allocation method, an electronic device, and a computer-readable storage medium. Background Art

[0004] Slicing Packet Network (SPN) fine-grained transport technology is a TDM (Time Division Multiplexing) transport network technology designed for comprehensive service delivery. It enables high-quality, integrated transport of services such as mobile bearer network midhaul / backhaul, enterprise / private lines / networks, and home broadband uplinks. The transport network's fine-grained channels support 10Mbps bandwidth granularity and offer flexible bandwidth allocation capabilities ranging from N*10Mbps, supporting a wide range of service types from 2Mbps to 10Gbps.

[0005] Traditional distributed time-division multiplexing (TDM) technology primarily uses Resource Reservation Protocol-Traffic Engineering (RSVP-TE). This approach requires extensive control interactions between devices and soft-state maintenance at intermediate nodes. This leads to poor scalability, complex maintenance, and is unsuitable for applications with numerous fine-grained connections.

[0006] With the continuous development of segment routing (SR) technology, by using routing label stacks, information about underlying network connections can be encapsulated in service packets. Path information can be centrally calculated through management and control and then sent to the head node. The path information includes path routing label stack information, and the routing label stack clearly indicates the channel of each node in the path.

[0007] Compared to RSVP-TE, the routing label stack-based approach requires no state maintenance and simplifies the control process. However, there is currently no TDM-based label stack path management and resource allocation solution. Therefore, implementing a TDM-based label stack path management and resource allocation solution is a major challenge facing the industry.

[0008] Summary of the Invention

[0009] In a first aspect, an embodiment of the present application provides a resource allocation method, applied to a first node, the method comprising: receiving a first path message, the first path message including a segment identifier SID list and resource requirement information, the SID list including at least one SID, each SID including a resource allocation instruction flag; obtaining a target SID corresponding to the current node from the SID list; and performing resource allocation according to the resource allocation instruction flag in the target SID and the resource requirement information.

[0010] In the second aspect, an embodiment of the present application provides a resource allocation method, which is applied to a second node. The method includes: sending a first path message to the first node, the first path message including a segment identifier SID list and resource requirement information, the SID list including at least one SID, and each SID including a resource allocation instruction flag.

[0011] In a third aspect, an embodiment of the present application provides an electronic device comprising: one or more processors; a memory on which one or more programs are stored, and when the one or more programs are executed by the one or more processors, the one or more processors implement the resource allocation method as described in the first aspect above; or, the resource allocation method as described in the second aspect above.

[0012] In a fourth aspect, an embodiment of the present application provides a computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, implements the resource allocation method as described in the first aspect above; or, the resource allocation method as described in the second aspect above. BRIEF DESCRIPTION OF THE DRAWINGS

[0013] The accompanying drawings are used to provide a further understanding of the technical solution of the present application and constitute a part of the specification. Together with the embodiments of the present application, they are used to explain the technical solution of the present application and do not constitute a limitation on the technical solution of the present application.

[0014] FIG1 is a flow chart of a resource allocation method provided in an embodiment of the present application;

[0015] FIG2 is a schematic diagram of a Node B local resource forwarding table entry provided in an embodiment of the present application;

[0016] FIG3 is a flow chart of a resource allocation method provided in an embodiment of the present application;

[0017] FIG4 is a schematic diagram of a hop-by-hop fgMTNP fine-grained path provided in an embodiment of the present application;

[0018] FIG5 is a schematic diagram of an end-to-end MTNP large particle path provided in an embodiment of the present application;

[0019] FIG6 is a schematic diagram of the device structure of an electronic device provided in an embodiment of the present application. DETAILED DESCRIPTION

[0020] In order to make the purpose, technical solutions and advantages of this application more clear, the following further describes this application in detail with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are only used to explain this application and are not intended to limit this application.

[0021] It should be understood that in the description of the embodiments of the present application, if there is a description of "first", "second", etc., it is only for the purpose of distinguishing technical features, and cannot be understood as indicating or implying relative importance or implicitly indicating the number of the indicated technical features or implicitly indicating the order of the indicated technical features. "At least one" means one or more, and "more" means two or more. "And / or" describes the association relationship of associated objects, indicating that three relationships may exist. For example, A and / or B can represent the existence of A alone, the existence of A and B at the same time, and the existence of B alone. Among them, A and B can be singular or plural. The character " / " generally indicates that the previous and next associated objects are in an "or" relationship. "At least one of the following" and similar expressions refer to any group of these items, including any group of single or plural items. For example, at least one of a, b and c can represent: a, b, c, a and b, a and c, b and c, or a, b and c, where a, b, c can be single or multiple.

[0022] In addition, the technical features involved in each embodiment of the present application described below can be combined with each other as long as they do not conflict with each other.

[0023] To facilitate understanding of the solutions of the embodiments of the present application and to provide a clear and concise description of the following embodiments, a brief introduction to the relevant technologies is first given:

[0024] SPN (Slicing Packet Network) fine-grained transport technology is a TDM (Time Division Multiplexing) transport network technology designed for comprehensive service delivery. It enables high-quality, integrated transport of services such as mobile bearer network midhaul / backhaul, enterprise / private lines / networks, and home broadband uplinks. The transport network's fine-grained channels support 10Mbps bandwidth granularity and offer flexible bandwidth allocation capabilities (any N*10Mbps), supporting a wide range of service types from 2Mbps to 10Gbps.

[0025] Traditional distributed TDM technology primarily uses RSVP-TE (Resource Reservation Protocol-Traffic Engineering). This approach requires extensive control interactions between devices and soft-state maintenance at intermediate nodes. This approach suffers from poor scalability, complex maintenance, and is unsuitable for deployments with numerous fine-grained connections.

[0026] With the continuous development of SR (Segment Routing) technology, by using the routing label stack, the information of the underlying network connection can be encapsulated in the service message. The path information can be centrally calculated by the management and control and then sent to the first node. The path information contains the path routing label stack information. The routing label stack clearly indicates the channel of each node in the path.

[0027] Compared to RSVP-TE, the routing label stack-based approach requires no state maintenance and simplifies the control process. However, there is currently no TDM-based label stack path management and resource allocation solution. Therefore, implementing a TDM-based label stack path management and resource allocation solution is a major challenge facing the industry.

[0028] Based on this, embodiments of the present application provide a resource allocation method, an electronic device, and a computer-readable storage medium, which aim to improve the expression of routing label stacks to make resource allocation more flexible, accurate, and efficient.

[0029] Please refer to Figure 1, which is a flow chart of a resource allocation method provided in an embodiment of the present application, wherein the resource allocation method is applied to a first node. As shown in Figure 1, the resource allocation method may include but is not limited to the following steps S110-S130, each of which is described in turn below:

[0030] Step S110: Receive a first path message, the first path message including a segment identifier SID list and resource requirement information, the SID list including at least one SID, and each SID including a resource allocation instruction flag.

[0031] It should be noted that the resource demand information of the present application includes at least one of bandwidth and delay requirements, that is, the resource demand information may include bandwidth, and may include bandwidth and delay requirements. The embodiments of the present application do not impose specific restrictions on the content of the resource demand information.

[0032] It should be noted that the instruction flag bit of the present application includes the first instruction flag.

[0033] Step S120, obtaining the target SID corresponding to the current node from the SID list;

[0034] It should be noted that each node in this application has a corresponding target SID, so that the target SID corresponding to the node can be obtained from the SID list, and then the corresponding operation can be performed according to the corresponding target SID.

[0035] It can be understood that the target SID of the present application is used to map the unique logical resource in the first node. Therefore, the corresponding logical resource can be accurately found through the target SID, and the resource can be allocated and managed according to the resource allocation instructions in the SID, thereby improving the accuracy and efficiency of resource management and ensuring the correct allocation of resources.

[0036] Step S130: Allocate resources according to the instruction flag and resource requirement information in the target SID.

[0037] It should be noted that this application improves the resource allocation method of TDM technology, and allocates resources according to the instruction flag and resource requirement information in the target SID, thereby making resource allocation more flexible, accurate and efficient, thereby helping to improve the overall performance and responsiveness of the system and meet various needs.

[0038] In a possible embodiment of the present application, regarding the above-mentioned step S130, it may specifically include step S131:

[0039] Step S131 : when the first instruction flag indicates that time slot resources need to be allocated, determine a time slot according to resource requirement information.

[0040] It should be noted that the above-mentioned first instruction flag can be used to indicate whether time slot resources need to be allocated. When the first instruction flag indicates that time slot resources need to be allocated, the time slot is determined according to the resource requirement information.

[0041] It can be understood that when the flag bit of the first instruction flag in the target SID is 1, that is, time slot resources need to be allocated, the outgoing time slot in the logical resource corresponding to the first node is determined according to the resource demand information and added to the local resource forwarding table entry corresponding to the target SID.

[0042] In a possible embodiment of the present application, after the above step S131, the following step S140 is further included:

[0043] Step S140: Add a time slot to the local resource forwarding entry corresponding to the target SID.

[0044] It should be noted that after determining the outgoing time slot based on the resource demand information, the present application can add the outgoing time slot to the local resource forwarding table corresponding to the target SID. Therefore, the present application can complete resource allocation according to resource demand and record the local resource forwarding table corresponding to the target SID.

[0045] It should be noted that the above-mentioned instruction flag also includes a second instruction flag, wherein the second instruction flag is used to indicate whether time slot crossing is required.

[0046] In a possible embodiment of the present application, the above-mentioned step S130 may further specifically include step S132:

[0047] Step S132: Obtain a local resource forwarding table entry corresponding to the target SID, and when the second instruction flag indicates that time slot interleaving is required, perform time slot interleaving configuration according to the incoming time slot and the outgoing time slot in the local resource forwarding table entry.

[0048] It should be noted that the local resource forwarding table entry corresponding to the target SID of the present application includes input time slots and output time slots. When the second instruction flag indicates that time slot crossing is required, the time slot crossing configuration can be completed according to the input time slots and output time slots, thereby achieving flexible time slot management, improving resource efficiency, simplifying resource scheduling, dynamic resource adjustment and enhancing system reliability.

[0049] It is understandable that when the flag bit of the second instruction flag in the target SID is 1, that is, time slot crossing is required, time slot crossing configuration is performed according to the incoming time slot and outgoing time slot in the obtained local resource forwarding table entry corresponding to the target SID.

[0050] Specifically, in a possible embodiment of the present application, the resource allocation method further includes the following steps S150 and S160:

[0051] Step S150, determining an incoming interface and an incoming time slot according to the first path message;

[0052] Step S160: Add an input interface and an input time slot to the local resource forwarding entry corresponding to the target SID.

[0053] For example, the present application first determines the incoming interface and incoming time slot based on the first path message. For example, the present node receives the first path message from incoming interface 1 and incoming time slots {1, 2}, and then determines that the incoming interface is 1 and the incoming time slots are {1, 2}. Next, the present application adds the incoming interface and incoming time slot to the local resource forwarding table entry corresponding to the target SID. Therefore, the present application can flexibly and on-demand allocate time slot resources or cross-configure time slots based on the incoming interface and incoming time slot, thereby achieving flexible time slot management, improving resource efficiency, simplifying resource scheduling, dynamic resource adjustment, and enhancing system reliability.

[0054] It should be noted that the available SID range information of the present application may include at least one global SID, wherein the global SID is sent by the second node to the first node, and the global SID corresponds to the connection between the first node and the adjacent node.

[0055] It can be understood that since the global SID of the present application corresponds to the connection between the first node and the adjacent node. Exemplarily, the global SID is the global SID of the Fine-Grain Metro Transport Network Path (fgMTNP) or Metro Transport Network Path (MTNP) or Ethernet (ETH), which expresses the link or connection between two nodes in the TDM-based forwarding plane. The two nodes here may be neighbors or forwarding adjacencies. The global SID is uniformly allocated by the network manager within the control domain.

[0056] It should be noted that the available SID range information of the present application includes at least one local SID, wherein the local SID is configured by the first node itself, and the local SID can correspond to the service layer output interface on the first node that supports the target granularity capability.

[0057] It can be understood that since the local SID of the present application corresponds to the service layer output interface on the first node that supports the target granularity capability, the service layer output interface on the first node that supports the target granularity capability can be quickly obtained through the local SID, so that resource allocation can be completed correctly.

[0058] Exemplarily, the local SID and available SID range information are locally allocated, maintained, and recovered by the forwarding node, and can be used to describe the outbound interface that supports fine-grained capabilities and the corresponding specific time slots in the outbound interface. This type of local SID belongs to the local behavior of the node, and other nodes are not aware of the time slot resources of the outbound interface of the current node. For the local, this embodiment provides a SID encoding method on a device. Once the port or board on the device enables the fine-grained capability, the available SID range information corresponding to the local interface can be generated locally based on the interface that enables the fine-grained capability. After the network management or PCE calculates the path, the local resource forwarding table entry corresponding to the current local SID can be improved. That is, based on the inbound interface and inbound time slot carried in the control protocol, the set of <inbound interface, inbound time slot, outbound interface, outbound time slot> that uniquely identifies the current local SID in the device can be improved. When the device is restarted, the current local resource forwarding table entry is still used preferentially.

[0059] In a possible embodiment of the present application, before step S110, the following steps S100a are further included:

[0060] Step S100a: sending capability information to the second node, the capability information including: the outbound interface of the first node supporting the target granularity service capability, the corresponding available time slot information, and the available SID range information.

[0061] It should be noted that by sending capability information to the second node, the second node can obtain the available resources of the first node regarding the target granularity service, and then encapsulate the first path message according to the available resources of the first node, and send the first path message to the first node, so that the first node can allocate resources according to the first path message, thereby making resource allocation more flexible, accurate and efficient.

[0062] It is understood that, in a possible embodiment of the present application, the first node mentioned above may be a source node or an intermediate node in the path, and after step S130, the following step S170 is further included:

[0063] Step S170: Send a second path message downstream, where the second path message includes: a SID list, resource requirement information, outbound interface information corresponding to the first node, and outbound time slot information corresponding to the first node.

[0064] Exemplarily, when the first node is a source node or an intermediate node and receives a first path message, the corresponding outgoing interface is searched in the local resource forwarding table entry according to the target SID in the first path message. At this time, resources are allocated according to the resource requirement information and instruction flag in the first path message. When the first instruction flag indicates that time slot resources need to be allocated, the outgoing time slot is determined according to the resource requirement information. When the second instruction flag indicates that time slot crossing is required, the local resource forwarding table entry corresponding to the target SID is obtained, and time slot crossing configuration is performed according to the incoming time slot and outgoing time slot in the local resource forwarding table entry. Then, the second path message is sent to the downstream. Finally, the downstream allocates resources according to the second path message.

[0065] It should be noted that after the downstream node of the present application receives the second path message, it can determine the target SID of the node according to the second path message, thereby obtaining the corresponding outgoing interface, and filling the corresponding incoming interface and incoming time slot information into the local resource forwarding table entry. In addition, the downstream node can determine whether it is necessary to allocate time slot resources or whether time slot crossing is required based on the resource allocation instruction flag in the target SID of the node. When time slot resources need to be allocated, the outgoing time slot is determined based on the resource demand information and / or the incoming time slot in the local resource forwarding table entry. When time slot crossing is required, the time slot crossing configuration is performed based on the incoming time slot and outgoing time slot in the local resource forwarding table entry.

[0066] It is understandable that, in a possible embodiment of the present application, the first node mentioned above may be the penultimate hop node in the path, and after step S130, the following step S180 is further included:

[0067] Step S180: No longer send the second path message downstream.

[0068] It can be understood that since the first node is the penultimate hop node in the path, the first node is the last target SID, so the first node does not need to send the SID list and resource requirement information in the first path message to the downstream node. The forwarding plane will then generate a specific time slot negotiation and send it to the downstream node, and the downstream node does not need to perform resource allocation.

[0069] Exemplarily, when the first node is the penultimate hop node and receives the first path message, the corresponding outgoing interface is searched in the local resource forwarding table entry according to the target SID in the first path message. At this time, resources are allocated according to the resource requirement information and instruction flag in the first path message. When the first instruction flag indicates that time slot resources need to be allocated, the outgoing time slot is determined according to the resource requirement information. When the second instruction flag indicates that time slot crossing is required, the local resource forwarding table entry corresponding to the target SID is obtained, and time slot crossing configuration is performed according to the incoming time slot and outgoing time slot in the local resource forwarding table entry. Then, the first path message is no longer sent to the downstream. At this time, the downstream does not need to allocate resources.

[0070] It can be understood that the above-mentioned instruction flag may include a first instruction flag, may include a second instruction flag, or may include a first instruction flag and a second instruction flag. This application does not impose any specific restrictions on the content of the instruction flag.

[0071] It can be understood that when the flag bit of the first instruction flag in the target SID is 1, that is, time slot resources need to be allocated, the time slot is determined according to the resource demand information and added to the local resource forwarding table item corresponding to the target SID; when the flag bit of the second instruction flag in the target SID is 1, that is, time slot crossing is required, the time slot crossing configuration is performed according to the input time slot and output time slot in the local resource forwarding table item corresponding to the target SID.

[0072] It can be understood that the above-mentioned target SID can be represented by WORD32, using the lower 16 bits to express the specific SID content, and the lower bit of the upper 16 bits to represent the resource allocation instruction. For example, in this example, the lower 2 bits represent the first instruction flag and the second instruction flag respectively. The target SID can also be expressed in an expression method according to actual conditions. This application does not impose specific restrictions on the expression method of the target SID, the size of the bytes occupied, and the positions of the flag bits of the first instruction flag and the second instruction flag in the target SID.

[0073] Please refer to Figure 2, which is a schematic diagram of a local resource forwarding table entry provided in an embodiment of the present application.

[0074] It is understood that the first node of the present application can use the target SID in the first path message to find the outgoing interface and resource requirement information in the local resource forwarding table entry corresponding to the target SID, and allocate resources based on the instruction flag and resource requirement information in the target SID. When the setup is restarted, the local resource forwarding table entry corresponding to the target SID can be directly read and the current resources can still be used.

[0075] It should be noted that the system can find the corresponding outgoing interface and resource requirement information according to the target SID in the first path message, and improve the local resource forwarding entry.

[0076] In addition, the present invention also provides another resource allocation method, which is applied to the second node. The resource allocation method may include but is not limited to the following steps S210, each of which is described in turn below:

[0077] Step S210: Send a first path message to the first node. The first path message includes a segment identifier SID list and resource requirement information. The SID list includes at least one SID, and each SID includes a resource allocation instruction flag.

[0078] It should be noted that the second node of the present application is capable of sending a first path message to the first node, wherein the first path message includes a segment identifier SID list and resource requirement information, the SID list includes at least one SID, and each SID includes an instruction flag, so that the first node can allocate resources according to the instruction flag and resource requirement information, thereby making resource allocation more flexible, accurate and efficient.

[0079] In a possible embodiment of the present application, before step S210, the following steps S200a are further included:

[0080] Step S200a: receiving capability information sent by multiple first nodes, where the capability information includes: outbound interfaces of the first nodes supporting target granularity capabilities, corresponding available time slot information, and available SID range information.

[0081] It should be noted that by receiving capability information sent by multiple first nodes, the second node can determine the first path message and send the first path message to the first node, so that the first node can allocate resources according to the first path message, thereby making resource allocation more flexible, accurate and efficient.

[0082] In a possible embodiment of the present application, after step S200a, the following steps S220, S230, and S240 are further included:

[0083] Step S220, determining at least one candidate path corresponding to the target service based on the destination address information corresponding to the target service;

[0084] Step S230, determining a target path based on the capability information of the first node in the candidate path;

[0085] Step S240: Generate a first path message according to the target path.

[0086] It should be noted that, first, the present application can determine at least one candidate path corresponding to the target business based on the destination address information corresponding to the target business; then, the present application can determine the target path based on the capability information of the first node in the candidate path; finally, the present application can generate a first path message based on the target path.

[0087] It can be understood that since the present application can determine the target path based on the capability information of the first node in the candidate path and obtain the first path information based on the target path, the first node can allocate resources according to the capability of the node, thereby making resource allocation more flexible, accurate and efficient.

[0088] In a possible embodiment of the present application, before the step S220 of determining the destination address information corresponding to the target service, the following step S250 is further included:

[0089] Step S250: receiving a path calculation request message sent by a source node, where the source node is one of the multiple first nodes, and the path calculation request message carries destination address information corresponding to the target service.

[0090] It should be noted that after the second node of the present application receives the path calculation request message sent by the source node, since the path calculation request message carries the destination address information corresponding to the target service, the second node can obtain at least one corresponding candidate path based on the destination address information corresponding to the target service, and obtain the target path based on the capability information of the first node of the candidate path. Then, the first path message is obtained based on the target path, and finally, the first path message is sent to the first node, so that the first node allocates resources according to the instruction flag in the first path message and the resource requirement information, making resource allocation more flexible, accurate and efficient.

[0091] It should be noted that the above-mentioned resource allocation instruction flag may include a first instruction flag, wherein the first instruction flag is used to indicate whether time slot resources need to be allocated.

[0092] It should be noted that, when the first instruction flag indicates that time slot resources need to be allocated, the first node determines the time slot according to the resource requirement information.

[0093] It should be noted that the above-mentioned instruction flag may further include a second instruction flag, wherein the second instruction flag is used to indicate whether time slot crossing is required.

[0094] It should be noted that when the second instruction flag indicates that time slot crossing is required, the first node can complete the time slot crossing configuration, thereby achieving flexible time slot management, improving resource efficiency, simplifying resource scheduling, dynamic resource adjustment and enhancing system reliability.

[0095] It can be understood that when the flag bit of the first instruction flag in the target SID is 1, that is, time slot resources need to be allocated, the time slot is determined based on the resource demand information and added to the local resource forwarding table item corresponding to the target SID; when the flag bit of the second instruction flag in the target SID is 1, that is, time slot crossing is required, the time slot crossing configuration is performed based on the input time slot and output time slot in the local resource forwarding table item corresponding to the target SID.

[0096] It can be understood that the above-mentioned target SID can be represented by WORD32, using the lower 16 bits to express the specific SID content, and the lower bit of the upper 16 bits to represent the resource allocation instruction. For example, in this example, the lower 2 bits represent the first instruction flag and the second instruction flag. The target SID can also be expressed in an expression method according to actual conditions. This application does not impose specific restrictions on the expression method of the target SID, the size of the bytes occupied, and the positions of the flag bits of the first instruction flag and the second instruction flag in the target SID.

[0097] In addition, it should be noted that the resource demand information of the present application includes at least one of bandwidth and delay requirements, that is, the resource demand information may include bandwidth, may include delay requirements, or may include bandwidth and delay requirements. The embodiments of the present application do not impose specific restrictions on the content of the resource demand information.

[0098] It can be understood that the target SID of the present application is used to map the unique logical resource in the first node. Therefore, the corresponding logical resource can be accurately found through the target SID, and resources can be allocated and managed on it, thereby improving the accuracy and efficiency of resource management and ensuring the correct allocation of resources.

[0099] It can be understood that the above-mentioned second node may be a network management system or a PCE (Path Computation Element), and the embodiment of the present application does not impose any specific limitation on the type of the second node.

[0100] It is understandable that nodes that support resource allocation can start the IGP protocol locally and send it to the MCS / PCE through protocols such as BGP-LS / ISIS / OSPFv3; or they can not start the IGP protocol and use NETCONF+YANG to report to the MCS / PCE.

[0101] Please refer to Figure 3, which is a flow chart of a resource allocation method provided in an embodiment of the present application.

[0102] In a possible embodiment, first, the second node receives capability information sent by multiple first nodes, where the capability information includes: the outbound interface of the first node supporting the target granularity capability, the corresponding available time slot information, and the available SID range information; then, the second node receives a path calculation request message sent by a source node, where the source node is one of the multiple first nodes, and the path calculation request message carries the destination address information corresponding to the target service; then, based on the destination address information corresponding to the target service, at least one candidate path corresponding to the target service is determined, and based on the capability information of the first nodes in the candidate path, the target path is determined, and the first path message is generated based on the target path; finally, the first path message is sent to the first node, where the first path message includes a segment identifier (SID) list and resource requirement information, where the SID list includes at least one SID, and each SID includes a resource allocation instruction flag.

[0103] It should be noted that when the first node can be the source node or intermediate node in the path, a second path message is sent downstream, and the second path message includes: a SID list, resource requirement information, outbound interface information corresponding to the first node, and outbound time slot information corresponding to the first node; when the first node can be the penultimate hop node in the path, the SID list and resource requirement information in the first path message are deleted, and the second path message is no longer sent downstream.

[0104] It can be understood that the above-mentioned second node may be a network management system or a PCE (Path Computation Element), and the embodiment of the present application does not impose any specific limitation on the type of the second node.

[0105] It is understandable that nodes that support resource allocation can start the IGP protocol locally and send it to the MCS / PCE through protocols such as BGP-LS / ISIS / OSPFv3; or they can not start the IGP protocol and use NETCONF+YANG to report to the MCS / PCE.

[0106] It can be understood that when the first node is a source node or an intermediate node and receives a first path message, it searches for the corresponding outgoing interface in the local resource forwarding table entry according to the target SID in the first path message. At this time, resource allocation is performed according to the resource requirement information and resource allocation instruction flag in the first path message. When the first instruction flag indicates that time slot resources need to be allocated, the outgoing time slot is determined according to the resource requirement information. When the second instruction flag indicates that time slot crossing is required, the local resource forwarding table entry corresponding to the target SID is obtained, and time slot crossing configuration is performed according to the incoming time slot and outgoing time slot in the local resource forwarding table entry. Then, the second path message is sent downstream. Finally, the downstream performs resource allocation according to the second path message.

[0107] It can be understood that when the first node is the penultimate hop node and receives the first path message, the corresponding outgoing interface is searched in the local resource forwarding table according to the target SID in the first path message. At this time, resources are allocated according to the resource requirement information and instruction flag in the first path message. When the first instruction flag indicates that time slot resources need to be allocated, the outgoing time slot is determined according to the resource requirement information. When the second instruction flag indicates that time slot crossing is required, the local resource forwarding table entry corresponding to the target SID is obtained, and time slot crossing configuration is performed according to the incoming time slot and outgoing time slot in the local resource forwarding table entry. Then, the second path message is no longer sent to the downstream. At this time, the downstream does not allocate outgoing interface resources.

[0108] Example 1:

[0109] In MTN networks, MTNP is typically statically configured by the network management (NM). The MTN-client ingress and egress interfaces of each device node in the network are preconfigured in the NM, which centrally stores the MTNP topology. When establishing a fine-granularity unit (FGU) path, the NM or PCE typically performs centralized path calculation, assesses whether node resources can meet the path requirements, and then sends a first path message to the source node. The head node allocates time slots along the path based on the sent path calculation results.

[0110] Scenario 1:

[0111] The fine-grained time slot requirements are encoded into the fine-grained route calculation result ERO (Explicit Route Object). When the time slot allocation requirements are sent to the device along with the fine-grained route calculation result, the device can identify the target SID to be processed by itself, parse the corresponding mtn-client interface in the target SID, and further determine whether the corresponding mtn-client interface has a time slot allocation requirement based on the resource allocation instruction in the SID. Finally, the device allocates fine-grained time slot resources that meet the requirements on the corresponding mtn-client interface.

[0112] Please refer to Figure 4, which is a flowchart of another resource allocation method provided in an embodiment of the present application.

[0113] Taking hop-by-hop MTNP as an example, the four nodes A, B, C and D are all MTN nodes that support granular service capabilities. Each node has an MTN 5G interface configured to support granular service capabilities, and MTNP connections have been established between A and B, between B and C, and between C and D. To express a fine-grained path A->B->C->D, you can use<SID1001,SID1002,SID1003> Each SID contains a resource allocation instruction flag. Optionally, the node information can be included in the existing SID or carried separately. Assume that A receives a first path message from the PCE or network management, where the first path message includes a segment identifier SID list and resource requirement information. The segment identifier SID list contains<SID1001,SID1002,SID1003> .

[0114] Node A determines that SID1001 is the target SID of this node, and confirms in the local resource forwarding table entry corresponding to the target SID that the outgoing interface corresponding to SID1001 is mtn-client-1, which is a 5G interface that supports fine-grainedness. According to the content 0x11001 of SID1001, the low bit of the high 16 bits is 0x1, and the flag bit of the first instruction flag is 1. Therefore, node A needs to reserve a time slot for the current path in mtn-client-1 corresponding to SID1001, that is, the path carries a time slot allocation requirement of 3 10M. Therefore, node A clearly wants to divide 3 10M time slots in mtn-client-1. Therefore, node A allocates time slots and writes the corresponding local resource forwarding table entry in the local SID1001, and then sends the SID list, resource requirement information, outgoing interface information and outgoing time slot information to node B in a unified or separate manner.

[0115] Please refer to Table 1, which is an exemplary local resource forwarding table of node A provided in an embodiment of the present application.

[0116] Table 1

[0117] After receiving the path information from node A, node B confirms that SID 1002 is the target SID for this node. Based on A's outbound interface mtn-client-1 and the outbound time slot information assigned by A, node B determines the local inbound interface mtn-client-1 and the inbound time slot (the same as the outbound time slot assigned by A). Furthermore, based on SID 1002 = 0x31002, node B specifies mtn-client-5 as the local outbound interface. In the local resource forwarding entry corresponding to the target SID, node B determines that the corresponding outbound interface mtn-client-5 exists and supports fine-grained routing. Based on the inbound interface inbound time slot and the time slot allocation requirements carried in the path, node B reserves three outbound time slots {3, 4, 5} for outbound interface mtn-client-5 according to the local resource forwarding entry. Node B then writes the local inbound and outbound interface and time slot information into the local resource forwarding entry corresponding to SID 1002. Furthermore, node B configures interleaving for the inbound and outbound time slots according to the first and second instruction flags of 0x31002. After node B completes local time slot allocation and fills in local resource forwarding entries, it sends the message containing the SID list, resource requirement information, outbound interface information, and outbound time slot information to node C. Node C handles the message in the same way as node B.

[0118] Please refer to Table 2, which is an exemplary local resource forwarding table of Node B provided in an embodiment of the present application.

[0119] Table 2

[0120] Please refer to Table 3, which is an exemplary local resource forwarding table of node C provided in an embodiment of the present application.

[0121] Table 3

[0122] Node C is the penultimate hop. After configuring the local timeslots {1, 2, 3} for mtn-client-4, node C no longer forwards the packet to node D. Node C only needs to configure the local timeslots, and the packet is then forwarded to node D using incremental or full timeslots on the forwarding plane. After receiving the forwarding plane's processing, node D simply writes the inbound interface mtn-client-4 into the forwarding table as a record. This step is optional.

[0123] Please refer to Table 4, which is an exemplary local resource forwarding table of node D provided in an embodiment of the present application.

[0124] Table 4

[0125] After node D completes the processing, the resource allocation corresponding to the fine-grained connection consisting of hop-by-hop MTNP termination is completed.

[0126] It can be understood that the above-mentioned resource allocation instruction flag may include a first instruction flag, or may include a first instruction flag and a second instruction flag, and this application does not impose any specific restrictions on the content of the instruction flag.

[0127] It can be understood that when the first instruction flag in the target SID is 1, that is, time slot resources need to be allocated, the time slot is determined based on the resource demand information and added to the local resource forwarding table item corresponding to the target SID; when the second instruction flag in the target SID is 1, that is, time slot crossing is required, the time slot crossing configuration is performed based on the input time slot and output time slot in the local resource forwarding table item corresponding to the target SID.

[0128] It can be understood that the above-mentioned target SID can be represented by WORD32, using the lower 16 bits to express the specific SID content, and the lower bit of the upper 16 bits to represent the resource allocation instruction. For example, in this example, the lower 2 bits represent the first instruction flag and the second instruction flag. The target SID can also be expressed in an expression method according to actual conditions. This application does not impose specific restrictions on the expression method of the target SID, the occupied byte size, and the position of the first instruction flag and the second instruction flag in the target SID.

[0129] Scenario 2:

[0130] Please refer to FIG5 , which is a schematic diagram of an end-to-end MTNP large particle path provided in an embodiment of the present application.

[0131] An end-to-end MTNP cross-connection has been established between node A and node C. A fine-grained fgMTNP connection needs to be established between point A and point C.

[0132] Used in this application<SID1001,SID1002> Represents the entire path. SID 1001 is the target SID of node A. At this time, the outgoing interface of fgMTNP in node A is mtn-client-1, and the outgoing time slots are {1, 2, 3}. SID 1002 represents the MTNP path in the network, and in node A, it represents the outgoing interface mtn-client-1. Node A is the head node, and node C is the downstream node. When node A receives the first path message from the network management or PCE, it searches the local resource forwarding table for entries according to SID 1001 (0x11001). According to SID 1001's instruction 0x11001, the first instruction flag in the upper 16 bits is set to 1, and the second instruction flag is set to 0, indicating that only time slot resources need to be allocated. Therefore, node A allocates outgoing time slots {1, 2, 3} in mtn-client-1.

[0133] Please refer to Table 5, which is another exemplary local resource forwarding table of node A provided in an embodiment of the present application.

[0134] Table 5

[0135] After receiving the path information from node A, node C confirms that the service is entering from the local mtn-client-2 interface. It then reserves the time slots {1, 2, 3} in the forwarding plane mtn-client-2 for the current service, completing the establishment of the current path.

[0136] Please refer to Table 6, which is another exemplary local resource forwarding table of node C provided in an embodiment of the present application.

[0137] Table 6

[0138] Example 2:

[0139] The present application provides a SID expression method that supports TDM technology, which can be described using WORD32 four bytes or multiples of four bytes. The present application does not impose any specific restrictions on it.

[0140] The available SID range information of the present application may include at least one global SID and may include at least one local SID.

[0141] A global SID (fgMTNP, MTNP, or ETH (Ethernet)) represents a link or connection between two nodes in the TDM-based forwarding plane. These two nodes can be neighbors or forwarding adjacencies. Global SIDs are assigned uniformly by the network management (NMS) within the control domain.

[0142] Local SIDs and available SID range information are locally allocated, maintained, and recovered by the forwarding node. They can be used to describe the outbound interface that supports granular service capabilities and the corresponding specific time slots in the outbound interface. This type of local SID is a local behavior of the node, and other nodes are unaware of the time slot resources of the outbound interface of the current node. For local use, this embodiment provides a SID encoding method on a device. Once the port or board on the device enables fine-grained capabilities, the available SID range information corresponding to the local interface can be generated locally based on the interface that enables fine-grained capabilities. After the network management or PCE calculates the path, the local resource forwarding table entry corresponding to the current local SID can be improved. That is, based on the inbound interface and inbound time slot carried in the control protocol, the set of <inbound interface, inbound time slot, outbound interface, outbound time slot> uniquely identified by the current local SID in the device can be improved. When the device is restarted, the current local resource forwarding table entry is still used preferentially.

[0143] Example 3:

[0144] Before path calculation, each node floods its 5G-capable mtn-client into the routing domain, along with the available SID range information for that mtn-client. Based on the available SID range information locally supported by each device's mtn-client in the flooded information, the network management assigns a SID within the range to the current calculated path and includes it in the calculated path result. After the source node receives the first path message, it carries the SID list in the message for node-by-node processing to perform resource allocation.

[0145] Each source and sink node supporting MTNP / 10GE standard Ethernet with fine-grained capabilities needs to open the IGP (Interior Gateway Protocol) routing domain.

[0146] Please refer to Table 7, which is an exemplary node interface fine-grained capability TLV provided in an embodiment of the present application.

[0147] Table 7

[0148] The node's fine-grained interface capability TLV (Type-Length-Value), where Type indicates the fine-grained capability, Length is the length of the entire TLV, Interface is the local mtn-client interface that supports granular service capabilities, Available Resource indicates the available resources on the current interface, that is, the available time slots, SID Beginning is the starting number of SIDs supported by the current interface, and SID Length is the maximum number of local SIDs supported by the current mtn-client outbound interface.

[0149] The embodiment of the present application further provides an electronic device, as shown in FIG6 , wherein the electronic device 1400 includes:

[0150] one or more processors 1410;

[0151] The memory 1420 stores one or more programs. When the one or more programs are executed by the one or more processors 1410, the one or more processors 1410 implement the following:

[0152] A resource allocation method as applied to a first node; or

[0153] For example, the resource allocation method is applied to the second node.

[0154] The memory 1420 is a non-transient network system that can be used to store non-transient software programs and non-transient computer executable programs. In addition, the memory 1420 may include a high-speed random access memory and may also include a non-transient memory, such as at least one disk storage device, a flash memory device, or other non-transient solid-state storage device. In some embodiments, the memory 1420 may optionally include a memory 1420 remotely located relative to the processor 1410, and these remote memories 1420 may be connected to the processor 1410 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.

[0155] The memory 1420 can be implemented in the form of a read-only memory (ROM), a static storage device, a dynamic storage device, or a random access memory (RAM). The memory 1420 can store an operating system and other application programs. When the technical solutions provided in the embodiments of this specification are implemented through software or firmware, the relevant program code is stored in the memory 1420 and is called by the processor 1410 to execute the methods of the embodiments of this application.

[0156] The processor 1410 can be implemented using a general-purpose CPU (Central Processing Unit), a microprocessor, an application-specific integrated circuit (ASIC), or one or more integrated circuits, and is used to execute relevant programs to implement the technical solutions provided in the embodiments of the present application.

[0157] In some embodiments, the electronic device further comprises:

[0158] Input / output interface, used to realize information input and output;

[0159] Communication interface, used to realize communication interaction between this device and other devices, which can be achieved through wired means (such as USB, network cable, etc.) or wireless means (such as mobile network, Wi-Fi, Bluetooth, etc.);

[0160] A bus that transmits information between various components of the device (e.g., the processor 1410, memory 1420, input / output interfaces, and communication interfaces);

[0161] The processor 1410 , the memory 1420 , the input / output interface, and the communication interface can be communicatively connected to each other within the device via a bus.

[0162] An embodiment of the present application further provides a computer-readable storage medium storing computer-executable instructions for executing:

[0163] A resource allocation method as applied to a first node; or

[0164] For example, the resource allocation method is applied to the second node.

[0165] An embodiment of the present application further provides a computer program product, including a computer program or computer instructions, wherein the computer program or computer instructions are stored in a computer-readable storage medium. A processor of a computer device reads the computer program or computer instructions from the computer-readable storage medium, and the processor executes the computer program or computer instructions, so that the computer device performs the following operations:

[0166] A resource allocation method as applied to a first node; or

[0167] For example, the resource allocation method is applied to the second node.

[0168] The system architecture and application scenarios described in the embodiments of the present application are intended to more clearly illustrate the technical solutions of the embodiments of the present application, and do not constitute a limitation on the technical solutions provided in the embodiments of the present application. Those skilled in the art will appreciate that with the evolution of the system architecture and the emergence of new application scenarios, the technical solutions provided in the embodiments of the present application are equally applicable to similar technical problems.

[0169] Those skilled in the art will appreciate that all or part of the processes in the above-mentioned embodiments can be implemented by instructing the relevant hardware through a computer program. The computer program can be stored in a non-volatile computer-readable storage medium. When the computer program is executed, it can include the processes of the embodiments of the above-mentioned methods. Among them, any reference to memory, storage, database or other media used in the embodiments provided in this application can include non-volatile and / or volatile memory. Non-volatile memory can include read-only memory (ROM), programmable ROM (PROM), electrically programmable ROM (EPROM), electrically erasable programmable ROM (EEPROM) or flash memory. Volatile memory can include random access memory (RAM) or external cache memory. By way of illustration and not limitation, RAM is available in various forms, such as static RAM (SRAM), dynamic RAM (DRAM), synchronous DRAM (SDRAM), double data rate SDRAM (DDRSDRAM), enhanced SDRAM (ESDRAM), synchronous link (Synchlink) DRAM (SLDRAM), memory bus (Rambus) direct RAM (RDRAM), direct memory bus dynamic RAM (DRDRAM), and memory bus dynamic RAM (RDRAM).

[0170] Those skilled in the art will appreciate that all or some of the steps and systems in the method disclosed above can be implemented as software, firmware, hardware, and appropriate combinations thereof. Some physical components or all physical components can be implemented as software executed by a processor, such as a central processing unit, a digital signal processor, or a microprocessor, or implemented as hardware, or implemented as an integrated circuit, such as an application-specific integrated circuit. Such software can be distributed on a computer-readable medium, and the computer-readable medium can include computer storage media (or non-transitory media) and communication media (or temporary media). As known to those skilled in the art, the term computer storage media is included in any method or technology for storing information (such as computer-readable instructions, data structures, program modules, or other data) and is volatile and non-volatile, removable, and non-removable. Computer storage media includes, but is not limited to, RAM, ROM, EEPROM, flash memory, or other memory technology, CD-ROM, digital versatile disks (DVD), or other optical disk storage, magnetic cassettes, magnetic tapes, disk storage, or other magnetic storage devices, or any other medium that can be used to store desired information and can be accessed by a computer. Furthermore, as is well known to those skilled in the art, communication media typically embodies computer-readable instructions, data structures, program modules, or other data in a modulated data signal such as a carrier wave or other transport mechanism, and may include any information delivery media.

[0171] The above description of some embodiments of the present application with reference to the accompanying drawings does not limit the scope of the present application. Any modifications, equivalent substitutions, and improvements made by those skilled in the art without departing from the scope and essence of the present application shall be within the scope of the present application.

Claims

1. A resource allocation method, applied to a first node, comprising: receiving a first path message, wherein the first path message includes a segment identifier (SID) list and resource requirement information, wherein the SID list includes at least one SID, and each SID includes a resource allocation instruction flag; Obtain the target SID corresponding to the current node from the SID list; Resources are allocated according to the resource allocation instruction flag in the target SID and the resource requirement information.

2. The method according to claim 1, wherein The resource requirement information includes at least one of bandwidth and delay requirements, and the target SID is used to map a unique logical resource in the first node.

3. The method according to claim 1, wherein The resource allocation instruction flag includes a first instruction flag, and the first instruction flag is used to indicate whether time slot resources need to be allocated; The performing resource allocation according to the resource allocation instruction flag in the target SID and the resource requirement information includes: When the first instruction flag indicates that time slot resources need to be allocated, the time slot is determined according to the resource requirement information.

4. The method according to claim 3, wherein: After determining the time slot according to the resource requirement information, the method further includes: The outgoing time slot is added to the local resource forwarding entry corresponding to the target SID.

5. The method according to claim 3, wherein The resource allocation instruction flag includes a second instruction flag, and the second instruction flag is used to indicate whether time slot crossing is required; The performing resource allocation according to the resource allocation instruction flag in the target SID and the resource requirement information includes: When the second instruction flag indicates that time slot interleaving is required, a local resource forwarding table entry corresponding to the target SID is obtained, and time slot interleaving configuration is performed according to the incoming time slot and the outgoing time slot in the local resource forwarding table entry.

6. The method according to claim 5, wherein: The method further comprises: determining an incoming interface and an incoming time slot according to the first path message; The input interface and the input time slot are added to the local resource forwarding entry corresponding to the target SID.

7. The method according to any one of claims 4 to 6, wherein: The local resource forwarding table entry also includes an outgoing interface.

8. The method according to claim 1, wherein Before receiving the first path message, the method further includes: Capability information is sent to the second node, where the capability information includes: an outbound interface of the first node supporting a target granularity capability, corresponding available time slot information, and available SID range information.

9. The method according to claim 8, wherein The available SID range information includes at least one local SID, the local SID code is configured by the first node itself, and the local SID corresponds to a service layer outbound interface on the first node that supports target granularity capability.

10. The method according to claim 1, wherein The first node is a source node or an intermediate node in the path; after allocating resources according to the resource allocation instruction flag in the target SID and the resource requirement information, the method further includes: Send a second path message to the downstream, the second path message including: the SID list, the resource requirement information information, outgoing interface information corresponding to the first node, and outgoing time slot information corresponding to the first node.

11. The method according to claim 1, wherein The first node is the penultimate hop node in the path. After performing a resource allocation action according to the instruction flag in the target SID and the resource requirement information, the method further includes: The SID list and the resource requirement information in the first path message are deleted, and no message is sent again.

12. A resource allocation method, applied to a second node, the method comprising: A first path message is sent to the first node, where the first path message includes a segment identifier SID list and resource requirement information, where the SID list includes at least one SID, and each SID includes a resource allocation instruction flag.

13. The method according to claim 12, wherein: Before sending the first path message to the first node, the method further includes: Capability information sent by multiple first nodes is received, where the capability information includes: outbound interfaces of target granularity service capabilities supported by the first nodes, corresponding available time slot information, and available SID range information.

14. The method according to claim 13, wherein After receiving the capability information sent by the plurality of first nodes, the method further includes: Determining at least one candidate path corresponding to the target service according to destination address information corresponding to the target service; determining a target path according to capability information of a first node in the candidate path; The first path message is generated according to the target path.

15. The method according to claim 14, wherein Before the destination address information corresponding to the target service is used, the method further includes: A path computation request message sent by a source node is received, where the source node is one of the multiple first nodes, and the path computation request message carries destination address information corresponding to the target service.

16. The method according to claim 12, wherein: The resource allocation instruction flag includes a first instruction flag, and the first instruction flag is used to indicate whether time slot resources need to be allocated.

17. The method according to claim 12, wherein: The resource allocation instruction flag includes a second instruction flag, and the second instruction flag is used to indicate whether time slot crossing is required.

18. The method according to claim 12, wherein: The resource requirement information includes at least one of bandwidth and delay requirements.

19. An electronic device comprising: one or more processors; A memory having one or more programs stored thereon, wherein when the one or more programs are executed by the one or more processors, the one or more processors implement the following: The resource allocation method according to any one of claims 1 to 11; or, The resource allocation method according to any one of claims 12 to 18.

20. A computer-readable storage medium having a computer program stored thereon, wherein when the program is executed by a processor, the resource allocation method according to any one of claims 1 to 11 is implemented; or, The resource allocation method according to any one of claims 12 to 18.

Images