Online computing method and device, equipment, storage medium and program product
By generating network tags and forwarding rules, the problem of reduced resource utilization and business experience caused by the additional computing power required for identification and classification in network computing is solved, achieving more efficient traffic processing.
Patent Information
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2026-01-15
- Publication Date
- 2026-04-21
AI Technical Summary
In network computing, existing technologies require additional computing power to identify and classify traffic, leading to a decline in resource utilization and business experience.
By parsing computing power offloading requests and combining service indicator information of each node, computing network tags and forwarding rules are generated. The tag control function is used to transmit these rules between routing nodes and computing power nodes, simplifying traffic identification and classification strategies.
It improves resource utilization and business experience by dynamically parsing user requests and generating network tags, simplifying the traffic identification and classification process.
Smart Images
Figure CN121907760A_ABST
Abstract
Description
Technical Field
[0001] This disclosure relates to the field of telecommunications technology, and in particular to an online computing method, apparatus, device, storage medium, and program product. Background Technology
[0002] When a mobile network has excess on-network computing power, terminals or servers can request to offload some of their computing needs to the network to simplify their implementation and improve user experience. Thus, when a user accesses a service, the network, in addition to transmitting traffic, also needs to perform business logic calculations during traffic transmission; this is called "on-network computing." "On-network computing" can be pre-selected by the network management orchestrator based on computing needs, selecting computing nodes, setting paths, and issuing execution policies. These execution policies require traffic identification and classification.
[0003] In related technologies, deep packet inspection is used to identify and classify traffic. However, implementing deep packet inspection at the execution node requires additional computing power, which not only affects response time but also consumes computing resources, leading to a decline in resource utilization and business experience.
[0004] It should be noted that the information disclosed in the background section above is only used to enhance the understanding of the background of this disclosure, and therefore may include information that does not constitute prior art known to those skilled in the art. Summary of the Invention
[0005] This disclosure provides an online computing method, apparatus, device, storage medium, and program product that at least to some extent overcomes the problem of reduced resource utilization and service experience caused by the need for additional computing power to identify and classify traffic in related technologies.
[0006] Other features and advantages of this disclosure will become apparent from the following detailed description, or may be learned in part from practice of this disclosure.
[0007] According to one aspect of this disclosure, an on-network computing method is provided, applied to a tag control function, comprising: parsing a received computing power offloading request, and determining a computing network tag, forwarding rules, and computing power service tasks by combining service indicator information of each node, wherein the computing network tag indicates a routing path and a computing power node; sending the computing network tag and the forwarding rules to each routing node through a connection management function, so that the initial node of the routing path adds the computing network tag to the received computing power offloading service flow and forwards it according to the forwarding rules, and other nodes of the routing path forward and modify the tag according to the computing network tag; and sending the computing network tag and the computing power service tasks to each computing power node through a computing power service management function, so that each computing node forwards the received computing power offloading service flow after executing the computing power service task according to the computing network tag.
[0008] In some embodiments, the method further includes: setting up a computing power offloading task based on the network's computing power offloading capacity; collecting dynamic resource information of network topology, routing nodes, and computing power nodes; and calculating service indicator information for each node.
[0009] In some embodiments, the step of parsing the received computing power offloading request and determining the computing network label, forwarding rules, and computing power service tasks by combining the service indicator information of each node includes: parsing the received computing power offloading request and determining the computing network label, forwarding rules, and computing power service tasks by combining the service indicator information of each node through a pre-set algorithm; wherein, the pre-set algorithm includes: selecting the optimal routing path and computing node combination that meets the quality of service based on the load status of the routing node and the remaining computing resources of the computing power node.
[0010] According to another aspect of this disclosure, an on-network computing system is also provided, comprising: a tag control function, a connection management function, and a computing power service management function; the tag control function parses received computing power offloading requests, and determines computing network tags, forwarding rules, and computing power service tasks by combining service indicator information of each node, wherein the computing network tag indicates a routing path and a computing power node; the tag control function sends the computing network tag and the forwarding rules to each routing node through the connection management function; the tag control function sends the computing network tag and the computing power service task to each computing power node through the computing power service management function; the initial node of the routing path adds the computing network tag to the received computing power offloading service flow and forwards it according to the forwarding rules, and other nodes of the routing path forward and modify the tag according to the computing network tag, wherein the routing node includes computing power nodes; each computing power node forwards the received computing power offloading service flow with the added computing network tag after executing the computing power service task according to the computing network tag.
[0011] In some embodiments, the system further includes: the tag control function sets up computing power offloading tasks according to the network's computing power offloading capacity; collects dynamic resource information of network topology, routing nodes and computing power nodes, and calculates service indicator information of each node.
[0012] In some embodiments, the tag control function parses the received computing power offloading request and determines the computing network tag, forwarding rules, and computing power service tasks by combining the service indicator information of each node. This includes: the tag control function parses the received computing power offloading request and determines the computing network tag, forwarding rules, and computing power service tasks by combining the service indicator information of each node through a pre-set algorithm; wherein the pre-set algorithm includes: selecting the optimal routing path and computing node combination that meets the quality of service based on the load status of the routing node and the remaining computing resources of the computing power node.
[0013] In some embodiments, before each routing node adds the computing network tag to the received computing offload service flow and forwards it according to the forwarding rules, the system further includes: the tag control function returning a request response to the terminal, wherein the request response indicates that the on-grid computing service has been set up; and the user terminal sending the computing offload service flow to the routing node.
[0014] In some embodiments, after each computing power node forwards the received computing power offloading service flow with the added tag according to the computing network tag and performs the computing power service task, the system further includes: a routing node monitoring the flow status of the computing network tag; during the flow process, each routing node decrements the value of the hop number segment in the computing network tag before forwarding; when the service flow is detected to have reached the last routing node, the computing network tag is deleted, and a tagless service flow after computing network calculation is determined; wherein the computing network tag includes a hop count and a tag value, the hop count indicates the number of nodes in the path, the tag value remains unchanged in the path, and the value of the hop number segment attached to the computing network tag is zero when the service flow reaches the last routing node; and the tagless service flow after computing network calculation is sent to the server.
[0015] In some embodiments, after each computing power node forwards the received computing power offloading service flow with the added computing network tag according to the computing network tag and performs the computing power service task, the system further includes: the computing network tag contains tag blocks arranged in the processing order of the tasks, wherein the tag blocks are divided into computing tag blocks and forwarding tag blocks, the computing tasks and forwarding rules are set according to the dimensions of the computing tag blocks and forwarding tag blocks respectively, and each task corresponds to a tag block of the computing network tag; after each node obtains the task corresponding to the computing network tag, it strips the tag block corresponding to the task and processes the task; when all tag blocks are deleted, all tasks are completed.
[0016] According to another aspect of this disclosure, an on-network computing device is also provided for tag control functions, comprising: a network tag generation module, configured to parse received computing power offloading requests, and determine network tags, forwarding rules, and computing power service tasks by combining service indicator information of each node, wherein the network tag indicates a routing path and a computing power node; a network tag first forwarding module, configured to send the network tag and the forwarding rules to each routing node through a connection management function, so that the initial node of the routing path adds the network tag to the received computing power offloading service flow and forwards it according to the forwarding rules, and other nodes of the routing path forward and modify the tag according to the network tag; and a network tag second forwarding module, configured to send the network tag and the computing power service task to each computing power node through a computing power service management function, so that each computing node forwards the received computing power offloading service flow after executing the computing power service task according to the network tag.
[0017] According to another aspect of this disclosure, an electronic device is also provided, comprising: a processor; and a memory for storing executable instructions of the processor; wherein the processor is configured to perform the online computing method described in any of the preceding claims by executing the executable instructions.
[0018] According to another aspect of this disclosure, a computer-readable storage medium is also provided, on which a computer program is stored, which, when executed by a processor, implements the online computing method described in any of the preceding claims.
[0019] According to another aspect of this disclosure, a computer program product is also provided, including a computer program that, when executed by a processor, implements the online computing method of any of the above.
[0020] The on-network computing method provided in the embodiments of this disclosure is applied to the tag control function, including: parsing the received computing power offloading request, and determining the computing network tag, forwarding rules, and computing power service tasks by combining the service indicator information of each node, wherein the computing network tag indicates the routing path and computing power node; sending the computing network tag and forwarding rules to each routing node through the connection management function, so that the initial node of the routing path adds the computing network tag to the received computing power offloading service flow and forwards it according to the forwarding rules, and other nodes of the routing path forward and modify the tag according to the computing network tag; sending the computing network tag and computing power service tasks to each computing power node through the computing power service management function, so that each computing power node forwards the received computing power offloading service flow after executing the computing power service task according to the computing network tag. This disclosure generates computing network tags by dynamically parsing user requests and comprehensively considering the real-time network status, and simplifies the traffic identification and classification strategy in the computing power offloading task to tag rule mapping, solving the problem that the additional computing power required for traffic identification and classification during computing power offloading leads to a decrease in resource utilization and service experience.
[0021] It should be understood that the above general description and the following detailed description are exemplary and explanatory only, and are not intended to limit this disclosure. Attached Figure Description
[0022] The accompanying drawings, which are incorporated in and form part of this specification, illustrate embodiments consistent with this disclosure and, together with the description, serve to explain the principles of this disclosure. It is obvious that the drawings described below are merely some embodiments of this disclosure, and those skilled in the art can obtain other drawings based on these drawings without any inventive effort.
[0023] Figure 1 This diagram illustrates an online computing system architecture according to an embodiment of the present disclosure; Figure 2 This diagram illustrates a flowchart of an online computing method according to an embodiment of the present disclosure; Figure 3 This is a flowchart illustrating a specific example of an on-network calculation method applied to tag control function in an embodiment of the present disclosure; Figure 4 A flowchart illustrating another specific example of an on-network calculation method applied to tag control function in the embodiments of this disclosure is shown. Figure 5 This diagram illustrates a flowchart of an online computing method according to an embodiment of the present disclosure; Figure 6a This diagram illustrates a setting mode for a computing tag according to an embodiment of the present disclosure. Figure 6b This diagram illustrates another setting mode for the network tag in an embodiment of the present disclosure; Figure 7 This diagram illustrates an on-network computing device applied to tag control functions according to an embodiment of the present disclosure; Figure 8 A structural block diagram of an electronic device according to an embodiment of the present disclosure is shown. Detailed Implementation
[0024] Exemplary embodiments will now be described more fully with reference to the accompanying drawings. However, these exemplary embodiments can be implemented in many forms and should not be construed as limited to the examples set forth herein; rather, they are provided so that this disclosure will be more comprehensive and complete, and will fully convey the concept of the exemplary embodiments to those skilled in the art. The described features, structures, or characteristics may be combined in any suitable manner in one or more embodiments.
[0025] Furthermore, the accompanying drawings are merely illustrative of this disclosure and are not necessarily drawn to scale. The same reference numerals in the drawings denote the same or similar parts, and therefore repeated descriptions of them will be omitted. Some block diagrams shown in the drawings are functional entities and do not necessarily correspond to physically or logically independent entities. These functional entities may be implemented in software, in one or more hardware modules or integrated circuits, or in different network and / or processor devices and / or microcontroller devices.
[0026] To facilitate understanding, before introducing the embodiments of this disclosure, the following explanations are provided for several terms involved in the embodiments of this disclosure: UE: User Equipment, a terminal device in a mobile network; SMF: Session Management Function; DN: Data Network; such as carrier services, internet or third-party services, etc. UPF: User Plane Function; RAN: Radio Access Network; CNNF: Core Network Node Function; CP: Computing Point; APP-C: Application-Client, application client; APP-O: Application-Offload, the part that uninstalls the application; APP-S: Application-Server; CSMF: Computing Service Management Function; CMF: Connection Management Function; LCF: Label Control Function.
[0027] The specific implementation methods of the embodiments of this disclosure will now be described in detail with reference to the accompanying drawings.
[0028] Figure 1 A schematic diagram of an exemplary application system architecture to which the online computing methods of the embodiments of this disclosure can be applied is shown. For example... Figure 1 As shown, the system architecture includes LCF101, CSMF102, CMF103, UE (APP-C)104, RAN105, CP (APP-O)106, UPF107 and DN (APP-S)108.
[0029] LCF supports selecting computing nodes and routing nodes to construct the optimal execution path based on network computing needs and resource evaluation, assigning path labels and issuing label policies. LCF also supports updating label policies based on the dynamic status of network resources. LCF connects with CSMF and CMF, sending computing network labels and computing service tasks to CSMF, and sending computing network labels, hop counts, and forwarding rules to CMF.
[0030] CSMF is a network function used in mobile networks to manage CPs and computing services, and to determine service provision and computation execution policies. CSMF connects to CPs and sends computing network tags and computing service tasks to CPs.
[0031] CMF corresponds to SMF in 5G networks and is used to manage routing nodes and establish transmission paths for service flows. CMF connects to UPF, RAN, and CP, sending network labels, hop counts, and forwarding rules to UPF, RAN, and CP.
[0032] The UE is a terminal device, also known as a user equipment. In specific implementations, the terminal device can be a mobile phone, tablet computer, laptop computer, personal digital assistant (PDA), mobile internet device (MID), wearable device, or in-vehicle device, etc. It should be noted that the specific type of terminal device is not limited in this embodiment of the invention. The UE disclosed herein has an APP-C installed, which refers to computationally intensive software running on the terminal. The UE is connected to the RAN.
[0033] A CP (Compute Node) is a network node that provides surplus computing power. By service-orientedizing this surplus computing power, it allows terminals or servers to offload high-performance computing demands onto the CP. CPs contain APP-O (Application Programming Objects), which are software installed and run on computing nodes within the network to offload computationally intensive logic from the terminal or server side to the network.
[0034] DN has APP-S installed, which refers to server software running in the cloud.
[0035] In one example disclosed herein, the UE initiates a computing offload request. The LCF parses the received computing offload request and, in conjunction with the service indicator information of each node, determines the computing network label, forwarding rules, and computing service tasks. The computing network label indicates the routing path and computing node. The LCF sends the computing network label and forwarding rules to each routing node via the CMF. The LCF also sends the computing network label and computing service tasks to each computing node via the CSMF. After the computing service is configured, the UE sends a computing offload service flow. The RAN identifies the service, inserts the computing network label and hop count, and forwards it to the CP. The CP completes the computing service task based on the computing network label and forwards it to the next hop (hop count decremented by one). After receiving the service flow, the UPF determines it is the last hop, removes the computing network label, and forwards it to the DN.
[0036] In one example of this disclosure, the above-mentioned on-grid computing system includes the following steps during operation: A tag control function parses the received computing power offloading request, and, in conjunction with the service indicator information of each node, determines the computing network tag, forwarding rules, and computing power service tasks, wherein the computing network tag indicates the routing path and computing power node; the tag control function sends the computing network tag and forwarding rules to each routing node through the connection management function; the tag control function sends the computing network tag and computing power service tasks to each computing power node through the computing power service management function; the initial node of the routing path adds the computing network tag to the received computing power offloading service flow and forwards it according to the forwarding rules; other nodes of the routing path forward the service flow according to the computing network tag and modify the tag, wherein the routing node includes computing power nodes; each computing power node forwards the received computing power offloading service flow with the added computing network tag after executing the computing power service task according to the computing network tag.
[0037] In one example of this disclosure, when the above-mentioned on-network computing system is running, the system further includes: a tag control function that sets up computing power offloading tasks based on the network's computing power offloading capacity; and collects dynamic resource information of network topology, routing nodes, and computing power nodes, and calculates service indicator information of each node.
[0038] In one example of this disclosure, during the operation of the aforementioned on-grid computing system, the tag control function parses the received computing power offloading requests and, in conjunction with the service indicator information of each node, determines the computing network tag, forwarding rules, and computing power service tasks. This includes: the tag control function parses the received computing power offloading requests and, in conjunction with the service indicator information of each node, determines the computing network tag, forwarding rules, and computing power service tasks through a pre-set algorithm; wherein, the pre-set algorithm includes: selecting the optimal routing path and computing node combination that meets the quality of service based on the load status of the routing nodes and the remaining computing resources of the computing power nodes.
[0039] In one example of this disclosure, when the above-mentioned on-grid computing system is running, before the initial node of the routing path adds a computing network tag to the received computing power offloading service flow and forwards it according to the forwarding rules, the system further includes: the tag control function returning a request response to the terminal, wherein the request response indicates that the on-grid computing service has been set up; and the user terminal sending the computing power offloading service flow to the routing node.
[0040] In one example of this disclosure, when the above-mentioned on-grid computing system is running, after each computing node forwards the received computing offloading service flow with added computing network tags according to the computing network tags, the system further includes: routing nodes monitoring the flow status of the computing network tags; during the flow process, each routing node decrements the value of the hop number segment in the computing network tag before forwarding; when the service flow is detected to have reached the last routing node, the computing network tag is deleted, and the unlabeled service flow after computing network calculation is determined; the unlabeled service flow after computing network calculation is sent to the server, wherein the computing network tag contains a hop count and a tag value, the hop count indicates the number of nodes in the path, the tag value remains unchanged in the path, and the value of the hop number segment attached to the computing network tag is zero when the service flow reaches the last routing node.
[0041] In one example of this disclosure, when the above-mentioned on-grid computing system is running, after each computing node forwards the received computing offloading service flow with added computing network tags according to the computing network tags, the system further includes: the computing network tag contains tag blocks arranged in the processing order of tasks, wherein the tag blocks are divided into computing tag blocks and forwarding tag blocks, the computing tasks and forwarding rules are set according to the dimensions of computing tag blocks and forwarding tag blocks respectively, and each task corresponds to a tag block of the computing network tag; after each node obtains the task corresponding to the computing network tag, it strips the tag block corresponding to the task and processes the task. When all tag blocks are deleted, all tasks are completed.
[0042] It should be noted that stripping the tag block corresponding to a task and processing the task can involve stripping the tag block, saving the tag block, and then processing or forwarding the task based on the specific function of the current node. If the current node is a routing node, it forwards tags and tasks; if the current node is a computing power node, it processes the task and then deletes the corresponding tag block. All tasks can include computing power tasks and forwarding tasks.
[0043] In one instance of this disclosure, during the execution of the computing power service, the flow status of computing network tags is monitored, and when the service flow is detected to have reached the last routing node (UPF), a tag deletion command is triggered.
[0044] In one example of this disclosure, the forwarding rules include: the routing node identifies the service flow based on the computing network label and performs forwarding; the UPF, as the end node, deletes the label and forwards the service flow to the server.
[0045] This disclosure transforms the traditional policy mechanism of mobile networks into a tag mechanism, avoiding the execution of complex identification rules by network elements and accelerating the policy execution process. By introducing computing network tags and adding elements such as computing power services on the basis of traditional routing learning, it supports the integrated scheduling and overall optimization of multiple resource elements, promoting the better implementation of next-generation network computing network integration and end-network-cloud collaboration.
[0046] Those skilled in the art will know that Figure 1 The number of LCF, CSMF, CMF, UE, RAN, CP, UPF, and DN is merely illustrative; any number of LCF, CSMF, CMF, UE, RAN, CP, UPF, and DN can be used as needed. This disclosure does not limit this.
[0047] Figure 2 This diagram illustrates a flowchart of an on-network calculation method applied to tag control functions in an embodiment of the present disclosure, such as... Figure 2 As shown, the on-network calculation method for tag control function provided in this embodiment includes the following steps: S202, parse the received computing power offloading request, and combine the service indicator information of each node to determine the computing network label, forwarding rules and computing power service tasks. Among them, the computing network label indicates the routing path and computing power node.
[0048] It should be noted that the aforementioned computing power offloading request can be a computing task migration application. For example, after the UE runs the APP, it initiates a computing power offloading request to the CSMF. The CSMF forwards the UE's computing power offloading request to the LCF. The computing power offloading request carries the APP ID, which is used to map and bind the computing power offloading request to the subsequent computing network label. The aforementioned service indicator information can be a comprehensive evaluation service indicator, including service indicator evaluations of computing power resources, connection resources, and service quality requirements. For example, service indicators are evaluated separately for computing power resources and connection resources, and then combined with service quality requirements and resource consumption to calculate a comprehensive evaluation indicator (such as a weighted average) for each computing power task path. The aforementioned computing network label indicates the routing path for fast matching of routing nodes. The computing network label also indicates the computing power node for specifying the target computing power node. The computing network label can take into account the needs of network forwarding and computing power scheduling. The computing network label is not deleted at intermediate nodes; it is deleted at the last node; the computing power node also has the function of a routing node. The aforementioned forwarding rule can be based on the optimal path of real-time link status to indicate the forwarding action for each hop, for example, selecting the next hop address after matching the label. The aforementioned computing power service tasks are tasks corresponding to the APP ID, used by computing power nodes to identify the services they need to perform. For example, computing power services include, but are not limited to, computation, and may also include various operations such as storage. The aforementioned routing path includes routing nodes and forwarding order. For example, a routing node can determine whether it is the last node based on the hop count information in the computing network tag.
[0049] S204, the computing network label and forwarding rules are sent to each routing node through the connection management function, so that the initial node of the routing path adds the computing network label to the received computing power offloading service flow and forwards it according to the forwarding rules, and other nodes of the routing path forward and modify the label according to the computing network label.
[0050] It should be noted that the aforementioned forwarding rules are associated with the computing network tag. Furthermore, the forwarding rules can dynamically change with network changes (real-time resource changes). The aforementioned computing offloading service flow can be a user terminal transmitting computing tasks that would otherwise be executed locally to computing nodes in the network for processing via a data stream of a specific format. For example, when a routing node recognizes that the APP ID in the computing offloading service flow has previously made a computing offloading request and successfully returned a response, it will insert a computing network tag and send it to the next node according to the forwarding rules. The starting point of the computing network tag is the device that inserts the tag. This device needs to identify the service and insert the tag. The starting point can be the RAN or the first core network node accessed, provided that the tag protocol is supported.
[0051] S206 sends computing network tags and computing service tasks to each computing node through the computing power service management function, so that each computing node can forward the received computing power offloading service flow after executing the computing power service task according to the computing network tag.
[0052] It should be noted that the aforementioned computing power service task can be a computing task that the current computing power node needs to perform for an APP ID (the computing power service task determined according to S202 can be either undertaking part of the computing task or undertaking all of the computing task). For example, when a computing power node receives a computing power offloading service flow with a computing network tag, it performs calculations on the aforementioned computing power offloading service flow according to the pre-received computing power service task, and after completing the calculation task, it forwards it to the next node.
[0053] This disclosure generates network tags based on dynamic parsing of user requests and comprehensive real-time network status, simplifying the traffic identification and classification strategy in the computing power offloading task into tag rule mapping. This solves the problem that additional computing power is needed in the computing power offloading process to identify and classify traffic, which leads to a decrease in resource utilization and business experience.
[0054] In one embodiment of this disclosure, such as Figure 3 As shown, the online computing method provided in this embodiment further includes the following steps: S302, set up computing power offloading tasks based on the network's computing power offloading capacity; S304 collects dynamic information on network topology, routing nodes, and computing nodes, and calculates service metrics for each node.
[0055] The service metrics information includes assessments of computing resources, connectivity resources, and service quality.
[0056] It should be noted that the above-mentioned setting of the computing power offloading task can be done before or after parsing the received computing power offloading request, depending on how the computing power is used, such as whether to send code directly or to carry task instructions (for the set task).
[0057] This disclosure uses S302 for initial configuration and S304 for dynamic resource monitoring, providing a prerequisite for accurate execution of subsequent computing power unloading.
[0058] In one embodiment of this disclosure, such as Figure 4 As shown in the embodiments of this disclosure, the on-network computing method, by parsing the received computing power offloading request and combining it with the service indicator information of each node, determines the computing network label, forwarding rules, and computing power service tasks, specifically including the following steps: S402, parse the received computing power offloading request, combine the service indicator information of each node, and determine the computing network label, forwarding rules and computing power service tasks through a pre-set algorithm; wherein, the pre-set algorithm includes: selecting the optimal routing path and computing power node combination that meets the quality of service based on the load status of the routing node and the remaining computing resources of the computing power node.
[0059] This disclosure achieves precise matching of dynamic computing resources based on quantitative multi-dimensional dynamic indicators (routing node load, computing resources, and service quality), reduces the complexity of computing offloading, and can adapt to large-scale edge computing scenarios.
[0060] Figure 5 This diagram illustrates a flowchart of an on-network calculation method applied to tag control functions in an embodiment of the present disclosure, such as... Figure 5 As shown, the on-network calculation method for tag control function provided in this embodiment includes the following steps: S501, LCF sets up computing power offloading tasks based on the network's computing power offloading capacity; S502, LCF collects dynamic resource information of network topology, routing nodes and computing nodes, and evaluates service indicators as needed (equivalent to the above service indicator information). S503, the UE runs the APP and sends a computing power offload request to the CSMF, which carries the APP ID; S504, CSMF forwards the UE's computing power offloading request to LCF; S505, LCF parses the UE's request, performs optimization calculations based on the service indicators of each node, selects the path and computing power node (including computing power service tasks, i.e., the computing tasks corresponding to the APP ID), and generates computing network tags; S506, LCF distributes network labels and forwarding rules to each routing node (including RAN / CNNF, CP, UPF) via the connection management function; S507, LCF uses the computing power service management function to issue computing network tags and computing power service tasks to computing power nodes (CP); S508, LCF returns a request response (computing power offload request response) to CSMF, indicating that the on-network computing service has been set up; S509, CSMF returns a request response to UE, indicating that the on-network computing service has been set up and notifying UE that it can start service flow transmission; S510, the UE sends a computing power offloading service flow (hereinafter referred to as service flow) to the RAN / CNNF. S511, RAN or CNNF are nodes that support the label protocol. When a service is identified, a computing network label is inserted. S512, RAN or CNNF will forward the service flow after inserting the label to the next hop CP; S513, the computing power nodes execute computing power service tasks based on the computing network tags, and then forward the processed business flows; S514, after executing the computing power service, the business flow is forwarded to the next hop UPF; S515, UPF selects the route exit based on the computing network label, determines that it is the last routing node, deletes the computing network label and forwards the unlabeled service flow; S516, UPF delivers the unlabeled service flow after network computation to the server.
[0061] This disclosure introduces a label control function within the core network. This function collects real-time deployment topology and resource status of various on-network service capabilities. Based on on-network computing subscription relationships, it generates computing network labels using a heterogeneous resource combination evaluation algorithm and multi-factor fusion scheduling. The label control function distributes label policies, specifically, it distributes computing network labels and computing power service tasks to the computing power service management function, and computing network labels and forwarding rules to the connection management function. These functions then forward the corresponding execution rules to computing power nodes or routing nodes (computing power nodes can also be routing nodes). When a terminal uses on-network computing services, the network node that identifies the on-network service inserts a computing network label. Subsequent nodes only need to read the label to quickly understand the rules and execute computing power services or forwarding operations. The label is deleted by the last network node in the service path, and the packet is then delivered to the target node in the usual manner. The label policy may also include path information, such as path hop count and path node sequence.
[0062] This disclosure transforms the policy mechanism of mobile networks into a tag mechanism and adds other elements such as computing power services, enabling the execution unit to quickly understand execution requirements and support the integrated scheduling and overall optimization of multiple resource elements.
[0063] In one example of this disclosure, the aforementioned computing network tag includes the following two setting modes: Mode 1, a computing network tag simultaneously implies computing power actions, such as... Figure 6aAs shown; in mode two, computing power tags and connection tags are set separately, and a business chain is used. After the corresponding processing of the tag is completed, the tag is deleted. In mode two, the skipping number segment can be omitted.
[0064] Based on the same inventive concept, this disclosure also provides an on-network computing device for tag control functions, as described in the following embodiments. Since the principle by which this device embodiment solves the problem is similar to that of the above-described method embodiments, the implementation of this device embodiment can refer to the implementation of the above-described method embodiments, and repeated details will not be elaborated further.
[0065] Figure 7 This diagram illustrates an on-network computing device used for tag control functions in an embodiment of the present disclosure, such as... Figure 7 As shown, the device includes: a computing network tag generation module 71, a computing network tag first forwarding module 72, and a computing network tag second forwarding module 73.
[0066] The computing network label generation module 71 is used to parse the received computing power offloading request, and determine the computing network label, forwarding rules and computing power service tasks by combining the service indicator information of each node. The computing network label indicates the routing path and computing power node.
[0067] The first forwarding module 72 for computing network labels is used to send computing network labels and forwarding rules to each routing node through the connection management function, so that the initial node of the routing path adds computing network labels to the received computing power offloading service flow and forwards it according to the forwarding rules, and other nodes of the routing path forward and modify the labels according to the computing network labels.
[0068] The second forwarding module 73 for computing network tags is used to send computing network tags and computing power service tasks to each computing power node through the computing power service management function, so that each computing power node forwards the received computing power offloading service flow after executing the computing power service task according to the computing network tag.
[0069] In one example of this disclosure, the on-network computing device applied to the tag control function further includes a front-end module for setting up computing offloading tasks based on the network's computing offloading capacity; collecting dynamic resource information of network topology, routing nodes, and computing nodes; and calculating service indicator information of each node.
[0070] In one example of this disclosure, the aforementioned computing network tag generation module is further used to parse the received computing power offloading request, combine the service indicator information of each node, and determine the computing network tag, forwarding rules, and computing power service tasks through a pre-set algorithm; wherein, the pre-set algorithm includes: selecting the optimal routing path and computing power node combination that meets the quality of service based on the load status of the routing node and the remaining computing resources of the computing power node.
[0071] It should be noted that the aforementioned network tag generation module 71, network tag first forwarding module 72, and network tag second forwarding module 73 correspond to S202 to S206 in the method embodiment. The examples and application scenarios implemented by these modules and their corresponding steps are the same, but they are not limited to the content disclosed in the above method embodiment. It should also be noted that these modules, as part of the apparatus, can be executed in a computer system such as a set of computer-executable instructions.
[0072] Those skilled in the art will understand that various aspects of this disclosure can be implemented as a system, method, or program product. Therefore, various aspects of this disclosure can be specifically implemented in the following forms: a completely hardware implementation, a completely software implementation (including firmware, microcode, etc.), or a combination of hardware and software aspects, collectively referred to herein as a "circuit," "module," or "system."
[0073] The following reference Figure 8 To describe an electronic device 800 according to such an embodiment of the present disclosure. Figure 8 The electronic device 800 shown is merely an example and should not impose any limitation on the functionality and scope of use of the embodiments disclosed herein.
[0074] like Figure 8 As shown, the electronic device 800 is manifested in the form of a general-purpose computing device. The components of the electronic device 800 may include, but are not limited to: at least one processing unit 810, at least one storage unit 820, and a bus 830 connecting different system components (including storage unit 820 and processing unit 810).
[0075] The storage unit stores program code that can be executed by the processing unit 810, causing the processing unit 810 to perform the steps described in the "Exemplary Methods" section above according to various exemplary embodiments of this disclosure.
[0076] For example, the processing unit 810 can execute the following steps in the above method embodiment: parse the received computing power offloading request, combine the service indicator information of each node, determine the computing network label, forwarding rules, and computing power service tasks, wherein the computing network label includes the routing path and computing power node; send the computing network label and forwarding rules to each routing node through the connection management function, so that the initial node of the routing path adds the computing network label to the received computing power offloading service flow and forwards it according to the forwarding rules; send the computing network label and computing power service tasks to each computing power node through the computing power service management function, so that each computing power node forwards the received computing power offloading service flow after executing the computing power service task according to the computing network label.
[0077] For example, the processing unit 810 can execute the following steps in the above method embodiment: set up a computing power offloading task according to the computing power offloading capacity of the network; collect dynamic resource information of network topology, routing nodes and computing power nodes, and calculate the service indicator information of each node.
[0078] For example, the processing unit 810 can execute the following steps in the above method embodiment: parse the received computing power offloading request, combine the service indicator information of each node, and determine the computing network label, forwarding rules and computing power service tasks through a pre-set algorithm; wherein, the pre-set algorithm includes: selecting the optimal routing path and computing power node combination that meets the quality of service based on the load status of the routing node and the remaining computing resources of the computing power node.
[0079] Storage unit 820 may include readable media in the form of volatile storage units, such as random access memory (RAM) 8201 and / or cache 8202, and may further include read-only memory (ROM) 8203.
[0080] The storage unit 820 may also include a program / utility 8204 having a set (at least one) of program modules 8205, such program modules 8205 including but not limited to: an operating system, one or more application programs, other program modules, and program data, each or some combination of these examples may include an implementation of a network environment.
[0081] Bus 830 can represent one or more of several types of bus structures, including a memory cell bus or memory cell controller, a peripheral bus, a graphics acceleration port, a processing unit, or a local bus using any of the various bus structures.
[0082] Electronic device 800 can also communicate with one or more external devices 840 (e.g., keyboard, pointing device, Bluetooth device, etc.), and with one or more devices that enable a user to interact with electronic device 800, and / or with any device that enables electronic device 800 to communicate with one or more other computing devices (e.g., router, modem, etc.). This communication can be performed via input / output (I / O) interface 850. Furthermore, electronic device 800 can also communicate with one or more networks (e.g., local area network (LAN), wide area network (WAN), and / or public networks, such as the Internet) via network adapter 860. As shown, network adapter 860 communicates with other modules of electronic device 800 via bus 830. It should be understood that, although not shown in the figures, other hardware and / or software modules can be used in conjunction with electronic device 800, including but not limited to: microcode, device drivers, redundant processing units, external disk drive arrays, RAID systems, tape drives, and data backup storage systems.
[0083] From the above description of the embodiments, those skilled in the art will readily understand that the exemplary embodiments described herein can be implemented by software or by combining software with necessary hardware. Therefore, the technical solutions according to the embodiments of this disclosure can be embodied in the form of a software product, which can be stored in a non-volatile storage medium (such as a CD-ROM, USB flash drive, external hard drive, etc.) or on a network, including several instructions to cause a computing device (such as a personal computer, server, terminal device, or network device, etc.) to execute the methods according to the embodiments of this disclosure.
[0084] In particular, according to embodiments of this disclosure, the process described above with reference to the flowchart can be implemented as a computer program product, which includes a computer program that, when executed by a processor, implements the above-described online computing method.
[0085] In exemplary embodiments of this disclosure, a computer-readable storage medium is also provided, which may be a readable signal medium or a readable storage medium. A program product capable of implementing the methods described above is stored thereon. In some possible implementations, various aspects of this disclosure may also be implemented as a program product including program code, which, when run on a terminal device, causes the terminal device to perform the steps described in the "Exemplary Methods" section of this specification according to various exemplary embodiments of this disclosure.
[0086] More specific examples of computer-readable storage media in this disclosure may include, but are not limited to: electrical connections having one or more wires, portable computer disks, hard disks, random access memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM or flash memory), optical fiber, portable compact disk read-only memory (CD-ROM), optical storage devices, magnetic storage devices, or any suitable combination of the foregoing.
[0087] In this disclosure, a computer-readable storage medium may include a data signal propagated in baseband or as part of a carrier wave, carrying readable program code. Such propagated data signals may take various forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination thereof. A readable signal medium may also be any readable medium other than a readable storage medium, capable of transmitting, propagating, or transmitting a program for use by or in connection with an instruction execution system, apparatus, or device.
[0088] Optionally, the program code contained on the computer-readable storage medium may be transmitted using any suitable medium, including but not limited to wireless, wired, optical fiber, RF, etc., or any suitable combination thereof.
[0089] In practical implementation, program code for performing the operations of this disclosure can be written in any combination of one or more programming languages, including object-oriented programming languages such as Java and C++, and conventional procedural programming languages such as C or similar languages. The program code can execute entirely on the user's computing device, partially on the user's device, as a standalone software package, partially on the user's computing device and partially on a remote computing device, or entirely on a remote computing device or server. In cases involving remote computing devices, the remote computing device can be connected to the user's computing device via any type of network, including a local area network (LAN) or a wide area network (WAN), or it can be connected to an external computing device (e.g., via the Internet using an Internet service provider).
[0090] It should be noted that although several modules or units for the device used to perform actions have been mentioned in the detailed description above, this division is not mandatory. In fact, according to embodiments of this disclosure, the features and functions of two or more modules or units described above can be embodied in one module or unit. Conversely, the features and functions of one module or unit described above can be further divided and embodied by multiple modules or units.
[0091] Furthermore, although the steps of the method in this disclosure are described in a specific order in the accompanying drawings, this does not require or imply that the steps must be performed in that specific order, or that all the steps shown must be performed to achieve the desired result. Additional or alternative steps may be omitted, multiple steps may be combined into one step, and / or a step may be broken down into multiple steps.
[0092] From the above description of the embodiments, those skilled in the art will readily understand that the exemplary embodiments described herein can be implemented by software or by combining software with necessary hardware. Therefore, the technical solutions according to the embodiments of this disclosure can be embodied in the form of a software product, which can be stored in a non-volatile storage medium (such as a CD-ROM, USB flash drive, external hard drive, etc.) or on a network, including several instructions to cause a computing device (such as a personal computer, server, mobile terminal, or network device, etc.) to execute the methods according to the embodiments of this disclosure.
[0093] Other embodiments of this disclosure will readily occur to those skilled in the art upon consideration of the specification and practice of the invention disclosed herein. This disclosure is intended to cover any variations, uses, or adaptations of this disclosure that follow the general principles of this disclosure and include common knowledge or customary techniques in the art not disclosed herein. The specification and examples are to be considered exemplary only, and the true scope and spirit of this disclosure are indicated by the appended claims.
Claims
1. An online computing method, characterized in that, Applied to label control functions, including: The received computing power offloading request is parsed, and the service indicator information of each node is combined to determine the computing network label, forwarding rules and computing power service tasks, wherein the computing network label indicates the routing path and computing power node; The connection management function sends the computing network tag and the forwarding rules to each routing node, so that the initial node of the routing path adds the computing network tag to the received computing power offloading service flow and forwards it according to the forwarding rules. Other nodes of the routing path forward the service flow according to the computing network tag and modify the tag. The computing power service management function sends the computing network tag and the computing power service task to each computing power node, so that each computing power node forwards the received computing power offloading service flow after executing the computing power service task according to the computing network tag.
2. The on-network computing method according to claim 1, characterized in that, The method further includes: Set up computing power offloading tasks based on the network's computing power offloading capacity; Collect dynamic information on network topology, routing nodes, and computing nodes, and calculate service metrics for each node.
3. The method according to claim 1, characterized in that, The process of parsing the received computing power offloading request, combined with the service indicator information of each node, determines the computing network tag, forwarding rules, and computing power service tasks, including: The received computing power offloading requests are parsed, and the service indicator information of each node is combined with the pre-set algorithm to determine the computing network label, forwarding rules and computing power service tasks; The pre-set algorithm includes: selecting the optimal routing path and computing node combination that meets the quality of service based on the load status of the routing node and the remaining computing resources of the computing node.
4. An online computing system, characterized in that, include: Tag control function, connection management function, and computing power service management function; The tag control function parses the received computing power offloading request, combines the service indicator information of each node, and determines the computing network tag, forwarding rules, and computing power service tasks. The computing network tag indicates the routing path and computing power node. The label control function sends the computing network label and the forwarding rules to each routing node through the connection management function; The tag control function sends the computing network tag and the computing power service task to each computing power node through the computing power service management function; The initial node of the routing path adds the computing network tag to the received computing power offloading service flow and forwards it according to the forwarding rules. Other nodes of the routing path forward the service flow according to the computing network tag and modify the tag. The routing node includes computing power nodes. Each computing power node forwards the received computing power offloading service flow with the added computing network tag after executing the computing power service task according to the computing network tag.
5. The on-network computing system according to claim 4, characterized in that, The system also includes: The tag control function sets up computing power offloading tasks based on the network's computing power offloading capacity; Collect dynamic information on network topology, routing nodes, and computing nodes, and calculate service metrics for each node.
6. The on-network computing system according to claim 4, characterized in that, The tag control function parses the received computing power offloading request and, in conjunction with the service indicator information of each node, determines the computing network tag, forwarding rules, and computing power service tasks, including: The tag control function parses the received computing power offloading request, combines the service indicator information of each node, and determines the computing network tag, forwarding rules, and computing power service tasks through a pre-set algorithm. The pre-set algorithm includes: selecting the optimal routing path and computing node combination that meets the quality of service based on the load status of the routing node and the remaining computing resources of the computing node.
7. The on-network computing system according to claim 4, characterized in that, Before the initial node of the routing path adds the computing network tag to the received computing power offloading service flow and forwards it according to the forwarding rules, the system further includes: The tag control function returns a request response to the user terminal, wherein the request response indicates that the online computing service has been set up. The user terminal sends the computing power offloading service flow to the routing node.
8. The on-network computing system according to claim 4, characterized in that, After each computing power node forwards the received computing power offloading service flow with the added computing network tag according to the computing network tag and performs the computing power service task, the system further includes: The routing nodes monitor the flow status of the network label. During the flow, each routing node decrements the value of the hop number field in the network label before forwarding it. When the service flow is detected to have reached the last routing node, the network label is deleted to determine the labelless service flow after network calculation. The network label contains a hop count and a label value. The hop count indicates the number of nodes in the path. The label value remains unchanged in the path. When the service flow reaches the last routing node, the value of the hop number field attached to the network label is zero. The unlabeled service flow calculated by the computing network is sent to the server.
9. The on-network computing system according to claim 4, characterized in that, After each computing power node forwards the received computing power offloading service flow with the added computing network tag according to the computing network tag and performs the computing power service task, the system further includes: The computing network tag contains tag blocks arranged in the order of task processing. The tag blocks are divided into computing tag blocks and forwarding tag blocks. The computing tasks and forwarding rules are set according to the dimensions of the computing tag blocks and forwarding tag blocks, respectively. Each task corresponds to one tag block of the computing network tag. After obtaining the task corresponding to the computing network tag, each node strips the tag block corresponding to the task and processes the task. When all tag blocks are deleted, all tasks are completed.
10. An online computing device, characterized in that, Applied to label control functions, including: The computing network label generation module is used to parse the received computing power offloading request, and combine the service indicator information of each node to determine the computing network label, forwarding rules and computing power service tasks. The computing network label indicates the routing path and computing power node. The first forwarding module for computing network labels is used to send the computing network labels and the forwarding rules to each routing node through the connection management function, so that the initial node of the routing path adds the computing network label to the received computing power offloading service flow and forwards it according to the forwarding rules, and other nodes of the routing path forward and modify the labels according to the computing network labels; The second forwarding module for the computing network tag is used to send the computing network tag and the computing power service task to each computing power node through the computing power service management function, so that each computing power node forwards the received computing power offloading service flow after executing the computing power service task according to the computing network tag.
11. An electronic device, characterized in that, include: processor; as well as Memory for storing the executable instructions of the processor; The processor is configured to execute the online computing method of any one of claims 1 to 3 by executing the executable instructions.
12. A computer-readable storage medium having a computer program stored thereon, characterized in that, When the computer program is executed by the processor, it implements the online computing method according to any one of claims 1 to 3.
13. A computer program product comprising: A computer program or instruction, characterized in that, when executed by a processor, the computer program or instruction implements the online computing method according to any one of claims 1 to 3.