CN116846808A - Force calculation router, force calculation forwarding method, device, equipment and medium - Google Patents
Force calculation router, force calculation forwarding method, device, equipment and medium Download PDFInfo
- Publication number
- CN116846808A CN116846808A CN202310889607.9A CN202310889607A CN116846808A CN 116846808 A CN116846808 A CN 116846808A CN 202310889607 A CN202310889607 A CN 202310889607A CN 116846808 A CN116846808 A CN 116846808A
- Authority
- CN
- China
- Prior art keywords
- power
- calculation
- force
- computing
- routing
- 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
- 238000004364 calculation method Methods 0.000 title claims abstract description 198
- 238000000034 method Methods 0.000 title claims abstract description 41
- 238000004590 computer program Methods 0.000 claims description 30
- 230000008859 change Effects 0.000 claims description 17
- 238000003860 storage Methods 0.000 claims description 14
- 238000010276 construction Methods 0.000 claims description 4
- 239000000284 extract Substances 0.000 claims description 3
- 238000010586 diagram Methods 0.000 description 7
- 230000006870 function Effects 0.000 description 6
- 230000006872 improvement Effects 0.000 description 5
- 230000005540 biological transmission Effects 0.000 description 4
- 238000004891 communication Methods 0.000 description 3
- 238000005516 engineering process Methods 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000003825 pressing Methods 0.000 description 2
- 230000008569 process Effects 0.000 description 2
- 238000003491 array Methods 0.000 description 1
- 238000004422 calculation algorithm Methods 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 238000005457 optimization Methods 0.000 description 1
- 230000008961 swelling Effects 0.000 description 1
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/02—Topology update or discovery
-
- 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 discloses a computing router and a computing forwarding method, a computing router, a computing forwarding device, computing forwarding equipment and a computing forwarding medium, wherein the computing router comprises the following steps: acquiring all current calculation force identifiers of a target calculation force routing node; superposing all the calculation force identifiers to form a new calculation force route item; and sending the power calculation routing message carrying the power calculation routing entry to a neighbor power calculation routing node of the target power calculation routing node. The embodiment of the invention can greatly reduce the number of the computing power route entries, thereby improving the route convergence speed and the computing power network forwarding efficiency.
Description
Technical Field
The present invention relates to the field of communications technologies, and in particular, to a computing router, and a computing forwarding method, apparatus, device, and medium.
Background
The computing power network realizes the global optimization of connection and computing power on the network through unified management and collaborative scheduling of multidimensional resources such as the network, storage, computing power and the like, and provides extremely user experience. The computing power routing layer is the core of the computing power sensing network, comprehensively considers the network and computing resource conditions, and dispatches different applications to proper computing nodes for processing, so that edge-to-edge coordination is realized. And the power calculation priority network (Compute First Network, CFN) is used as a power calculation routing layer key technology, and the optimal scheduling of the service is realized through cooperative routing and power calculation state information.
In the existing scheme, under the power routing node, there are multiple power resource nodes, so the power routing node has multiple power routing entries, and all the power routing entries are transferred to its BGP (Border Gateway Protocol ) neighbors at the same time, as shown in fig. 1. However, due to the particularity of the computational power routing, the computational power routing has no stability of the IP routing, and along with the change of computational power resources, the computational power routing forwarding table is more and more bulky, so that the convergence speed of the computational power routing is slower, and the computational power network forwarding efficiency is low.
Disclosure of Invention
The invention provides a power calculation router, a power calculation forwarding method, a power calculation router forwarding device, a power calculation forwarding device and a power calculation forwarding medium, and aims to solve the problems that in the prior art, as power calculation resources change, a power calculation routing forwarding table becomes more and more bulky, so that the convergence speed of the power calculation routing is slow, and the forwarding processing efficiency of a power calculation network is low. The invention greatly reduces the number of the computing power route items and improves the convergence speed of the computing power route and the forwarding efficiency of the computing power network.
In order to achieve the above object, an embodiment of the present invention provides a method for forwarding computing power, including:
acquiring all current calculation force identifiers of a target calculation force routing node;
superposing all the calculation force identifiers to form a new calculation force route item;
and sending the power calculation routing message carrying the power calculation routing entry to a neighbor power calculation routing node of the target power calculation routing node.
As an improvement of the above scheme, all the overlapped calculation force identifiers are located at the head of the calculation force routing message.
As an improvement of the above solution, the computing power forwarding method further includes:
when the neighbor force calculation routing node receives the force calculation routing message, the neighbor force calculation routing node extracts all the force calculation identifiers in the force calculation routing message;
and the neighbor computing power routing node combines each computing power identifier with the corresponding IP header, tcp header and BGP message to form a plurality of original computing power routing entries.
As an improvement of the above solution, the computing power forwarding method further includes:
when the neighbor power-calculating routing node receives the power-calculating request, if any power-calculating identifier exists in all original power-calculating routing entries to meet the resource requirement carried by the power-calculating request, the neighbor power-calculating routing node calculates the remaining resources after the power-calculating identifier meets the resource requirement, and updates the power-calculating identifier.
As an improvement of the above solution, the computing power forwarding method further includes:
when the non-source force calculation routing node has the condition of updating the force calculation identifier, the non-source force calculation routing node sends a force calculation identifier change message to the source force calculation routing node; the power calculating identifier change message at least carries power calculating identifiers before and after updating, the non-source power calculating routing node is not the first power calculating routing node for forwarding the power calculating identifier, and the source power calculating routing node is the first power calculating routing node for forwarding the power calculating identifier.
As an improvement of the above solution, the computing power identifier at least includes: the type of service, computing resources, and network resources provided by the computing resource node.
To achieve the above object, an embodiment of the present invention provides a computing force forwarding device, including:
the computing power identifier acquisition module is used for acquiring all the current computing power identifiers of the target computing power routing node;
the new calculation route item construction module is used for superposing all calculation identifications to form a new calculation route item;
and the calculation force forwarding module is used for sending the calculation force routing message carrying the calculation force routing entry to the neighbor calculation force routing node of the target calculation force routing node.
To achieve the above object, an embodiment of the present invention provides a computing router including a processor, a memory, and a computer program stored in the memory and configured to be executed by the processor, the processor implementing the computing forwarding method as described above when executing the computer program.
To achieve the above object, an embodiment of the present invention provides an electronic device including a processor, a memory, and a computer program stored in the memory and configured to be executed by the processor, the processor implementing the computing power forwarding method as described above when executing the computer program.
To achieve the above object, embodiments of the present invention provide a computer-readable storage medium including a stored computer program; wherein the computer program, when run, controls the device in which the computer readable storage medium resides to perform the computational power forwarding method as described above.
Compared with the prior art, the method, the device, the equipment and the medium for forwarding the calculated force have the advantages that all the current calculated force identifiers of the calculated force routing nodes are overlapped to form a new calculated force routing entry, and the calculated force routing message carrying the calculated force routing entry is sent to the neighbor calculated force routing nodes, so that the number of calculated force routing entries needing to be forwarded in a calculated force network is greatly reduced, and the problems that a calculated force routing forwarding table is more and more bulky, the routing convergence speed is slow, and the forwarding processing efficiency of the calculated force network is low in the prior art are solved. In addition, the embodiment of the invention updates the computational power identification in the computational power route transmission process, reduces the update frequency of the computational power route information, and further improves the route convergence speed and the computational power network forwarding processing efficiency.
Drawings
FIG. 1 is a schematic diagram of a prior art method of computing force forwarding;
fig. 2 is a flowchart of a method for forwarding calculation force according to an embodiment of the present invention;
FIG. 3 is a schematic diagram of a method for forwarding computational power according to the present invention;
fig. 4 is a block diagram of a power calculation forwarding device according to an embodiment of the present invention;
fig. 5 is a block diagram of an electronic device according to an embodiment of the present invention.
Detailed Description
The following description of the embodiments of the present invention will be made clearly and completely with reference to the accompanying drawings, in which it is apparent that the embodiments described are only some embodiments of the present invention, but not all embodiments. All other embodiments, which can be made by those skilled in the art based on the embodiments of the invention without making any inventive effort, are intended to be within the scope of the invention.
Referring to fig. 2, fig. 2 is a flowchart of a method for forwarding computing power according to an embodiment of the present invention, where the method for forwarding computing power includes:
s1, acquiring all current calculation power identifiers of a target calculation power routing node;
s2, superposing all the calculation force identifiers to form a new calculation force route item;
and S3, sending the power calculation routing message carrying the power calculation routing entry to a neighbor power calculation routing node of the target power calculation routing node.
It can be appreciated that the neighbor power routing node is a power routing node having BGP neighbor relation with the target power routing node, and the neighbor power routing node and the target power routing node are BGP neighbors of each other.
In the embodiment of the invention, all the calculation force identifiers under the target calculation force routing node are all overlapped and pressed into the calculation force routing message, and the calculation force routing item is reconstructed, so that all the calculation force routing items under the target calculation force routing node are packed into one calculation force routing item, the number of the calculation force routing items is greatly reduced, and the problems of slow routing convergence speed and low calculation force network forwarding processing efficiency caused by the fact that the calculation force routing forwarding table is more and more bulky in the prior art are solved.
In an optional implementation manner, all the overlapped computation power identifiers are located at the head of the computation power routing message.
In the embodiment of the invention, in order to better press the calculation force identifiers into a calculation force route item, all the calculation force identifiers under the whole target calculation force route node are pressed into the calculation force route message head through the pressing of the multi-layer label similar to the MPLS message. Similarly, when the target computing power routing node overlaps all computing power identifiers under the node, the IP header, the tcp header and the BGP message are summarized to form a new computing power routing entry.
In an alternative embodiment, the computing power forwarding method further includes:
when the neighbor force calculation routing node receives the force calculation routing message, the neighbor force calculation routing node extracts all the force calculation identifiers in the force calculation routing message;
and the neighbor computing power routing node combines each computing power identifier with the corresponding IP header, tcp header and BGP message to form a plurality of original computing power routing entries.
In the embodiment of the invention, after receiving the computational power routing message, the neighbor computational power routing node continuously transmits the computational power routing message to the neighbor of the neighbor, simultaneously expands the computational power identifier of the computational power routing message, reconstructs each computational power routing item, adds the self routing forwarding table, and each reconstructed computational power routing item comprises the computational power identifier, the IP header, the tcp header and the BGP message corresponding to the computational power identifier.
In an alternative embodiment, the computing power forwarding method further includes:
when the neighbor power-calculating routing node receives a power-calculating request, if any power-calculating identifier exists in all original power-calculating routing entries to meet the resource requirement carried by the power-calculating request, the neighbor power-calculating routing node calculates the remaining resources after the power-calculating identifier meets the resource requirement, and updates the power-calculating identifier; the original computing power route entry comprises a computing power identifier, and an IP header, a tcp header and a BGP message corresponding to the computing power identifier.
In the embodiment of the invention, when the neighbor power routing node receives the power calculation request and the original power calculation routing item has the power calculation identifier which meets the resource requirement carried by the power calculation request, subtracting the resource requirement carried by the power calculation request from the resource of the power calculation identifier to obtain the residual resource, and updating the resource of the power calculation identifier into the residual resource, so that the power calculation identifier is updated at the neighbor power calculation routing node receiving the power calculation request without returning to the previous node for resource calculation and transmission, thereby reducing the updating frequency of the power calculation routing information and further improving the routing convergence speed and the power calculation network forwarding processing efficiency.
In an alternative embodiment, the computing power forwarding method further includes:
when the non-source force calculation routing node has the condition of updating the force calculation identifier, the non-source force calculation routing node sends a force calculation identifier change message to the source force calculation routing node; the power calculating identifier change message at least carries power calculating identifiers before and after updating, the non-source power calculating routing node is not the first power calculating routing node for forwarding the power calculating identifier, and the source power calculating routing node is the first power calculating routing node for forwarding the power calculating identifier.
It can be understood that when a calculation force request is received and a calculation force identifier exists in an original calculation force routing entry to meet the resource requirement carried by the calculation force request, the calculation force identifier is updated, at this time, a calculation force identifier change message is sent to a source calculation force routing node, the change of the calculation force identifier is notified, and the source calculation force routing node records the change.
In an alternative embodiment, the computing power identification includes at least: the type of service, computing resources, and network resources provided by the computing resource node.
It can be understood that the computing power identifier is a computing power unique identifier in a computing power network naming space, and includes information such as service types, computing resources, network resources and the like that can be provided by the computing power resource node.
For a better understanding of embodiments of the present invention, by way of example, reference is made to fig. 3:
1. all the force calculation identifiers of all the force calculation resources node of the force calculation under the force calculation routing node R1 are pressed into the head of the force calculation routing message at the position of the force calculation routing node R1;
2. transmitting the power calculation routing message to a power calculation routing node R2 through a BGP protocol, wherein the power calculation routing node R2 is a neighbor power calculation routing node of the power calculation routing node R1;
3. after receiving the message, the computing power routing node R2 expands the computing power identifier of the head of the computing power routing item message;
4. when a calculation force request exists under the calculation force routing node R2 and the corresponding calculation force identifier 3 in the calculation force routing item just meets the resource requirement, the calculation force router recalculates the remaining resources after the calculation force identifier 3 meets the calculation force request and regenerates the calculation force identifier 3 (new);
5. the force calculation routing node R2 re-pushes the new force calculation identifier 3 (new) into the force calculation routing message and sends it to its neighbor force calculation routing node R3. And meanwhile, sending a calculation power identification change message to the source router, informing the change of the calculation power identification, and recording the change by the source router.
The embodiment of the invention collects the calculation force route items under the whole calculation force route node into one calculation force route item through the multi-layer superposition of the calculation force identifiers in the calculation force route message and similar to the pressing of the multi-layer label of the MPLS message, and then carries out calculation force route transmission through the IP layer route protocol, the neighbor calculation force route node totally reads the multi-layer calculation force identifiers, and meanwhile, the neighbor calculation force route node can recalculate the calculation force identifiers, thereby greatly reducing the number of the calculation force route items needing to be forwarded in the calculation force network and solving the problems of frequent update of calculation force route information and swelling calculation force route table at the network layer in the prior art.
Of course, the above is only a specific implementation manner, each computing force routing node can press all computing force identifiers into the computing force routing message header for forwarding, and can also be used as a neighboring computing force routing node of other computing force routing nodes, receive computing force routing messages sent by other computing force routing nodes, and update the computing force identifiers when receiving computing force requests, so that the number of computing force routing entries and the updating frequency of routing information are greatly reduced.
Referring to fig. 4, fig. 4 is a block diagram of a power calculation forwarding device 10 according to an embodiment of the present invention, where the power calculation forwarding device 10 includes:
the computing power identifier obtaining module 11 is configured to obtain all the current computing power identifiers of the target computing power routing node;
a new calculation route entry construction module 12, configured to superimpose all the calculation identifiers to form a new calculation route entry;
and the power calculation forwarding module 13 is used for sending the power calculation routing message carrying the power calculation routing entry to the neighbor power calculation routing node of the target power calculation routing node.
Preferably, all the overlapped power calculation identifiers are located at the head of the power calculation routing message.
Preferably, the computing force forwarding device further includes:
the power calculation routing message receiving module is used for extracting all the power calculation identifiers in the power calculation routing message by the neighbor power calculation routing node when the power calculation routing message is received by the neighbor power calculation routing node;
the original computing force route item construction module is used for combining each computing force identifier with the corresponding IP header, tcp header and BGP message by the neighbor computing force route node to form a plurality of original computing force route items.
Preferably, the computing force forwarding device further includes:
the computing power mark updating module is used for when the neighbor computing power routing node receives the computing power request, if any computing power mark exists in all original computing power routing entries to meet the resource requirement carried by the computing power request, the neighbor computing power routing node calculates the remaining resources after the computing power mark meets the resource requirement, and updates the computing power mark; the original computing power route entry comprises a computing power identifier, and an IP header, a tcp header and a BGP message corresponding to the computing power identifier.
Preferably, the computing force forwarding device further includes:
the power calculation identifier change message sending module is used for sending a power calculation identifier change message to the source power calculation routing node by the non-source power calculation routing node when the power calculation identifier update condition exists in the non-source power calculation routing node; the power calculating identifier change message at least carries power calculating identifiers before and after updating, the non-source power calculating routing node is not the first power calculating routing node for forwarding the power calculating identifier, and the source power calculating routing node is the first power calculating routing node for forwarding the power calculating identifier.
Preferably, the computing power identifier at least comprises: the type of service, computing resources, and network resources provided by the computing resource node.
It should be noted that, the working process of each module in the computing force forwarding device 10 according to the embodiment of the present invention may refer to the working process of the computing force forwarding method according to the above embodiment, and will not be described herein.
The embodiment of the invention also provides a computing router, which comprises a processor, a memory and a computer program stored in the memory and configured to be executed by the processor, wherein the processor realizes the computing forwarding method according to any embodiment when executing the computer program.
Embodiments of the present invention also provide a computer-readable storage medium including a stored computer program; wherein the computer program, when executed, controls a device in which the computer readable storage medium is located to perform the computing power forwarding method according to any one of the embodiments described above.
Referring to fig. 5, fig. 5 is a block diagram of an electronic device 20 according to an embodiment of the present invention, where the electronic device 20 includes: a processor 21, a memory 22 and a computer program stored in said memory 22 and executable on said processor 21. The processor 21, when executing the computer program, implements the steps of the embodiments of the algorithm described above. Alternatively, the processor 21 may implement the functions of the modules/units in the above-described device embodiments when executing the computer program.
Illustratively, the computer program may be partitioned into one or more modules/units that are stored in the memory 22 and executed by the processor 21 to complete the present invention. The one or more modules/units may be a series of computer program instruction segments capable of performing the specified functions, which instruction segments are used to describe the execution of the computer program in the electronic device 20.
The electronic device 20 may be a computing device such as a desktop computer, a notebook computer, a palm computer, and a cloud server. The electronic device 20 may include, but is not limited to, a processor 21, a memory 22. It will be appreciated by those skilled in the art that the schematic diagram is merely an example of the electronic device 20 and is not meant to be limiting of the electronic device 20, and may include more or fewer components than shown, or may combine certain components, or different components, e.g., the electronic device 20 may also include input-output devices, network access devices, buses, etc.
The processor 21 may be a central processing unit (Central Processing Unit, CPU), but may also be other general purpose processors, digital signal processors (Digital Signal Processor, DSP), application specific integrated circuits (Application Specific Integrated Circuit, ASIC), field-programmable gate arrays (Field-Programmable Gate Array, FPGA) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, or the like. The general purpose processor may be a microprocessor or the processor may be any conventional processor or the like, and the processor 21 is a control center of the electronic device 20, and connects various parts of the entire electronic device 20 using various interfaces and lines.
The memory 22 may be used to store the computer program and/or module, and the processor 21 may implement various functions of the electronic device 20 by executing or executing the computer program and/or module stored in the memory 22, and invoking data stored in the memory 22. The memory 22 may mainly include a storage program area and a storage data area, wherein the storage program area may store an operating system, an application program (such as a sound playing function, an image playing function, etc.) required for at least one function, and the like; the storage data area may store data (such as audio data, phonebook, etc.) created according to the use of the handset, etc. In addition, the memory 22 may include high-speed random access memory, and may also include non-volatile memory, such as a hard disk, memory, plug-in hard disk, smart Media Card (SMC), secure Digital (SD) Card, flash Card (Flash Card), at least one disk storage device, flash memory device, or other volatile solid-state storage device.
Wherein the integrated modules/units of the electronic device 20 may be stored in a computer readable storage medium if implemented in the form of software functional units and sold or used as a stand alone product. Based on such understanding, the present invention may implement all or part of the flow of the method of the above embodiment, or may be implemented by a computer program to instruct related hardware, where the computer program may be stored in a computer readable storage medium, and the computer program may implement the steps of each of the method embodiments described above when executed by the processor 21. Wherein the computer program comprises computer program code which may be in source code form, object code form, executable file or some intermediate form etc. The computer readable medium may include: any entity or device capable of carrying the computer program code, a recording medium, a U disk, a removable hard disk, a magnetic disk, an optical disk, a computer Memory, a Read-Only Memory (ROM), a random access Memory (RAM, random Access Memory), an electrical carrier signal, a telecommunications signal, a software distribution medium, and so forth.
It should be noted that the above-described apparatus embodiments are merely illustrative, and the units described as separate units may or may not be physically separate, and units shown as units may or may not be physical units, may be located in one place, or may be distributed over a plurality of network units. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of this embodiment. In addition, in the drawings of the embodiment of the device provided by the invention, the connection relation between the modules represents that the modules have communication connection, and can be specifically implemented as one or more communication buses or signal lines. Those of ordinary skill in the art will understand and implement the present invention without undue burden.
Compared with the prior art, the method, the device, the equipment and the medium for forwarding the calculated force have the advantages that all the current calculated force identifiers of the calculated force routing nodes are overlapped to form a new calculated force routing entry, so that the calculated force routing message carrying the calculated force routing entry is sent to the neighbor calculated force routing nodes, the number of calculated force routing entries needing to be forwarded in a calculated force network is greatly reduced, and the problems that a calculated force routing forwarding table is more and more bulky, the route convergence speed is slow, and the forwarding processing efficiency of the calculated force network is low in the prior art are solved. In addition, the embodiment of the invention updates the computational power identification in the computational power route transmission process, reduces the update frequency of the computational power route information, and further improves the route convergence speed and the computational power network forwarding processing efficiency.
While the foregoing is directed to the preferred embodiments of the present invention, it will be appreciated by those skilled in the art that changes and modifications may be made without departing from the principles of the invention, such changes and modifications are also intended to be within the scope of the invention.
Claims (10)
1. A method of computing force forwarding, comprising:
acquiring all current calculation force identifiers of a target calculation force routing node;
superposing all the calculation force identifiers to form a new calculation force route item;
and sending the power calculation routing message carrying the power calculation routing entry to a neighbor power calculation routing node of the target power calculation routing node.
2. The method of claim 1, wherein all the overlapped force identifiers are located at a header of the force routing message.
3. The computing force forwarding method of claim 2, wherein the computing force forwarding method further comprises:
when the neighbor force calculation routing node receives the force calculation routing message, the neighbor force calculation routing node extracts all the force calculation identifiers in the force calculation routing message;
and the neighbor computing power routing node combines each computing power identifier with the corresponding IP header, tcp header and BGP message to form a plurality of original computing power routing entries.
4. The computing force forwarding method of claim 3 wherein the computing force forwarding method further comprises:
when the neighbor power-calculating routing node receives the power-calculating request, if any power-calculating identifier exists in all original power-calculating routing entries to meet the resource requirement carried by the power-calculating request, the neighbor power-calculating routing node calculates the remaining resources after the power-calculating identifier meets the resource requirement, and updates the power-calculating identifier.
5. The computing force forwarding method of claim 1, wherein the computing force forwarding method further comprises:
when the non-source force calculation routing node has the condition of updating the force calculation identifier, the non-source force calculation routing node sends a force calculation identifier change message to the source force calculation routing node; the power calculating identifier change message at least carries power calculating identifiers before and after updating, the non-source power calculating routing node is not the first power calculating routing node for forwarding the power calculating identifier, and the source power calculating routing node is the first power calculating routing node for forwarding the power calculating identifier.
6. The computing force forwarding method of claim 1 wherein the computing force identification comprises at least: the type of service, computing resources, and network resources provided by the computing resource node.
7. A computing force forwarding device, comprising:
the computing power identifier acquisition module is used for acquiring all the current computing power identifiers of the target computing power routing node;
the new calculation route item construction module is used for superposing all calculation identifications to form a new calculation route item;
and the calculation force forwarding module is used for sending the calculation force routing message carrying the calculation force routing entry to the neighbor calculation force routing node of the target calculation force routing node.
8. A power router comprising a processor, a memory, and a computer program stored in the memory and configured to be executed by the processor, the processor implementing the power forwarding method of any of claims 1-6 when the computer program is executed.
9. An electronic device comprising a processor, a memory, and a computer program stored in the memory and configured to be executed by the processor, the processor implementing the computing power forwarding method of any of claims 1-6 when the computer program is executed.
10. A computer readable storage medium, wherein the computer readable storage medium comprises a stored computer program; wherein the computer program, when run, controls a device in which the computer readable storage medium is located to perform the method of computing power forwarding according to any one of claims 1 to 6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310889607.9A CN116846808A (en) | 2023-07-18 | 2023-07-18 | Force calculation router, force calculation forwarding method, device, equipment and medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310889607.9A CN116846808A (en) | 2023-07-18 | 2023-07-18 | Force calculation router, force calculation forwarding method, device, equipment and medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN116846808A true CN116846808A (en) | 2023-10-03 |
Family
ID=88163304
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202310889607.9A Pending CN116846808A (en) | 2023-07-18 | 2023-07-18 | Force calculation router, force calculation forwarding method, device, equipment and medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN116846808A (en) |
-
2023
- 2023-07-18 CN CN202310889607.9A patent/CN116846808A/en active Pending
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109547349B (en) | Virtual routing-based traffic management method, device, terminal and storage medium | |
| US10637794B2 (en) | Resource subscription method, resource subscription apparatus, and resource subscription system | |
| US8903972B2 (en) | Method and apparatus for sharing contents using information of group change in content oriented network environment | |
| CN102984194A (en) | Sychronization of configuration file of virtual application distribution chassis | |
| CN110730478B (en) | Slice association method, device, end-to-end slice organizer and storage medium | |
| US10411911B2 (en) | Network as service service cross-domain orchestration method, orchestration device, and control device | |
| CN111338806B (en) | Service control method and device | |
| CN104184663A (en) | Communication method and device based on software-defined network and integrated identification network | |
| CN110290168A (en) | Data transmission method for uplink, device, server and storage medium | |
| US20230269164A1 (en) | Method and apparatus for sending route calculation information, device, and storage medium | |
| CN103825826A (en) | Method and device for implementing dynamic routing | |
| EP4294080A1 (en) | Route processing method and network device | |
| EP2348686B1 (en) | Information processing device, method and computer program for decide an address | |
| CN107872387B (en) | Method and system for transmitting VPN route | |
| CN112714146B (en) | Resource scheduling method, device, equipment and computer readable storage medium | |
| CN116846808A (en) | Force calculation router, force calculation forwarding method, device, equipment and medium | |
| CN115665026A (en) | Cluster networking method and device | |
| CN115190168B (en) | Edge server management system and server cluster | |
| CN115550439B (en) | Event management system and method | |
| CN112468600B (en) | Application message notification method, system and storage medium based on network matrix | |
| CN114124780B (en) | Route issuing method, device, electronic equipment and storage medium | |
| CN116319514B (en) | Data processing method and related device | |
| WO2023169364A1 (en) | Routing generation method and apparatus, and data message forwarding method and apparatus | |
| KR100474358B1 (en) | Method and apparatus for implementation function of remote network monitoring in high speed router, and storage medium for recording program thereof | |
| CN117527692A (en) | Calculation notification and routing method in calculation network, electronic equipment and 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 |