CN114827007A - Routing method and device for computing power perception, routing node and client equipment - Google Patents
Routing method and device for computing power perception, routing node and client equipment Download PDFInfo
- Publication number
- CN114827007A CN114827007A CN202110062699.4A CN202110062699A CN114827007A CN 114827007 A CN114827007 A CN 114827007A CN 202110062699 A CN202110062699 A CN 202110062699A CN 114827007 A CN114827007 A CN 114827007A
- Authority
- CN
- China
- Prior art keywords
- routing
- cost
- network
- different paths
- calculation
- 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.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 98
- 230000008447 perception Effects 0.000 title abstract description 14
- 238000004364 calculation method Methods 0.000 claims abstract description 143
- 238000005259 measurement Methods 0.000 claims description 8
- 238000005457 optimization Methods 0.000 abstract description 3
- 238000010586 diagram Methods 0.000 description 11
- 230000005540 biological transmission Effects 0.000 description 9
- 238000004422 calculation algorithm Methods 0.000 description 9
- 230000006870 function Effects 0.000 description 6
- 238000004891 communication Methods 0.000 description 4
- 230000008569 process Effects 0.000 description 4
- 230000008878 coupling Effects 0.000 description 3
- 238000010168 coupling process Methods 0.000 description 3
- 238000005859 coupling reaction Methods 0.000 description 3
- 238000012545 processing Methods 0.000 description 3
- 230000002093 peripheral effect Effects 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 238000004590 computer program Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 239000000126 substance Substances 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/12—Shortest path evaluation
- H04L45/123—Evaluation of link metrics
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/30—Routing of multiclass traffic
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/74—Address processing for routing
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention provides a routing method and device for computing power perception, a routing node and client equipment. The method comprises the following steps: acquiring a routing request sent by a client; wherein, the routing request comprises at least one destination node of the requested target service; respectively calculating the network cost and the calculation cost of different paths corresponding to each destination node as a route end point according to the route request; determining the routing cost corresponding to different paths according to the network cost and the calculation cost of the different paths; and determining a target path of the routing request according to the routing cost corresponding to different paths. By adopting the method, the performance influence of different destination nodes on the path calculation is considered, the calculation cost is introduced, the network cost and the calculation cost are integrated, the optimization of the network and calculation combined path is realized, and the routing cost of different paths is determined, so that the optimal path can be obtained.
Description
Technical Field
The present invention relates to the technical field of data communication networks, and in particular, to a routing method and apparatus, a routing node, and a client device for computing power awareness.
Background
At present, in an IP bearer network, in order to meet a service requirement, a forwarding Path is calculated according to a bandwidth and a delay requirement of a service, for example, an optimal forwarding Path is calculated based on a given constraint condition by using a Constrained Shortest Path First (CSPF) algorithm based on a constraint, in combination with a network parameter, and an optimal Path under the constraint condition is generated. The constraint conditions may include Cost, link attribute, bandwidth, etc.; the determination method of Cost is as follows: path computation is performed based on the above constraints, Cost being 100M/full bandwidth. The CSPF algorithm is only for calculating the end point of a Label Switching Path (LSP) tunnel, i.e. generating the best Path to reach a specified router, i.e. the destination router has been determined, and only the Path to the destination router is selected.
Except for constraint conditions, the measurement metric of the existing path calculation algorithm is calculated based on network performance, such as parameters of network bandwidth, hop count, residual bandwidth and the like, the algorithm cost only considers the network cost and cannot ensure the optimal performance of a target node, and the completion of services not only needs to ensure the path in the network but also needs to ensure the optimal performance of the target node, so that the problem that the optimal path and the optimal target point cannot be obtained by adopting the existing routing method exists.
Disclosure of Invention
The technical scheme of the invention aims to provide a routing method, a routing device, a routing node and client equipment for calculating power perception, which are used for solving the problem that the optimal path cannot be obtained by adopting the routing method in the prior art.
The embodiment of the invention provides a routing method for computing power perception, which is applied to a first routing node, wherein the method comprises the following steps:
acquiring a routing request sent by a client; wherein, the route request comprises at least one destination node of the requested target service;
respectively calculating the network cost and the calculation cost of different paths corresponding to each destination node as a route end point according to the route request; wherein, the different paths comprise different network paths and/or different destination nodes;
determining the routing cost corresponding to different paths according to the network cost and the calculation cost of the different paths;
and determining a target path of the routing request according to the routing cost corresponding to different paths.
Optionally, in the routing method, the routing request further includes network requirement information and/or computation requirement information of the target service;
wherein, according to the routing request, respectively calculating the network cost and the calculation cost of different paths corresponding to each destination node as a routing end point, comprises:
and respectively calculating the network cost and the calculation cost of different paths corresponding to each destination node as a routing end point according to the network demand information and/or the calculation demand information.
Optionally, the routing method, where determining the routing costs corresponding to different paths according to the network costs and the computation costs of the different paths, includes:
and determining the routing cost corresponding to different paths according to the first weight value corresponding to the network cost and the second weight value corresponding to the calculation cost.
Optionally, the routing method further includes:
and determining a first weight value corresponding to the network cost and a second weight value corresponding to the calculation cost in different paths according to the target service, the service type determined by the target service, the current network state and the states of different calculation force nodes.
Optionally, the routing method, where determining the routing costs corresponding to different paths according to a first weight value corresponding to the network cost and a second weight value corresponding to the computation cost includes:
and determining the routing costs corresponding to different paths by taking the network demand information and the calculation demand information in the routing request as constraint conditions according to the network costs, the calculation costs, the first weight value and the second weight value of different paths.
Optionally, the routing method, where determining the target path of the routing request according to the routing costs corresponding to different paths includes:
and determining the path corresponding to the routing cost meeting the preset numerical value as the target path.
Optionally, in the routing method, the routing request includes at least two pieces of routing request information, which respectively include different destination nodes and network requirement information and computation requirement information requested by the corresponding destination nodes.
Optionally, in the routing method, in the routing request, the computation requirement information is recorded in an optional TLV field.
Optionally, in the routing method, the routing request further includes a preset indication field, which is used to indicate a joint metric method for calculating the routing cost according to the network demand and the computational demand;
when determining the routing costs corresponding to different paths according to the network costs and the calculation costs of the different paths, calculating the routing costs in a joint measurement manner indicated by the preset indication field according to the network costs and the calculation costs of the different paths.
Optionally, the routing method further includes:
acquiring a path strategy of a generated path sent by a second routing node;
and when the current network state and/or computing resource are determined not to meet the path strategy, recalculating the generated path, or reporting update information to the second routing node, and recalculating the generated path by the second routing node.
Optionally, the routing method, where recalculating, by the second routing node, the generated path includes:
when the path strategy is generated, a first weight value corresponding to the network cost and/or a second weight value corresponding to the calculation cost are/is updated;
and recalculating the generated path according to the updated first weight value and the second weight value.
The embodiment of the invention provides a routing method for computing power perception, which is applied to client equipment, wherein the method comprises the following steps:
determining at least one destination node of a target service according to a node list sent by a Domain Name Server (DNS); the node list records destination nodes corresponding to different target services;
sending a routing request; wherein the routing request includes at least one destination node of the requested target service.
Optionally, in the routing method, the routing request further includes network requirement information and calculation requirement information.
Optionally, in the routing method, the routing request includes at least two pieces of routing request information, which respectively include different target nodes and network requirement information and computation requirement information requested by the corresponding target nodes.
Optionally, in the routing method, in the routing request, the computation requirement information is recorded in an optional TLV field.
Optionally, in the routing method, the routing request further includes a preset indication field, which is used to indicate a joint metric manner for calculating the routing cost according to the network demand and the computational demand.
The embodiment of the present invention further provides a routing node, which includes a transceiver and a processor, where:
the transceiver is used for acquiring a routing request sent by a client; wherein, the route request comprises at least one destination node of the requested target service;
the processor is used for respectively calculating the network cost and the calculation cost of different paths corresponding to each destination node as a routing end point according to the routing request; wherein, the different paths comprise different network paths and/or different destination nodes;
determining the routing cost corresponding to different paths according to the network cost and the calculation cost of the different paths;
and determining a target path of the routing request according to the routing cost corresponding to different paths.
The embodiment of the invention provides a client device, which comprises a processor and a transceiver, wherein:
the processor is used for determining at least one destination node of a target service according to a node list sent by a Domain Name Server (DNS); the node list records destination nodes corresponding to different target services;
the transceiver is used for sending a routing request;
wherein the routing request includes at least one destination node of the requested target service.
The embodiment of the invention provides a routing device for calculating power perception, which is applied to a first routing node, wherein the device comprises:
the request acquisition module is used for acquiring a routing request sent by a client; wherein, the route request comprises at least one destination node of the requested target service;
the first analysis module is used for respectively calculating the network cost and the calculation cost of different paths corresponding to each destination node as a route end point according to the route request;
the second analysis module is used for determining the routing cost corresponding to different paths according to the network cost and the calculation cost of the different paths;
and the third analysis module is used for determining a target path of the routing request according to the routing cost corresponding to different paths.
The embodiment of the invention also provides a routing device for computing power perception, which is applied to client equipment, wherein the device comprises:
the determining module is used for determining at least one destination node of the target service according to the node list sent by the domain name server DNS; the node list records destination nodes corresponding to different target services;
a request sending module for sending a routing request,
wherein the routing request includes at least one destination node of the requested target service.
An embodiment of the present invention provides a network device, including: a processor, a memory, and a program stored on the memory and executable on the processor, the program when executed by the processor implementing the computationally aware routing method of any of the above.
An embodiment of the present invention further provides a readable storage medium, where the readable storage medium stores a program, and the program, when executed by a processor, implements the steps in the computation-aware routing method described in any one of the above.
At least one of the above technical solutions of the present invention has the following beneficial effects:
by adopting the routing method for perception of computing power, the computing cost is formed by adding computing power parameters in cost calculation based on the computing algorithm combining the target node and the path, the joint decision of the network and the computing is realized, and the routing cost corresponding to different paths is determined, so that the optimal target path is determined, and the problem that the optimal path cannot be obtained by adopting the routing method in the prior art is solved.
Drawings
Fig. 1 is a schematic flow chart of a routing method according to an embodiment of the present invention;
FIG. 2 is a diagram of a system architecture for implementing the routing method according to an embodiment of the present invention;
FIG. 3 is a second system architecture diagram of a routing method according to an embodiment of the present invention;
FIG. 4 is a third diagram of the system architecture for implementing the routing method according to the embodiment of the present invention;
FIG. 5 is a diagram of a system architecture for implementing the routing method according to an embodiment of the present invention;
FIG. 6 is a fifth diagram of a system architecture for implementing the routing method according to the embodiment of the present invention;
fig. 7 is a flowchart illustrating a routing method according to another embodiment of the present invention;
fig. 8 is a schematic structural diagram of a routing node according to an embodiment of the present invention;
FIG. 9 is a schematic structural diagram of a client device according to an embodiment of the present invention;
fig. 10 is a schematic structural diagram of a routing device according to an embodiment of the present invention;
fig. 11 is a schematic structural diagram of a routing device according to another embodiment of the present invention;
fig. 12 is a schematic structural diagram of a network device according to an embodiment of the present invention;
fig. 13 is a schematic structural diagram of a network device according to another embodiment of the present invention.
Detailed Description
In order to make the technical problems, technical solutions and advantages of the present invention more apparent, the following detailed description is given with reference to the accompanying drawings and specific embodiments.
In order to solve the problem that the optimal path cannot be obtained by using the routing method in the prior art, embodiments of the present invention provide a routing method with computation-force awareness, which considers the performance of different destination nodes to affect path computation, introduces computation cost, integrates network cost and computation cost, realizes network and computation combined path optimization, and determines the routing cost of different paths, so as to obtain the optimal path.
The routing method for computing power awareness according to an embodiment of the present invention is applied to a first routing node, as shown in fig. 1, and includes:
s110, acquiring a routing request sent by a client; wherein, the route request comprises at least one destination node of the requested target service;
s120, respectively calculating the network cost and the calculation cost of different paths corresponding to each destination node as a route end point according to the route request; wherein, the different paths comprise different network paths and/or different destination nodes;
s130, determining the routing cost corresponding to different paths according to the network cost and the calculation cost of the different paths;
s140, determining the target path of the routing request according to the routing cost corresponding to different paths.
By adopting the routing method for perception of computing power, the computing cost is formed by adding computing power parameters in cost calculation based on the computing algorithm combining the target node and the path, the joint decision of the network and the computation is realized, and the routing cost corresponding to different paths is determined, so that the optimal target path is determined.
As shown in fig. 2, the system structure of the routing method using computation-oriented awareness according to the embodiment of the present invention includes a controller, which is configured to implement computation scheduling and determine a destination node and a transmission path transmitted by a service request initiated by a terminal. When a terminal initiates a service request, a controller (i.e., a first routing node) generates a computationally intensive scheduling policy for the service on demand, the computationally intensive scheduling policy including determining a path and a destination node. The step of determining different transmission paths comprises the steps of taking each destination node as a routing end point, determining each computing node through which the service initiated by the terminal is transmitted to the corresponding routing end point, and forming the paths comprising different computing nodes into different transmission paths.
In this embodiment of the present invention, optionally, in step S110, the obtained routing request further includes network requirement information and/or calculation requirement information of the target service;
in step S120, respectively calculating network costs and calculation costs of different paths corresponding to each destination node as a routing end point according to the routing request, includes:
and respectively calculating the network cost and the calculation cost of different paths corresponding to each destination node as a routing end point according to the network demand information and/or the calculation demand information.
In step S130, determining the routing cost corresponding to the different paths according to the network cost and the computation cost of the different paths includes:
and determining the routing cost corresponding to different paths according to the first weight value corresponding to the network cost and the second weight value corresponding to the calculation cost.
By adopting the routing method in the embodiment, the weighted values of different network costs and calculation costs are dynamically generated according to different service characteristics, that is, the first weighted value corresponding to the network cost and the second weighted value corresponding to the calculation cost are determined. Taking the first weight value as W1 and the second weight value as W2 as an example, the route cost W may be calculated by:
path cost W-W1-network cost + W2-calculated cost.
Optionally, the method further comprises:
and determining a first weight value corresponding to the network cost and a second weight value corresponding to the calculation cost in different paths according to the target service, the service type determined by the target service, the current network state and the states of different calculation force nodes.
Optionally, the first routing node includes a weight definition function unit, configured to generate a corresponding first weight value and a corresponding second weight value according to a target service requested in the routing request, a service type determined by the target service, a current network state, and states of different computation force nodes.
By adopting the embodiment, the requirement information of the target service in the routing request initiated by the client is mapped into network requirements such as bandwidth and time delay on one hand by the weight definition functional unit; and on the other hand, the demand information is mapped into computing power demand, such as the demand information comprising service information, a CPU, a GPU and the like. The network cost and the calculation cost of corresponding different paths can be calculated respectively by taking the network requirement and the calculation force requirement as constraint conditions. And determining a first weight value corresponding to the network cost and a second weight value corresponding to the calculation cost in different paths according to the target service, the service type determined by the target service, the current network state, the states of different calculation force nodes and the like.
Optionally, the first routing node further includes a path computation function unit, where the network requirement and the computation requirement mapped according to the requirement information of the target service and the first weight value and the second weight value may be input to the path computation function unit, and the path computation function unit performs computation of the target node and the path by combining the first weight value and the second weight value based on the network requirement and the computation requirement as constraint conditions.
Optionally, when a first weight value corresponding to the network cost and a second weight value corresponding to the computation cost are determined, a weight decision may be performed in an auxiliary manner according to a service completion delay ratio, so as to implement a joint decision of the network cost and the computation cost. For example, based on the time delay, the service is divided into: the network type, the calculation type and the mixed type can be divided into the network type for the services with small data volume, long distance, short calculation occupation time and relatively large transmission delay; services with large data volume, short distance, long calculation occupation time and small transmission delay can be classified into calculation types; services with close time delay, small data volume and close distance or large data volume and long distance can be classified into a hybrid type.
Optionally, with the routing method according to the embodiment of the present invention, during a packet forwarding process of a service, the first weight value and the second weight value may be dynamically adjusted according to a real-time network state and a real-time computing resource state.
According to the above, in the embodiment of the present invention, determining the routing costs corresponding to different paths according to the first weight value corresponding to the network cost and the second weight value corresponding to the computation cost includes:
and determining the routing costs corresponding to different paths by taking the network demand information and the calculation demand information in the routing request as constraint conditions according to the network costs, the calculation costs, the first weight value and the second weight value of different paths.
Optionally, in step S140, determining a target path of the routing request according to the routing costs corresponding to different paths includes:
and determining the path corresponding to the routing cost meeting the preset numerical value as the target path.
As shown in fig. 3, a terminal sends a routing request including a target service, determines routing costs corresponding to different paths according to network costs, calculation costs, a first weight value and a second weight value of the different paths, with network demand information and calculation demand information in the routing request as constraint conditions, determines a target path of the routing request according to the routing costs corresponding to the different paths, and sends initial path information and node information of each node to a determined destination node and each calculation node according to the determined target path.
Since the existing path computation communication protocol must specify destination node information to perform path computation, in order to achieve computation of multiple destination nodes to obtain an optimal path, as shown in fig. 4, a Domain Name Server (DNS) returns a node list including multiple destination nodes to a terminal, where the node list includes, for example, node 1, node 2, and node 3, and optionally, a remaining computation power of each node is included in the node list.
In one embodiment, optionally, the routing request information sent by the terminal to the controller (that is, the first routing node) includes different destination nodes, and network requirement information and calculation requirement information requested by the corresponding destination nodes. As shown in fig. 4, the controller respectively calculates corresponding optimal paths based on different destination nodes, and specifically, the controller calculates a network cost and a calculation cost based on a path corresponding to each destination node; alternatively, the calculation cost is the calculated force standard value/remaining calculated force. By adopting the routing method for calculating power perception described in the embodiment of the present invention, for the path corresponding to each destination node, the corresponding path cost is calculated based on the network cost, the calculation cost, the first weight value w1 corresponding to the first network cost, and the second weight value w2 corresponding to the calculation cost, that is, the calculation mode of the path cost is as follows: the Path cost is f (network cost, computation cost, weight | condition: network requirement, computation requirement).
In the above manner, the controller compares metric values of multiple "paths + nodes", that is, Path cost, based on different weights, determines an optimal Path, and returns Path information of the determined optimal Path to the terminal, where the Path information may optionally include information of a destination node and each computation node from the terminal to the destination node. Optionally, the controller further returns the network cost, the calculation cost, a first weight value w1 corresponding to the first network cost, a second weight value w2 corresponding to the calculation cost, and the like to the terminal. For example, as shown in fig. 4, the controller may determine that the node 1 is a destination node of the optimal path, determine the optimal path from the terminal to the node 1, and return corresponding path information to the terminal by using the above calculation.
According to the above, in the embodiment of the present invention, optionally, the routing request sent by the client includes the requested destination node and the requested parameter; the request parameter comprises network demand information and/or calculation demand information of the target service, and the network demand information and/or calculation demand information is used as a constraint condition when the path is calculated.
The method includes a path computation client and a path computation server based on the existing Path Computation Element Protocol (PCEP) extension. Wherein the path computation client (e.g. terminal) sends the above-mentioned route request to the path computation server (e.g. one of the routing nodes).
Compared with the prior art, in the embodiment of the invention, the routing request comprises the network requirement information and the calculation requirement information.
Optionally, in the routing request, the calculation requirement information is recorded in an optional TLV field.
Further, optionally, the routing request further includes a preset indication field for indicating a joint measurement mode for calculating the routing cost according to the network requirement and the calculation requirement;
when determining the routing costs corresponding to different paths according to the network costs and the calculation costs of the different paths, calculating the routing costs in a joint measurement manner indicated by the preset indication field according to the network costs and the calculation costs of the different paths.
In the embodiment of the present invention, optionally, a field T in the routing request may carry a metric object, which is used to indicate the joint metric method. For example, a joint metric for calculating the path cost through the network cost and the calculation cost may be defined by defining T ═ 8.
When the target path determined by the controller forwards the path policy issued by the controller, the network and the computing resources are updated, which may result in that the established policy may not meet the service requirement, so that the weight information of the network/computing parameters needs to be dynamically adjusted, and the path weight calculation needs to be performed. Optionally, the recalculation may be performed by an intermediate routing node, that is, may be performed by any routing node in the path process, for example, an inter-domain router, which is used for performing the path recalculation between each domain; optionally, the path may also be reported to the controller, and the controller performs the path recalculation.
For example, taking fig. 5 as an example, the initially set target path for traffic transmission from the terminal to the destination node includes node 1, node 2, node 3, and node 4. When the node 2 predicts that the path delay through the node 3 and the node 4 is larger than the expected transmission delay and the proportion of the whole delay is higher, the node 2 can perform path calculation again according to the weight information of the node 2, such as the weight for increasing the calculation cost of the corresponding network, and such as selecting a path to transmit services for the node 5 and the node 6, so as to achieve lower delay.
Of course, the path recalculation described above may also be performed by the controller or the computing force management platform.
When the path recalculation is performed by a controller (e.g., for the first routing node), optionally, the method further comprises:
the first routing node acquires a path strategy of a generated path sent by the second routing node;
and when the current network state and/or computing resource are determined not to meet the path strategy, recalculating the generated path, or reporting update information to the second routing node, and recalculating the generated path by the second routing node.
Optionally, recalculating, by the second routing node, the generated path, including:
when the path strategy is generated, a first weight value corresponding to the network cost and/or a second weight value corresponding to the calculation cost are/is updated;
and recalculating the generated path according to the updated first weight value and the second weight value.
Therefore, in this embodiment of the present invention, optionally, when the network state and the computation state change, the network node on the path may initiate a local path dynamic adjustment, including: adjusting the weight parameters based on the real-time network state and the calculation state;
specifically, as shown in fig. 6, a network node capable of implementing path adjustment needs to have the following functions:
supporting a weight definition function and a novel path calculation algorithm, and issuing a weight definition strategy and a novel algorithm by a calculation force management platform;
the service information and service requirement information perception is supported, such as service delay information and the like, and the service information and the service requirement information can be issued by a controller;
and the state perception of the computing nodes is supported, including state updating information of the computing nodes and the like.
Compared with the route calculation algorithm which usually calculates the optimal route only according to the determined destination address, the route method provided by the embodiment of the invention introduces the destination node performance as the calculation cost to calculate the route cost, and can dynamically adjust the weighting parameters of the network cost and the calculation cost to calculate the optimal route based on the service requirement, the network parameter and the calculation parameter, thereby realizing the optimal route selection of the destination node and the route. Therefore, by adopting the method, the service requirements, the network state and the calculation state are combined, the utilization of network resources and calculation resources is optimized by dynamically setting the weight information of the network cost and the calculation cost, and the service experience can be ensured; in addition, the forwarding path and the destination node can be dynamically adjusted, the autonomy of the network node is increased, the real-time network and the calculation state can be responded and adjusted, and the service requirement is met.
Another aspect of the embodiments of the present invention further provides a routing method for computing power awareness, which is applied to a client device, as shown in fig. 7, where the method includes:
s710, determining at least one destination node of a target service according to a node list sent by a Domain Name Server (DNS); the node list records destination nodes corresponding to different target services;
s720, sending a routing request; wherein the routing request includes at least one destination node of the requested target service.
By adopting the routing method with calculation ability perception, the domain name server DNS sends at least one destination node to the client equipment, so that the routing request sent by the client equipment can comprise at least one destination node of the target service, and thus, the routing node (such as a controller) receiving the routing request can consider the performance influence of different destination nodes on path calculation, introduce calculation cost, integrate network cost and calculation cost, realize network and calculation combined path optimization, and determine the routing cost of different paths so as to obtain the optimal path.
Optionally, in the routing method, the routing request further includes network requirement information and computation requirement information.
Optionally, in the routing method, the routing request includes at least two pieces of routing request information, which respectively include different target nodes and network requirement information and computation requirement information requested by the corresponding target nodes.
Optionally, in the routing method, in the routing request, the computation requirement information is recorded in an optional TLV field.
Optionally, in the routing method, the routing request further includes a preset indication field, which is used to indicate a joint metric manner for calculating the routing cost according to the network demand and the computational demand.
An embodiment of the present invention further provides a routing node, as shown in fig. 8, including a transceiver 810 and a processor 820, where:
the transceiver 810 is configured to obtain a routing request sent by a client; wherein, the routing request comprises at least one destination node of the requested target service;
the processor 820 is configured to calculate, according to the routing request, network costs and calculation costs of different paths corresponding to each destination node as a routing end point; wherein, the different paths comprise different network paths and/or different destination nodes;
determining the routing cost corresponding to different paths according to the network cost and the calculation cost of the different paths;
and determining a target path of the routing request according to the routing cost corresponding to different paths.
Optionally, the routing node, wherein the routing request further includes network requirement information and/or computation requirement information of the target service;
the processor 820 respectively calculates the network cost and the calculation cost of different paths corresponding to each destination node as a routing end point according to the routing request, including:
and respectively calculating the network cost and the calculation cost of different paths corresponding to each destination node as a routing end point according to the network demand information and/or the calculation demand information.
Optionally, the routing node, wherein the processor 820 determines the routing cost corresponding to the different paths according to the network cost and the computation cost of the different paths, includes:
and determining the routing cost corresponding to different paths according to the first weight value corresponding to the network cost and the second weight value corresponding to the calculation cost.
Optionally, the routing node, wherein the processor 820 is further configured to:
and determining a first weight value corresponding to the network cost and a second weight value corresponding to the calculation cost in different paths according to the target service, the service type determined by the target service, the current network state and the states of different calculation force nodes.
Optionally, the routing node, wherein the processor 820 determines the routing costs corresponding to different paths according to a first weight value corresponding to the network cost and a second weight value corresponding to the computation cost, including:
and determining the routing costs corresponding to different paths by taking the network demand information and the calculation demand information in the routing request as constraint conditions according to the network costs, the calculation costs, the first weight value and the second weight value of different paths.
Optionally, the routing node, wherein the determining, by the processor 820, the target path of the routing request according to the routing costs corresponding to different paths includes:
and determining the path corresponding to the routing cost meeting the preset numerical value as the target path.
Optionally, the routing request includes at least two pieces of routing request information, which respectively include different destination nodes and network requirement information and computation requirement information requested by the corresponding destination nodes.
Optionally, the routing node, wherein in the routing request, the computation requirement information is recorded in an optional TLV field.
Optionally, the routing node, wherein the routing request further includes a preset indication field for indicating a joint metric manner for calculating the routing cost according to the network demand and the computational demand;
when the processor 820 determines the routing costs corresponding to the different paths according to the network costs and the calculation costs of the different paths, the routing costs are calculated in a joint measurement manner indicated by the preset indication field according to the network costs and the calculation costs of the different paths.
Optionally, the routing node, wherein the processor 820 is further configured to:
acquiring a path strategy of a generated path sent by a second routing node;
and when the current network state and/or computing resource are determined not to meet the path strategy, recalculating the generated path, or reporting update information to the second routing node, and recalculating the generated path by the second routing node.
Optionally, the routing node, wherein the recalculating, by the second routing node, the generated path includes:
when the path strategy is generated, a first weight value corresponding to the network cost and/or a second weight value corresponding to the calculation cost are/is updated;
and recalculating the generated path according to the updated first weight value and the second weight value.
An embodiment of the present invention further provides a client device, as shown in fig. 9, including a processor 910 and a transceiver 920, where:
the processor 910 is configured to determine at least one destination node of a target service according to a node list sent by a domain name server DNS; the node list records destination nodes corresponding to different target services;
the transceiver 920 is configured to send a routing request;
wherein the routing request includes at least one destination node of the requested target service.
Optionally, the client device, wherein the routing request further includes network requirement information and computation requirement information.
Optionally, the client device, wherein the routing request includes at least two pieces of routing request information, which respectively include different target nodes and network requirement information and computation requirement information requested by the corresponding target nodes.
Optionally, the client device, wherein, in the routing request, the computation requirement information is recorded in an optional TLV field.
Optionally, the client device further includes a preset indication field, which is used to indicate a joint metric method for calculating the routing cost according to the network demand and the computation demand.
An embodiment of the present invention further provides a routing device for computing power awareness, which is applied to a first routing node, and as shown in fig. 10, the device includes:
a request obtaining module 1001, configured to obtain a routing request sent by a client; wherein, the route request comprises at least one destination node of the requested target service;
a first analyzing module 1002, configured to respectively calculate network costs and calculation costs of different paths corresponding to each destination node as a routing end point according to the routing request;
a second analysis module 1003, configured to determine, according to the network cost and the computation cost of different paths, the routing cost corresponding to the different paths;
a third analyzing module 1004, configured to determine a target path of the routing request according to the routing costs corresponding to different paths.
Optionally, the routing device, wherein the routing request further includes network requirement information and/or computation requirement information of the target service;
the first analysis module 1002 calculates network costs and calculation costs of different paths corresponding to each destination node as a routing end point according to the routing request, respectively, and includes:
and respectively calculating the network cost and the calculation cost of different paths corresponding to each destination node as a routing end point according to the network demand information and/or the calculation demand information.
Optionally, in the routing apparatus, the determining, by the third analyzing module 1004, the routing costs corresponding to different paths according to the network costs and the computation costs of the different paths includes:
and determining the routing cost corresponding to different paths according to the first weight value corresponding to the network cost and the second weight value corresponding to the calculation cost.
Optionally, in the routing apparatus, the second analysis module 1003 is further configured to:
and determining a first weight value corresponding to the network cost and a second weight value corresponding to the calculation cost in different paths according to the target service, the service type determined by the target service, the current network state and the states of different calculation force nodes.
Optionally, in the routing apparatus, the determining, by the third analyzing module 1004, the routing costs corresponding to different paths according to a first weighted value corresponding to the network cost and a second weighted value corresponding to the computation cost includes:
and determining the routing costs corresponding to different paths by taking the network demand information and the calculation demand information in the routing request as constraint conditions according to the network costs, the calculation costs, the first weight value and the second weight value of different paths.
Optionally, in the routing device, the determining, by the third analysis module 1004, the target path of the routing request according to the routing costs corresponding to different paths includes:
and determining the path corresponding to the routing cost meeting the preset numerical value as the target path.
Optionally, the routing device, where the routing request includes at least two pieces of routing request information, and the routing request includes different destination nodes, and network requirement information and computation requirement information requested by the corresponding destination nodes.
Optionally, the routing device, wherein, in the routing request, the computation requirement information is recorded in an optional TLV field.
Optionally, the routing device, wherein the routing request further includes a preset indication field, which is used to indicate a joint metric manner for calculating the routing cost according to the network demand and the computational demand;
when determining the routing costs corresponding to different paths according to the network costs and the calculation costs of the different paths, calculating the routing costs in a joint measurement manner indicated by the preset indication field according to the network costs and the calculation costs of the different paths.
Optionally, the routing apparatus, wherein the apparatus further includes a fourth analyzing module 1005, configured to:
acquiring a path strategy of a generated path sent by a second routing node;
and when the current network state and/or computing resource are determined not to meet the path strategy, recalculating the generated path, or reporting update information to the second routing node, and recalculating the generated path by the second routing node.
Optionally, the routing apparatus, wherein the recalculating, by the second routing node, the generated path includes:
when the path strategy is generated, a first weight value corresponding to the network cost and/or a second weight value corresponding to the calculation cost are/is updated;
and recalculating the generated path according to the updated first weight value and the second weight value.
An embodiment of the present invention further provides a routing apparatus for computing power awareness, which is applied to a client device, and as shown in fig. 11, the apparatus includes:
a determining module 1101, configured to determine at least one destination node of a target service according to a node list sent by a domain name server DNS; the node list records destination nodes corresponding to different target services;
a request sending module 1102 for sending a routing request,
wherein the routing request includes at least one destination node of the requested target service.
Optionally, the routing device, wherein the routing request further includes network requirement information and computation requirement information.
Optionally, the routing device, where the routing request includes at least two pieces of routing request information, and the routing request includes different target nodes, and network requirement information and computation requirement information requested by the corresponding target nodes.
Optionally, the routing device, wherein, in the routing request, the computation requirement information is recorded in an optional TLV field.
Optionally, the routing device further includes a preset indication field, which is used to indicate a joint metric method for calculating the routing cost according to the network demand and the computational demand.
Another aspect of the embodiments of the present invention further provides a network device, where the network device is a routing node, and as shown in fig. 12, the base station includes: a processor 1201; and a memory 1203 connected to the processor 1201 through the bus interface 1202, where the memory 1203 is used to store programs and data used by the processor 1201 when performing operations, and the processor 1201 calls and executes the programs and data stored in the memory 1203.
The transceiver 1204 is connected to the bus interface 1202 and configured to receive and transmit data under the control of the processor 1201, and specifically, the processor 1201 is configured to read a program in the memory 1203 and execute the following processes:
acquiring a routing request sent by a client; wherein, the route request comprises at least one destination node of the requested target service;
respectively calculating the network cost and the calculation cost of different paths corresponding to each destination node as a routing end point according to the routing request;
determining the routing cost corresponding to different paths according to the network cost and the calculation cost of the different paths;
and determining a target path of the routing request according to the routing cost corresponding to different paths.
Optionally, in the network device, the routing request further includes network requirement information and/or computation requirement information of the target service;
the processor 1201 respectively calculates the network cost and the calculation cost of different paths corresponding to each destination node as a routing end point according to the routing request, and the method includes:
and respectively calculating the network cost and the calculation cost of different paths corresponding to each destination node as a routing end point according to the network demand information and/or the calculation demand information.
Optionally, in the network device, the determining, by the processor 1201, the routing costs corresponding to different paths according to the network costs and the computation costs of the different paths includes:
and determining the routing cost corresponding to different paths according to the first weight value corresponding to the network cost and the second weight value corresponding to the calculation cost.
Optionally, in the network device, the processor 1201 is further configured to:
and determining a first weight value corresponding to the network cost and a second weight value corresponding to the calculation cost in different paths according to the target service, the service type determined by the target service, the current network state and the states of different calculation force nodes.
Optionally, in the network device, the determining, by the processor 1201, the routing costs corresponding to different paths according to a first weight value corresponding to the network cost and a second weight value corresponding to the computation cost includes:
and determining the routing costs corresponding to different paths by taking the network demand information and the calculation demand information in the routing request as constraint conditions according to the network costs, the calculation costs, the first weight value and the second weight value of different paths.
Optionally, in the network device, the determining, by the processor 1201, a target path of the routing request according to routing costs corresponding to different paths includes:
and determining the path corresponding to the routing cost meeting the preset numerical value as the target path.
Optionally, the network device, wherein the route request includes at least two pieces of route request information, which respectively include different destination nodes, and network requirement information and computation requirement information requested by the corresponding destination nodes.
Optionally, the network device, wherein, in the routing request, the computation requirement information is recorded in an optional TLV field.
Optionally, in the network device, the routing request further includes a preset indication field, which is used to indicate a joint metric method for calculating a routing cost according to a network requirement and a computation requirement;
when the processor 1201 determines the routing costs corresponding to the different paths according to the network costs and the calculation costs of the different paths, the routing costs are calculated in a joint measurement manner indicated by the preset indication field according to the network costs and the calculation costs of the different paths.
Optionally, in the network device, the processor 1201 is further configured to:
acquiring a path strategy of a generated path sent by a second routing node;
and when the current network state and/or computing resource are determined not to meet the path strategy, recalculating the generated path, or reporting update information to the second routing node, and recalculating the generated path by the second routing node.
Optionally, in the network device, the recalculating, by the second routing node, the generated path includes:
when the path strategy is generated, a first weight value corresponding to the network cost and/or a second weight value corresponding to the calculation cost are/is updated;
and recalculating the generated path according to the updated first weight value and the second weight value.
Where in fig. 12 the bus architecture may include any number of interconnected buses and bridges, with various circuits linking together one or more processors, represented by the processor 1201, and memory, represented by the memory 1203. The bus architecture may also link together various other circuits such as peripherals, voltage regulators, power management circuits, and the like, which are well known in the art, and therefore, will not be described any further herein. The bus interface provides an interface. The transceiver 1204 may be a number of elements including a transmitter and a receiver providing a means for communicating with various other apparatus over a transmission medium. The processor 1201 is responsible for managing a bus architecture and general processing, and the memory 1203 may store data used by the processor 1201 in performing operations.
An embodiment of the present invention further provides a terminal, as shown in fig. 13, where the terminal includes: a processor 1301; and a memory 1303 connected to the processor 1301 via the bus interface 1302, wherein the memory 1303 is used for storing programs and data used by the processor 1301 in performing operations, and the transceiver 1304 is connected to the bus interface 1302 and used for receiving and transmitting data under the control of the processor 1301.
Wherein the content of the first and second substances,
when the processor 1301 calls and executes the programs and data stored in the memory 1303, the following processes are performed:
determining at least one destination node of a target service according to a node list sent by a Domain Name Server (DNS); the node list records destination nodes corresponding to different target services;
sending a routing request; wherein the routing request includes at least one destination node of the requested target service.
Optionally, the terminal, wherein the routing request further includes network requirement information and calculation requirement information.
Optionally, the terminal, wherein the routing request includes at least two pieces of routing request information, which respectively include different target nodes, and network requirement information and computation requirement information requested by the corresponding target nodes.
Optionally, the terminal, wherein, in the routing request, the computation requirement information is recorded in an optional TLV field.
Optionally, the terminal, wherein the routing request further includes a preset indication field, which is used to indicate a joint metric method for calculating the routing cost according to the network requirement and the computation requirement.
It is noted that in fig. 13, the bus architecture may include any number of interconnected buses and bridges, with one or more processors represented by processor 1301 and various circuits represented by memory 1303 linked together. The bus architecture may also link together various other circuits such as peripherals, voltage regulators, power management circuits, and the like, which are well known in the art, and therefore, will not be described any further herein. The bus interface provides an interface. The transceiver 1304 may be a plurality of elements including a transmitter and a receiver that provide a means for communicating with various other apparatus over a transmission medium. The user interface 1305 may also be an interface capable of interfacing with a desired device for different terminals, including but not limited to a keypad, display, speaker, microphone, joystick, etc. The processor 1301 is responsible for managing a bus architecture and general processing, and the memory 1303 may store data used by the processor 1301 in performing operations.
In addition, embodiments of the present invention also provide a computer-readable storage medium, on which a computer program is stored, wherein the program, when executed by a processor, implements the steps in the computationally aware routing method as described in any one of the above.
Specifically, the computer-readable storage medium is applied to the routing node or the client device, and when the computer-readable storage medium is applied to the routing node and the client device, the execution steps in the corresponding routing method are described in detail above, and are not described herein again.
In the several embodiments provided in the present application, it should be understood that the disclosed method and apparatus may be implemented in other ways. For example, the above-described apparatus embodiments are merely illustrative, and for example, the division of the units is only one logical division, and other divisions may be realized in practice, for example, a plurality of units or components may be combined or integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, devices or units, and may be in an electrical, mechanical or other form.
In addition, functional units in the embodiments of the present invention may be integrated into one processing unit, or each unit may be physically included alone, or two or more units may be integrated into one unit. The integrated unit can be realized in a form of hardware, or in a form of hardware plus a software functional unit.
The integrated unit implemented in the form of a software functional unit may be stored in a computer readable storage medium. The software functional unit is stored in a storage medium and includes several instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute some steps of the transceiving method according to various embodiments of the present invention. And the aforementioned storage medium includes: various media capable of storing program codes, such as a usb disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk, or an optical disk.
While the preferred embodiments of the present invention have been described, it will be understood by those skilled in the art that various changes and modifications may be made without departing from the spirit and scope of the invention.
Claims (22)
1. A computationally aware routing method applied to a first routing node, the method comprising:
acquiring a routing request sent by a client; wherein, the route request comprises at least one destination node of the requested target service;
respectively calculating the network cost and the calculation cost of different paths corresponding to each destination node as a route end point according to the route request; wherein, the different paths comprise different network paths and/or different destination nodes;
determining the routing cost corresponding to different paths according to the network cost and the calculation cost of the different paths;
and determining a target path of the routing request according to the routing cost corresponding to different paths.
2. The routing method according to claim 1, wherein the routing request further includes network demand information and/or computation demand information of the target service;
wherein, according to the routing request, respectively calculating the network cost and the calculation cost of different paths corresponding to each destination node as a routing end point, comprises:
and respectively calculating the network cost and the calculation cost of different paths corresponding to each destination node as a routing end point according to the network demand information and/or the calculation demand information.
3. The routing method according to claim 1, wherein determining the routing cost corresponding to the different paths according to the network cost and the computation cost of the different paths comprises:
and determining the routing cost corresponding to different paths according to the first weight value corresponding to the network cost and the second weight value corresponding to the calculation cost.
4. The routing method according to claim 3, wherein the method further comprises:
and determining a first weight value corresponding to the network cost and a second weight value corresponding to the calculation cost in different paths according to the target service, the service type determined by the target service, the current network state and the states of different calculation force nodes.
5. The routing method according to claim 3, wherein determining the routing cost corresponding to the different paths according to a first weight value corresponding to the network cost and a second weight value corresponding to the computation cost comprises:
and determining the routing costs corresponding to different paths by taking the network demand information and the calculation demand information in the routing request as constraint conditions according to the network costs, the calculation costs, the first weight value and the second weight value of different paths.
6. The routing method according to claim 1, wherein determining the target path of the routing request according to the routing costs corresponding to different paths comprises:
and determining the path corresponding to the routing cost meeting the preset numerical value as the target path.
7. The routing method according to claim 2, wherein the routing request includes at least two routing request messages, each of which includes a different destination node and the network requirement information and the computation requirement information requested by the corresponding destination node.
8. The routing method according to claim 2 or 7, wherein in the routing request, the computation requirement information is recorded in an optional TLV field.
9. The routing method according to claim 1, wherein the routing request further includes a preset indication field for indicating a joint metric manner for calculating the routing cost according to the network demand and the calculation demand;
when determining the routing costs corresponding to different paths according to the network costs and the calculation costs of the different paths, calculating the routing costs in a joint measurement manner indicated by the preset indication field according to the network costs and the calculation costs of the different paths.
10. The routing method according to claim 1, wherein the method further comprises:
acquiring a path strategy of a generated path sent by a second routing node;
and when the current network state and/or computing resource are determined not to meet the path strategy, recalculating the generated path, or reporting update information to the second routing node, and recalculating the generated path by the second routing node.
11. The routing method of claim 10, wherein recalculating, by the second routing node, the generated path comprises:
when the path strategy is generated, a first weight value corresponding to the network cost and/or a second weight value corresponding to the calculation cost;
and recalculating the generated path according to the updated first weight value and the second weight value.
12. A computationally aware routing method for a client device, the method comprising:
determining at least one destination node of a target service according to a node list sent by a Domain Name Server (DNS); the node list records destination nodes corresponding to different target services;
sending a routing request; wherein the routing request includes at least one destination node of the requested target service.
13. The routing method according to claim 12, wherein the routing request further includes network demand information and computation demand information.
14. The routing method according to claim 13, wherein the routing request includes at least two routing request messages, each including a different destination node and the network requirement information and the computation requirement information requested by the corresponding destination node.
15. The routing method according to claim 13 or 14, wherein in the routing request, the computation requirement information is recorded in an optional TLV field.
16. The routing method according to claim 12, wherein the routing request further includes a preset indication field for indicating a joint metric manner for calculating the routing cost according to the network demand and the computation demand.
17. A routing node comprising a transceiver and a processor, wherein:
the transceiver is used for acquiring a routing request sent by a client; wherein, the route request comprises at least one destination node of the requested target service;
the processor is used for respectively calculating the network cost and the calculation cost of different paths corresponding to each destination node as a routing end point according to the routing request; wherein, the different paths comprise different network paths and/or different destination nodes;
determining the routing cost corresponding to different paths according to the network cost and the calculation cost of the different paths;
and determining a target path of the routing request according to the routing cost corresponding to different paths.
18. A client device comprising a processor and a transceiver, wherein:
the processor is used for determining at least one destination node of a target service according to a node list sent by a Domain Name Server (DNS); the node list records destination nodes corresponding to different target services;
the transceiver is used for sending a routing request;
wherein the routing request includes at least one destination node of the requested target service.
19. A computationally aware routing apparatus for use in a first routing node, the apparatus comprising:
the request acquisition module is used for acquiring a routing request sent by a client; wherein, the route request comprises at least one destination node of the requested target service;
the first analysis module is used for respectively calculating the network cost and the calculation cost of different paths corresponding to each destination node as a route end point according to the route request;
the second analysis module is used for determining the routing cost corresponding to different paths according to the network cost and the calculation cost of the different paths;
and the third analysis module is used for determining a target path of the routing request according to the routing cost corresponding to different paths.
20. A computationally aware routing apparatus for a client device, the apparatus comprising:
the determining module is used for determining at least one destination node of the target service according to the node list sent by the domain name server DNS; the node list records destination nodes corresponding to different target services;
a request sending module for sending a routing request,
wherein the routing request includes at least one destination node of the requested target service.
21. A network device, comprising: a processor, a memory and a program stored on the memory and executable on the processor, the program, when executed by the processor, implementing the computationally aware routing method of any of claims 1 to 11 or implementing the computationally aware routing method of any of claims 12 to 16.
22. A readable storage medium, characterized in that a program is stored thereon, which program, when being executed by a processor, carries out the steps in the computationally intensive routing method of any one of claims 1 to 11, or carries out the steps in the computationally intensive routing method of any one of claims 12 to 16.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110062699.4A CN114827007A (en) | 2021-01-18 | 2021-01-18 | Routing method and device for computing power perception, routing node and client equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110062699.4A CN114827007A (en) | 2021-01-18 | 2021-01-18 | Routing method and device for computing power perception, routing node and client equipment |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN114827007A true CN114827007A (en) | 2022-07-29 |
Family
ID=82523801
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110062699.4A Pending CN114827007A (en) | 2021-01-18 | 2021-01-18 | Routing method and device for computing power perception, routing node and client equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114827007A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114095075A (en) * | 2021-11-17 | 2022-02-25 | 国网宁夏电力有限公司信息通信公司 | Optical network fault recovery method based on service customization demand perception |
| CN115297014A (en) * | 2022-09-29 | 2022-11-04 | 浪潮通信信息系统有限公司 | Zero-trust computing network operating system, management method, electronic device and storage medium |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20120026886A1 (en) * | 2009-04-08 | 2012-02-02 | Huawei Technologies Co., Ltd. | Path computation method, path computation element, node device, and network system |
| KR20150123120A (en) * | 2014-04-24 | 2015-11-03 | 울산대학교 산학협력단 | Apparatus for providing qos in wireless ad hoc networks |
| CN109995653A (en) * | 2019-04-15 | 2019-07-09 | 深圳市迅雷网络技术有限公司 | Data transmission method, device, system and the readable storage medium storing program for executing of cross-node |
| CN110891021A (en) * | 2018-09-11 | 2020-03-17 | 中兴通讯股份有限公司 | Path calculation method and device and computer readable storage medium |
-
2021
- 2021-01-18 CN CN202110062699.4A patent/CN114827007A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20120026886A1 (en) * | 2009-04-08 | 2012-02-02 | Huawei Technologies Co., Ltd. | Path computation method, path computation element, node device, and network system |
| KR20150123120A (en) * | 2014-04-24 | 2015-11-03 | 울산대학교 산학협력단 | Apparatus for providing qos in wireless ad hoc networks |
| CN110891021A (en) * | 2018-09-11 | 2020-03-17 | 中兴通讯股份有限公司 | Path calculation method and device and computer readable storage medium |
| CN109995653A (en) * | 2019-04-15 | 2019-07-09 | 深圳市迅雷网络技术有限公司 | Data transmission method, device, system and the readable storage medium storing program for executing of cross-node |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114095075A (en) * | 2021-11-17 | 2022-02-25 | 国网宁夏电力有限公司信息通信公司 | Optical network fault recovery method based on service customization demand perception |
| CN115297014A (en) * | 2022-09-29 | 2022-11-04 | 浪潮通信信息系统有限公司 | Zero-trust computing network operating system, management method, electronic device and storage medium |
| CN115297014B (en) * | 2022-09-29 | 2022-12-27 | 浪潮通信信息系统有限公司 | Zero-trust computing network operating system, management method, electronic device and storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| EP3968594B1 (en) | Method, apparatus and system for selecting mobile edge computing node | |
| EP3968610A1 (en) | Method, device, and system for selecting mobile edge computing node | |
| EP3528440B1 (en) | Path selection method and system, network acceleration node, and network acceleration system | |
| CN111147387B (en) | Flow control method and device for hybrid SDN network | |
| CN111181849B (en) | Return source path determining method, determining device, computer equipment and storage medium | |
| CN114095579A (en) | Computing power processing network system, service processing method and equipment | |
| CN113810438B (en) | Service computing resource scheduling and requesting method, node equipment and terminal | |
| CN114827007A (en) | Routing method and device for computing power perception, routing node and client equipment | |
| CN101729430A (en) | Dynamic resource allocation system and allocation method used for supporting end-to-end time delay warranty | |
| WO2015169146A1 (en) | Path calculation method, message response method and related device | |
| WO2024104284A1 (en) | Nwdaf-based management and decision-making method for computing resources | |
| CN108235376B (en) | User plane anchor point selection method and device | |
| CN104468371A (en) | Multicast service message processing method and device | |
| WO2023155669A1 (en) | Method and device for selecting user plane function | |
| JP2016054420A (en) | Communication system, communication device, and communication program | |
| CN106102022B (en) | Transfer control method and system based on bottom-layer network characteristic | |
| CN113810442B (en) | Resource reservation method, device, terminal and node equipment | |
| CN112714146B (en) | Resource scheduling method, device, equipment and computer readable storage medium | |
| CN115226073A (en) | Message forwarding method, device and system and computer readable storage medium | |
| CN113347089B (en) | Software Defined Network (SDN) system, network configuration method, device and equipment | |
| WO2016101163A1 (en) | Data transmission method in one machine to machine system and common services entity | |
| CN116781732A (en) | Routing method, system and node | |
| JP2003258855A (en) | System and method for managing real time communication quality | |
| JP2013538383A (en) | Accessing a network of nodes distributed across a communication architecture using a topology server with multiple criteria selection | |
| CN114172842A (en) | Data transmission processing method, device, equipment and readable storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |