Communication method and device, communication equipment and readable storage medium

Abstract

The invention discloses a communication method and device, communication equipment and a readable storage medium, and belongs to the technical field of communication. The communication method in the embodiment of the invention comprises the following steps: a first network function receives a first demand sent by a second network function; therefore, the first demand (such as a computing power demand or a computing demand) can be notified to the first network function, and then the matched computing power node can be selected to compute the service data, so that the situations of service lagging, jitter and the like are reduced, and the service experience is improved.

Description

TECHNICAL FIELD

[0001] The present application belongs to the technical field of communication, and particularly relates to a communication method and device, a communication equipment and a readable storage medium. BACKGROUND

[0002] With the continuous development of third-party applications, the market of immersive services such as Augmented Reality (AR), Virtual Reality (VR), and Mixed Reality (MR) is rapidly increasing. Immersive services require networks to transmit and process multi-modal data such as audio, video, haptics, and various sensor information, and have strict requirements on network performance indicators such as transmission rate, latency, and reliability, as well as computing power such as processor capability and storage capability. However, at present, due to the limitation of terminal computing power, the user experience of immersive applications is poor, and the immersive experience of users cannot be fully realized. The service is obviously stuttering and jittering. Under such circumstances, how to improve the service experience is a problem that needs to be solved at present. SUMMARY

[0003] The purpose of the embodiments of the present application is to provide a communication method and device, a communication equipment and a readable storage medium to solve the problem of how to improve the service experience.

[0004] In order to solve the above technical problems, the present application is implemented as follows:

[0005] In a first aspect, a communication method is provided, applied to a first network function, comprising:

[0006] The first network function receives a first requirement sent by a second network function.

[0007] In a second aspect, a communication method is provided, applied to a second network function, comprising:

[0008] The second network function sends a first requirement to the first network function.

[0009] In a third aspect, a communication method is provided, applied to a first device, comprising:

[0010] The first device sends a second data packet to the second network function; wherein the second data packet carries a second requirement, and the second requirement includes at least one of the following: a second task number, a calculation type, a calculation precision, and an estimated task duration.

[0011] In a fourth aspect, a communication device is provided, applied to a first network function, comprising:

[0012] A first receiving module is configured to receive a first requirement sent by a second network function.

[0013] In a fifth aspect, a communication apparatus applied to a second network function is provided, comprising:

[0014] A fourth sending module is configured to send the first demand to the first network function.

[0015] In a sixth aspect, a communication apparatus applied to a first device is provided, comprising:

[0016] A seventh sending module is configured to send a second data packet to the second network function, wherein the second data packet carries a second demand, and the second demand comprises at least one of a second task number, a calculation type, a calculation precision, and an estimated task duration.

[0017] In a seventh aspect, a communication device is provided, comprising a processor, a memory, and a program or instructions stored in the memory and executable on the processor, and the program or instructions are executed by the processor to implement the steps of the method according to the first aspect, or the steps of the method according to the second aspect, or the steps of the method according to the third aspect.

[0018] In an eighth aspect, a readable storage medium is provided, and the readable storage medium stores a program or instructions, and the program or instructions are executed by a processor to implement the steps of the method according to the first aspect, or the steps of the method according to the second aspect, or the steps of the method according to the third aspect.

[0019] In a ninth aspect, a computer program product is provided, comprising computer instructions, and the computer instructions are executed by a processor to implement the steps of the method according to the first aspect, or the steps of the method according to the second aspect, or the steps of the method according to the third aspect.

[0020] Through the scheme in the embodiments of the present application, the first demand (such as the computing power demand or the calculation demand) can be notified to the first network function, and then a matched computing power node can be selected to calculate the service data, so as to reduce the service lag, jitter, and the like, and improve the service experience. BRIEF DESCRIPTION OF DRAWINGS

[0021] Figure 1 is a flowchart of a communication method provided by the embodiments of the present application;

[0022] Figure 2 is a flowchart of a process of active registration of computing power resources in the embodiments of the present application;

[0023] Figure 3 is a flowchart of a paging registration process of computing power resources in the embodiments of the present application;

[0024] Figure 4 is a flowchart of a deregistration process of computing power resources in the embodiments of the present application;

[0025] Figure 5 is a flowchart of another communication method provided by an embodiment of the present application;

[0026] Figure 6 is a flowchart of another communication method provided by an embodiment of the present application;

[0027] Figure 7 is a flowchart of a process of carrying along a computing power requirement in an embodiment of the present application;

[0028] Figure 8 is a deployment schematic diagram of a CCF in an embodiment of the present application;

[0029] Figure 9 is a structural schematic diagram of a communication apparatus provided by an embodiment of the present application;

[0030] Figure 10 is a structural schematic diagram of a communication apparatus provided by an embodiment of the present application;

[0031] Figure 11 is a structural schematic diagram of a communication apparatus provided by an embodiment of the present application;

[0032] Figure 12 is a structural schematic diagram of a communication apparatus provided by an embodiment of the present application. DETAILED DESCRIPTION

[0033] The technical solutions in the embodiments of the present application will be described clearly and completely below with reference to the drawings in the embodiments of the present application. Obviously, the described embodiments are only some of the embodiments of the present application, not all the embodiments. Based on the embodiments in the present application, all other embodiments obtained by those skilled in the art without creative work fall within the scope of protection of the present application.

[0034] The terms "first", "second", etc. in the specification and claims of the present application are used to distinguish similar objects, and are not used to describe a specific order or sequence. It should be understood that the data used in this way can be interchanged under appropriate circumstances, so that the embodiments of the present application can be implemented in an order other than those illustrated or described herein, and the objects distinguished by "first", "second", etc. are generally of a kind and do not limit the number of objects, for example, the first object can be one or more. In addition, "and / or" in the specification and claims indicates at least one of the connected objects, and the character " / ", generally indicates that the objects before and after are in an "or" relationship.

[0035] In the embodiments of the present application, the computing power node can be expressed as a computing node, both of which represent the same meaning.

[0036] In the embodiments of the present application, the computing power requirement can be expressed as a computing requirement, both of which represent the same meaning.

[0037] In the embodiments of the present application, the computing power task can be expressed as a computing task, both of which represent the same meaning.

[0038] In the embodiments of the present application, the computing power resource can be expressed as a computing resource, both of which represent the same meaning.

[0039] In the embodiments of the present application, the computing power resource can include mobile computing power resource.

[0040] The communication method, device, communication equipment and readable storage medium provided by the embodiments of the present application will be described in detail below in combination with the drawings, specific embodiments and application scenarios.

[0041] Please refer to Figure 1 , Figure 1 is a flowchart of a communication method provided by the embodiments of the present application, which is applied to a first network function, such as Figure 1 as shown in the figure, the method comprises the following steps:

[0042] Step 11: The first network function receives the first requirement sent by the second network function.

[0043] In the embodiments of the present application, the first requirement can be a computing power requirement or a computing requirement. The computing power requirement can be expressed as a computing requirement, both of which represent the same meaning.

[0044] The first network function can be selected from any of the following: a computing control function (CCF), a session management function (SMF), and a computing network element. In addition, the first network function can also be a combined network function (NF) of the CCF, the SMF and / or the computing network element, or other NFs capable of realizing similar functions, which are not limited in the embodiments.

[0045] The second network function can be selected from any of the following: a user plane function (UPF) and a computing node. In addition, the second network function can also be a combined NF of the UPF and the computing node, or other NFs capable of realizing similar functions, which are not limited in the embodiments.

[0046] Optionally, the first requirement can include but is not limited to at least one of the following:

[0047] The first task number is specifically an internal task number, i.e., a task number used for identifying a computing task within a network, such as an identifier used within a 5GC;

[0048] Terminal location information, which is optionally a tracking area identity (TAI) or a geographic area;

[0049] A computing type, which is optionally but not limited to an accelerated processing unit (APU), a central processing unit (CPU), a data processing unit (DPU), a graphics processing unit (GPU), a neural processing unit (NPU), a tensor processing unit (TPU), or the like;

[0050] Computing precision, which is optionally but not limited to a million instructions per second (MIPS), a Dhrystone MIPS (DMIPS), which represents the relative performance of a CPU when running integer operations (Dhrystone), an operation per second (OPS), a floating point operation per second (FLOPS), or the like;

[0051] An estimated task duration.

[0052] By the scheme in the embodiments of the present application, the first requirement (such as a computing power requirement or a computing requirement) can be notified to the first network function, and then a matched computing power node can be selected to compute service data, thereby reducing service lag, jitter, and the like, and improving service experience.

[0053] Optionally, the communication method can further include:

[0054] The first network function matches the first requirement with registered computing power resources to obtain a first computing power node. The first computing power node can be understood as a computing power node matched to perform a computing task corresponding to the first task number in the first requirement, or a computing power node matched to the computing task corresponding to the first task number in the first requirement. Thus, a suitable computing power node can be selected to perform a computing power task.

[0055] Optionally, the matched information can include at least one of the following:

[0056] a) a computing resource type, such as APU, CPU, DPU, GPU, NPU, TPU, etc.;

[0057] b) a computing resource precision, such as MIPS, DMIPS, OPS, FLOPS, etc.;

[0058] c) a network function identifier NF ID, such as an IP address, a Fully Qualified Domain Name (FQDN), a Global Product and Service Identifier (GPSI), etc.;

[0059] d) location information, such as including location information of the computing node;

[0060] e) terminal location, such as TAI or Geographic Area, etc.;

[0061] f) NF type, such as UPF, Maintenance Endpoint (MEP), Vehicle-to-Everything server (V2X server), Third-party Application (3 rd APP), User Equipment (UE), etc.;

[0062] g) a computing resource available duration, which can also be expressed as an invalidation time.

[0063] That is, when matching the computing node, part or all of the above a) to g) information can be selected for matching to obtain a computing node that meets the demand.

[0064] Optionally, the matching rule can include but is not limited to at least one of the following:

[0065] (1) matching the computing node whose computing resource type is consistent with the calculation type in the first demand, that is, if the computing resource type of a computing node is consistent with the calculation type in the first demand, the computing node is matched; for example, this type-related condition must be met, that is, a computing node whose computing resource type is inconsistent with the calculation type cannot be selected;

[0066] (2) match the computing power resource precision with the computing precision in the first demand, that is, if the computing power resource precision of a computing power node is consistent with the computing precision in the first demand, the computing power node is matched; for example, this precision condition must be met, that is, a computing power node with inconsistent computing power resource precision and computing precision cannot be selected;

[0067] (3) match the computing power resource with the distance of the second network function (such as UPF) within the first value range; the first value can be pre-configured by the operator according to the actual demand;

[0068] (4) preferentially match the computing power node with a shorter distance to the second network function; for example, in the case of the same computing type and computing precision, the computing power node with a shorter distance to the second network function (such as UPF) is preferentially matched;

[0069] (5) consider the computing power node with a distance greater than the second value to the second network function as not meeting the demand; the second value can be pre-configured by the operator according to the actual demand, such as N km or the like; for example, if the distance between the computing power resource of a computing node and the second network function (such as UPF) is greater than N km, the computing node is considered as not meeting the demand;

[0070] (6) when the available duration of a single computing power node cannot meet the estimated task duration in the first demand, divide the computing task into multiple sub-period tasks, and perform secondary matching on the multiple sub-period tasks; for example, if the estimated task duration cannot be matched, the computing task can be divided into M sub-period tasks for secondary matching, and M is an integer greater than 1.

[0071] It should be noted that when matching the computing power node, part or all of the above (1) to (6) can be selected for matching, and the present embodiment does not limit this.

[0072] Optionally, the communication method in the present embodiment can further include at least one of the following:

[0073] The first network function receives a first data packet;

[0074] The first network function parses a first task number carried in the first data packet;

[0075] The first network function forwards the first data packet to the first computing power node according to the first task number.

[0076] For example, the first network function (such as CCF) can receive a first data packet from the UPF; the first data packet can be understood as a service data packet, which carries a first task number (that is, a network internal task number) for identifying a computing task.

[0077] In an optional embodiment, after the first network function (e.g., CCF) matches the first computing power node, if a first data packet is subsequently received and the first task number carried in the first data packet matches the first computing power node, the first data packet can be forwarded to the first computing power node, and the first computing power node can perform the computing task.

[0078] Optionally, the forwarding of the first data packet to the first computing power node can include at least one of the following:

[0079] The first network function decomposes the computing task of the first data packet; for example, the task decomposition can be performed according to the allocated task decomposition manner;

[0080] The first network function forwards the decomposed computing task to the corresponding first computing power node.

[0081] Optionally, after the first data packet is forwarded to the first computing power node, the communication method can further include:

[0082] The first network function receives the computing result of the first data packet sent by the first computing power node;

[0083] The first network function sends the computing result to the second network function and / or the terminal, so that the second network function and / or the terminal can learn the computing result.

[0084] Optionally, after the first data packet is forwarded to the first computing power node, the communication method can further include:

[0085] The first network function receives the notification information sent by the first computing power node, and the notification information is used to notify the completion of the computing of the first data packet, so that the first network function can learn the completed computing task.

[0086] In the embodiments of the present application, the computing power information of the computing power node can be reported through a registration process. The communication method can further include at least one of the following:

[0087] The first network function receives a registration request sent by the computing power node; wherein the registration request is used to request the registration of the computing power resource of the computing power node, and / or the registration request includes the computing power information of the computing power node;

[0088] The first network function stores the computing power information of the computing power node.

[0089] In this way, the computing power information of the computing power node can be actively reported to the first network function (e.g., CCF, SMF, etc.) through the registration process.

[0090] Optionally, the computing power information of the computing power node includes at least one of the following:

[0091] Type of computing power node, such as UPF, MEP, V2X server, 3 rd APP, UE, etc.

[0092] Identity of computing power node, such as IP address, FQDN, GPSI, etc.

[0093] Location information of computing power node, such as TAI or Geographic Area, etc.

[0094] Type of computing power resource of computing power node, such as APU, CPU, DPU, GPU, NPU, TPU, etc.

[0095] Precision of computing power resource of computing power node, such as MIPS, DMIPS, OPS, FLOPS, etc.

[0096] Available duration or invalidation time of computing power resource of computing power node.

[0097] Optionally, the registration process can be triggered by inquiry. The communication method can further include:

[0098] The first network function sends an inquiry request to the computing power node, and the inquiry request is used to inquire whether the computing power node needs to report computing power resources. Thus, when the computing power node needs to report computing power resources, the computing power node can timely report its own computing power resources.

[0099] Optionally, the process of receiving the registration request sent by the computing power node can include: the first network function receives the registration request sent by the computing power node when the computing power node needs to report computing power resources.

[0100] Optionally, the communication method can further include:

[0101] The first network function receives a deregistration request sent by the computing power node, and the deregistration request is used to request to deregister the computing power resources of the computing power node.

[0102] Optionally, after receiving the deregistration request, the communication method can further include:

[0103] The first network function detects whether there is a computing service on the computing power resources of the computing power node, and performs any of the following:

[0104] (A) When there is no computing service on the computing power resources of the computing power node, delete the computing power information of the computing power node;

[0105] (B) When there is a computing service on the computing power resources of the computing power node, and the service can end before the latest invalidation time of the computing power resources, delete the computing power information of the computing power node after the service ends.

[0106] (C) When the computing power resource of the computing power node has a service being computed, but the service cannot be ended before the latest invalid time of the computing power resource, the service is migrated to other computing power nodes, and the computing power information of the computing power node is deleted.

[0107] Optionally, the deregistration request can include at least one of the following:

[0108] The type of the computing power node, such as UPF, MEP, V2X server, 3 rd APP, UE, etc.

[0109] The identifier of the computing power node, such as IP address, FQDN, GPSI, etc.

[0110] The location information of the computing power node, such as TAI or Geographic Area, etc.

[0111] The type of the computing power resource of the computing power node, such as APU, CPU, DPU, GPU, NPU, TPU, etc.

[0112] The precision of the computing power resource of the computing power node, such as MIPS, DMIPS, OPS, FLOPS, etc.

[0113] The available duration or invalid time of the computing power resource of the computing power node.

[0114] The latest invalid time of the computing power resource of the computing power node.

[0115] The following will be combined Figures 2 to 4 to explain the registration and deregistration process in the present application.

[0116] Please refer to Figure 2 , Figure 2 is the active registration process of the computing power resource in the embodiments of the present application, which can include the following steps:

[0117] Step 21: When there is available computing power on the computing power node (such as UPF, MEP, V2X server, 3rd APP, UE, etc.) of the computing power network, the computing power node actively sends a computing power registration request to the CCF, which can carry at least one of the following information of the node: NF type (such as UPF, MEP, V2X server, 3rd APP, UE, etc.), NF ID (such as IP address, FQDN, GPSI, etc.), location information (such as TAI or Geographic Area, etc.), computing power resource type (such as APU, CPU, DPU, GPU, NPU, TPU, etc.), computing power resource precision (such as MIPS, DMIPS, OPS, FLOPS, etc.), and computing power resource available duration (or invalid time).

[0118] Step 22: The CCF stores the computing power information of the computing power node locally.

[0119] Step 23: The CCF returns a registration response to the computing power node to notify the computing power node that the registration of the computing power resource is successful.

[0120] Please refer to Figure 3 , Figure 3 is the paging registration process of the computing power resource in the embodiment of the present application, which can include the following steps:

[0121] Step 31: If the computing power control node (such as CCF) finds (for example, through other computing or resource distribution processes) that a computing power node with computing power resources in the network does not register computing power to itself, or the valid time of the previously reported computing power resources expires, it can initiate an active inquiry request (request) to inquire whether the other party needs to (continue to) report computing power resources.

[0122] Step 32: If the computing power node judges that there is computing power resource available for reporting, it sends a computing power registration request to the CCF, which can carry at least one of the following information of the node: NF type (such as UPF, MEP, V2X server, 3rd APP, UE, etc.), NF ID (such as IP address, FQDN, GPSI, etc.), location information (such as TAI or Geographic Area, etc.), computing power resource type (such as APU, CPU, DPU, GPU, NPU, TPU, etc.), computing power resource precision (such as MIPS, DMIPS, OPS, FLOPS, etc.), and computing power resource available duration (or invalid time).

[0123] If the computing power node judges that there is no computing power resource available for reporting, it does not initiate the registration process.

[0124] Step 33: The CCF stores the computing power information of the computing power node locally.

[0125] Step 34: The CCF returns a registration response to the computing power node to inform the computing power node that the registration of the computing power resource is successful.

[0126] Please refer to Figure 4 , Figure 4 is a de-registration process of the computing power resource in the embodiments of the present application, which can include the following steps:

[0127] Step 41: When the computing power on the computing power node (such as UPF, MEP, V2X server, 3rd APP, UE, etc.) of the mobile computing power network fails before the expected failure time, the computing power node actively sends a computing power de-registration request to the computing power control node (such as CCF), which can carry at least one of the following of the node: NF type (such as UPF, MEP, V2X server, 3rd APP, UE, etc.), NF ID (such as IP address, FQDN, GPSI, etc.), location information (such as TAI or Geographic Area, etc.), computing power resource type (such as APU, CPU, DPU, GPU, NPU, TPU, etc.), computing power resource precision (such as MIPS, DMIPS, OPS, FLOPS, etc.), computing power resource available duration (or failure time), and latest failure time of the computing power resource (much smaller than the original failure time).

[0128] Step 42: After receiving the de-registration request, the CCF checks whether there is a computing service on the computing power resource, and whether the related service can end before the latest failure time; if so, wait for the service to end and delete the local computing power resource information; if not, migrate the computing power service to other suitable computing power nodes, and delete the local computing power resource information after all computing power services end.

[0129] Step 43: The CCF returns a de-registration response to the computing power node to inform the computing power node that the de-registration of the computing power resource is successful.

[0130] Please refer to Figure 5 , Figure 5 is a flowchart of a communication method provided in the embodiments of the present application, which is applied to a second network function, such as Figure 5 As shown in the figure, the method includes the following steps:

[0131] Step 51: The second network function sends a first demand to a first network function.

[0132] In the embodiments of the present application, the first demand can be a computing power demand or a computing demand. The computing power demand can be expressed as the computing demand, and both represent the same meaning.

[0133] The first network function can be any one of the following: a computing power control function (CCF), a session management function (SMF), and a computing power network element. In addition, the first network function can also be a combined network function (NF) of the CCF, the SMF, and / or the computing power network element, or other NFs capable of implementing similar functions, which are not limited in the embodiments.

[0134] The second network function can be any one of the following: a user plane function (UPF) and a computing power node. In addition, the second network function can also be a combined NF of the UPF and the computing power node, or other NFs capable of implementing similar functions, which are not limited in the embodiments.

[0135] Optionally, the first requirement is a requirement of first service and / or first data for a computing task, or the first requirement is a requirement of first service and / or first data for a computing power task. The first service can be an immersive service such as AR, VR, and MR. The first data can be immersive service data such as AR, VR, and MR.

[0136] Optionally, the first requirement is used to match with the registered computing power resources. The information and rules of the specific matching can be referred to the above-mentioned embodiments, which are not described herein again.

[0137] Optionally, the first requirement can include but is not limited to at least one of the following:

[0138] A first task number, which is specifically an internal task number, i.e., a task number used to identify a computing task in the network;

[0139] Terminal location information, which can be TAI or Geographic Area, etc.

[0140] A computing type, which can be but is not limited to APU, CPU, DPU, GPU, NPU, TPU, etc.

[0141] Computing precision, which can be but is not limited to MIPS, DMIPS, OPS, FLOPS, etc.

[0142] Estimated task duration.

[0143] Through the scheme in the embodiments of the present application, the first requirement (such as computing power requirement or computing requirement) can be notified to the first network function, and then a matched computing power node can be selected to compute service data, thereby reducing service lag, jitter, and the like, and improving service experience.

[0144] Optionally, the communication method can further include at least one of the following:

[0145] The second network function receives the second data packet sent by the first device, such as an application server (AS) or the like;

[0146] The second network function extracts the second requirement from the second data packet.

[0147] The second network function maps the second task number included in the second requirement to the first task number. For example, the second task number can be randomly mapped to the first task number, and no limitation is made in this regard.

[0148] It should be noted that the first task number is specifically an internal task number, that is, a task number used to identify a computing task within the network, such as an identifier used within the 5GC. The second task number is specifically an external task number, such as an identifier used between the AS, the UE, and the 5GC to identify a task. Since the external task number can be repeated, the mapping of the second task number to the first task number can prevent the repetition of the task number between different AFs. In addition, by virtue of the mapping of the second task number to the first task number, since the first task number is an internal task number of the network, external attacks can be prevented, and security can be improved.

[0149] Optionally, in addition to the second task number, the second requirement can also include at least one of the following:

[0150] The computing type, which can be but is not limited to APU, CPU, DPU, GPU, NPU, TPU, or the like;

[0151] The computing precision, which can be but is not limited to MIPS, DMIPS, OPS, FLOPS, or the like;

[0152] The estimated task duration.

[0153] Optionally, the manner of mapping the second task number included in the second requirement to the first task number can include that the second network function maps the superimposed information of the second task number and a first identifier to the first task number. The first identifier is an application function identifier, and the application function identifier is used for the first device and / or the terminal and / or the second network function. Since the external task number (i.e., the second task number) can be repeated, and the application function identifier is usually a unique identifier, mapping the superimposed information of the second task number and the first identifier to the first task number can prevent the occurrence of confusion.

[0154] Optionally, the communication method can further include:

[0155] The second network function establishes an association relationship between the first task number and the second task number and at least one of the following: a terminal address, an address of the first device, a terminal location;

[0156] The second network function stores the association relationship.

[0157] In this way, by means of the established / stored association relationship, the terminal address, the address of the first device and / or the terminal position can be associated with the corresponding task, thereby improving the accuracy of task execution.

[0158] Optionally, the communication method can further include at least one of the following:

[0159] The second network function receives the third data packet sent by the first device, such as an application server (AS) or the like;

[0160] The second network function replaces the second task number carried in the third data packet with the corresponding first task number to obtain the first data packet;

[0161] The second network function sends the first data packet carrying the first task number to the first network function, so that the first network function forwards the first data packet to the corresponding computing power node according to the first task number to execute the computing task.

[0162] Optionally, the communication method can further include at least one of the following:

[0163] The second network function receives the computing result of the first data packet sent by the first network function, so as to notify the terminal of the computing result of the service data;

[0164] The second network function sends the computing result of the first data packet to the terminal, so that the terminal learns the computing result of the service data.

[0165] Please refer to Figure 6 , Figure 6 is a flowchart of a communication method provided by the embodiments of the present application, which is applied to a first device, such as an AS or the like. As shown in Figure 6 the method includes the following steps:

[0166] Step 61: The first device sends a second data packet to a second network function; the second data packet carries a second requirement, and the second requirement includes at least one of the following: a second task number, a computing type, a computing precision, and an estimated task duration.

[0167] In the embodiments of the present application, the second network function can be any one of the following: a user plane function (UPF) and a computing power node. In addition, the second network function can also be a combined NF of the UPF and the computing power node, or other NFs capable of achieving similar functions, which are not limited in the embodiments.

[0168] The second requirement is a requirement of the first service and / or the first data on a computing task, or the second requirement is a requirement of the first service and / or the first data on a computing power task. The first service can be an immersive service such as AR, VR, MR, etc. The first data can be immersive service data such as AR, VR, MR, etc.

[0169] Optionally, the second task number is specifically an external task number, such as an identification number used between an AS, a UE and a 5GC for identifying a task. The computing type can be, but is not limited to, APU, CPU, DPU, GPU, NPU, TPU, etc. The computing precision can be, but is not limited to, MIPS, DMIPS, OPS, FLOPS, etc.

[0170] Through the scheme in the embodiments of the present application, the first device can deliver the related computing / computing power requirement to the network along with the data packet, so that the network selects a matched computing power node to compute the service data, thereby reducing service lag, jitter and the like, and improving service experience.

[0171] See Figure 7 The on-the-fly carrying process of the computing power requirement in the specific embodiments of the present application can include:

[0172] Step 1: The UE and a third-party server AS start a service with large computing demand such as XR, the AS carries the computing power requirement (i.e., the second requirement) along with the packet header of the first one or the first N data packets before a large number of computing packets start, and delivers the first one or the first N data packets to the UPF. The packet header is marked (flag) to indicate that it contains the computing power requirement (such as the second task number, the computing type, the computing precision, and the estimated task duration).

[0173] Step 2: After receiving the downlink data packet, the UPF parses the packet header to learn that it contains the computing power requirement, then performs DPI and extracts the computing power requirement (i.e., the second requirement), wherein the computing power requirement can include at least one of the following: the second task number (external task number), the computing type (such as APU, CPU, DPU, GPU, NPU, TPU, etc.), the computing precision (such as MIPS, DMIPS, OPS, FLOPS, etc.), and the estimated task duration.

[0174] Optionally, the UPF can map the second task number to the first task number (internal task number), such as using the superimposed information of the second task number + AF ID to map to the first task number (internal task number), and establish an association relationship between the first / second task number and the UE IP address, the AS IP address, and the UE location, and record the association relationship locally for use.

[0175] Step 3: The UPF forwards the computing power requirement (i.e., the first requirement) to the CCF through a data packet, wherein at least one of the following is carried: a first task number (an internal task number), a computing type (such as APU, CPU, DPU, GPU, NPU, TPU, etc.), a computing precision (such as MIPS, DMIPS, OPS, FLOPS, etc.), and an estimated task duration.

[0176] Step 4: After receiving the computing power requirement (i.e., the first requirement), the CCF performs matching based on the locally registered computing power resources and the computing power requirement reported by the UPF. The specific matching rules can be referred to in the above embodiments, which will not be described here.

[0177] Optionally, the CCF sends a computing power resource matching success response to the UPF after matching. If the CCF cannot match suitable computing resources, it returns a computing power resource matching failure message to the UPF.

[0178] Optionally, if the UPF receives a failure response, it sends the computing power requirement (i.e., the first requirement) to another CCF to request resource matching, repeating steps 3-4.

[0179] Step 5: The AS sends a task / service data packet to the UPF, and the packet header carries the second task number (an external task number) included in the above computing power requirement (i.e., the second requirement).

[0180] Step 6: After receiving the task data packet, the UPF analyzes and finds that the second task number agreed upon is carried in the packet header, then replaces the second task number with the corresponding first task number (an internal task number), and forwards the data packet carrying the first task number (an internal task number) to the CCF.

[0181] Step 7: The CCF receives the data packet, analyzes the first task number (an internal task number) carried in the packet header, and forwards the data packet to the computing power node matched in step 4, i.e., performs computing task distribution.

[0182] After the above step 7, the following two cases can exist:

[0183] Case A:

[0184] Step 8a: The computing power node performs computation after receiving the data packet, and feeds back the large data packet, i.e., the computing result, to the CCF.

[0185] Step 9a: The CCF forwards the computing result to the UPF after receiving it.

[0186] Step 10a: The UPF forwards the computing result to the UE after receiving it.

[0187] Case B:

[0188] Step 8b: If the UE IP address is carried when the computing power task is sent in step 7, the computing node can forward the calculation result to the target UE according to the UE IP address after receiving the task data packet and calculating.

[0189] Step 9b: The computing node sends notification information to the CCF to notify the CCF of the completion of calculation.

[0190] Step 10b: The CCF notifies the UPF of the completion of calculation.

[0191] In an optional embodiment, the location of the CCF in the core network can be seen from Figure 8 , but the present embodiment is not limited thereto, and the CCF can be deployed based on actual needs.

[0192] It should be noted that the communication method provided in the embodiments of the present application can be executed by a communication device or a control module in the communication device for executing the communication method. In the embodiments of the present application, the communication device executes the communication method as an example to illustrate the communication device provided in the embodiments of the present application.

[0193] Please refer to Figure 9 , Figure 9 is a structural schematic diagram of a communication device provided in the embodiments of the present application. The device is applied to a first network function, which can be a CCF, an SMF, a computing power network element, etc. As shown in Figure 9 , the communication device 90 comprises:

[0194] The first receiving module 91 is configured to receive a first demand sent by a second network function.

[0195] Optionally, the communication device 90 further comprises:

[0196] The matching module is configured to match the first demand with registered computing power resources to obtain a first computing power node.

[0197] Optionally, the first demand is a computing power demand or a calculation demand.

[0198] Optionally, the communication device 90 further comprises at least one of the following:

[0199] The second receiving module is configured to receive a first data packet.

[0200] The analysis module is configured to analyze a first task number carried in the first data packet.

[0201] The first sending module is configured to forward the first data packet to the first computing power node according to the first task number.

[0202] Optionally, the first sending module is specifically configured to perform at least one of the following:

[0203] decompose the computing task of the first data packet;

[0204] forward the decomposed computing task to a corresponding first computing power node.

[0205] Optionally, the matched rule comprises at least one of:

[0206] matching a computing power node whose computing power resource type is consistent with the computing type in the first demand;

[0207] matching a computing power node whose computing power resource precision is consistent with the computing precision in the first demand;

[0208] matching a computing power node whose distance to the second network function is within a first value range;

[0209] preferentially matching a computing power node which is closer to the second network function;

[0210] regarding a computing power node whose distance to the second network function is greater than a second value as not satisfying the demand;

[0211] when the available duration of a single computing power node cannot satisfy the estimated task duration in the first demand, dividing the computing task into multiple sub-period tasks, and performing secondary matching on the multiple sub-period tasks.

[0212] Optionally, the matched information comprises at least one of:

[0213] computing power resource type;

[0214] computing power resource precision;

[0215] network function identifier NF ID;

[0216] location information;

[0217] terminal location;

[0218] network function NF type;

[0219] computing power resource available duration.

[0220] Optionally, the first demand comprises at least one of:

[0221] first task number, terminal location information, computing type, computing precision, estimated task duration.

[0222] Optionally, the communication device 90 further comprises at least one of:

[0223] The third receiving module is configured to receive a registration request sent by the computing power node, wherein the registration request is used to request registration of the computing power resource of the computing power node, and / or the registration request comprises the computing power information of the computing power node.

[0224] The storage module is configured to store the computing power information of the computing power node.

[0225] Optionally, the computing power information of the computing power node comprises at least one of the following:

[0226] The type of the computing power node;

[0227] The identifier of the computing power node;

[0228] The location information of the computing power node;

[0229] The type of the computing power resource of the computing power node;

[0230] The accuracy of the computing power resource of the computing power node;

[0231] The available duration or invalidation time of the computing power resource of the computing power node.

[0232] Optionally, the communication device 90 further comprises:

[0233] The second sending module is configured to send an inquiry request to the computing power node, wherein the inquiry request is used to inquire whether the computing power node needs to report the computing power resource.

[0234] Optionally, the third receiving module is specifically configured to receive the registration request sent by the computing power node when the computing power resource needs to be reported.

[0235] Optionally, the communication device 90 further comprises:

[0236] The fourth receiving module is configured to receive a deregistration request sent by the computing power node, wherein the deregistration request is used to request deregistration of the computing power resource of the computing power node.

[0237] Optionally, the communication device 90 further comprises:

[0238] The execution module is configured to detect whether there is a computing service on the computing power resource of the computing power node, and perform any one of the following:

[0239] When there is no computing service on the computing power resource of the computing power node, delete the computing power information of the computing power node;

[0240] When there is a computing service on the computing power resource of the computing power node, and the computing service can be ended before the latest invalidation time of the computing power resource, delete the computing power information of the computing power node after the computing service is ended;

[0241] When there is a service being calculated on the computing power resource of the computing power node, but the service cannot be ended before the latest invalid time of the computing power resource, the service is migrated to other computing power nodes, and the computing power information of the computing power node is deleted.

[0242] Optionally, the deregistration request comprises at least one of the following:

[0243] The type of the computing power node;

[0244] The identifier of the computing power node;

[0245] The location information of the computing power node;

[0246] The type of the computing power resource of the computing power node;

[0247] The precision of the computing power resource of the computing power node;

[0248] The available duration or invalid time of the computing power resource of the computing power node;

[0249] The latest invalid time of the computing power resource of the computing power node.

[0250] Optionally, the communication device 90 further comprises:

[0251] The fifth receiving module is configured to receive the calculation result of the first data packet sent by the first computing power node;

[0252] The third sending module is configured to send the calculation result to the second network function and / or terminal.

[0253] Optionally, the method further comprises:

[0254] The sixth receiving module is configured to receive the notification information sent by the first computing power node, and the notification information is used to notify the completion of the calculation of the first data packet.

[0255] Optionally, the first network function is any one of the following: computing power control function (CCF), session management function (SMF), and computing power network element.

[0256] And / or, the second network function is any one of the following: user plane function (UPF) and computing power node.

[0257] The communication device 90 of the embodiments of the present application can implement each process of the method embodiments shown in the above Figure 1 , and can achieve the same technical effects. To avoid repetition, it will not be described here.

[0258] Please refer to Figure 10 , Figure 10Figure 1 is a structural schematic diagram of a communication device provided by an embodiment of the present application, the device being applied to a second network function, which can be a UPF, a computing node, etc. Figure 10 As shown in Figure 1, the communication device 100 comprises:

[0259] A fourth sending module 101, configured to send a first demand to a first network function.

[0260] Optionally, the first demand is a demand of a first service and / or first data for a computing task, or the first demand is a demand of the first service and / or first data for a computing task.

[0261] Optionally, the first demand is used for matching with a registered computing resource.

[0262] Optionally, the communication device 100 further comprises at least one of the following:

[0263] A seventh receiving module, configured to receive a second data packet sent by a first device;

[0264] An extracting module, configured to extract a second demand from the second data packet;

[0265] A mapping module, configured to map a second task number included in the second demand into a first task number.

[0266] Optionally, the first task number is an internal task number.

[0267] Optionally, the second task number is an external task number.

[0268] Optionally, the mapping module is specifically configured to map the second task number and superimposed information of a first identifier into the first task number; the first identifier is an application function identifier, and the application function identifier is used for the first device and / or a terminal and / or the second network function.

[0269] Optionally, the communication device 100 further comprises:

[0270] An establishing module, configured to establish an association relationship between the first task number and the second task number and at least one of the following: a terminal address, an address of the first device, a terminal location.

[0271] A storage module, configured to store the association relationship.

[0272] Optionally, the second demand further comprises at least one of the following:

[0273] A computing type, a computing precision, and an estimated task duration.

[0274] Optionally, the first demand comprises at least one of the following:

[0275] The first task number, the terminal position information, the calculation type, the calculation precision, and the estimated task duration.

[0276] Optionally, the communication apparatus 100 further comprises at least one of the following:

[0277] The eighth receiving module is configured to receive a third data packet sent by the first device.

[0278] The replacing module is configured to replace the second task number carried in the third data packet with the corresponding first task number to obtain a first data packet.

[0279] The fifth sending module is configured to send the first data packet carrying the first task number to the first network function.

[0280] Optionally, the communication apparatus 100 further comprises at least one of the following:

[0281] The ninth receiving module is configured to receive a calculation result of the first data packet sent by the first network function.

[0282] The sixth sending module is configured to send the calculation result of the first data packet to the terminal.

[0283] The communication apparatus 100 of the embodiments of the present application can implement each process of the method embodiments shown in the above Figure 5 and achieve the same technical effects. To avoid repetition, details are not described herein.

[0284] Please refer to Figure 11 , Figure 11 is a structural schematic diagram of a communication apparatus provided by the embodiments of the present application. The apparatus is applied to a first device, such as an AS, etc., as shown in Figure 11 , the communication apparatus 110 comprises:

[0285] The seventh sending module 111 is configured to send a second data packet to a second network function. The second data packet carries a second requirement, and the second requirement comprises at least one of the following: a second task number, a calculation type, a calculation precision, and an estimated task duration.

[0286] The communication apparatus 110 of the embodiments of the present application can implement each process of the method embodiments shown in the above Figure 6 and achieve the same technical effects. To avoid repetition, details are not described herein.

[0287] Optionally, as shown in Figure 12 , the embodiments of the present application further provide a communication device 120, which comprises a processor 121, a memory 122, a program or instruction stored in the memory 122 and executable on the processor 121. For example, when the communication device 120 is a first network function, the program or instruction is executed by the processor 121 to implement the aboveFigure 1 The various processes of the communication method embodiments shown can achieve the same technical effects. Alternatively, when the communication device 120 is the second network function, the program or instruction is executed by the processor 121 to achieve the above-mentioned Figure 5 The various processes of the communication method embodiments shown can achieve the same technical effects. Alternatively, when the communication device 120 is the first device, the program or instruction is executed by the processor 121 to achieve the above-mentioned Figure 6 The various processes of the communication method embodiments shown can achieve the same technical effects. For the sake of brevity, the same will not be repeated here.

[0288] The embodiments of the present application also provide a computer program product, including computer instructions, which, when executed by a processor, can achieve the various processes of the above-mentioned communication method embodiments and achieve the same technical effects. For the sake of brevity, the same will not be repeated here.

[0289] The embodiments of the present application also provide a readable storage medium, which stores a program or instruction, which, when executed by a processor, can achieve the various processes of the above-mentioned communication method embodiments and achieve the same technical effects. For the sake of brevity, the same will not be repeated here.

[0290] Computer readable media includes permanent and non-permanent, removable and non-removable media, which can be implemented by any method or technology to store information. Information can be computer readable instructions, data structures, program modules or other data. Examples of computer storage media include, but are not limited to, phase change memory (PRAM), static random access memory (SRAM), dynamic random access memory (DRAM), other types of random access memory (RAM), read only memory (ROM), electrically erasable programmable read only memory (EEPROM), flash memory or other memory technology, compact disc read only memory (CD-ROM), digital versatile disc (DVD) or other optical storage, magnetic cassette, magnetic tape disk storage or other magnetic storage device, or any other non-transmission medium that can be used to store information accessible by a computing device. According to the definition in this paper, computer readable media does not include transitory computer readable media, such as modulated data signals and carriers.

[0291] It should be noted that, in the present document, the terms "comprises / comprising" or any other variations 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 can also include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element preceded by "comprises... a" does not, without more constraints, foreclose the existence of additional identical elements in the process, method, article, or apparatus that comprises the recited element.

[0292] The above-mentioned sequence numbers of the embodiments of the present application are only for description, and do not represent advantages or disadvantages of the embodiments.

[0293] Through the above description of the embodiments, those skilled in the art can clearly understand that the above-mentioned embodiment methods can be realized by means of software and necessary general hardware platforms, of course, they can also be realized by hardware, but in many cases, the former is a better embodiment. Based on such understanding, the technical solutions of the present application can be embodied in the form of a software product in essence or in the form of a contribution to the prior art. The computer software product is stored in a storage medium (such as a ROM / RAM, a magnetic disk, or an optical disk), and includes a plurality of instructions for causing a service classification device (which can be a mobile phone, a computer, a server, an air conditioner, or a network device, etc.) to execute the methods described in the various embodiments of the present application.

[0294] The above-mentioned is only the preferred embodiment of the present application, and it should be pointed out that, for those skilled in the art, without departing from the principles of the present application, a number of improvements and refinements can be made, and these improvements and refinements should also be regarded as the protection scope of the present application.

Claims

1. A communication method characterized by comprising: The method comprises the following steps: A first network function receives a first requirement sent by a second network function.

2. The method of claim 1, wherein, The method further comprises the following steps: The first network function matches the first requirement with registered computing resource to obtain a first computing node.

3. The method according to claim 1 or 2, characterized in that, The first requirement is a computing resource requirement or a computing requirement.

4. The method according to claim 1 or 2, characterized in that, The method further comprises at least one of the following steps: The first network function receives a first data packet; The first network function parses a first task number carried in the first data packet; The first network function forwards the first data packet to the first computing node according to the first task number.

5. The method of claim 4, wherein, The forwarding of the first data packet to the first computing node comprises at least one of the following steps: The first network function decomposes a computing task of the first data packet; The first network function forwards the decomposed computing task to a corresponding first computing node.

6. The method of claim 2, wherein, The matching rule comprises at least one of the following: Matching a computing node whose computing resource type is consistent with the computing type in the first requirement; Matching a computing node whose computing resource precision is consistent with the computing precision in the first requirement; Matching a computing node whose distance from the second network function is within a first value range; Prior matching a computing node which is closer to the second network function; Considering a computing node whose distance from the second network function is greater than a second value as not meeting the requirement; When the available duration of a single computing node cannot meet the estimated task duration in the first requirement, dividing the computing task into multiple sub-period tasks and performing secondary matching on the multiple sub-period tasks.

7. The method of claim 2, wherein, The matching information comprises at least one of the following: Computing resource type; Computing resource precision; Network function identifier (NF ID); Location information; Terminal location; Network function (NF) type; Computing resource available duration.

8. The method of claim 1, wherein, The first requirement comprises at least one of the following: First task number, terminal location information, computing type, computing precision, estimated task duration.

9. The method of claim 1, wherein, The method further comprises at least one of the following steps: The first network function receives a registration request sent by a computing node; the registration request is used to request registration of the computing resource of the computing node, and / or the registration request contains computing information of the computing node; The first network function stores the computing information of the computing node.

10. The method of claim 9, wherein, The computing information of the computing node comprises at least one of the following: Type of the computing node; Identifier of the computing node; Location information of the computing node; Computing resource type of the computing node; Computing resource precision of the computing node; Available duration or invalid time of the computing resource of the computing node.

11. The method of claim 9, wherein, The method further comprises the following steps: The first network function sends an inquiry request to the computing node, and the inquiry request is used to inquire whether the computing node needs to report the computing resource.

12. The method of claim 11, wherein, The first network function receives the registration request sent by the computing node, comprising: The first network function receives the registration request sent by the computing node when the computing node needs to report the computing resource.

13. The method of claim 1, wherein, The method further comprises the following steps: The first network function receives a deregistration request sent by a computing node, and the deregistration request is used to request deregistration of the computing resource of the computing node.

14. The method of claim 13, wherein, The method further comprises the following steps: The first network function detects whether there is a service being calculated on the computing power resource of the computing power node, and performs any one of the following: When there is no service being calculated on the computing power resource of the computing power node, deleting the computing power information of the computing power node; When there is a service being calculated on the computing power resource of the computing power node, and the service can end before the latest expiration time of the computing power resource, deleting the computing power information of the computing power node after the service ends; When there is a service being calculated on the computing power resource of the computing power node, but the service cannot end before the latest expiration time of the computing power resource, migrating the service to other computing power nodes, and deleting the computing power information of the computing power node.

15. The method of claim 13, wherein, The deregistration request includes at least one of the following: The type of the computing power node; The identifier of the computing power node; The location information of the computing power node; The type of the computing power resource of the computing power node; The accuracy of the computing power resource of the computing power node; The available duration or expiration time of the computing power resource of the computing power node; The latest expiration time of the computing power resource of the computing power node.

16. The method of claim 4, wherein, The method further includes: The first network function receives the calculation result of the first data packet sent by the first computing power node; The first network function sends the calculation result to the second network function and / or the terminal.

17. The method of claim 4, wherein, The method further includes: The first network function receives the notification information sent by the first computing power node, and the notification information is used to notify the completion of the calculation of the first data packet.

18. The method of claim 1, wherein, The first network function is any one of the following: computing power control function (CCF), session management function (SMF), and computing power network element; And / or, The second network function is any one of the following: user plane function (UPF) and computing power node.

19. A method of communication, comprising: It includes: The second network function sends a first demand to the first network function.

20. The method of claim 19, wherein, The first demand is the demand of a first service and / or first data for a computing task, or the first demand is the demand of a first service and / or first data for a computing power task; And / or, the first demand is used to match with the registered computing power resource.

21. The method according to claim 19 or 20, characterized in that, The method further includes at least one of the following: The second network function receives a second data packet sent by a first device; The second network function extracts a second demand from the second data packet; The second network function maps a second task number included in the second demand to a first task number.

22. The method of claim 21, wherein: The first task number is an internal task number; And / or, The second task number is an external task number.

23. The method of claim 21, wherein, The second network function maps the second task number included in the second demand to the first task number, comprising: The second network function maps the second task number and the superposition information of the first identifier to the first task number; the first identifier is an application function identifier, and the application function identifier is used for the first device and / or terminal and / or the second network function.

24. The method of claim 21, wherein, The method further includes: The second network function establishes an association relationship between the first task number and the second task number and at least one of the following: terminal address, address of the first device, and terminal location; The second network function stores the association relationship.

25. The method of claim 21, wherein, The second requirement further includes at least one of: a calculation type, a calculation precision, and an estimated task duration.

26. The method of claim 19, wherein, The first requirement includes at least one of: a first task number, terminal location information, a calculation type, a calculation precision, and an estimated task duration.

27. The method of claim 19, wherein, The method further includes at least one of: The second network function receives a third data packet sent by a first device; The second network function replaces a second task number carried in the third data packet with a corresponding first task number to obtain a first data packet; The second network function sends the first data packet carrying the first task number to the first network function.

28. The method of claim 19, wherein, The method further includes at least one of: The second network function receives a calculation result of the first data packet sent by the first network function; The second network function sends the calculation result of the first data packet to a terminal.

29. A method of communication, comprising: Comprising: The first device sends a second data packet to the second network function; wherein the second data packet carries a second requirement, and the second requirement includes at least one of: a second task number, a calculation type, a calculation precision, and an estimated task duration.

30. A communications device, characterized by Comprising: The first receiving module is configured to receive a first requirement sent by the second network function.

31. A communications device, characterized by Comprising: The fourth sending module is configured to send the first requirement to the first network function.

32. A communications device, characterized by Comprising: The seventh sending module is configured to send a second data packet to the second network function; wherein the second data packet carries a second requirement, and the second requirement includes at least one of: a second task number, a calculation type, a calculation precision, and an estimated task duration.

33. A communications device, characterized by The processor, the memory, and the program or the instructions stored in the memory and executable on the processor are included, and the program or the instructions are executed by the processor to implement the steps of the method according to any one of claims 1 to 18, or the steps of the method according to any one of claims 19 to 28, or the steps of the method according to claim 29.

34. A readable storage medium, characterized by The readable storage medium stores the program or the instructions, and the program or the instructions are executed by the processor to implement the steps of the method according to any one of claims 1 to 18, or the steps of the method according to any one of claims 19 to 28, or the steps of the method according to claim 29.

35. A computer program product, characterised in that, The computer instructions are executed by the processor to implement the steps of the method according to any one of claims 1 to 18, or the steps of the method according to any one of claims 19 to 28, or the steps of the method according to claim 29.

Images