CN116647500A - Routing path generation method, data transmission method and computer readable medium - Google Patents

Abstract

The application discloses a route path generation method, and belongs to the technical field of communication. The route path generation method comprises the following steps: acquiring the calculation information of each calculation gateway in the calculation resource pool; generating SIDs of various services according to the calculation force information; and generating a routing path by using the SIDs of the services and the routing information of the SIDs. The technical scheme of the application can effectively improve the analysis efficiency of the route. The present disclosure also provides a data transmission method, an electronic device, and a computer-readable medium.

Description

Routing path generation method, data transmission method and computer readable medium

Technical Field

The present application relates to the field of communications technologies, and in particular, to a routing path generating method, a data transmission method, an electronic device, and a computer readable medium.

Background

Currently, when solving the problem of routing programming of a power network, segment routing (Segment Routing Over IPv, SRv 6) based on an IPv6 forwarding plane is generally adopted, such as schemes of calculating a priority network (Computing First Network, CFN), an access point name (Access Point Name, APN), and the like, so that required label information can participate in routing decisions. However, when the current CFN and APN schemes guide route programming, different route path selection services cannot be provided according to service requirements, and the priority order among label information cannot be ensured, so that the analysis efficiency of the route is affected. Therefore, how to simplify the routing message carrying the label information and improve the routing resolution efficiency becomes a challenge to be solved.

Disclosure of Invention

Therefore, the application provides a route path generation method, which solves the problem of low route analysis efficiency caused by the fact that different route path selection services cannot be provided according to service requirements and the priority order among label information cannot be ensured in the prior art.

In order to achieve the above object, as a first aspect of the present application, there is provided a routing path generation method based on a network Segment Identity (SID), the routing path generation method comprising:

acquiring the calculation information of each calculation gateway in the calculation resource pool;

generating SIDs of various services according to the calculation force information;

and generating a routing path by using the SIDs of the services and the routing information of the SIDs.

Optionally, the generating the SID of each service according to the computing power information includes:

determining the computing power resource type and the resource consumption used by each service according to the computing power information;

standard quantization is carried out on the computing power resource types and the resource usage corresponding to each service, and a plurality of numeric SID factors are obtained so as to describe each service;

the service SID factor is added to the SID extension bits according to a predetermined rule.

Optionally, the performing standard quantization on the computing power resource type and the resource usage corresponding to each service to obtain a plurality of quantized SID factors includes:

obtaining service attribute templates corresponding to the service types according to the service types, wherein the service attribute templates are used for determining the requirements of the services of the service types on SID factors;

and selecting the SID factors according to the service attribute templates, and determining the service SID factors corresponding to the service types.

Optionally, the SID extension bit includes a position extension bit, an parsing mode extension bit, and an operator extension bit; the adding the service SID factor to the SID extension bit according to the predetermined rules includes:

splitting the service SID factors to obtain a first service SID factor and a second service SID factor, wherein the first service SID factor is a gateway address of a service type; the second service SID factor is a plurality of numeric SID factors of one service type;

adding the first service SID factor to the position extension bit;

adding an analysis mode identifier into the analysis mode expansion bit, wherein the analysis mode identifier is used for indicating a first service SID factor and a second service SID factor to obtain corresponding service SID factors;

the second service SID factor is added to the operator extension bit.

As a second aspect of the present application, there is provided a SID-based data transmission method comprising:

receiving a service message;

analyzing the service message to obtain various services required by the service message;

determining SIDs of all services required by the service message;

determining a routing path corresponding to the SID of each service, wherein the routing path is generated by the routing path generation method in any one of the first aspect;

and forwarding the service message according to the determined routing path.

Optionally, the determining the routing path corresponding to the SID of each service includes:

determining the location extension bit of the SID of each service;

and determining a routing path corresponding to the SID of each service according to the position expansion bit of the SID of each service.

Optionally, the SID extension bit includes a position extension bit, an parsing mode extension bit, and an operator extension bit;

the determining the routing path corresponding to the SID of each service according to the position expansion bit of the SID of each service comprises the following steps:

determining a first service SID factor according to the content of the position expansion bit of the SID of each service, wherein the first service SID factor is a gateway address of one service type;

and determining a routing path corresponding to the SID of each service according to the first service SID factor.

As a third aspect of the present application, there is provided a routing path generation method based on a network segment identification SID, comprising:

and sending the computing power information to a Segment Routing (SR) router for the SR router to execute the routing path generating method of any one of the first aspect, wherein the computing power resource pool comprises a current computing power gateway.

In a fourth aspect, an embodiment of the present application provides an electronic device, including:

one or more processors;

a memory having one or more programs stored thereon, which when executed by the one or more processors, cause the one or more processors to implement the method according to any of the first to third aspects;

one or more I/O interfaces coupled between the processor and the memory configured to enable information interaction of the processor with the memory.

In a fifth aspect, an embodiment of the present application provides a computer-readable medium, on which a computer program is stored, which program, when executed by a processor, implements a method according to any one of the first to third aspects.

The route path generation method provided by the application obtains the corresponding SID according to the service type of the required service by utilizing the calculation information of the calculation gateway in the calculation resource pool, and generates the route path by utilizing the SID of each service and the route information of each SID, so that the generation of the route path can combine the calculation information of each gateway, and meanwhile, only carries the calculation information describing the required calculation gateway according to different service types, thereby effectively improving the analysis efficiency of the route.

Drawings

The accompanying drawings are included to provide a further understanding of the application, and are incorporated in and constitute a part of this specification, illustrate the application and together with the description serve to explain, without limitation, the application.

Fig. 1 is a flowchart of a route path generating method according to an embodiment of the present application;

fig. 2 is a flowchart of a part of steps in a routing path generating method according to an embodiment of the present application;

fig. 3 is a flowchart illustrating a part of steps in a routing path generating method according to an embodiment of the present application;

fig. 4 is a flowchart of a part of steps in a routing path generating method according to an embodiment of the present application;

fig. 5 is a flowchart of a data transmission method according to an embodiment of the present application;

fig. 6 is a flowchart of a route path generating method according to an embodiment of the present application;

fig. 7 is a flowchart of an electronic device according to an embodiment of the present application;

Detailed Description

The following describes specific embodiments of the present application in detail with reference to the drawings. It should be understood that the detailed description and specific examples, while indicating and illustrating the application, are not intended to limit the application.

As used herein, the term "and/or" includes any and all combinations of one or more of the associated listed items.

The terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the application. As used herein, the singular forms "a," "an," and "the" are intended to include the plural forms as well, unless the context clearly indicates otherwise.

The terms "comprises," "comprising," and/or "including" when used in this specification, specify the presence of stated features, integers, steps, operations, elements, and/or components, but do not preclude the presence or addition of one or more other features, integers, steps, operations, elements, components, and/or groups thereof.

Embodiments of the application may be described with reference to plan and/or cross-sectional illustrations that are schematic illustrations of idealized embodiments of the application. Accordingly, the example illustrations may be modified in accordance with manufacturing techniques and/or tolerances.

Unless otherwise defined, all terms (including technical and scientific terms) used herein have the same meaning as commonly understood by one of ordinary skill in the art. It will be further understood that terms, such as those defined in commonly used dictionaries, should be interpreted as having a meaning that is consistent with their meaning in the context of the relevant art and the present application and will not be interpreted in an idealized or overly formal sense unless expressly so defined herein.

The inventor of the present disclosure repeatedly researches and discovers that, in the related art, when the computing gateway uses labels such as network segment identification SID to perform route programming, the reason that the route analysis efficiency is low is that when the current CFN and APN schemes guide route programming, the label information of the obtained route message is fixed, and the information which does not participate in route decision is written into the label information. Specifically, when receiving the SRv message carrying the tag, the computing gateway needs to parse the Segment List (SL) of the message extension bit. In the process of obtaining the identifiers for identifying the services, only part of the identifiers actually participate in the routing decision, and the analysis of the segment list is needed to be carried out piece by piece, so that the routing based on the identifiers has lower routing analysis efficiency. In addition, the label information of the routing message is fixed and also causes to influence the routing analysis efficiency. When routing programming with fixed and unchanged labels, the power gateway cannot provide differentiated routing services according to different demands of the traffic.

As a first aspect of the present application, an embodiment of the present application provides a method for generating a routing path based on a network segment identification SID, as shown in fig. 1, where the method for generating a routing path may include:

in step S110, computing power information of each computing power gateway in the computing power resource pool is obtained;

in step S120, the SID of each service is generated according to the calculation power information;

in step S130, a routing path is generated using the SID of each service and routing information of each SID.

It should be noted that the route path generating method provided by the present application is executed by the SR router of the packet forwarding device capable of resolving the segment route SRv. The route path generating method provided by the embodiment of the application acts on the IPv6 of the sixth generation internet protocol and carries out route forwarding based on the segment route SRv6 of the IPv6 forwarding plane.

For the routing forwarding service, the routing information is always changed along with the change of the network environment, and thus the computing force gateways required to be used on the routing path and the requirements on the gateways are also changed continuously. At this time, the SID of each service can identify the computing power gateway required by the routing, and the requirements on the computing power resource type and the resource usage of the required computing power gateway. Therefore, when the routing path needs to be regenerated, the SID can be generated according to the power information of the power gateway redetermined by the new routing information, and the new routing path can be generated by using the SID.

In the embodiment of the application, the computing gateway in the computing resource pool refers to a route forwarding unit working in the sixth generation network protocol IPv6 network environment and used for forwarding various messages. For the aforementioned computational power gateway, it typically does not have the parsing capability to parse the corresponding message generated by the segment route SRv when forwarding the message. Thus, the generation of the network segment identification SID, and the generation and forwarding of the routing path based on the identification all need to be handled by a dedicated SR router. The computing power gateway in the computing power resource pool can provide self computing power information for an SR router needing to generate a routing path based on the SID; and the computing gateway in the computing resource pool forwards the received SRv message to be forwarded to the SR router with resolving capability for resolving agent so as to acquire the next hop address.

In step S110, the computing power information of the computing power gateway refers to computing power information of each service that can be provided by the computing power gateway, and the computing power resource type of the computing power information may include: the computing power of the hardware device, the location of the service, the cache location, the requirement of the service on the computing power, the bandwidth requirement, the time delay requirement, the packet loss requirement, the protocol version and the like. The computing power information of the computing power gateway may include the computing power resource type and the resource usage of the corresponding type.

In the embodiment of the application, the generation of the SIDs of each service according to the calculation force information means that the calculation force information can describe the service, and based on the SIDs, the calculation force information is utilized to form the SIDs of the SRv message header coding rule, so that the corresponding SIDs can describe the corresponding service. When a single communication service includes a plurality of services to be sequentially executed, the SIDs of the services generated according to the computing power information may also form a corresponding set to describe the corresponding communication service.

As described above, the SID generated from the computing force information can describe the corresponding service. In actual communication traffic, the requirements for the type of computational resources of the same service in different traffic scenarios may change. At this time, the SR server with processing capability of SRv can re-acquire the computing power information of the re-determined services in each computing power gateway in the computing power resource pool, where the computing power information includes the re-determined computing power resource type and resource usage, and re-generate the SID of the corresponding service based on the re-determined computing power information, and generate the routing path.

In the embodiment of the present application, the routing information of the SID refers to the service usage sequence corresponding to the SID of each service. Optionally, the routing information of the SID is pre-stored in the SR router for routing path generation. After the execution sequence of any two adjacent services is obtained through the pre-stored routing information of the SID, further calculation of the routing forwarding path between the two services is generally required.

In step S130, the routing algorithm is not particularly limited, and it is necessary to calculate the routing path between the two services after knowing the execution sequence of the two services, as described above. In an alternative implementation manner, for the route jump node between two services obtained by route calculation, the existing SID can be selected to identify the node, instead of using the SID carrying the calculation information in the present application, so as to save the processing resources of the processing unit of the corresponding SR router.

In the embodiment of the present application, as an optional implementation manner, after generating a routing path by using the SID of each service and the routing information of each SID, the method may further include: generating a routing table item according to the moving path; distributing the routing table entries to a computing gateway; wherein each routing node of the movement path comprises the computational force gateway. As described above, each of the computing gateways in the computing resource pool typically does not have parsing capability to parse the corresponding message generated by the segment route SRv6, so a device with parsing capability SRv may generate, after generating the routing path, a routing table entry required by the corresponding computing gateway according to the moving path, and distribute the routing table entry to each computing gateway, so as to save forwarding time generated by the computing gateway when performing forwarding tasks, where the forwarding time is generated by using the proxy service of SRv6 frequently.

In the embodiment of the present application, how to perform step S120 is not limited in particular, and as described above, the computing power information includes the computing power resource type and the resource usage of the corresponding type. Combining the above calculation force information can give calculation force requirements required by various services, and the calculation force information meeting the calculation force requirements can be written in through SRv protocol to generate network segment identification SID, accordingly, the generation of SID of each service according to the calculation force information, as shown in fig. 2, may include:

in step S121, determining the computing power resource type and the resource usage of each service according to the computing power information;

in step S122, standard quantization is performed on the computing power resource types and resource usage amounts corresponding to each service, so as to obtain a plurality of numeric SID factors, so as to describe each service;

in step S123, the service SID factor is added to the SID extension bit according to a predetermined rule.

When describing the service by using the acquired computing power information, not all the resource usage of the computing power resource types capable of representing the service characteristics can be represented by using numerical values, and not all the resource usage capable of being represented by using the numerical values have the same scale. Therefore, standard quantization is required for the computing power resource types and resource usage corresponding to each service, so that the various quantized resource usage (or quantized SID factors) have comparability.

The computing power information that needs to be quantized in the embodiments of the present application may include resource usage of multiple computing power resource types. Wherein, the computing power resource types can be classified into service naming, service status, resource types and the like. Standard quantization is carried out on the computing power resource type to obtain a plurality of numeric SID factors, wherein the numeric SID factors can comprise: location SID factors, performance SID factors, functional SID factors, etc.

By means of the above-mentioned location SID factor, performance SID factor, functional SID factor, various service properties can be described, respectively, for example,

the location SID factors may include service locations, service cache locations, etc.;

the performance SID factors can comprise calculation force requirements, bandwidth requirements, time delay requirements, packet loss requirements, communication modes and the like;

the functional SID factors may include service type, calculation force type, security type, protocol version, etc.

For convenience of description and processing, a plurality of numeric SID factors are combined, and the obtained combined result is called a service SID factor, wherein the service SID factor comprises requirements of services for different computing power resource types and different resource usage amounts, so that different services can be described by selecting different service SID factors.

As described above, the route path generation method based on the network segment identification SID provided in the embodiment of the present application acts on IPv6 and performs route forwarding based on SRv. The SID extension bit refers to three components of a Segment List (SL) located in the Segment routing header (Segment Routing Header, SRH) after the IPv6 header, and includes: position extension bit (Locator), parse mode extension bit (Function), operator extension bit (figure).

In the embodiment of the application, the service SID factor needs to be added into the SID extension bit to generate a corresponding SID for filling in the segment routing header SRH to obtain a corresponding SRv message, thereby realizing message transmission and routing guidance.

Alternatively, the service SID factor may contain location information capable of indicating a location of the service, and the location information capable of indicating the service can be filled in the location extension bit. For example, the network address of the computing gateway a providing the computing service in the computing resource pool is filled in the location extension bit to obtain the corresponding SID, so that the SRv message containing the corresponding SID can be correctly forwarded to the computing gateway a to obtain the computing service provided by the computing gateway.

Optionally, the service SID factor may also contain requirements for the resource usage of the described service, and the requirements for the resource usage of the described service can be filled in operator extension bits. For example, when the computing gateway a is used to execute the software download service, there are transmission bandwidth requirements and network delay requirements for the software download task, and the transmission bandwidth requirements and the network delay requirements can be filled into the operator extension bit to obtain the corresponding SID, so that the computing gateway a can correctly download according to the transmission bandwidth requirements and the network delay requirements provided by the SID when executing the software download service.

Optionally, when the service SID factor needs to use the position extension bit and the operator extension bit at the same time, a preset parsing mode identifier may be filled in the parsing mode extension bit, where the parsing mode identifier may instruct the SR router to restore to obtain the service SID factor according to the operator extension bit and the content filled in the position extension bit.

The case where three partial extension bits of the SID extension bit of the segment list need to be used simultaneously will be described in detail, and will not be described in detail.

In the present application, how to perform standard quantization is not limited, and the performing standard quantization on the computing power resource type and the resource usage corresponding to each service to obtain a plurality of quantized SID factors, which describe each service, as shown in fig. 3, may include:

in step S122a, a service attribute template corresponding to each service type is obtained according to the service type, where the service attribute template is used to determine the requirement of the service of each service type on the SID factor.

In step S122b, the SID factor is selected according to the service attribute template, and the service SID factor corresponding to the service type is determined.

For services, different service content often means that different computing gateways need to be used to participate in the corresponding service. At this time, in order to select the computing power resource type and the resource usage of the corresponding type, which can describe the specific service, from the plurality of the numeric SID factors, the requirements of different service types for the numeric SID factors are characterized by using the service attribute template. Therefore, in order to obtain the service SID factor corresponding to the service type, the numeric SID factor may be selected according to the service attribute template.

In the embodiment of the application, the service attribute template refers to a selection tool capable of selecting from all the numeric SID factors subjected to standard quantization to obtain the numeric SID factors capable of describing specific services.

In an exemplary embodiment, the obtained digitized SID factors may be saved into a set, resulting in a set of SID factors. At this time, the service attribute template may be a set with the same size as the SID factor set, and the service attribute template is composed of 0 and 1, when the value of the xth bit in the service attribute template is 0, it means that the computing power resource type and the resource usage of the xth bit corresponding to the SID factor set are not required by the service corresponding to the service attribute template; when the value of the X bit in the service attribute template is 1, the computing power resource type and the resource consumption of the X bit corresponding to the SID factor set are required by the service corresponding to the service attribute template.

In an exemplary embodiment, the digitized SID factors obtained by the computing gateway may be stored in a matrix, and for convenience of description and processing, the matrix formed by the digitized SID factors obtained by the computing gateway is referred to as a service identification matrix U, as shown in formula (1).

Wherein L is _i Representing a position SID factor at column i of the matrix; p (P) _i Representing the performance SID factor of the ith column of the matrix, F _i Representing the functional SID factor at column i of the matrix;

at this time, since the service attribute template is a selection tool that can be selected from all the quantized SID factors subjected to standard quantization to obtain the quantized SID factors capable of describing a specific service, the service attribute template constitutes a service template matrix V of the same size as the service identification matrix, as shown in formula (2).

Wherein L is _i (x)、P _i (x)、F _i (x) All are when x is 0, the value is 0; when x is 1, a function with a value of 1; x is 0 or 1; and when x is 0, the calculation force information of the corresponding position of the service identification matrix is not required, and when x is 1, the calculation force information of the corresponding position of the service identification matrix is required.

And selecting the SID factors according to the service attribute templates by carrying out Hadamard product on the service identification matrix and the service template matrix. For convenience of description and processing, the hadamard product result of the two matrices is referred to as a service awareness matrix W. And each element of the service perception matrix is the service SID factor.

In the present application, how to execute step S123 is not particularly limited, and as described above, the SID extension bits include a position extension bit, an parsing manner extension bit, and an operator extension bit; accordingly, the adding the service SID factor to the SID extension bit according to the predetermined rule, as shown in fig. 4, may include:

in step S123a, splitting the service SID factor to obtain a first service SID factor and a second service SID factor, where the first service SID factor is a gateway address of a service type; the second service SID factor is a plurality of numeric SID factors of one service type;

in step S123b, adding the first service SID factor to the position extension bit;

in step S123c, adding an analysis mode identifier to the analysis mode extension bit, where the analysis mode identifier is used to instruct the first service SID factor and the second service SID factor to obtain corresponding service SID factors;

in step S123d, the second service SID factor is added to the operator extension bit.

For the service SID factor of a route forwarding service, two different location information needs to be used simultaneously to implement the corresponding service. At this time, the service SID factor may include two computing gateways corresponding to the different bit information, and requirements for resource usage of multiple computing resource types for the two computing gateways. Filling one of the position information of the two computing power gateways into a position expansion bit, filling the position information of the other computing power gateway and the requirement of the resource consumption of a plurality of computing power resource types aiming at the two computing power gateways into an operator expansion bit, and filling an analysis mode identifier which can instruct an SR router to restore the content filled in the operator expansion bit and the position expansion bit to obtain a service SID factor into an analysis mode expansion bit.

In the embodiment of the application, the service SID factor of the route forwarding service is required to be added into the SID expansion bit to generate the corresponding SID.

Optionally, the first service SID factor is one of the location information of the two computing power gateways, and the second service SID factor is the location information of the other computing power gateway and the requirement of resource usage of multiple computing power resource types for the two computing power gateways. The resolution mode identifier may be obtained according to a preset mapping table between the resolution mode and the resolution mode identifier, where the resolution mode may include direct stitching and matrix stitching.

In one exemplary embodiment, when a service SID factor is used to identify a route forwarding service, the service SID factor contains two computing gateways involved in route forwarding and the requirements for the resource usage of the two computing gateways for multiple computing resource types. At this time, the first service SID factor may be a source IP address of the route forwarding, and the second service SID factor may be a destination IP address of the route forwarding, and requirements of resource usage of multiple computing power resource types of the gateway corresponding to the source IP address and the destination IP address. When the service SID factors can be obtained by directly splicing the first service SID factor and the second service SID factor, a preset analysis mode identifier is direct splicing, and the analysis mode identifier can indicate the SR router to restore the content filled in the operator expansion bit and the position expansion bit to obtain the service SID factor.

As described above, there is an alternative embodiment, where the digitized SID factors form a whole, and when the organization form of the whole is a matrix, the matrix is called a service identification matrix, the service attribute template is called a service template matrix, and the hadamard product is performed on the service identification matrix and the service attribute template to obtain a service perception matrix of the service SID factors.

In an exemplary embodiment, when the service awareness matrix of the service SID factor is W _i When, as shown in formula (3), the service SID factor is L ₁ L ₂ P ₁ P ₂ F ₁ F ₃ 。

When a service SID factor is used to identify a route forwarding service, the service SID factor contains two computing power gateways involved in route forwarding and requirements for the resource usage of the two computing power gateways for multiple computing power resource types. Let L be ₁ The source IP address forwarded for the route, in which case the first service SID factor may be the source IP address L forwarded for the route ₁ The second service SID factor may be a destination IP address for route forwarding, and a resource usage requirement of the source IP address and the destination IP address for multiple computing power resource types of the gateway, i.e., L ₂ P ₁ P ₂ F ₁ F ₃ 。

And filling the first service SID factor into a position expansion bit, and filling the second service SID factor into an operator expansion bit.

Meanwhile, in order to enable the first service SID factor and the second service SID factor to be accurately resolved into corresponding service SID factors, a service attribute template of the service SID factors is also filled in an operator expansion bit where the second service SID factors are located, and an resolving mode identifier at the moment is matrix splicing. Alternatively, the parsing-manner identifier corresponding to the matrix splice may be identified with |mat|.

As a second aspect of the present application, an embodiment of the present application provides a SID-based data transmission method, as shown in fig. 5, including:

in step S210, receiving a service packet;

in step S220, parsing the service message, where each service is required by the service message;

in step S230, determining the SID of each service required by the service packet;

in step S240, determining a routing path corresponding to the SID of each service, where the routing path is a routing path generated by the routing path generating method in any one of steps S110 to S130 in the first aspect;

in step S250, the service packet is forwarded according to the determined routing path.

It should be noted that the data transmission method provided by the present application is executed by the SR router of the message forwarding device capable of parsing SRv messages.

For a computational gateway in a computational resource pool, it typically does not have the ability to parse SRv protocol messages when forwarding the messages. Thus, when the computing force gateway receives a SRv protocol related message, it is generally required to send the message to a segment routing SR router to obtain the network address of the next hop computing force gateway on the routing table for forwarding.

In the embodiment of the present application, the determining the SID of each service required by the service packet refers to obtaining a plurality of SIDs in the Segment List by using an SR router with SRv parsing capability, and obtaining a corresponding service SID factor by parsing the SID, thereby determining a routing path by using the service SID factor.

In the present application, how to execute step S230 is not limited, and optionally, the determining the routing path corresponding to the SID of each service may include:

determining the location extension bit of the SID of each service;

and determining a routing path corresponding to the SID of each service according to the position expansion bit of the SID of each service.

In the embodiment of the present application, the step of extracting the service SID factor from the SID extension bit according to a predetermined rule refers to performing the inverse process of adding the service SID factor to the SID extension bit. In the adding process, the service SID factors are split into a first service SID factor and a second service SID factor, the first service SID factor and the second service SID factor are respectively filled in a position expansion bit and an operator expansion bit, and an analysis mode identifier which can indicate the first service SID factor and the second service SID factor to be synthesized is stored in an analysis mode expansion bit. Therefore, to determine the routing path, the parsing of the SID should at least include parsing the location extension bit to obtain a first service SID factor, where the first service SID factor includes a network address of a computing gateway for a service of a corresponding service type, so as to determine the routing path.

Optionally, when the SID includes a service SID factor of the routing forwarding service, the first service SID factor may be one of the location information of the two computing gateways, and the second service SID factor may be the location information of the other computing gateway and a requirement for resource usage of multiple computing resource types of the two computing gateways. The resolution mode identifier may be obtained according to a preset mapping table between the resolution mode and the resolution mode identifier, where the resolution mode may include direct stitching and matrix stitching.

As a third aspect of the present application, an embodiment of the present application provides a routing path generating method based on a network segment identification SID, for a computing gateway, as shown in fig. 6, including:

in step S310, the computing power information is sent to the segment routing SR router for the SR router to perform the routing path generation method according to any of the first aspect steps S110-S130, wherein the computing power resource pool comprises the current computing power gateway.

For a segment routing SR router, in order to perform the routing path generation method, it is necessary to collect the computational power information of multiple computational power gateways in the computational power resource pool where it is located, so the serving computational power gateway sends its computational power information to the SR router with SRv parsing capability to generate the routing path. In order to avoid repetitive description, specific steps of the route path generating method are not described herein.

The above steps of the methods are divided, for clarity of description, and may be combined into one step or split into multiple steps when implemented, so long as they include the same logic relationship, and they are all within the protection scope of this patent; it is within the scope of this patent to add insignificant modifications to the algorithm or flow or introduce insignificant designs, but not to alter the core design of its algorithm and flow.

As a fourth aspect of the present application, an embodiment of the present application provides an electronic device.

The functions or modules included in the apparatus provided by the embodiments of the present application may be used to perform the methods described in the first to third method embodiments, and specific implementation and technical effects thereof may refer to the descriptions in the foregoing method embodiments, which are not repeated herein for brevity.

In this embodiment, each module is a logic module, and in practical application, one logic unit may be one physical unit, or may be a part of one physical unit, or may be implemented by a combination of a plurality of physical units. In addition, in order to highlight the innovative part of the present application, units that are not so close to solving the technical problem presented by the present application are not introduced in the present embodiment, but this does not indicate that other units are not present in the present embodiment.

Referring to fig. 7, an embodiment of the present application provides an electronic device, including:

one or more processors 701;

a memory 702, on which one or more programs are stored, which when executed by one or more processors, cause the one or more processors to implement the route path generation method, the data transmission method of any of the above;

one or more I/O interfaces 703, coupled between the processor and the memory, are configured to enable information interaction of the processor with the memory.

Wherein the processor 701 is a device having data processing capabilities, including but not limited to a Central Processing Unit (CPU) or the like; memory 702 is a device with data storage capability including, but not limited to, random access memory (RAM, more specifically SDRAM, DDR, etc.), read-only memory (ROM), electrically charged erasable programmable read-only memory (EEPROM), FLASH memory (FLASH); an I/O interface (read/write interface) 703 is connected between the processor 701 and the memory 702 to enable information interaction between the processor 701 and the memory 702, including but not limited to a data Bus (Bus) or the like.

In some embodiments, processor 701, memory 702, and I/O interface 703 are interconnected by a bus, which in turn is connected to other components of the computing device.

The present embodiment also provides a computer readable medium, on which a computer program is stored, where the program when executed by a processor implements the route path generating method and the data transmission method provided in the present embodiment, and in order to avoid repetitive description, specific steps of the route path generating method and the data transmission method are not described herein.

Those of ordinary skill in the art will appreciate that all or some of the steps, systems, functional modules/units in the apparatus, and methods of the application described above may be implemented as software, firmware, hardware, and suitable combinations thereof. In a hardware implementation, the division between the functional modules/units mentioned in the above description does not necessarily correspond to the division of physical components; for example, one physical component may have multiple functions, or one function or step may be performed cooperatively by several physical components. Some or all of the physical components may be implemented as software executed by a processor, such as a central processing unit, digital signal processor, or microprocessor, or as hardware, or as an integrated circuit, such as an application specific integrated circuit. Such software may be distributed on computer readable media, which may include computer storage media (or non-transitory media) and communication media (or transitory media). The term computer storage media includes both volatile and nonvolatile, removable and non-removable media implemented in any method or technology for storage of information such as computer readable instructions, data structures, program modules or other data, as known to those skilled in the art. 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 tape, magnetic disk storage or other magnetic storage devices, or any other medium which can be used to store the desired information and which can be accessed by a computer. Furthermore, as is well known to those of ordinary skill 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 includes any information delivery media.

It should be noted that, in this document, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising one … …" does not exclude the presence of other like elements in a process, method, article, or apparatus that comprises the element.

Those skilled in the art will appreciate that while some embodiments described herein include some features but not others included in other embodiments, combinations of features of different embodiments are meant to be within the scope of the embodiments and form different embodiments.

It is to be understood that the above embodiments are merely illustrative of the application of the principles of the present application, but not in limitation thereof. Various modifications and improvements may be made by those skilled in the art without departing from the spirit and substance of the application, and are also considered to be within the scope of the application.

Claims (10)

1. A routing path generation method based on network segment identification SID, the routing path generation method comprising:

acquiring the calculation information of each calculation gateway in the calculation resource pool;

generating SIDs of various services according to the calculation force information;

and generating a routing path by using the SIDs of the services and the routing information of the SIDs.

2. The routing path generation method of claim 1, wherein the generating the SIDs of the services from the computing power information comprises:

determining the computing power resource type and the resource consumption used by each service according to the computing power information;

standard quantization is carried out on the computing power resource types and the resource usage corresponding to each service, and a plurality of numeric SID factors are obtained so as to describe each service;

the service SID factor is added to the SID extension bits according to a predetermined rule.

3. The route path generating method according to claim 2, wherein said performing standard quantization on the computing power resource type and the resource usage corresponding to each service to obtain a plurality of quantized SID factors includes:

obtaining service attribute templates corresponding to the service types according to the service types, wherein the service attribute templates are used for determining the requirements of the services of the service types on SID factors;

and selecting the SID factors according to the service attribute templates, and determining the service SID factors corresponding to the service types.

4. The routing path generation method of claim 2, wherein the SID extension bits include a position extension bit, an parsing manner extension bit, an operator extension bit; the adding the service SID factor to the SID extension bit according to the predetermined rules includes:

splitting the service SID factors to obtain a first service SID factor and a second service SID factor, wherein the first service SID factor is a gateway address of a service type; the second service SID factor is a plurality of numeric SID factors of one service type;

adding the first service SID factor to the position extension bit;

adding an analysis mode identifier into the analysis mode expansion bit, wherein the analysis mode identifier is used for indicating a first service SID factor and a second service SID factor to obtain corresponding service SID factors;

the second service SID factor is added to the operator extension bit.

5. A data transmission method based on a network segment identification SID, the data transmission method comprising:

receiving a service message;

analyzing the service message to obtain various services required by the service message;

determining SIDs of all services required by the service message;

determining a routing path corresponding to the SID of each service, wherein the routing path is generated by the routing path generation method according to any one of claims 1-4;

and forwarding the service message according to the determined routing path.

6. The data transmission method according to claim 5, wherein the determining the routing path corresponding to the SID of each service includes:

determining the location extension bit of the SID of each service;

and determining a routing path corresponding to the SID of each service according to the position expansion bit of the SID of each service.

7. The data transmission method of claim 6, wherein the SID extension bits comprise position extension bits, parse mode extension bits, operator extension bits;

the determining the routing path corresponding to the SID of each service according to the position expansion bit of the SID of each service comprises the following steps:

determining a first service SID factor according to the content of the position expansion bit of the SID of each service, wherein the first service SID factor is a gateway address of one service type;

and determining a routing path corresponding to the SID of each service according to the first service SID factor.

8. A route path generation method based on network segment identification SID includes:

transmitting the computational effort information to a segment routing SR router for the SR router to perform the routing path generation method of any one of claims 1 to 4, wherein the computational effort resource pool comprises a current computational effort gateway.

9. An electronic device:

one or more processors;

a memory having one or more programs stored thereon, which when executed by the one or more processors, cause the one or more processors to implement the method of any of claims 1-8;

one or more I/O interfaces coupled between the processor and the memory configured to enable information interaction of the processor with the memory.

10. A computer readable medium having stored thereon a computer program which, when executed by a processor, implements the method according to any of claims 1-8.