CN116582540A

CN116582540A - Communication collaboration method and device for edge calculation, computer equipment and storage medium

Info

Publication number: CN116582540A
Application number: CN202310836967.2A
Authority: CN
Inventors: 甄岩; 白晖峰; 霍超; 郑利斌; 尹志斌; 张港红; 苑佳楠; 程显明; 张颉; 顾仁涛; 耿俊成
Original assignee: Beijing Smartchip Microelectronics Technology Co Ltd
Current assignee: Beijing Smartchip Microelectronics Technology Co Ltd
Priority date: 2023-07-10
Filing date: 2023-07-10
Publication date: 2023-08-11
Anticipated expiration: 2043-07-10
Also published as: CN116582540B

Abstract

The embodiment of the specification provides a communication cooperation method, a device, computer equipment and a storage medium for edge calculation. The method comprises the following steps: determining at least one second edge computing node according to the communication cooperative demand; the second edge computing node is a node used for establishing a communication cooperative relationship with the first edge computing node in the plurality of nodes; determining at least one communication cooperative path between the first edge computing node and any second edge computing node according to the communication delay and the available bandwidth of any link in the edge computing system and the communication cooperative demand aiming at any second edge computing node; and mapping at least one communication cooperative path into a physical route so as to establish a communication cooperative relationship between the first edge computing node and any second edge computing node, thereby improving the computing resource utilization rate and the distributed processing capacity of edge computing.

Description

Communication collaboration method and device for edge calculation, computer equipment and storage medium

Technical Field

The embodiment in the specification relates to the technical field of communication, in particular to a communication cooperation method, a device, computer equipment and a storage medium for edge calculation.

Background

With the rapid development of the internet of things, more and more terminal devices access to the network, the access scale of data and services also increases in an explosive manner, and higher requirements are also provided for performances such as system time delay and the like. The edge computing is used as a new computing mode, so that data and business can be effectively processed in time by an edge computing system near the terminal equipment when the computing resources and the energy consumption of the terminal equipment are limited or network congestion and high delay exist in the cloud of the system.

In the related art, the allocation mode of computing resources in edge computing is single and passive, and an effective cooperative mechanism is lacked among all nodes, so that the problem of low processing capacity of computing tasks caused by difficulty in effective utilization of computing resources exists.

Therefore, a communication collaboration method for edge computing is needed to improve the computing resource utilization and the distributed processing capacity of the edge computing.

Disclosure of Invention

In view of this, various embodiments of the present disclosure are directed to a communication collaboration method, apparatus, computer device, and storage medium for edge computing to improve computing resource utilization and distributed processing power of edge computing.

The embodiment of the specification provides a communication cooperation method of edge calculation, which is applied to an edge calculation system, wherein the edge calculation system comprises a plurality of nodes, and the plurality of nodes comprise first edge calculation nodes with communication cooperation requirements; the method comprises the following steps: determining at least one second edge computing node according to the communication cooperative demand; wherein the second edge computing node is a node of the plurality of nodes for establishing a communication cooperative relationship with the first edge computing node; determining at least one communication cooperative path between the first edge computing node and any second edge computing node according to the communication delay and the available bandwidth of any link in the edge computing system and the communication cooperative demand; mapping the at least one communication cooperative path into a physical route to establish a communication cooperative relationship between the first edge computing node and any one of the second edge computing nodes.

Further, the determining at least one second edge computing node according to the communication cooperation requirement includes: if the communication cooperative demand comprises functional coupling information, taking at least one designated node as the at least one second edge computing node; the designated node is a non-first edge computing node in the edge computing system, and the functional coupling information indicates that a business interaction relationship exists between the first edge computing node and the at least one designated node.

Further, the communication coordination requirement includes a computational power requirement; the determining at least one second edge computing node according to the communication cooperative demand comprises the following steps: if the communication cooperative demand does not include functional coupling information, determining available computing power of a non-first edge computing node in the edge computing system; and sequentially selecting the maximum available computing force of non-first edge computing nodes in the edge computing system as second edge computing nodes until the sum of the available computing forces of at least one second edge computing node meets the computing force requirement.

Further, the determining, for any second edge computing node, at least one communication cooperative path between the first edge computing node and any second edge computing node according to the communication delay and the available bandwidth of any link in the edge computing system and the communication cooperative demand includes: determining the link weight of any link in the edge computing system according to the communication delay and the available bandwidth of the any link; wherein, any link is a line between any node in the edge computing system and any adjacent node thereof; determining a corresponding path set according to the link weight of a link in the edge computing system aiming at any second edge computing node; wherein the path set comprises at least one path, the path is a line between the first edge computing node and any second edge computing node, and the path comprises at least one link; determining path weights of any paths in the path set according to the available bandwidth and communication delay of each link contained in the any paths; and determining at least one communication cooperative path between the first edge computing node and any second edge computing node according to the path weight of each path in the path set and the communication cooperative demand.

Further, the communication collaboration requirement includes a bandwidth requirement; the determining at least one communication cooperative path between the first edge computing node and any second edge computing node according to the path weight of each path in the path set and the communication cooperative demand includes: sequentially selecting the path weight with the largest path weight in the path set as a communication cooperative path until the sum of the path bandwidths of the obtained at least one communication cooperative path meets the bandwidth requirement; wherein the path bandwidth is determined based on the available bandwidth of the links in the corresponding path.

Further, the communication collaboration requirement includes a bandwidth requirement; the communication cooperative path comprises at least one relay node, wherein the relay node is a node used for communication between the first edge computing node and any second edge computing node in the plurality of nodes; the mapping the at least one communication cooperative path to a physical route to establish a communication cooperative relationship between the first edge computing node and any second edge computing node includes: generating a path mapping signaling frame for any communication cooperative path based on the first edge computing node in the edge computing system; transmitting the path mapping signaling frame along any communication cooperative path to indicate all relay nodes on the any communication cooperative path, and reserving bandwidth resources meeting the bandwidth requirements according to the path mapping signaling frame; receiving a path mapping confirmation frame fed back by any relay node of any communication cooperative path after receiving the path mapping signaling frame; and under the condition that path mapping confirmation frames fed back by all relay nodes of the at least one communication cooperative path are received, the at least one communication cooperative path is confirmed to be mapped into an actual physical route on the edge computing system, so that a communication cooperative relationship between the first edge computing node and any second edge computing node is established.

Further, the communication cooperation method further includes: generating a co-ordination release signaling frame for the arbitrary communication co-path based on the first edge computing node in the edge computing system; transmitting the coordination release signaling frame along any communication coordination path to instruct all relay nodes on the any communication coordination path to release the bandwidth resource; receiving a cooperative cancellation acknowledgement frame fed back by any relay node of any communication cooperative path after receiving the cooperative cancellation signaling frame; and confirming to release the communication cooperative relationship between the first edge computing node and any second edge computing node under the condition that the cooperative release confirmation frames fed back by all relay nodes of the at least one communication cooperative path are received.

The embodiment of the specification provides a communication cooperative device for edge computing, which is applied to an edge computing system, wherein the edge computing system comprises a plurality of nodes, and the plurality of nodes comprise a first edge computing node with communication cooperative requirements; the communication cooperative apparatus includes: the initialization module is used for determining at least one second edge computing node according to the communication cooperative demand; wherein the second edge computing node is a node of the plurality of nodes for establishing a communication cooperative relationship with the first edge computing node; the path determining module is used for determining at least one communication cooperative path between the first edge computing node and any second edge computing node according to the communication delay and the available bandwidth of any link in the edge computing system and the communication cooperative demand; and the route mapping module is used for mapping the at least one communication cooperative path into a physical route so as to establish a communication cooperative relationship between the first edge computing node and any second edge computing node.

Further, the initialization module comprises a static initialization module; the static initialization module is configured to take at least one designated node as the at least one second edge computing node if the communication coordination requirement includes functional coupling information; the designated node is a non-first edge computing node in the edge computing system, and the functional coupling information indicates that a business interaction relationship exists between the first edge computing node and the at least one designated node.

Further, the communication coordination requirement includes a computational power requirement; the initialization module comprises a dynamic initialization module; the dynamic initialization module is configured to determine an available computing power of a non-first edge computing node in the edge computing system if the communication coordination requirement does not include functional coupling information; and sequentially selecting the maximum available computing force of non-first edge computing nodes in the edge computing system as second edge computing nodes until the sum of the available computing forces of at least one second edge computing node meets the computing force requirement.

Further, the path determination module includes: the link weight determining module is used for determining the link weight of any link in the edge computing system according to the communication time delay and the available bandwidth of the any link; wherein, any link is a line between any node in the edge computing system and any adjacent node thereof; the path set determining module is used for determining a corresponding path set according to the link weight of a link in the edge computing system aiming at any second edge computing node; wherein the path set comprises at least one path, the path is a line between the first edge computing node and any second edge computing node, and the path comprises at least one link; the path weight determining module is used for determining the path weight of any path in the path set according to the available bandwidth and the communication delay of each link contained in the any path; and the cooperative path determining module is used for determining at least one communication cooperative path between the first edge computing node and any second edge computing node according to the path weight of each path in the path set and the communication cooperative demand.

Further, the communication collaboration requirement includes a bandwidth requirement; the cooperative path determining module is used for sequentially selecting the path weight with the largest path weight in the path set as a communication cooperative path until the sum of the path bandwidths of the obtained at least one communication cooperative path meets the bandwidth requirement; wherein the path bandwidth is determined based on the available bandwidth of the links in the corresponding path.

Further, the communication collaboration requirement includes a bandwidth requirement; the communication cooperative path comprises at least one relay node, wherein the relay node is a node used for communication between the first edge computing node and any second edge computing node in the plurality of nodes; the route mapping module comprises: a first mapping module, configured to generate a path mapping signaling frame for any communication cooperative path based on the first edge computing node in the edge computing system; the second mapping module is used for sending the path mapping signaling frame along any communication cooperative path to indicate all relay nodes on the any communication cooperative path, and reserving bandwidth resources meeting the bandwidth requirements according to the path mapping signaling frame; a third mapping module, configured to receive a path mapping acknowledgement frame fed back by any relay node of the any communication cooperative path after receiving the path mapping signaling frame; and the fourth mapping module is used for confirming that the at least one communication cooperative path is mapped into an actual physical route on the edge computing system under the condition that path mapping confirmation frames fed back by all relay nodes of the at least one communication cooperative path are received, so as to establish a communication cooperative relationship between the first edge computing node and any second edge computing node.

Further, the communication cooperative apparatus further includes: a first cancellation module configured to generate a cancellation signaling frame for the arbitrary communication cooperative path based on the first edge computing node in the edge computing system; a second cancellation module, configured to send the cooperative cancellation signaling frame along the any communication cooperative path, so as to instruct all relay nodes on the any communication cooperative path to release the bandwidth resource; a third cancellation module, configured to receive a cancellation acknowledgement frame fed back by any relay node of the any communication cooperative path after receiving the cancellation signaling frame; and the fourth cancellation module is used for confirming and canceling the communication cooperative relationship between the first edge computing node and any second edge computing node under the condition that the cooperative cancellation confirmation frames fed back by all relay nodes of the at least one communication cooperative path are received.

The embodiment of the present specification provides a computer device, including a memory and a processor, where the memory stores a computer program, and the processor executes the computer program to implement the communication collaboration method described in any of the above embodiments.

The present description provides a computer-readable storage medium having stored thereon a computer program which, when executed by a processor, implements the communication cooperation method of any one of the above embodiments.

According to the embodiments provided by the specification, at least one second edge computing node for establishing a communication cooperative relationship with a first edge computing node is determined according to the communication cooperative demand of the first edge computing node in an edge computing system, and then, for any second edge computing node, at least one communication cooperative path between the first edge computing node and the second edge computing node is determined according to the communication delay and the available bandwidth of any link in the edge computing system and the communication cooperative demand of the first edge computing node, and the at least one communication cooperative path is mapped into a physical route, so that the communication cooperative relationship between the first edge computing node and any second edge computing node is established, and the computing resource utilization rate and the distributed processing capacity of edge computing can be improved.

Drawings

FIG. 1 is a schematic diagram of a topology of an edge computing system provided in an embodiment of the present disclosure;

Fig. 2 is a schematic diagram of a flow of a communication collaboration method of edge computation according to an embodiment of the present disclosure;

fig. 3 is a schematic diagram of a flow of a method for determining a second edge computing node according to an embodiment of the present disclosure;

fig. 4 is a schematic diagram of a flow of a method for determining a second edge computing node according to an embodiment of the present disclosure;

fig. 5 is a schematic diagram of a flow of a method for determining a communication cooperative path according to an embodiment of the present disclosure;

fig. 6 is a schematic diagram of a flow of a mapping binding method of a communication collaboration path according to an embodiment of the present disclosure;

fig. 7 is a schematic diagram of a flow of a method for canceling mapping of a communication cooperative path according to an embodiment of the present disclosure;

FIG. 8 is a schematic diagram of a communication cooperative apparatus for edge computation according to an embodiment of the present disclosure;

fig. 9 is a schematic diagram of a computer device according to an embodiment of the present disclosure.

Detailed Description

In order to make the technical solution of the present specification better understood by those skilled in the art, the technical solution of the present specification embodiment will be clearly and completely described below with reference to the accompanying drawings in the embodiment of the present specification, and it is apparent that the described embodiment is only a part of the embodiment of the present specification, but not all the embodiments. All other embodiments, which can be made by one of ordinary skill in the art without undue burden from the present disclosure, are intended to be within the scope of the present disclosure.

With the rapid development of the internet of things, the access scale of terminal equipment, data and services is continuously increased, the explosive increased data volume is far more than the bearing capacity of network bandwidth, and the emergence of a large number of novel intelligent applications brings higher demands to the system delay performance.

The edge calculation is used as a new calculation mode, so that data can be effectively processed in time by an edge calculation system near the terminal equipment when the calculation resources and the energy consumption of the terminal equipment are limited or network congestion and high delay exist in the cloud of the system. In the edge computing mode, the terminal equipment can offload computing tasks to edge computing equipment in a nearby edge computing system for execution, and the network congestion and high delay problems caused by transmitting all data to a data center or a system cloud in traditional cloud computing can be effectively relieved.

For the electric power internet of things, the access scale of terminals, data and services in the electric power internet of things is continuously increased, and massive electric power data needs to be analyzed and calculated on edge computing equipment or edge computing nodes, so that efficient and flexible service processing and decision making are realized. In the edge computing mode, the bottleneck is mainly that the computing, communication, storage and other resources of the edge computing node are limited, and when the number of terminal devices and the data scale are further increased, the resources of the edge computing node tend to be saturated, so that the service quality of the edge computing node is easily reduced. However, in the related art, the allocation manner of the computing resources in the edge computing is single and passive, and there is a lack of an effective collaboration mechanism between the nodes, which results in a problem of low processing capacity of the computing task caused by difficulty in effectively utilizing the computing resources.

Therefore, it is necessary to provide a communication collaboration method for edge computing, which is capable of changing the operation mode of the edge computing nodes from a stand-alone independent operation mode to a distributed collaboration mode of a plurality of edge computing nodes according to the distributed characteristics of the electric power system service, so as to realize the 'edge-to-edge' communication collaboration between the edge computing nodes in the edge computing system, and improve the interoperability between the edge computing nodes, the interaction efficiency of the edge computing service, the computing resource utilization rate of the edge computing and the distributed processing capability.

Referring to fig. 1, fig. 1 is a schematic topology diagram of an edge computing system according to an embodiment of the present disclosure. An edge computing system may include a plurality of nodes and a plurality of links 130. Link 130 refers to a line between any two of a number of nodes for carrying information and data. The plurality of nodes may include a plurality of edge computing nodes 110 capable of edge computation. The plurality of nodes may also include a relay node 120 for communicating. Illustratively, any of the plurality of edge computing nodes 110 may be used for communication, i.e., any edge computing node 110 may act as a relay node 120 for communication.

Specifically, the plurality of edge computing nodes 110 may include a first edge computing node having a communication cooperative requirement, and a plurality of non-first edge computing nodes. The non-first edge computing node refers to an edge computing node 110 among the plurality of edge computing nodes 110 other than the first edge computing node.

In particular, a plurality of non-first edge computing nodes may include a second edge computing node for establishing a communication co-ordination with the first edge computing node.

In particular, the plurality of non-first edge computing nodes may include a designated node designated for establishing a communication synergistic relationship with the first edge computing node.

Referring to fig. 2, fig. 2 is a schematic flow chart of the communication collaboration method for edge computation, which provides the method operation steps as the flow chart, but may include more or less operation steps based on conventional or non-creative labor. The order of steps recited in the embodiments is merely one implementation of a plurality of step execution orders and does not represent a unique execution order. In actual system or server product execution, the methods illustrated in the embodiments may be performed sequentially or in parallel (e.g., in parallel processors or in the context of multi-threaded processing). The communication collaboration method can be applied to a first edge computing node with communication collaboration requirements in an edge computing system, and particularly as shown in fig. 2, the communication collaboration method can include the following steps.

Step S210: determining at least one second edge computing node according to the communication cooperative demand; the second edge computing node is a node used for establishing communication cooperative relationship with the first edge computing node in the plurality of nodes.

In some cases, when establishing an "edge-to-edge" communication coordination relationship based on edge computing nodes in an edge computing system, this may be done according to the communication coordination requirements of the first edge computing node. For example, when the size of the received service data further increases, the computing and storage resources of the first edge computing node tend to be saturated, which easily results in a decrease in computing processing capacity, and at this time, the computing resource utilization of the edge computing can be improved by generating a communication coordination requirement and establishing an "edge-to-edge" communication coordination relationship according to the communication coordination requirement, so as to improve the distributed processing capacity of the edge computing.

In this embodiment, the first edge computing node may determine at least one second edge computing node according to the communication cooperation requirement. Specifically, for example, the first edge computing node may determine a communication coordination requirement according to the received service information and computing resource information of the first edge computing node itself, and then determine at least one second edge computing node from the plurality of nodes according to the communication coordination requirement. In other words, at least one second edge computing node may be determined from a plurality of non-first edge computing nodes according to the communication cooperative requirement, so as to obtain a second edge computing node set including at least one second edge computing node, so as to establish a communication cooperative relationship between the first edge computing node and any second edge computing node in the second edge computing node set.

Step S220: and determining at least one communication cooperative path between the first edge computing node and the second edge computing node according to the communication delay and the available bandwidth of any link in the edge computing system and the communication cooperative demand aiming at any second edge computing node.

Any link may refer to a line between any two adjacent nodes in the plurality of nodes of the edge computing system. The first edge computing node may be a line between any one of the adjacent relay nodes, a line between any one of the relay nodes and any one of the adjacent relay nodes, and a line between any one of the second edge computing nodes and any one of the adjacent relay nodes. As an example, it may also be a line between a first edge computing node and any of its neighboring second edge computing nodes.

In this embodiment, for any second edge computing node, the first edge computing node may comprehensively determine one or more communication cooperative paths between the first edge computing node and the second edge computing node according to a communication delay and an available bandwidth of any link in the edge computing system and a communication cooperative demand of the first edge computing node. Specifically, for example, the first edge computing node may determine multiple paths between the first edge computing node and the second edge computing node based on communication delays and available bandwidths of all links, and select one or more communication collaboration paths from the multiple paths according to communication collaboration requirements.

In particular, a path may refer to a line between a first edge computing node and the second edge computing node. Wherein a path may comprise at least one link, in other words, a path may be composed of at least one link. The communication cooperative path is a path which is determined by selecting from a plurality of paths according to the communication cooperative demand and is used for establishing the communication cooperative relationship between the first edge computing node and the second edge computing node.

Step S230: at least one communication cooperative path is mapped to a physical route to establish a communication cooperative relationship between the first edge computing node and any of the second edge computing nodes.

In some cases, by determining one or more communication cooperative paths between a first edge computing node and any second edge computing node, a virtual path model between the first edge computing node and the second edge computing node may be obtained, and to establish a communication cooperative relationship between the first edge computing node and the second edge computing node, the one or more communication cooperative paths as the virtual path model may be mapped to a physical route.

In this embodiment, for any second edge computing node, the first edge computing node may map one or more communication cooperation paths between the first edge computing node and the second edge computing node to a physical route, so that the corresponding physical route carries the one or more communication cooperation paths between the first edge computing node and the second edge computing node.

In the above embodiment, the at least one second edge computing node for establishing a communication coordination relationship with the first edge computing node is determined according to the communication coordination requirement of the first edge computing node in the edge computing system, and then, for any second edge computing node, according to the communication delay and the available bandwidth of any link in the edge computing system and the communication coordination requirement of the first edge computing node, at least one communication coordination path between the first edge computing node and the second edge computing node is determined, and the at least one communication coordination path is mapped into a physical route, so that an "edge-edge" communication coordination relationship between the first edge computing node and any second edge computing node can be established, that is, a communication coordination network between the first edge computing node and at least one second edge computing node can be established, thereby, the computing resource utilization rate and the distributed processing capacity of edge computing can be improved, and the interoperability between the edge computing nodes and the interaction efficiency of edge computing services in the edge computing system can be improved.

In some embodiments, referring to fig. 3, determining at least one second edge computing node according to the communication collaboration requirement may include the following steps.

Step S310: judging whether the communication cooperative demand comprises functional coupling information or not; the functional coupling information may indicate that a service interaction relationship exists between the first edge computing node and at least one designated node.

In some cases, the communication cooperative requirement of the first edge computing node may include functional coupling information, where the functional coupling information may indicate that a traffic interaction relationship exists between the first edge computing node and the specified one or more specified nodes, or may indicate that a traffic of functional coupling exists between the first edge computing node and the specified one or more specified nodes, where at this time, when determining at least one second edge computing node for establishing a communication cooperative relationship with the first edge computing node, the functional coupling information may be statically determined, that is, may directly specify, as the second edge computing node, one or more specified nodes that need to establish the communication cooperative relationship.

Step S320: if the communication cooperative demand comprises functional coupling information, taking at least one designated node as a second edge computing node; wherein the designated node is a non-first edge computing node in the edge computing system.

In this embodiment, if the communication cooperative demand includes the functional coupling information, the first edge computing node may use the specified one or more specified nodes as the second edge computing node that establishes the communication cooperative relationship with the first edge computing node based on the functional coupling information. The service application of the first edge computing node may illustratively use the designated one or more designated nodes as second edge computing nodes which establish a communication cooperative relationship with the first edge computing node to obtain a second edge computing node set comprising at least one second edge computing node. Illustratively, the designated node may be a non-first edge computing node in the edge computing system. For example, the communication collaboration requirement may include a bandwidth requirement and a computational force requirement, and the designated node may be a non-first edge computing node in the edge computing system that satisfies the bandwidth requirement and the computational force requirement. As an example, the coupling information may be determined from the first edge computing node based on the received traffic information and the computing resource information of the first edge computing node itself.

In the above embodiment, by judging whether the communication cooperative demand includes the functional coupling information, and using the specified one or more specified nodes as the second edge computing nodes establishing the communication cooperative relationship with the first edge computing node in the case that the communication cooperative demand includes the functional coupling information, in this way, in the case that a service interaction relationship exists between the first edge computing node and the specified one or more specified nodes, at least one second edge computing node for establishing the communication cooperative relationship with the first edge computing node can be directly determined through the specification, so that static determination of the one or more second edge computing nodes for establishing the communication cooperative relationship with the first edge computing node is realized.

In some implementations, the communication coordination requirement may include a computational power requirement. Referring to fig. 4, determining at least one second edge computing node according to the communication cooperation requirement may include the following steps.

Step S410: if the communication collaboration requirement does not include functional coupling information, determining available computing power of a non-first edge computing node in the edge computing system.

In some cases, where the communication collaboration requirement does not include functional coupling information, i.e., traffic indicating that there is no functional coupling between the first edge computing node and any non-first edge computing nodes, the determination may be made dynamically from the non-first edge computing nodes in the edge computing system when determining at least one second edge computing node for establishing a communication collaboration relationship with the first edge computing node.

In this embodiment, the first edge computing node may determine whether the communication cooperation requirement includes the functional coupling information, and if the communication cooperation requirement does not include the functional coupling information, determine an available computing power of a non-first edge computing node in the edge computing system, so as to determine the second edge computing node based on the available computing power of the non-first edge computing node. Specifically, for example, the first edge computing node may broadcast a computing power query request to any non-first edge computing node in the edge computing system by broadcasting, and receive available computing power fed back by any non-first edge computing node after receiving the computing power query request.

Step S420: and sequentially selecting the maximum available computing force of non-first edge computing nodes in the edge computing system as the second edge computing nodes until the sum of the available computing forces of at least one second edge computing node meets the computing force requirement.

In this embodiment, after determining available computing forces of a plurality of non-first edge computing nodes in the edge computing system, the first edge computing node may sequentially select one of the plurality of non-first edge computing nodes with the largest available computing force as the second edge computing node until the sum of the obtained available computing forces of at least one second edge computing node meets the computing force requirement, and obtain a second edge computing node set including at least one second edge computing node. Specifically, for example, the first edge computing node may sort the plurality of non-first edge computing nodes according to the magnitude of the available computing force, obtain a plurality of non-first edge computing nodes sorted according to the magnitude of the available computing force from large to small, sequentially select a first non-first edge computing node of the sorted plurality of non-first edge computing nodes as a second edge computing node, add the second edge computing node set, calculate the sum of the available computing forces of all the second edge computing nodes in the second edge computing node set after each selection, and determine whether the sum of the available computing forces meets the computing force requirement of the communication cooperation requirement, if so, end the selection, otherwise, continue the selection.

In the above embodiment, by determining the available computing forces of the non-first edge computing nodes in the edge computing system, and sequentially selecting one of the plurality of non-first edge computing nodes with the largest available computing force as the second edge computing node until the sum of the available computing forces of the obtained at least one second edge computing node meets the computing force requirement, one or more second edge computing nodes for establishing a communication cooperative relationship with the first edge computing node may be dynamically and preferably determined from the edge computing system based on the computing force requirement and the available computing forces of the non-first edge computing node.

In some embodiments, referring to fig. 5, for any second edge computing node, determining at least one communication collaboration path between the first edge computing node and the second edge computing node according to a communication latency and an available bandwidth of any link in the edge computing system, and a communication collaboration requirement may include the following steps.

Step S510: determining the link weight of any link according to the communication delay and the available bandwidth of any link in the edge computing system; wherein any link is a line between any node in the edge computing system and any adjacent node thereof.

In some cases, after determining at least one second edge computing node for establishing a communication collaboration relationship with the first edge computing node, a determination may be made of a communication collaboration path between the first edge computing node and any second edge computing node based on link weights of any link in the edge computing system.

In this embodiment, the first edge computing node may determine the link weight of any link in the edge computing system according to the communication latency and the available bandwidth of any link. In particular, the first edge computing node may, after determining the at least one second edge computing node, generate a communication collaboration link table between the first edge computing node and the at least one second edge computing node from the at least one second edge computing node, which may include all relevant links between the first edge computing node and the at least one second edge computing node and their connection relations. Specifically, for example, the first edge computing node may determine the link weight of any link according to the communication latency and the available bandwidth of any link in the communication collaboration link table.

Illustratively, the link weights for any link may be determined according to equation 1, where L _i，j Representing the link between any node i and any adjacent node j thereof, B _i，j Representing link L _i，j T is the available bandwidth of (1) _i，j Representing link L _i，j Is used for the communication delay of the (a),representing link L _i，j Is used for the link weight of the (c).

Equation 1

Step S520: determining a corresponding path set according to the link weight of a link in the edge computing system aiming at any second edge computing node; the path set comprises at least one path, the path is a line between the first edge computing node and any second edge computing node, and the path comprises at least one link.

In this embodiment, for any second edge computing node, the first edge computing node may determine, according to the link weight of the link in the edge computing system, a corresponding path set between the first edge computing node and the second edge computing node. Specifically, for example, the first edge computing node may determine, according to the link weight of any link of the communication cooperative link table and the connection relationship between the links, a complete path between the first edge computing node and the second edge computing node, so as to obtain a path set between the first edge computing node and the second edge computing node. Any path in the set of paths includes one or more links.

For example, the first edge computing node may determine a set of paths between the first edge computing node and any of the second edge computing nodes using a path search algorithm based on the link weights of any of the links. The path search algorithm may be, for example, the Dijkstra algorithm.

Step S530: and determining the path weight of any path in the path set according to the available bandwidth and the communication delay of each link contained in any path.

In this embodiment, after determining the path set between the first edge computing node and any second edge computing node, the first edge computing node may determine, for any path in the path set, a path weight of the path according to an available bandwidth and a communication delay of each link included in the path. Illustratively, the path weights for any of the paths may be determined according to equation 2. Wherein R is _s，d Represents any path between a first edge computing node s and any second edge computing node d, i.e. represents the set of links, or one or more links, that any path between a first edge computing node s and any second edge computing node d passes through. min { B _i，j And any path R _s，d The minimum available bandwidth of the link traversed. max { B _i，j And any path R _s，d The maximum available bandwidth of the link traversed.Representing the path weight of any path between the first edge computing node s and any second edge computing node.

Equation 2

Step S540: and determining at least one communication cooperative path between the first edge computing node and any second edge computing node according to the path weight of each path in the path set and the communication cooperative demand.

In this embodiment, after determining the path weight of each path in the path set between the first edge computing node and any second edge computing node, the first edge computing node may determine at least one communication cooperative path between the first edge computing node and the second edge computing node according to the path weight of each path and the communication cooperative requirement. In particular, the communication collaboration requirement may include a bandwidth requirement. The first edge computing node may, for each path in the set of paths, take as the path bandwidth of the path the minimum available bandwidth of the links through which the path passes. The first edge computing node can select one or more paths from the path set based on the path weight, evaluate the path bandwidth of the one or more paths according to the bandwidth requirement, and use the selected one or more paths as one or more communication cooperative paths between the first edge computing node and the second edge computing node according to the evaluation result.

Specifically, the first edge computing node may sequentially select the path with the largest path weight in the path set as the communication cooperative path until the sum of the path bandwidths of the obtained one or more communication cooperative paths meets the bandwidth requirement. For example, the communication synergy path may be determined by formula 3, that is, the path weight maximum may be selected from the path set by formula 3. Wherein V is _R Representing a communication cooperative path between a first edge computing node s and a second edge computing node d, B _s Representing the bandwidth requirement among the communication co-demands of the first edge computing node s,representing the maximum path weight between the first edge computing node s and the second edge computing node d.

Equation 3

For example, assuming that the path set includes k paths, the k paths in the path set may be selected by equation 3 to obtain a path R1 (s, d 1) corresponding to the maximum path weight, where d1 represents any second edge computing node in the second edge computing node set, if the path bandwidth of the path R1 (s, d 1) meets the bandwidth requirement B _s Then the path R1 (s, d 1) is used as a first edge calculation node s and a second edge meterCommunication cooperative path V between computing nodes d1 _R1 . If the path bandwidth of the path R1 (s, d 1) does not meet the bandwidth requirement Bs, continuing to select the k-1 paths remaining in the path set through the formula 3 to obtain a path R2 (s, d 1) corresponding to the maximum path weight in the remaining paths, and if the sum of the path bandwidths of the path R1 (s, d 1) and the path R2 (s, d 1) meets the bandwidth requirement Bs, taking both the path R1 (s, d 1) and the path R2 (s, d 1) as a communication cooperative path V between the first edge computing node s and the second edge computing node d1 _R1 、V _R2 . If the sum of the path bandwidths of the path R1 (s, d 1) and the path R2 (s, d 1) does not meet the bandwidth requirement Bs, continuing to select the rest paths until the sum of the path bandwidths of the selected paths meets the bandwidth requirement Bs, and taking the selected paths as communication cooperative paths.

In this way, for each second edge computing node in the second edge computing node set including m second edge computing nodes, the corresponding path set is selected according to formula 3, so that one or more communication cooperative paths of the first edge computing node and each second edge computing node can be obtained:

{{V _R1 (s，d1)，V _R2 (s，d1)，……，V _Rn (s，d1)}，

{V _R1 (s，d2)，V _R2 (s，d2)，……，V _Rn (s，d2)}，

……，

{V _R1 (s，dm)，V _R2 (s，dm)，……，V _Rn (s，dm)}}。

in the above embodiment, the virtual path model between the first edge computing node and the second edge computing node may be obtained by determining the link weight of the link according to the communication delay and the available bandwidth of the link, determining the path set between the first edge computing node and the second edge computing node by using the path search algorithm based on the link weight, determining the path weight of each path in the path set based on the available bandwidth and the communication delay of the link, and determining one or more communication cooperative paths between the first edge computing node and the second edge computing node from the path set by using the path weight and the bandwidth requirement, so that the one or more communication cooperative paths serving as the virtual path model may be mapped into physical routes subsequently, thereby establishing the communication cooperative relationship between the first edge computing node and the second edge computing node.

In some implementations, the communication collaboration requirement may include a bandwidth requirement. The communication cooperative path may include at least one relay node, wherein the relay node may be a node of the plurality of nodes for communication between the first edge computing node and any of the second edge computing nodes.

In this embodiment, referring to fig. 6, mapping at least one communication cooperative path to a physical route to establish a communication cooperative relationship between a first edge computing node and any second edge computing node may include the following steps.

Step S610: a path map signaling frame is generated for any communication cooperative path based on a first edge computing node in the edge computing system.

In some cases, after determining one or more communication cooperative paths between the first edge computing node and any second edge computing node in the second edge computing node set, one or more communication cooperative paths serving as a virtual path model need to be mapped into physical routes on the edge computing system, so that the one or more communication cooperative paths are carried through corresponding physical routes, and establishment of a communication cooperative relationship is achieved.

In this embodiment, the first edge computing node may generate a communication cooperative routing table for performing signaling interaction between the first edge computing node and any second edge computing node in the second edge computing node set based on any communication cooperative path between the first edge computing node and any second edge computing node, and generate a path mapping signaling frame based on the obtained communication cooperative routing table.

Step S620: and transmitting a path mapping signaling frame along any communication cooperative path to indicate all relay nodes on any communication cooperative path, and reserving bandwidth resources meeting the bandwidth requirements according to the path mapping signaling frame.

In this embodiment, the first edge computing node may send a path mapping signaling frame along any communication cooperative path to indicate all relay nodes on the communication cooperative path, and reserve bandwidth resources meeting the bandwidth requirement according to the path mapping signaling frame. Specifically, for example, the first edge computing node may send the path mapping signaling frame according to the communication cooperative routing table, so as to forward the path mapping signaling frame along the corresponding communication cooperative path, thereby indicating that all relay nodes on the corresponding communication cooperative path reserve bandwidth resources that meet the bandwidth requirement.

Step S630: and receiving a path mapping confirmation frame fed back by any relay node of any communication cooperative path after receiving the path mapping signaling frame.

In this embodiment, the first edge computing node may receive a path mapping acknowledgement frame fed back by any relay node of any communication cooperative path after receiving a path mapping signaling frame. Specifically, after receiving the path mapping signaling frame and reserving bandwidth resources according to the path mapping signaling frame, the relay node on any communication cooperative path may feed back a path mapping acknowledgement frame along the communication cooperative path, and the first edge computing node may receive the path mapping acknowledgement frame fed back by the relay node.

Step S640: and under the condition that path mapping confirmation frames fed back by all relay nodes of at least one communication cooperative path are received, confirming that the at least one communication cooperative path is mapped into an actual physical route on an edge computing system, and establishing a communication cooperative relationship between a first edge computing node and any second edge computing node.

In this embodiment, for any second edge computing node, the first edge computing node may confirm that mapping binding of actual physical routes of all communication cooperative paths between the first edge computing node and the second edge computing node on the edge computing system is completed when receiving a path mapping confirmation frame fed back by all relay nodes of all communication cooperative paths between the first edge computing node and the second edge computing node, thereby completing establishment of a communication cooperative relationship between the first edge computing node and the second edge computing node.

In some embodiments, referring to fig. 7, the communication collaboration method may further include the following steps.

Step S710: based on a first edge computing node in the edge computing system, a co-ordination release signaling frame is generated for any communication co-path.

In some cases, mapping the bound physical routes on the edge computing system for one or more communication collaboration paths between the first edge computing node and any second edge computing node requires that the bound physical routes be removed, thereby removing the communication collaboration relationship established between the first edge computing node and any second edge computing node.

In this embodiment, the first edge computing node may generate the release-of-collaboration signaling frame based on a communication collaboration routing table of any communication collaboration path between the first edge computing node and the second edge computing node.

Step S720: and sending a cooperative cancellation signaling frame along any communication cooperative path to instruct all relay nodes on any communication cooperative path to release bandwidth resources.

In this embodiment, the first edge computing node may send a cooperative cancellation signaling frame along a communication cooperative path corresponding to the communication cooperative routing table, so as to instruct all relay nodes on the communication cooperative path to release the reserved bandwidth resource according to the cooperative cancellation signaling frame. Specifically, for example, the first edge computing node may send a coordination release signaling frame according to the communication coordination routing table, so as to forward the coordination release signaling frame along a corresponding communication coordination path, thereby indicating all relay nodes on the corresponding communication coordination path to release bandwidth resources.

Step S730: and any relay node receiving any communication cooperative path feeds back a cooperative cancellation confirmation frame after receiving the cooperative cancellation signaling frame.

Step S740: and under the condition that the communication cooperative relation between the first edge computing node and any second edge computing node is confirmed to be released when the cooperative release confirmation frames fed back by all relay nodes of at least one communication cooperative path are received.

In this embodiment, for any second edge computing node, when receiving the cooperative cancellation acknowledgement frame fed back by all relay nodes of all communication cooperative paths between the first edge computing node and the second edge computing node, the first edge computing node may cancel the actual physical route to which all communication cooperative paths between the first edge computing node and the second edge computing node are mapped and bound on the edge computing system, thereby canceling the communication cooperative relationship between the first edge computing node and the second edge computing node.

The embodiment of the specification provides a communication cooperation method for edge computing, which can be applied to a first edge computing node with communication cooperation requirements in an edge computing system. The communication cooperation method may include the following steps.

Step S802: determining at least one second edge computing node according to the communication cooperative demand; the second edge computing node is a node used for establishing communication cooperative relationship with the first edge computing node in the plurality of nodes.

Specifically, it may be determined whether the communication cooperation requirement includes the function coupling information; the functional coupling information may indicate that a service interaction relationship exists between the first edge computing node and at least one designated node. If the communication cooperative demand comprises functional coupling information, taking at least one designated node as a second edge computing node; wherein the designated node is a non-first edge computing node in the edge computing system.

Specifically, if the communication collaboration requirement does not include functional coupling information, determining available computing power for a non-first edge computing node in the edge computing system. And sequentially selecting the maximum available computing force of non-first edge computing nodes in the edge computing system as the second edge computing nodes until the sum of the available computing forces of at least one second edge computing node meets the computing force requirement.

Step S804: determining the link weight of any link according to the communication delay and the available bandwidth of any link in the edge computing system; wherein any link is a line between any node in the edge computing system and any adjacent node thereof.

Step S806: determining a corresponding path set according to the link weight of a link in the edge computing system aiming at any second edge computing node; the path set comprises at least one path, the path is a line between the first edge computing node and any second edge computing node, and the path comprises at least one link.

Step S808: and determining the path weight of any path in the path set according to the available bandwidth and the communication delay of each link contained in any path.

Step S810: and determining at least one communication cooperative path between the first edge computing node and any second edge computing node according to the path weight of each path in the path set and the communication cooperative demand.

Step S812: a path map signaling frame is generated for any communication cooperative path.

Step S814: and transmitting a path mapping signaling frame along any communication cooperative path to indicate all relay nodes on any communication cooperative path, and reserving bandwidth resources meeting the bandwidth requirements according to the path mapping signaling frame.

Step S816: and receiving a path mapping confirmation frame fed back by any relay node of any communication cooperative path after receiving the path mapping signaling frame.

Step S818: and under the condition that path mapping confirmation frames fed back by all relay nodes of at least one communication cooperative path are received, confirming that the at least one communication cooperative path is mapped into an actual physical route on an edge computing system, and establishing a communication cooperative relationship between a first edge computing node and any second edge computing node.

Step S820: for any communication cooperative path, a cooperative cancellation signaling frame is generated.

Step S822: and sending a cooperative cancellation signaling frame along any communication cooperative path to instruct all relay nodes on any communication cooperative path to release bandwidth resources.

Step S824: and any relay node receiving any communication cooperative path feeds back a cooperative cancellation confirmation frame after receiving the cooperative cancellation signaling frame.

Step S826: and under the condition that the communication cooperative relation between the first edge computing node and any second edge computing node is confirmed to be released when the cooperative release confirmation frames fed back by all relay nodes of at least one communication cooperative path are received.

The embodiment of the specification provides a communication cooperative device for edge calculation. The communication collaboration device can be applied to an edge computing system. Referring to fig. 8, the communication cooperative apparatus may include an initialization module 810, a path determination module 820, and a route mapping module 830.

An initialization module 810, configured to determine at least one second edge computing node according to the communication coordination requirement; the second edge computing node is a node used for establishing a communication cooperative relationship with the first edge computing node in the plurality of nodes; the path determining module 820 is configured to determine, for any second edge computing node, at least one communication cooperative path between the first edge computing node and any second edge computing node according to a communication delay and an available bandwidth of any link in the edge computing system, and a communication cooperative demand; the route mapping module 830 is configured to map at least one communication cooperative path to a physical route, so as to establish a communication cooperative relationship between the first edge computing node and any second edge computing node.

In some implementations, the initialization module may include a static initialization module; the static initialization module is used for taking at least one designated node as at least one second edge computing node if the communication cooperative demand comprises functional coupling information; the designated node is a non-first edge computing node in the edge computing system, and the functional coupling information indicates that a business interaction relationship exists between the first edge computing node and at least one designated node.

In some implementations, the initialization module may include a dynamic initialization module; the dynamic initialization module is used for determining available computing power of a non-first edge computing node in the edge computing system if the communication cooperative demand does not include the functional coupling information; and sequentially selecting the maximum available computing force of non-first edge computing nodes in the edge computing system as the second edge computing nodes until the sum of the available computing forces of at least one second edge computing node meets the computing force requirement.

In some implementations, the path determination module may include: the link weight determining module is used for determining the link weight of any link according to the communication delay and the available bandwidth of any link in the edge computing system; any link is a line between any node in the edge computing system and any adjacent node thereof; the path set determining module is used for determining a corresponding path set according to the link weight of the link in the edge computing system aiming at any second edge computing node; the path set comprises at least one path, the path is a line between a first edge computing node and any second edge computing node, and the path comprises at least one link; the path weight determining module is used for determining the path weight of any path in the path set according to the available bandwidth and the communication delay of each link contained in any path; and the cooperative path determining module is used for determining at least one communication cooperative path between the first edge computing node and any second edge computing node according to the path weight and the communication cooperative demand of each path in the path set.

In some embodiments, the cooperative path determining module may be configured to sequentially select, as the communication cooperative path, the path with the largest path weight in the path set until the sum of the path bandwidths of the obtained at least one communication cooperative path meets the bandwidth requirement; wherein the path bandwidth is determined based on the available bandwidth of the links in the corresponding path.

In some embodiments, the route mapping module may include: the first mapping module is used for generating a path mapping signaling frame aiming at any communication cooperative path based on a first edge computing node in the edge computing system; the second mapping module is used for sending a path mapping signaling frame along any communication cooperative path so as to indicate all relay nodes on any communication cooperative path, and bandwidth resources meeting bandwidth requirements are reserved according to the path mapping signaling frame; the third mapping module is used for receiving a path mapping confirmation frame fed back by any relay node of any communication cooperative path after receiving the path mapping signaling frame; and the fourth mapping module is used for confirming that the at least one communication cooperative path is mapped into an actual physical route on the edge computing system under the condition that path mapping confirmation frames fed back by all relay nodes of the at least one communication cooperative path are received so as to establish a communication cooperative relationship between the first edge computing node and any second edge computing node.

In some embodiments, the communication cooperative apparatus may further include: a first cancellation module configured to generate a cancellation signaling frame for any communication cooperative path based on a first edge computing node in the edge computing system; a second releasing module, configured to send a cooperative releasing signaling frame along any communication cooperative path, so as to instruct all relay nodes on any communication cooperative path to release bandwidth resources; the third release module is used for receiving a cooperative release confirmation frame fed back by any relay node of any communication cooperative path after receiving a cooperative release signaling frame; and the fourth cancellation module is used for confirming and canceling the communication cooperative relationship between the first edge computing node and any second edge computing node under the condition that the cooperative cancellation confirmation frames fed back by all relay nodes of at least one communication cooperative path are received.

The specific functions and effects achieved by the communication cooperative apparatus may be explained with reference to other embodiments of the present specification, and will not be described herein. The various modules in the communication collaboration device may be implemented in whole or in part by software, hardware, and combinations thereof. The modules can be embedded in hardware or independent of a processor in the computer device, or can be stored in a memory in the computer device in a software mode, so that the processor can call and execute the operations corresponding to the modules.

Referring to fig. 9, in some embodiments, a computer apparatus may be provided, including a memory and a processor, where the memory stores a computer program, and the processor implements the communication collaboration method in the above embodiments when executing the computer program.

The present specification embodiment also provides a computer-readable storage medium having stored thereon a computer program which, when executed by a computer, causes the computer to perform the communication cooperation method in any of the above embodiments.

The present description also provides a computer program product comprising instructions which, when executed by a computer, cause the computer to perform the communication collaboration method of any of the above embodiments.

In one embodiment, a computer device is provided, which may be a terminal, and the internal structure thereof may be as shown in fig. 9. The computer device includes a processor, a memory, and a communication interface connected by a system bus. Wherein the processor of the computer device is configured to provide computing and control capabilities. The memory of the computer device includes a non-volatile storage medium and an internal memory. The non-volatile storage medium stores an operating system and a computer program. The internal memory provides an environment for the operation of the operating system and computer programs in the non-volatile storage media. The communication interface of the computer device is used for carrying out wired or wireless communication with an external terminal, and the wireless mode can be realized through WIFI, an operator network, NFC (near field communication) or other technologies. The computer program is executed by a processor to implement a communication collaboration method.

It will be appreciated that the specific examples herein are intended only to assist those skilled in the art in better understanding the embodiments of the present disclosure and are not intended to limit the scope of the present invention.

It should be understood that, in various embodiments of the present disclosure, the sequence number of each process does not mean that the execution sequence of each process should be determined by the function and the internal logic, and should not constitute any limitation on the implementation process of the embodiments of the present disclosure.

It will be appreciated that the various embodiments described in this specification may be implemented either alone or in combination, and are not limited in this regard.

Unless defined otherwise, all technical and scientific terms used in the embodiments of this specification have the same meaning as commonly understood by one of ordinary skill in the art to which this specification belongs. The terminology used in the description is for the purpose of describing particular embodiments only and is not intended to limit the scope of the description. The term "and/or" as used in this specification includes any and all combinations of one or more of the associated listed items. As used in this specification and the appended claims, the singular forms "a," "an," and "the" are intended to include the plural forms as well, unless the context clearly indicates otherwise.

It will be appreciated that the processor of the embodiments of the present description may be an integrated circuit chip having signal processing capabilities. In implementation, the steps of the above method embodiments may be implemented by integrated logic circuits of hardware in a processor or instructions in software form. The processor may be a general purpose processor, a Digital signal processor (Digital SignalProcessor, DSP), an application specific integrated circuit (Application Specific Integrated Circuit, ASIC), an off-the-shelf programmable gate array (Field Programmable Gate Array, FPGA) or other programmable logic device, discrete gate or transistor logic device, discrete hardware components. The methods, steps and logic blocks disclosed in the embodiments of the present specification may be implemented or performed. A general purpose processor may be a microprocessor or the processor may be any conventional processor or the like. The steps of a method disclosed in connection with the embodiments of the present specification may be embodied directly in hardware, in a decoded processor, or in a combination of hardware and software modules in a decoded processor. The software modules may be located in a random access memory, flash memory, read only memory, programmable read only memory, or electrically erasable programmable memory, registers, etc. as well known in the art. The storage medium is located in a memory, and the processor reads the information in the memory and, in combination with its hardware, performs the steps of the above method.

It will be appreciated that the memory in the embodiments of this specification may be either volatile memory or nonvolatile memory, or may include both volatile and nonvolatile memory. The nonvolatile memory may be a read-only memory (ROM), a Programmable ROM (PROM), an Erasable Programmable ROM (EPROM), an Electrically Erasable Programmable ROM (EEPROM), or a flash memory, among others. The volatile memory may be Random Access Memory (RAM). It should be noted that the memory of the systems and methods described herein is intended to comprise, without being limited to, these and any other suitable types of memory.

Those of ordinary skill in the art will appreciate that the elements and algorithm steps described in connection with the embodiments disclosed herein can be implemented as electronic hardware, or combinations of computer software and electronic hardware. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the solution. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present specification.

It will be clear to those skilled in the art that, for convenience and brevity of description, specific working procedures of the above-described system, apparatus and unit may refer to corresponding procedures in the foregoing method embodiments, and are not repeated herein.

In the several embodiments provided in this specification, it should be understood that the disclosed systems, apparatuses, and methods may be implemented in other ways. For example, the apparatus embodiments described above are merely illustrative, e.g., the division of the units is merely a logical function division, and there may be additional divisions when actually implemented, e.g., multiple units or components may be combined or integrated into another system, or some features may be omitted or not performed. Alternatively, the coupling or direct coupling or communication connection shown or discussed with each other may be an indirect coupling or communication connection via some interfaces, devices or units, which may be in electrical, mechanical or other form.

The units described as separate units may or may not be physically separate, and units shown as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the embodiment.

In addition, each functional unit in each embodiment of the present specification may be integrated into one processing unit, each unit may exist alone physically, or two or more units may be integrated into one unit.

The functions, if implemented in the form of software functional units and sold or used as a stand-alone product, may be stored in a computer-readable storage medium. Based on this understanding, the technical solutions of the present specification may be essentially or portions contributing to the prior art or portions of the technical solutions may be embodied in the form of a software product stored in a storage medium, including several instructions to cause a computer device (which may be a personal computer, a server, or a network device, etc.) to perform all or part of the steps of the methods described in the embodiments of the present specification. And the aforementioned storage medium includes: a usb disk, a removable hard disk, a read-only memory (ROM), a random-access memory (RAM), a magnetic disk, or an optical disk, etc.

The foregoing is merely specific embodiments of the present disclosure, but the scope of the present disclosure is not limited thereto, and any person skilled in the art can easily think about changes or substitutions within the technical scope disclosed in the present disclosure, and should be covered by the scope of the present disclosure. Therefore, the protection scope of the present invention shall be subject to the protection scope of the claims.

Claims

1. A communication collaboration method of edge computing, wherein the communication collaboration method is applied to an edge computing system, and the edge computing system comprises a plurality of nodes, wherein the plurality of nodes comprise first edge computing nodes with communication collaboration requirements; the method comprises the following steps:

determining at least one second edge computing node according to the communication cooperative demand; wherein the second edge computing node is a node of the plurality of nodes for establishing a communication cooperative relationship with the first edge computing node;

determining at least one communication cooperative path between the first edge computing node and any second edge computing node according to the communication delay and the available bandwidth of any link in the edge computing system and the communication cooperative demand;

mapping the at least one communication cooperative path into a physical route to establish a communication cooperative relationship between the first edge computing node and any one of the second edge computing nodes.

2. The communication collaboration method of claim 1, wherein the determining at least one second edge computing node according to the communication collaboration requirement comprises:

If the communication cooperative demand comprises functional coupling information, taking at least one designated node as the at least one second edge computing node; the designated node is a non-first edge computing node in the edge computing system, and the functional coupling information indicates that a business interaction relationship exists between the first edge computing node and the at least one designated node.

3. The communication cooperation method according to claim 1, wherein the communication cooperation requirement includes a calculation force requirement;

the determining at least one second edge computing node according to the communication cooperative demand comprises the following steps:

if the communication cooperative demand does not include functional coupling information, determining available computing power of a non-first edge computing node in the edge computing system;

and sequentially selecting the maximum available computing force of non-first edge computing nodes in the edge computing system as second edge computing nodes until the sum of the available computing forces of at least one second edge computing node meets the computing force requirement.

4. The method according to claim 1, wherein the determining, for any second edge computing node, at least one communication collaboration path between the first edge computing node and any second edge computing node according to the communication latency and the available bandwidth of any link in the edge computing system and the communication collaboration requirement includes:

Determining the link weight of any link in the edge computing system according to the communication delay and the available bandwidth of the any link; wherein, any link is a line between any node in the edge computing system and any adjacent node thereof;

determining a corresponding path set according to the link weight of a link in the edge computing system aiming at any second edge computing node; wherein the path set comprises at least one path, the path is a line between the first edge computing node and any second edge computing node, and the path comprises at least one link;

determining path weights of any paths in the path set according to the available bandwidth and communication delay of each link contained in the any paths;

and determining at least one communication cooperative path between the first edge computing node and any second edge computing node according to the path weight of each path in the path set and the communication cooperative demand.

5. The communication collaboration method of claim 4, wherein the communication collaboration requirement comprises a bandwidth requirement;

The determining at least one communication cooperative path between the first edge computing node and any second edge computing node according to the path weight of each path in the path set and the communication cooperative demand includes:

sequentially selecting the path weight with the largest path weight in the path set as a communication cooperative path until the sum of the path bandwidths of the obtained at least one communication cooperative path meets the bandwidth requirement; wherein the path bandwidth is determined based on the available bandwidth of the links in the corresponding path.

6. The communication collaboration method of claim 1, wherein the communication collaboration requirement comprises a bandwidth requirement; the communication cooperative path comprises at least one relay node, wherein the relay node is a node used for communication between the first edge computing node and any second edge computing node in the plurality of nodes;

the mapping the at least one communication cooperative path to a physical route to establish a communication cooperative relationship between the first edge computing node and any second edge computing node includes:

generating a path mapping signaling frame for any communication cooperative path based on the first edge computing node in the edge computing system;

Transmitting the path mapping signaling frame along any communication cooperative path to indicate all relay nodes on the any communication cooperative path, and reserving bandwidth resources meeting the bandwidth requirements according to the path mapping signaling frame;

receiving a path mapping confirmation frame fed back by any relay node of any communication cooperative path after receiving the path mapping signaling frame;

and under the condition that path mapping confirmation frames fed back by all relay nodes of the at least one communication cooperative path are received, the at least one communication cooperative path is confirmed to be mapped into an actual physical route on the edge computing system, so that a communication cooperative relationship between the first edge computing node and any second edge computing node is established.

7. The communication cooperation method according to claim 6, characterized in that the communication cooperation method further comprises:

generating a co-ordination release signaling frame for the arbitrary communication co-path based on the first edge computing node in the edge computing system;

transmitting the coordination release signaling frame along any communication coordination path to instruct all relay nodes on the any communication coordination path to release the bandwidth resource;

Receiving a cooperative cancellation acknowledgement frame fed back by any relay node of any communication cooperative path after receiving the cooperative cancellation signaling frame;

and confirming to release the communication cooperative relationship between the first edge computing node and any second edge computing node under the condition that the cooperative release confirmation frames fed back by all relay nodes of the at least one communication cooperative path are received.

8. A communication collaboration apparatus for edge computing, wherein the communication collaboration apparatus is applied to an edge computing system, the edge computing system comprising a plurality of nodes, the plurality of nodes comprising a first edge computing node having a communication collaboration requirement; the communication cooperative apparatus includes:

the initialization module is used for determining at least one second edge computing node according to the communication cooperative demand; wherein the second edge computing node is a node of the plurality of nodes for establishing a communication cooperative relationship with the first edge computing node;

the path determining module is used for determining at least one communication cooperative path between the first edge computing node and any second edge computing node according to the communication delay and the available bandwidth of any link in the edge computing system and the communication cooperative demand;

And the route mapping module is used for mapping the at least one communication cooperative path into a physical route so as to establish a communication cooperative relationship between the first edge computing node and any second edge computing node.

9. The communication collaboration apparatus of claim 8, wherein the initialization module comprises a static initialization module; the static initialization module is configured to take at least one designated node as the at least one second edge computing node if the communication coordination requirement includes functional coupling information; the designated node is a non-first edge computing node in the edge computing system, and the functional coupling information indicates that a business interaction relationship exists between the first edge computing node and the at least one designated node.

10. The communication collaboration apparatus of claim 8, wherein the communication collaboration requirement comprises a computational force requirement;

the initialization module comprises a dynamic initialization module; the dynamic initialization module is configured to determine an available computing power of a non-first edge computing node in the edge computing system if the communication coordination requirement does not include functional coupling information; and sequentially selecting the maximum available computing force of non-first edge computing nodes in the edge computing system as second edge computing nodes until the sum of the available computing forces of at least one second edge computing node meets the computing force requirement.

11. The communication cooperative apparatus as recited in claim 8, wherein the path determination module comprises:

the link weight determining module is used for determining the link weight of any link in the edge computing system according to the communication time delay and the available bandwidth of the any link; wherein, any link is a line between any node in the edge computing system and any adjacent node thereof;

the path set determining module is used for determining a corresponding path set according to the link weight of a link in the edge computing system aiming at any second edge computing node; wherein the path set comprises at least one path, the path is a line between the first edge computing node and any second edge computing node, and the path comprises at least one link;

the path weight determining module is used for determining the path weight of any path in the path set according to the available bandwidth and the communication delay of each link contained in the any path;

and the cooperative path determining module is used for determining at least one communication cooperative path between the first edge computing node and any second edge computing node according to the path weight of each path in the path set and the communication cooperative demand.

12. The communication collaboration apparatus of claim 11, wherein the communication collaboration requirement comprises a bandwidth requirement; the cooperative path determining module is used for sequentially selecting the path weight with the largest path weight in the path set as a communication cooperative path until the sum of the path bandwidths of the obtained at least one communication cooperative path meets the bandwidth requirement; wherein the path bandwidth is determined based on the available bandwidth of the links in the corresponding path.

13. The communication collaboration apparatus of claim 8, wherein the communication collaboration demand comprises a bandwidth demand; the communication cooperative path comprises at least one relay node, wherein the relay node is a node used for communication between the first edge computing node and any second edge computing node in the plurality of nodes; the route mapping module comprises:

a first mapping module, configured to generate a path mapping signaling frame for any communication cooperative path based on the first edge computing node in the edge computing system;

the second mapping module is used for sending the path mapping signaling frame along any communication cooperative path to indicate all relay nodes on the any communication cooperative path, and reserving bandwidth resources meeting the bandwidth requirements according to the path mapping signaling frame;

A third mapping module, configured to receive a path mapping acknowledgement frame fed back by any relay node of the any communication cooperative path after receiving the path mapping signaling frame;

and the fourth mapping module is used for confirming that the at least one communication cooperative path is mapped into an actual physical route on the edge computing system under the condition that path mapping confirmation frames fed back by all relay nodes of the at least one communication cooperative path are received, so as to establish a communication cooperative relationship between the first edge computing node and any second edge computing node.

14. The communication cooperative apparatus as claimed in claim 13, wherein the apparatus further comprises:

a first cancellation module configured to generate a cancellation signaling frame for the arbitrary communication cooperative path based on the first edge computing node in the edge computing system;

a second cancellation module, configured to send the cooperative cancellation signaling frame along the any communication cooperative path, so as to instruct all relay nodes on the any communication cooperative path to release the bandwidth resource;

a third cancellation module, configured to receive a cancellation acknowledgement frame fed back by any relay node of the any communication cooperative path after receiving the cancellation signaling frame;

And the fourth cancellation module is used for confirming and canceling the communication cooperative relationship between the first edge computing node and any second edge computing node under the condition that the cooperative cancellation confirmation frames fed back by all relay nodes of the at least one communication cooperative path are received.

15. A computer device comprising a memory and a processor, the memory storing a computer program, characterized in that the processor implements the communication collaboration method of any of claims 1 to 7 when the computer program is executed.

16. A computer-readable storage medium, on which a computer program is stored, characterized in that the computer program, when being executed by a processor, implements the communication cooperation method according to any one of claims 1 to 7.