[go: up one dir, main page]

WO2022027224A1 - Procédé de communication orienté service de ressource ou puissance de calcul en réseau - Google Patents

Procédé de communication orienté service de ressource ou puissance de calcul en réseau Download PDF

Info

Publication number
WO2022027224A1
WO2022027224A1 PCT/CN2020/106797 CN2020106797W WO2022027224A1 WO 2022027224 A1 WO2022027224 A1 WO 2022027224A1 CN 2020106797 W CN2020106797 W CN 2020106797W WO 2022027224 A1 WO2022027224 A1 WO 2022027224A1
Authority
WO
WIPO (PCT)
Prior art keywords
task
package
computing power
resource
computing
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Ceased
Application number
PCT/CN2020/106797
Other languages
English (en)
Chinese (zh)
Inventor
雷凯
余锡权
徐婷
张梅梅
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Shenzhen Smartcity Technology Development Group Co Ltd
Peking University Shenzhen Graduate School
Original Assignee
Shenzhen Smartcity Technology Development Group Co Ltd
Peking University Shenzhen Graduate School
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Shenzhen Smartcity Technology Development Group Co Ltd, Peking University Shenzhen Graduate School filed Critical Shenzhen Smartcity Technology Development Group Co Ltd
Priority to PCT/CN2020/106797 priority Critical patent/WO2022027224A1/fr
Priority to CN202080102877.5A priority patent/CN116250219A/zh
Publication of WO2022027224A1 publication Critical patent/WO2022027224A1/fr
Anticipated expiration legal-status Critical
Ceased legal-status Critical Current

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/50—Network services
    • H04L67/56—Provisioning of proxy services
    • H04L67/568—Storing data temporarily at an intermediate stage, e.g. caching

Definitions

  • the invention relates to a communication method oriented to resource services in a network, in particular to a communication method oriented to computing power services in a network.
  • the core value of the network is to improve efficiency.
  • the telephone network improves the efficiency of human communication
  • the Internet improves the efficiency of human collaboration.
  • the basic topology abstraction of the traditional Internet architecture is the end-to-end model: the network is in the middle, the computing is in the periphery, and the host is fully connected to the logical virtual through the network.
  • edge computing or ubiquitous computing the topology becomes computing embedded in the middle of the network. From the perspective of completing the user's computing tasks, the embedded resources are no longer peer-to-peer, but need to consider differences in distance and network good or bad condition.
  • the widespread deployment of edge computing brings new opportunities and challenges to operator networks.
  • the development of edge computing promotes the integration of network domain computing at the basic resource level.
  • the present invention mainly provides a communication method oriented to in-network computing power service and a communication method oriented to in-network resource service, which will be described in detail below.
  • an embodiment provides a communication method for in-network computing power services, including:
  • the computing power task requirement package at least includes a name field, the type of computing task, the required computing power and data input fields; the name field of the computing power task requirement package is used to uniquely identify the computing power The task requirement package, the data input field is used to store the data to be calculated;
  • the computing power task result package includes a name field and a calculation result field
  • the name field of the computing power task result package is used to uniquely identify the computing power task result package
  • the calculation result field is used to store the calculation result.
  • the name field of the computing power task result package corresponds to the name field of the computing power task requirement package
  • the node After the computing task demand package is forwarded to any node in the network, when the node receives the computing task demand package, it determines whether it is by extracting the type of computing task and the computing power required in the computing task demand package. Able to complete the computing task requested by the computing power task requirement package; specifically, when the node judges that it has deployed the function corresponding to the type of computing task in the computing power task requirement package, and the function is greater than or equal to the computing task required in the computing power task requirement package. When the computing power is high, it is judged that it can complete the computing task requested by the computing power task demand package; otherwise, it is judged that it cannot be completed;
  • the node executes the corresponding computing task, and returns the calculation result through the computing power task result packet along the original path where the computing power task demand packet was forwarded;
  • the type of computing task in the package and the required computing power are used as the basis for routing and forwarding, and the computing power task demand package is forwarded to another node.
  • the computing power task requirement package further includes signature authentication information, which is used to indicate the authorization status of the sender of the computing power task requirement package;
  • the computing power task result package further includes signature authentication information, which is used to indicate the calculation result. Trusted situation.
  • an embodiment provides a communication method for in-network computing power services, the communication method is based on the communication of a computing power task demand package and a computing power task result package, and the computing power task demand package is used for Request calculation from the node in the network, and the computing power task result package stores the calculation result returned by the node in the network for the computing power task demand package; the communication method includes:
  • the node judges whether it can complete the computing task requested by the computing power task demand package;
  • the node executes the corresponding computing task, and returns the computing result through the computing power task result packet along the original path where the computing power task demand packet was forwarded;
  • the node continues to forward the computing power task demand package to other nodes in the network until a node in the network can complete the computing task requested by the computing power task demand package.
  • the node if it is judged that it cannot be completed, the node also marks the computing task requirement package as unsatisfied; when the node receives the corresponding computing task result package returned along the original path, the previous corresponding Records marked as unsatisfied are deleted.
  • the node when the node receives the corresponding computing power task result packet returned along the original path, it judges whether it has enough cache space, and if so, caches the computing power task result packet, otherwise, does not cache force task structure package; or,
  • the node that executes the computing task requested by the computing power task demand package after giving the computing power task result package, also judges whether it has enough cache space. If so, it caches the computing power task result package. Adjacent nodes cache computing power task result packets.
  • the computing power task requirement package at least includes a name field, the type of computing task and the required computing power, and the name field of the computing power task requirement package is used to uniquely identify the computing power task requirement package;
  • the power task result bag includes a name field and a calculation result field, and the name field of the calculation power task result bag is used to uniquely identify the calculation power task result bag, and the calculation result field is used to store the calculation result; the name of the calculation power task result bag The field corresponds to the name field of the computing power task requirement package.
  • the node in the network when the node in the network receives the computing power task demand package, it determines whether it can complete the computing power task demand package by extracting the type of the computing task and the required computing power in the computing power task demand package.
  • Computing tasks specifically, when a node in the network judges that it has deployed a function corresponding to the type of computing task in the computing power task demand package, and has a computing power greater than or equal to the computing power required in the computing power task demand package, it judges itself The computing task requested by the computing power task requirement package can be completed, otherwise, it is judged that it cannot be completed.
  • the node when the node judges that the computing task requested by the computing power task requirement package cannot be completed, the node uses the computing task type and required computing power in the computing power task requirement package as the basis for routing and forwarding, and sends the computing power task The demand packet is forwarded to another node.
  • the computing power task requirement package further includes a data input field and/or signature authentication information, the data input field of the computing power task requirement package is used to store the data to be calculated, and the signature authentication information is used to indicate the calculation
  • the authorization status of the sender of the power task demand package; the computing power task result package also includes signature authentication information, which is used to indicate that the calculation result is trustworthy.
  • an embodiment provides a communication method for in-network resource services.
  • the communication method communicates based on a resource task request package and a resource task result package, and the resource task request package is used to request an in-network node Resource task, the resource task result package stores the task result returned by the node in the network for the resource task request package, and the communication method includes:
  • the node determines whether it can complete the resource task requested by the resource task request package;
  • the node executes the corresponding resource task, and returns the task result through the resource task result package along the original path where the resource task request package was forwarded;
  • the node continues to forward the resource task request packet to other nodes in the network until a node in the network can complete the resource task requested by the resource task request packet.
  • the node if it is judged that it cannot be completed, the node also marks the resource task request package as unsatisfied; when the node receives the corresponding resource task result package returned along the original path, it marks the previous corresponding package as unsatisfied. Unsatisfied records are deleted.
  • the node when the node receives the corresponding resource task result package returned along the original path, it determines whether it has enough cache space, and if so, caches the resource task result package, otherwise, does not cache the resource task result package; or,
  • the node that executes the resource task requested by the resource task request package after giving the resource task result package, also judges whether it has enough cache space. If so, it caches the resource task result package. Resource task result package.
  • the resource task request package at least includes a name field, the type of resource task and the required amount of resources, and the name field of the resource task request package is used to uniquely identify the resource task request package;
  • the resource task result package Including a name field and a calculation result field, the name field of the resource task result bag is used to uniquely identify the resource task result bag, and the task result field is used to store the task result;
  • the name field of the resource task result bag and the resource task request bag are used. corresponding to the name field.
  • the node in the network when the node in the network receives the resource task requirement package, it determines whether it can complete the resource task requested by the resource task requirement package by extracting the resource task type and required resource amount in the resource task requirement package; Specifically, when a node in the network judges that it has deployed a function corresponding to the type of the resource task in the resource task demand package, and the amount of resources required in the resource task demand package is greater than or equal to that of the resource task demand package, it judges that it can complete the resource task demand. The resource task requested by the package, otherwise, it is judged that it cannot be completed.
  • the node when the node judges that the resource task requested by the resource task demand package cannot be completed, the node forwards the resource task demand package according to the type of resource task and the required amount of resources in the resource task demand package as the basis for routing and forwarding. to another node.
  • an embodiment provides a computer-readable storage medium comprising a program executable by a processor to implement the method described in any of the embodiments herein.
  • FIG. 1 is a schematic diagram of a resource task request package and a resource task result package according to an embodiment
  • FIG. 2 is a flow chart of a communication method oriented to resource services in a network according to an embodiment
  • FIG. 3 is a schematic diagram of forwarding of a computing power task request packet and a computing power task result packet according to an embodiment
  • FIG. 4 is a schematic diagram of a computing power task request package and a computing power task result package according to an embodiment
  • FIG. 5 is a flow chart of a communication method oriented to an in-network computing power service according to an embodiment
  • FIG. 6 is a flow chart of a communication method for in-network computing power services according to another embodiment
  • FIG. 7 is a schematic structural diagram of a communication device for routing and computing according to an embodiment
  • FIG. 8 is a schematic structural diagram of a communication device for routing and computing according to another embodiment.
  • connection and “connection” mentioned in this application, unless otherwise specified, include both direct and indirect connections (connections).
  • the computing power service network needs to coordinately consider the needs of the evolution of network and computing integration, and realize the network-wide optimization of ubiquitous links and computing power resources, flexible scheduling of computing power requirements, and reasonable distribution of computing power tasks.
  • the computing power service network realizes the global optimization of connection and computing power in the network through unified management and coordinated scheduling of multi-dimensional resources such as network, storage and computing power. There can be one or more targets for the computing power service network.
  • the network can perceive ubiquitous computing and services, and users do not need to care about the location and deployment status of computing resources in the network.
  • Another example is to realize flexible and dynamic service deployment: according to real-time resource status and user SLA (Service-Level Agreement, service-level agreement) requirements, flexibly schedule services to the optimal edge node.
  • SLA Service-Level Agreement, service-level agreement
  • the core value of the network is to improve efficiency.
  • the technical problem to be solved by the present invention is to design a reasonable and efficient communication method and communication device, which are used for resource service request and resource service response in the scenario of in-network resource service.
  • ICN Information Center Network
  • Information-Center Network Information-Center Network
  • NDN Named Data Network
  • CCN Content-Centric Networking
  • IP address and communication connection no longer exists in the network, and its network communication is based on two types of data packets, Interest packets (interest packets, in some cases can also be called as request packets) and Data packets (data packets), which are matched by full or relative names.
  • Interest packets are used to request data from the data requesting direction network, and data packets are the data returned by the data owner after receiving the request.
  • NDN is a pull-based architecture, in which users request data by sending Interest packets, and the corresponding data packets return along the same path, achieving good content distribution capabilities through the data's built-in caching function and flexible forwarding strategy layer .
  • the content-oriented network transmission characteristics of NDN enable it to be used for content distribution of massive data.
  • the Interest packet there are two types of data packets in the NDN network, one is the Interest packet, the other is the Data packet, and the two are matched according to the complete or relative name.
  • the network communication process is completely driven by the content consumer.
  • the requester sends an Interest packet to the network through one or more locally owned interfaces, names the data as a link, and uses a pull method to obtain the corresponding Data packet.
  • the Interest package mainly contains fields such as "Content Name”, “Selector”, and "Nonce”; the "Content Name” field is used to uniquely identify a content block; the “Selector” field is provided by the content consumer who generates the Interest package , which is mainly used to attach some additional information for forwarding decisions; the "Nonce” field is generated by the content consumer that generates the Interest packet, and is mainly used to prevent loops in the forwarding process of the Interest packet.
  • the Data package mainly includes "Content Name”, “Signature”, "Signed Info” and “Content”; the “Content Name” field corresponds to the "Content Name” in the Interest package one-to-one; the “Content” field carries a content block specific data. Since each Data packet needs to be signed by the content producer that generates this block to achieve the integrity and reliability of the content, the "Signature” field and the “Signed Info” field are respectively used to carry specific signature content and related Signer information.
  • a routing node in an NDN network When a routing node in an NDN network receives an Interest packet, it will perform the following actions:
  • the routing node uses the Longest Prefix Matching (LPM) method to retrieve the local FIB (Forwarding Information Base) table.
  • LPM Longest Prefix Matching
  • the forwarding strategy selects the forwarding interface and forwards the Interest packet, and then the Interest packet is discarded, thereby ending its processing flow in the routing node;
  • Each PIT entry has a life cycle. When this life cycle arrives, the corresponding PIT entry will be removed from the PIT table.
  • a routing node in an NDN network When a routing node in an NDN network receives a Data packet, it will perform the following operations:
  • NDN networks have the following disadvantages:
  • the interest package and data package of the NDN network both contain the name field, and the name field contains routing information. However, the data packet does not need to be routed, so there is additional redundant routing information in the data packet.
  • the interest package and data package of the NDN network can only be used to request content data. It cannot be directly used in the computing power service network to perform computing requests, computing execution and return of computing results for computing tasks.
  • Path caching is a simple approach that requires less computation and communication overhead of placing replicas in the network. Copies of content are cached at intermediate nodes in the path from the content provider to the user. However, due to the continuous accumulation of copies on the path, the content is redundant, which will seriously waste the storage space of the node and reduce the overall hit rate of the cache.
  • the present invention proposes a communication method oriented to in-network resource services, particularly a communication method oriented to in-network computing power services, which will be described in detail below.
  • the present invention constructs two kinds of data packages, namely, the resource task request package and the resource task result package.
  • the resource task request package is used to request resource tasks from the nodes in the network
  • the resource task result package stores the task results returned by the nodes in the network for the resource task request package.
  • a resource task request package can correspond to one or more resource task result packages.
  • the resource task request packet needs to find a routing path through routing.
  • the resource task result packet does not need to be routed, and is directly returned along the routing path of the resource task request packet.
  • the communication method is based on the pull (pull) communication model, that is, only when the user or the client application actively sends a resource task request packet, the nodes in the network will execute the resource task and return one or more resource task result packets to the user. .
  • the resource task request package at least includes a name field, the type of resource task and the required amount of resources; in some embodiments, the resource task request package may also include a data input field and/or signature authentication information .
  • the name field of the resource task request package used to uniquely identify the resource task request package; the name field may contain a timestamp and an identifier of the resource task requester.
  • the type of resource task in the resource task request package determines the tools required to implement the resource task.
  • the amount of resources required in the resource task request package may be a definite value, indicating the amount of resources required to complete the resource task.
  • the data input field of the resource task request package used to store the data required to execute the resource task.
  • the signature authentication information of the resource task request package is used to indicate the authorization status of the sender of the resource task request package.
  • the resource task result package includes a name field and a calculation result field; in some embodiments, the resource task result package further includes signature authentication information.
  • the name field of the resource task result package used to uniquely identify the resource task result package, and the word field may contain a timestamp and an identifier of the resource task requester.
  • the task result field of the resource task result package used to store the task result.
  • the name field of the resource task result package corresponds to the name field of the computing power task requirement package.
  • the resource task request packet contains routing information.
  • the combination of the two fields of the resource task type and the required resource amount is the basis for routing forwarding, while the resource task result packet does not need to contain additional routing information. , so there is no redundant routing information in the resource task result packet like the data packet in the NDN network.
  • the name field of the package used to identify the protocol package
  • the field used for routing and forwarding such as the above-mentioned resource task type and required resource amount
  • the communication method is based on resource task request package and resource task result package communication, the resource task request package is used to request resource tasks from nodes in the network, and the resource task result package is stored in the network.
  • the task result returned by the inner node for the resource task request package includes the following steps:
  • Step 100 Any node in the network (eg, node A) receives a resource task request packet.
  • Step 110 When any node in the network (eg, the above-mentioned node A) receives the resource task request package, the node (node A) determines whether it can complete the resource task requested by the resource task request package.
  • the node determines whether it can complete the resource task requested by the resource task request package.
  • the node in the network when the node in the network receives the resource task requirement package, it judges whether it can complete the resource task requested by the resource task requirement package by extracting the resource task type and required resource amount in the resource task requirement package; specifically , when the node in the network judges that it has deployed the function corresponding to the type of the resource task in the resource task demand package, and the amount of resources required in the resource task demand package is greater than or equal to The requested resource task, otherwise, it is judged that it cannot be completed.
  • Step 120 If the judgment can be completed, the node (node A) executes the corresponding resource task, and returns the task result through the resource task result packet along the original path where the resource task request packet was forwarded.
  • Step 130 If it is judged that it cannot be completed, the node (node A) continues to forward the resource task request packet to other nodes in the network until a node in the network can complete the resource task requested by the resource task request packet.
  • the node forwards the resource task request package to another node according to the type of the resource task and the required resource amount in the resource task request package as the routing and forwarding basis.
  • the node when the node judges that the resource task cannot be completed in step 130, the node also marks the resource task request package as unsatisfied; when the node receives the corresponding resource task result package returned along the original path, Records previously marked as unsatisfied will be deleted.
  • the node may adopt a strategy of not caching the resource task result package; in some embodiments, the node may also adopt a strategy of caching the resource task result package. Specifically, it may be further divided into paths (on -path) caching strategy and off-path caching strategy, as detailed below.
  • the node when the node receives the corresponding resource task result package returned along the original path, it determines whether it has enough cache space, and if so, caches the resource task result package, otherwise, does not cache the resource task result. Bag.
  • the node that executes the resource task requested by the resource task request package after giving the resource task result package, also judges whether it has enough cache space, and if so, caches the resource task result package, otherwise, then Notifies its neighbors to cache resource task result packets.
  • Such resources can be storage resources, bandwidth resources, and computing resources.
  • the following may take computing resources as an example for description.
  • the present invention constructs two kinds of data packets, namely the computing power task request package and the computing power task result package.
  • the computing power task demand package is used to request calculation from the nodes in the network, and the computing power task result package stores the calculation results returned by the nodes in the network for the computing power task demand package.
  • a computing power task request package can correspond to one or more computing power task result packages.
  • the two have an atomic correspondence; when one computing task request package corresponds to multiple computing power task result packages, the two have a composite correspondence.
  • the computing power task request packet needs to be routed to find a routing path.
  • the computing power task result packet does not need to be routed, and returns directly along the routing path of the computing power task request packet.
  • the communication method is based on the pull (pull) communication model, that is, only when the user or the client application actively sends a computing task request packet, the nodes in the network will perform the computing task and return one or more computing task results. package to users.
  • the computing power task can typically be, for example, tasks such as face recognition, speech recognition, and image recognition.
  • the computing power task request package at least includes a name field, the type of computing power task and the required computing power; in some embodiments, the computing power task request package may also include a data input field and/or Signature authentication information.
  • the name field of the computing power task request package used to uniquely identify the computing power task request package; the name field may contain a timestamp and an identifier of the computing task requester.
  • the type of computing task in the computing power task request package determine what the function to call is. For example, the type of computing task is a picture recognition, then the function that may need to be called is the function photoRecognition() of image recognition. If the computing task is a speech recognition, then the function that may need to be called is the function speechRecognition() of speech recognition.
  • the computing power required in the computing power task request package can be a definite value, indicating the computing power required to complete the computing task.
  • the data input field of the computing power task request package used to store the data required to perform the computing power task. Some computing tasks must have input data, then put the input data into the data input field. For example, if the computing task is image recognition, then the image to be recognized needs to be input into the data input field, and the input data of the subsequent image recognition function photoRecognition() is called from the data input field of the computing power task request package. image to be recognized.
  • the signature authentication information of the computing power task request package is used to indicate the authorization status of the sender of the computing power task request package. Requesters of network computing must be authorized.
  • the computing power task result package includes a name field and a calculation result field; in some embodiments, the computing power task result package further includes signature authentication information.
  • the name field of the computing power task result package used to uniquely identify the computing power task result package, and the word field may contain a timestamp and the identifier of the computing task requester.
  • the name field of the computing power task result package corresponds to the name field of the computing power task requirement package.
  • the task result field of the computing power task result package used to store the calculation results.
  • the task result field is variable in length; the calculation results expected by different computing tasks are different, so the length of the corresponding result field is also different, such as face recognition, image recognition and speech recognition.
  • the calculation results expected by the three computing tasks are likely to be different.
  • the signature authentication information of the computing power task result package used to indicate that the computing result is trustworthy. Signature authentication information This is to ensure that the calculation result must be trusted.
  • the computing power task request packet contains routing information.
  • the combination of the two fields of the computing task type and the required computing power is the basis for routing and forwarding, while the computing power task result packet does not need to contain additional information. Routing information, so there is no additional redundant routing information in the computing power task result packet like the data packet in the NDN network.
  • the name field of the packet used to identify the protocol packet
  • the field used for routing and forwarding such as the type of the above-mentioned computing task and the required computing power
  • a communication method for in-network computing power services is based on the communication of a computing power task demand package and a computing power task result package, the computing power task demand package is used to request calculation from a node in the network, and the computing power task result package is used to request calculation from a node in the network.
  • the calculation results returned by the nodes in the network for the computing power task demand package are stored.
  • the communication method includes the following steps:
  • Step 200 When any node (eg, node A) in the network receives the computing power task requirement package, the node (node A) determines whether it can complete the computing task requested by the computing power task requirement package.
  • the node determines whether it can complete the computing task requested by the computing power task requirement package.
  • the node in the network determines whether it can complete the computing task requested by the computing power task demand package by extracting the type of computing task and the required computing power in the computing power task demand package. Specifically, when the node in the network judges that it has deployed the function corresponding to the type of the computing task in the computing power task demand package, and has the computing power greater than or equal to the computing power required in the computing power task demand package, it judges that it can complete the task itself. The computing task requested by the computing power task requirement package, otherwise, it is judged that it cannot be completed.
  • Step 210 If the judgment can be completed, the node (node A) executes the corresponding computing task, and returns the computing result through the computing power task result packet along the original path where the computing power task demand packet was forwarded.
  • Step 220 If it is judged that it cannot be completed, the node (node A) continues to forward the computing power task demand package to other nodes in the network until a node in the network can complete the computing task requested by the computing power task demand package.
  • the node uses the computing task type and required computing power in the computing power task requirement package as the basis for routing and forwarding, and sends the computing power task request package forwarded to another node.
  • the node when the node judges that the computing task cannot be completed in step 220, the node also marks the computing task requirement package as unsatisfied; when the node receives the corresponding computing power task result package returned along the original path , the records previously marked as unsatisfied will be deleted.
  • the node may adopt a strategy of not caching the resource task result package; in some embodiments, the node may also adopt a strategy of caching the computing power task result package. Specifically, it can be divided into paths The (on-path) caching strategy and the off-path (off-path) caching strategy are described in detail below.
  • the node when the node receives the corresponding computing power task result package returned along the original path, it judges whether it has enough cache space, if so, caches the computing power task result package, otherwise, does not cache the computing power task result package. Force Task Structure Pack.
  • the node that executes the computing task requested by the computing power task requirement package after giving the computing power task result package, also judges whether it has enough cache space, and if so, caches the computing power task result package, On the contrary, it informs its adjacent nodes to cache the computing power task result packet.
  • Fig. 5 illustrates the communication method oriented to the computing power service in the network from the point of view of the nodes in the network. The following describes the communication method oriented to the computing power service in the network from the perspective of the user.
  • a communication method for in-network computing power services includes the following steps:
  • Step 300 Construct and issue a computing power task requirement package.
  • the description of the computing power task requirement package can refer to the description of Figure 4 above.
  • the computing power task requirement package includes at least the name field, the type of computing task, the required computing power and the data input field.
  • the computing power task requirement package can also include Signature authentication information.
  • Step 310 Receive a computing power task result package.
  • the description of the computing power task result package can refer to the description of FIG. 4 above.
  • the computing power task result package includes a name field and a calculation result field, and the name field of the computing power task result package and the name field of the computing power task requirement package.
  • the computing power task requirement package may also include signature authentication information.
  • step 310 How the computing power task demand packet sent in step 300 is forwarded and executed in the network, and how step 310 can receive the computing power task result packet forwarded from the node in the network, is described in detail in the method steps of FIG. 5 , For example, after the computing task demand package is forwarded to any node in the network, when the node receives the computing power task demand package, it can determine whether it is able to obtain the computing power by extracting the type of computing task and the required computing power in the computing task demand package.
  • the packet is returned along the original path where the computing power task demand packet was forwarded; when it is judged that it cannot be completed, the node uses the type of computing task and the required computing power in the computing power task demand packet as the basis for routing and forwarding, and sends the computing power task demand packet. forwarded to another node.
  • the nodes involved in the communication method for in-network computing power services can be routers or interactive machines, or pure computing nodes, which can be used for routing and computing. Please refer to FIG. 7 , it is advisable to define a node as a communication device for routing and computing.
  • This communication device can be functionally divided into four components: computing resource component 10, functional component 20, storage resource component 30 and functional modules 40.
  • the computing power resource component 10 represents the computing power available to the node.
  • the function component 20 represents the computing function deployed by the node.
  • a node may deploy one or more different computing functions, or none of the computing functions may be deployed.
  • the storage resource component 30 is used for storing calculation results or other data that needs to be stored.
  • the functional module 40 may include functional modules such as service orchestration, resource scheduling, forwarding of computing power requirements, and security authentication.
  • FIG. 8 is a schematic structural diagram of a communication device for routing and computing.
  • Routing module perform computing power demand scheduling and service orchestration.
  • Security authentication module perform security authentication on computing task requesters and computing results, the requester must be authorized, and the computing results must be trusted.
  • Forwarding module forwarding computing power requirements and forwarding calculation results.
  • Computing engine The computing power engine that performs computing tasks, including computing power.
  • Computing function library Deployed computing functions, possibly deploying multiple functions.
  • Routing/computation table FIB/CIB table, used for forwarding and execution of computing power task requirements.
  • Cache Cache computational data, or other data.
  • Physical high-speed switching fabric perform high-speed packet switching.
  • NIC network card physical network card.
  • a computing service network can be constructed.
  • the computing power service network realizes the global optimization of connection and computing power in the network, so that the operator network has the comprehensive service capability of ICT system integration and provides a consistent user experience.
  • both the interest package and the data package of the NDN network contain the name field, and the name field contains routing information.
  • the data packet does not need to be routed, so there is additional redundant routing information in the data packet.
  • the computing power task demand packet needs to be routed and forwarded, so it needs to contain routing information
  • the computing power task result packet does not need to be routed and forwarded, and directly follows the computing power task demand packet.
  • the original routing path is returned, so the computing power task result packet no longer contains redundant routing information.
  • the interest package and data package of the NDN network can only be used to request content data.
  • the present invention can be implemented for requesting computations, performing computations and returning computation results.
  • an NDN routing node When an NDN routing node receives an interest packet, it can only look up whether there is corresponding data in the cache through the name field. In the present invention, it is no longer necessary to search for data in the cache, but the node first judges whether the corresponding function (computing function) can be provided, and then judges whether it can provide sufficient computing power.
  • the data package of NDN can only be cached on-path path. Due to the continuous accumulation of copies on the path, the content is redundant, which will seriously waste the storage space of the node and reduce the overall hit rate of the cache. The calculation results are simultaneously cached on-path and off-path, and some cache optimizations are performed.
  • any tangible, non-transitory computer-readable storage medium may be used, including magnetic storage devices (hard disks, floppy disks, etc.), optical storage devices (CD to ROM, DVD, Blu Ray disks, etc.), flash memory, and/or the like .
  • These computer program instructions may be loaded on a general purpose computer, special purpose computer or other programmable data processing apparatus to form a machine such that the instructions executed on the computer or other programmable data processing apparatus may generate means for implementing the specified functions.
  • These computer program instructions may also be stored in a computer-readable memory that instructs a computer or other programmable data processing device to operate in a particular manner, such that the instructions stored in the computer-readable memory form a piece of Articles of manufacture, including implementing means for implementing specified functions.
  • Computer program instructions may also be loaded on a computer or other programmable data processing device to perform a series of operational steps on the computer or other programmable device to produce a computer-implemented process such that a process executed on the computer or other programmable device Instructions may provide steps for implementing specified functions.
  • the term “comprising” and any other variations thereof are non-exclusive inclusion, such that a process, method, article or device including a list of elements includes not only those elements, but also not expressly listed or included in the process , method, system, article or other elements of a device.
  • the term “coupled” and any other variations thereof refer to physical connections, electrical connections, magnetic connections, optical connections, communication connections, functional connections, and/or any other connection.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

L'invention concerne un procédé de communication orienté service de ressource en réseau et un procédé de communication orienté service de puissance de calcul. En prenant un service de ressources en réseau en tant qu'exemple, un paquet de demande de tâche de ressource, un paquet de résultat de tâche de ressource, et une stratégie de transfert correspondante sont construites, de façon à concevoir un procédé de communication raisonnable et efficace et un dispositif de communication utilisé pour une demande de service de ressource et une réponse de service de ressource dans un scénario de service de ressource en réseau.
PCT/CN2020/106797 2020-08-04 2020-08-04 Procédé de communication orienté service de ressource ou puissance de calcul en réseau Ceased WO2022027224A1 (fr)

Priority Applications (2)

Application Number Priority Date Filing Date Title
PCT/CN2020/106797 WO2022027224A1 (fr) 2020-08-04 2020-08-04 Procédé de communication orienté service de ressource ou puissance de calcul en réseau
CN202080102877.5A CN116250219A (zh) 2020-08-04 2020-08-04 一种面向网内算力或资源服务的通信方法

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/CN2020/106797 WO2022027224A1 (fr) 2020-08-04 2020-08-04 Procédé de communication orienté service de ressource ou puissance de calcul en réseau

Publications (1)

Publication Number Publication Date
WO2022027224A1 true WO2022027224A1 (fr) 2022-02-10

Family

ID=80119214

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2020/106797 Ceased WO2022027224A1 (fr) 2020-08-04 2020-08-04 Procédé de communication orienté service de ressource ou puissance de calcul en réseau

Country Status (2)

Country Link
CN (1) CN116250219A (fr)
WO (1) WO2022027224A1 (fr)

Cited By (12)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114844888A (zh) * 2022-04-01 2022-08-02 杭州安存网络科技有限公司 算力机及其处理方法
CN114884861A (zh) * 2022-07-11 2022-08-09 军事科学院系统工程研究院网络信息研究所 一种基于网内计算的信息传输方法和系统
CN115051988A (zh) * 2022-06-07 2022-09-13 瞳见科技有限公司 一种基于分布式算力的融合调度系统
CN115061808A (zh) * 2022-08-03 2022-09-16 国汽智控(北京)科技有限公司 车云计算算力调度方法、装置、电子设备及存储介质
CN115118784A (zh) * 2022-06-30 2022-09-27 中国电信股份有限公司 算力资源的调度方法、装置及系统
CN115242865A (zh) * 2022-07-11 2022-10-25 北京邮电大学 一种远程视频人工服务的切换标准
CN115623602A (zh) * 2022-12-19 2023-01-17 浪潮通信信息系统有限公司 资源重选方法及装置
CN116614499A (zh) * 2023-05-04 2023-08-18 山东省计算中心（国家超级计算济南中心） 算力网络广域资源协同调度方法
CN116938934A (zh) * 2023-09-19 2023-10-24 江苏嘉擎信息技术有限公司 一种基于报文的任务切换控制方法及系统
CN118368214A (zh) * 2024-03-25 2024-07-19 浪潮通信信息系统有限公司 城市算力网络性能评分方法及装置
WO2024160054A1 (fr) * 2023-01-30 2024-08-08 中国移动通信有限公司研究院 Procédé et appareil de planification de puissance de calcul, dispositif associé et support de stockage
CN119167373A (zh) * 2024-09-05 2024-12-20 广州点动信息科技股份有限公司 一种基于云计算的安全管理方法、系统、终端及存储介质

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20150207754A1 (en) * 2014-01-21 2015-07-23 Unicorn Media, Inc. Load balancing for mesh computing
CN107135268A (zh) * 2017-05-22 2017-09-05 南京大学 基于信息中心网络的分布式任务计算方法
CN109981460A (zh) * 2019-03-19 2019-07-05 北京邮电大学 一种面向服务的融合网络、计算、存储一体化方法及装置
CN110659110A (zh) * 2018-06-28 2020-01-07 厦门本能管家科技有限公司 一种基于区块链分布式计算的方法及系统
CN110875945A (zh) * 2018-09-04 2020-03-10 京东方科技集团股份有限公司 用于在通用服务实体上进行任务处理的方法、装置和介质

Family Cites Families (14)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2012113446A1 (fr) * 2011-02-22 2012-08-30 Nokia Siemens Networks Gmbh & Co. Kg Association de ressources informatiques et de ressources de communication à un service dans une architecture de gestion de ressources
CN103543986B (zh) * 2013-10-30 2017-04-05 曙光信息产业(北京)有限公司 Cfx的计算任务的实现方法和装置
US9935893B2 (en) * 2016-03-28 2018-04-03 The Travelers Indemnity Company Systems and methods for dynamically allocating computing tasks to computer resources in a distributed processing environment
US10785341B2 (en) * 2016-11-21 2020-09-22 Intel Corporation Processing and caching in an information-centric network
CN107295110B (zh) * 2017-08-16 2020-08-04 网宿科技股份有限公司 计算任务的处理方法、边缘节点、业务服务器及系统
CN108848032B (zh) * 2018-05-18 2021-04-02 湖南科技大学 一种支持多兴趣类型处理的命名对象网络实现方法
WO2020133450A1 (fr) * 2018-12-29 2020-07-02 驭势科技（北京）有限公司 Système et procédé de partage de puissance de calcul au moyen d'un réseautage dynamique destinés à un dispositif mobile
CN110532092A (zh) * 2019-08-21 2019-12-03 云湾科技(嘉兴)有限公司 资源匹配方法、装置及设备
CN110618869B (zh) * 2019-09-19 2022-09-23 北京思维造物信息科技股份有限公司 一种资源管理方法、装置及设备
CN111126895A (zh) * 2019-11-18 2020-05-08 青岛海信网络科技股份有限公司 一种复杂场景下调度智能分析算法的管理仓库及调度方法
CN111212107B (zh) * 2019-12-10 2022-05-13 中移（杭州）信息技术有限公司 用于cdn平台的业务处理方法及cdn系统
CN111400008B (zh) * 2020-03-13 2023-06-02 北京旷视科技有限公司 计算资源调度方法、装置及电子设备
CN111367679B (zh) * 2020-03-31 2024-07-23 中国建设银行股份有限公司 人工智能算力资源复用方法及装置
CN111475276A (zh) * 2020-05-29 2020-07-31 深圳市元征科技股份有限公司 一种基于边缘计算的任务管理方法及其装置

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20150207754A1 (en) * 2014-01-21 2015-07-23 Unicorn Media, Inc. Load balancing for mesh computing
CN107135268A (zh) * 2017-05-22 2017-09-05 南京大学 基于信息中心网络的分布式任务计算方法
CN110659110A (zh) * 2018-06-28 2020-01-07 厦门本能管家科技有限公司 一种基于区块链分布式计算的方法及系统
CN110875945A (zh) * 2018-09-04 2020-03-10 京东方科技集团股份有限公司 用于在通用服务实体上进行任务处理的方法、装置和介质
CN109981460A (zh) * 2019-03-19 2019-07-05 北京邮电大学 一种面向服务的融合网络、计算、存储一体化方法及装置

Cited By (17)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114844888A (zh) * 2022-04-01 2022-08-02 杭州安存网络科技有限公司 算力机及其处理方法
CN114844888B (zh) * 2022-04-01 2024-01-19 杭州安存网络科技有限公司 算力机及其处理方法
CN115051988A (zh) * 2022-06-07 2022-09-13 瞳见科技有限公司 一种基于分布式算力的融合调度系统
CN115118784A (zh) * 2022-06-30 2022-09-27 中国电信股份有限公司 算力资源的调度方法、装置及系统
CN115118784B (zh) * 2022-06-30 2025-01-28 中国电信股份有限公司 算力资源的调度方法、装置及系统
CN114884861B (zh) * 2022-07-11 2022-09-30 军事科学院系统工程研究院网络信息研究所 一种基于网内计算的信息传输方法和系统
CN115242865A (zh) * 2022-07-11 2022-10-25 北京邮电大学 一种远程视频人工服务的切换标准
CN114884861A (zh) * 2022-07-11 2022-08-09 军事科学院系统工程研究院网络信息研究所 一种基于网内计算的信息传输方法和系统
CN115061808A (zh) * 2022-08-03 2022-09-16 国汽智控(北京)科技有限公司 车云计算算力调度方法、装置、电子设备及存储介质
CN115623602A (zh) * 2022-12-19 2023-01-17 浪潮通信信息系统有限公司 资源重选方法及装置
CN115623602B (zh) * 2022-12-19 2023-04-07 浪潮通信信息系统有限公司 资源重选方法及装置
WO2024160054A1 (fr) * 2023-01-30 2024-08-08 中国移动通信有限公司研究院 Procédé et appareil de planification de puissance de calcul, dispositif associé et support de stockage
CN116614499A (zh) * 2023-05-04 2023-08-18 山东省计算中心（国家超级计算济南中心） 算力网络广域资源协同调度方法
CN116938934A (zh) * 2023-09-19 2023-10-24 江苏嘉擎信息技术有限公司 一种基于报文的任务切换控制方法及系统
CN116938934B (zh) * 2023-09-19 2023-12-22 江苏嘉擎信息技术有限公司 一种基于报文的任务切换控制方法及系统
CN118368214A (zh) * 2024-03-25 2024-07-19 浪潮通信信息系统有限公司 城市算力网络性能评分方法及装置
CN119167373A (zh) * 2024-09-05 2024-12-20 广州点动信息科技股份有限公司 一种基于云计算的安全管理方法、系统、终端及存储介质

Also Published As

Publication number Publication date
CN116250219A (zh) 2023-06-09

Similar Documents

Publication Publication Date Title
WO2022027224A1 (fr) Procédé de communication orienté service de ressource ou puissance de calcul en réseau
US9838333B2 (en) Software-defined information centric network (ICN)
CN112470436B (zh) 用于提供多云连通性的系统、方法、以及计算机可读介质
US10194414B2 (en) Information centric networking based service centric networking
US9871850B1 (en) Enhanced browsing using CDN routing capabilities
JP2017517170A (ja) Ｎｆｖシステムにおけるサービス実装のための方法および通信ユニット
US10931559B2 (en) Distribution of network-policy configuration, management, and control using model-driven and information-centric networking
WO2011150830A1 (fr) Procédé et nœud permettant d'obtenir un contenu et réseau de contenu
CN110249611A (zh) 流量工程业务映射
Amadeo et al. SDN-managed provisioning of named computing services in edge infrastructures
Nicolaescu et al. Store edge networked data (SEND): A data and performance driven edge storage framework
WO2016131171A1 (fr) Procédé et dispositif d'exploitation de progiciel de vnf
Song et al. Exploring reliable decentralized networks with smart collaborative theory
Badshah et al. An improved method to deploy cache servers in software defined network-based information centric networking for big data
US20220012110A1 (en) Networking-related system call interception and modification
Nakanishi et al. A container-based content delivery method for edge cloud over wide area network
Amadeo et al. Towards software-defined fog computing via named data networking
Kim et al. Media-oriented service composition with service overlay networks: Challenges, approaches and future trends
Nascimento et al. A programmable network architecture for information centric network using data replication in private clouds
WO2016141573A1 (fr) Procédé et appareil pour déterminer un nsd à téléverser
WO2024092929A1 (fr) Procédé et appareil d'autorisation de données inter-domaine, et dispositif électronique
Ohshima et al. Construction of routing information knowledge base towards wide area network management
CN115473650A (zh) 服务功能链实现方法、装置、终端设备以及存储介质
Li et al. Design of general SDN controller system framework for multi-domain heterogeneous networks
Raman et al. Experimenting with a simulation framework for peer-to-peer file sharing in named data networking

Legal Events

Date Code Title Description
NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 20947945

Country of ref document: EP

Kind code of ref document: A1

122 Ep: pct application non-entry in european phase

Ref document number: 20947945

Country of ref document: EP

Kind code of ref document: A1