CN110071875B - Path query method, data transmission method, device and storage medium - Google Patents
Path query method, data transmission method, device and storage medium Download PDFInfo
- Publication number
- CN110071875B CN110071875B CN201910365947.5A CN201910365947A CN110071875B CN 110071875 B CN110071875 B CN 110071875B CN 201910365947 A CN201910365947 A CN 201910365947A CN 110071875 B CN110071875 B CN 110071875B
- Authority
- CN
- China
- Prior art keywords
- node
- path
- information
- request information
- inquiry request
- 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.)
- Active
Links
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/02—Topology update or discovery
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L63/00—Network architectures or network communication protocols for network security
- H04L63/04—Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks
- H04L63/0428—Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks wherein the data content is protected, e.g. by encrypting or encapsulating the payload
- H04L63/0442—Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks wherein the data content is protected, e.g. by encrypting or encapsulating the payload wherein the sending and receiving network entities apply asymmetric encryption, i.e. different keys for encryption and decryption
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/104—Peer-to-peer [P2P] networks
- H04L67/1074—Peer-to-peer [P2P] networks for supporting data block transmission mechanisms
- H04L67/1078—Resource delivery mechanisms
Abstract
The invention provides a path query method, a data transmission method, equipment and a storage medium, wherein the method comprises the following steps: receiving path inquiry request information, adding the IP address of the node into the path information of the path inquiry request information, and inquiring whether a first public key is the same as a second public key included in the path inquiry request information: if not, the updated path query request information is sent to each connected node for executing the path query method; if so, adding the IP address of the second node into the path information of the path inquiry request information, and sending the updated path inquiry request information to the first node; wherein the path query request information is generated by the first node in response to a communication request to communicate with the second node, according to a second public key of the second node. The invention ensures that different nodes in the P2P network accurately receive and transmit data, has less network flow consumption during data transmission, and provides good user experience for users.
Description
Technical Field
The present application relates to the field of internet technologies, and in particular, to a path query method, a data transmission method, a device, and a storage medium.
Background
In a traditional P2P network, if a data sender wants to send encrypted data to a data receiver, the data sender encrypts the data by using a public key of the data receiver and sends the encrypted data to a whole network node, and after receiving the encrypted data, the whole network node decrypts the encrypted data by using its own private key, and if the encrypted data cannot be decrypted, the encrypted data is not sent to the node; in this case, each node will receive many invalid messages and cause network traffic to be wasted.
Disclosure of Invention
In view of the above-mentioned drawbacks and deficiencies of the prior art, it is desirable to provide a path query method, a data transmission method, a device, and a storage medium that accurately transceive data and consume less network traffic.
In a first aspect, the present invention provides a path query method, in which each node stores a public key and an IP address of each connected node, including:
receiving path inquiry request information, and adding the IP address of the node into the path information of the path inquiry request information;
inquiring whether the first public key is the same as the second public key included in the path inquiry request information:
if not, the updated path query request information is sent to each connected node for executing the path query method;
if so, adding the IP address of the second node into the path information of the path inquiry request information, and sending the updated path inquiry request information to the first node;
wherein the path query request information is generated by the first node in response to a communication request to communicate with the second node, according to a second public key of the second node.
In a second aspect, the present invention provides a data transmission method, which is applied to a first node, and includes:
acquiring a plurality of pieces of path information between the current node and a second node according to a path query method;
and transmitting the data information to the second node according to the acquired information of each path.
In a third aspect, the present invention also provides an apparatus comprising one or more processors and a memory, wherein the memory contains instructions executable by the one or more processors to cause the one or more processors to perform a path query method and a data transmission method provided according to embodiments of the present invention.
In a fourth aspect, the present invention also provides a storage medium storing a computer program, the computer program enabling a computer to execute the path query method and the data transmission method according to the embodiments of the present invention.
The path query method, the data transmission method, the device and the storage medium provided by the embodiments of the present invention add the IP address of the node to the path information of the path query request information by receiving the path query request information, and query whether the first public key is the same as the second public key included in the path query request information: if not, the updated path query request information is sent to each connected node for executing the path query method; if so, adding the IP address of the second node into the path information of the path inquiry request information, and sending the updated path inquiry request information to the first node; the path query request information is generated by the first node in response to a communication request communicated with the second node according to the second public key of the second node, so that data can be accurately received and transmitted between different nodes in the P2P network, network flow consumption is low during data transmission, and good user experience is provided for users.
Some embodiments of the present invention provide a path query method, a data transmission method, a device, and a storage medium, further establishing a communication connection with a first node: when the communication connection with the first node is successfully established, the IP address of the second node is added into the path information of the path inquiry request information and the updated path inquiry request information is sent to the first node; and when the communication connection with the first node cannot be established, the IP address of the second node is added into the path information of the path inquiry request information, and the updated path inquiry request information is returned according to the updated path information so that the received nodes continue returning until the first node receives the updated path inquiry request information.
The path query method, the data transmission method, the device and the storage medium provided by some embodiments of the present invention further encrypt data information by using a public key of the second node; the encrypted data information is transmitted to the second node according to the acquired path information, so that the second node receives the encrypted data information and then decrypts the encrypted data information by using a private key, the encrypted data information is accurately transmitted, the encrypted data is prevented from being transmitted to the whole network node in the P2P network, the network flow consumption is low during data transmission, the privacy of the data is better protected, and the user experience is further optimized.
Drawings
Other features, objects and advantages of the present application will become more apparent upon reading of the following detailed description of non-limiting embodiments thereof, made with reference to the accompanying drawings in which:
fig. 1 is a schematic diagram illustrating a connection scenario of nodes in a P2P network according to an embodiment of the present invention.
Fig. 2 is a flowchart of a path query method according to an embodiment of the present invention.
Fig. 3 is a flowchart of step S15 in a preferred embodiment of the method shown in fig. 2.
Fig. 4 is a flowchart of step S14 in a preferred embodiment of the method shown in fig. 2.
Fig. 5 is a flowchart of a data transmission method according to an embodiment of the present invention.
Fig. 6 is a flowchart of step S24 in a preferred embodiment of the method shown in fig. 5.
Fig. 7 is a flowchart of step S24 in a preferred embodiment of the method shown in fig. 5.
Fig. 8 is a schematic structural diagram of an apparatus according to an embodiment of the present invention.
Detailed Description
The present application will be described in further detail with reference to the following drawings and examples. It is to be understood that the specific embodiments described herein are merely illustrative of the relevant invention and not restrictive of the invention. It should be noted that, for convenience of description, only the portions related to the present invention are shown in the drawings.
It should be noted that the embodiments and features of the embodiments in the present application may be combined with each other without conflict. The present application will be described in detail below with reference to the embodiments with reference to the attached drawings.
Fig. 1 is a schematic diagram illustrating a connection scenario of nodes in a P2P network according to an embodiment of the present invention. As shown in fig. 1, in the present embodiment, there are 8 nodes in the P2P network, where node a wants to send encrypted data information to node B; in a traditional data transmission mode, a node A encrypts data by using a public key Pub _ B of a node B and sends the encrypted data to a whole network node, after the whole network node (such as a node C) receives the encrypted data, the node C decrypts the encrypted data by using a private key Pri _ C of the node C, and if the Pri _ C cannot decrypt the received encrypted data, the encrypted data is not sent to the node, each node receives a lot of invalid messages and wastes network traffic; in this embodiment, when the node a wants to send the encrypted data information to the node B, the node a first queries a path connected to the node B, and then transmits the encrypted data through the queried path. The following describes the path query method provided by the present invention in detail with reference to fig. 2.
Fig. 2 is a flowchart of a path query method according to an embodiment of the present invention. As shown in fig. 2, in this embodiment, the present invention provides a path query method, in which each node stores a public key and an IP address of each connected node, including:
s12: receiving path inquiry request information, and adding the IP address of the node into the path information of the path inquiry request information;
s13: inquiring whether the first public key is the same as the second public key included in the path inquiry request information:
otherwise, step S14 is executed: sending the updated path query request information to each connected node for executing the path query method;
if yes, go to step S15: adding the IP address of the second node into the path information of the path inquiry request information, and sending the updated path inquiry request information to the first node;
wherein the path query request information is generated by the first node in response to a communication request to communicate with the second node, according to a second public key of the second node.
Specifically, in the application scenario shown in fig. 1, the path query request information includes path request information and path information, and the path request information includes a second public key and a first node of the path information; the method of sending the updated path query request information to each of the connected nodes is configured to send the updated path query request information to each of the connected nodes excluding the nodes included in the path query request information as an example;
suppose that node A (first node) in the P2P network wants to send encrypted data information to node B (second node), and the path inquiry request information is ((Pub _ B), path (A)); communication connection relationships among nodes in the P2P network are shown in fig. 1, and since each node stores a public key and an IP address with each node connected thereto:
the node a stores: pub _ C and IP _ C, Pub _ D and IP _ D, Pub _ E and IP _ E;
the node B stores: pub _ F and IP _ F, Pub _ D and IP _ D, Pub _ H and IP _ H;
node C stores: pub _ A and IP _ A, Pub _ F and IP _ F;
node D stores: pub _ A and IP _ A, Pub _ B and IP _ B;
node E stores: pub _ A and IP _ A, Pub _ G and IP _ G;
node F stores: pub _ C and IP _ C, Pub _ B and IP _ B;
the node G stores: pub _ E and IP _ E, Pub _ H and IP _ H;
the node H stores: pub _ B and IP _ B, Pub _ G and IP _ G;
the node A broadcasts path inquiry request information to the connected nodes C, D and E to search the node B;
for node C:
in step S12, the node C receives the path inquiry request information, and adds IP _ C to the path information ((Pub _ B), path (a-C)) of the path inquiry request information;
in step S13, node C queries whether there is a first public key that is the same as Pub _ B:
since node C stores Pub _ a and Pub _ F, and is different from Pub _ B, step S14 is executed: sending the updated path inquiry request information ((Pub _ B, path (A-C)) to each node of the nodes included in the path information except the path inquiry request information, namely to the node F, so that the node F can execute the path inquiry method; node F receives the path inquiry request information, adds IP _ F into the path information ((Pub _ B, path (A-C-F)) of the path inquiry request information, and inquires whether a first public key is the same as the first public key of the Pub _ B:
since node F stores Pub _ C and Pub _ B, and Pub _ B is the same as Pub _ B, step S15 is executed: the IP address of the node B is added to path information ((Pub _ B), path: (A-C-F-B)) of the path inquiry request information, and the updated path inquiry request information ((Pub _ B), path: (A-C-F-B)) is transmitted to the node A.
For node D:
in step S12, node D receives the path inquiry request message, and adds IP _ D to the path information ((Pub _ B), path (a-D)) of the path inquiry request message;
in step S13, node D inquires whether there is a first public key that is the same as Pub _ B:
since node D stores Pub _ a and Pub _ B, and Pub _ B is the same as Pub _ B, step S15 is executed: the IP address of the node B is added to path information ((Pub _ B, path: (A-D-B)) of the path inquiry request information, and the updated path inquiry request information ((Pub _ B, path: (A-D-B)) is transmitted to the node A.
For node E:
in step S12, the node E receives the path inquiry request information, and adds IP _ E to the path information ((a, B), path (a-E)) of the path inquiry request information;
in step S13, node E queries whether there is a first public key that is the same as Pub _ B:
since node C stores Pub _ a and Pub _ G, and is different from Pub _ B, step S14 is executed: sending the updated path inquiry request information ((Pub _ B, path (A-E)) to each node of the nodes included in the path information except the path inquiry request information, namely to the node G, so that the node G executes the path inquiry method; and the node G receives the path inquiry request information, adds the IP _ G into the path information ((Pub _ B, path (A-E-G)) of the path inquiry request information, inquires whether a first public key is the same as the first public key of the Pub _ B:
since the node G stores Pub _ E and Pub _ H, and is different from Pub _ B, step S14 is executed: sending the updated path inquiry request information ((Pub _ B, path (A-E-G)) to each node of the nodes included in the path information except the path inquiry request information, namely to the node H, so that the node H can execute the path inquiry method; and the node H receives the path inquiry request information, adds the IP _ H into the path information ((Pub _ B, path (A-E-G-H)) of the path inquiry request information, inquires whether a first public key is the same as the Pub _ B or not by the node H:
since node H stores Pub _ G and Pub _ B, and Pub _ B is the same as Pub _ B, step S15 is executed: the IP address of the node B is added to path information ((Pub _ B), path: (A-E-G-H-B)) of the path inquiry request information, and the updated path inquiry request information ((Pub _ B), path: (A-E-G-H-B)) is transmitted to the node A.
In the above embodiments, the path query method provided by the present invention is described in detail by taking the example that the path query request information includes the path request information and the path information, and the path request information includes the second public key and the first node of the path information, in further embodiments, the path query method provided by the present invention is not limited to the above example, and the path query request information may also be configured as the path request information and the path information according to actual requirements, and the path request information includes the second public key, the first node of the path information, and the first node of the path information, which can achieve the same technical effect.
In the above embodiment, the method for sending the updated path query request information to each connected node is configured to send the updated path query request information to each connected node except for the node included in the path information of the path query request information, which is taken as an example, the path query method provided by the present invention is described in detail in further embodiments, the path query method provided by the present invention is not limited to the above example, and the updated path query request information may also be sent to each connected node according to actual requirements, each connected node determines whether there is duplicate node information in the path information in the received updated path query request information, and if there is no duplicate node information, step S14 is continuously executed, so that the same technical effect can be achieved.
The embodiment enables the different nodes in the P2P network to accurately receive and transmit data, has less network flow consumption during data transmission, and provides good user experience for users.
Fig. 3 is a flowchart of step S15 in a preferred embodiment of the method shown in fig. 2. As shown in fig. 3, in a preferred embodiment, step S15 includes:
s151: establishing a communication connection with a first node:
when the communication connection is successfully established with the first node, step S152 is executed: adding the IP address of the second node into the path information of the path inquiry request information and sending the updated path inquiry request information to the first node;
when the communication connection cannot be established with the first node, step S153 is executed: and adding the IP address of the second node into the path information of the path inquiry request information, and returning the updated path inquiry request information according to the updated path information so that the received node continues to return until the first node receives the updated path inquiry request information.
Specifically, taking node H as an example:
the node H has acquired the IP address of the node a through the updated path query request information, and in step S151, the node H establishes communication connection with the node a:
when the node H successfully establishes the communication connection with the node a, step S152 is executed: adding the IP address of the node B into the path information ((Pub _ B), path (A-E-G-H-B)) of the path inquiry request information, and sending ((Pub _ B), path (A-E-G-H-B));
when the node H cannot establish the communication connection with the node a, step S153 is performed: and adding the IP address of the node B into the path information ((Pub _ B) and path (A-E-G-H-B)) of the path inquiry request information, returning the updated path inquiry request information according to the updated path information for the receiving node to continue returning until the first node receives the updated path inquiry request information, namely the node H returns ((Pub _ B) and path (A-E-G-H-B)) to the node G, the node G returns to the node E, and the node E returns to the node A.
The embodiment ensures that the two nodes in the isolated network can accurately receive data, thereby further optimizing the user experience.
Fig. 4 is a flowchart of step S14 in a preferred embodiment of the method shown in fig. 2. As shown in fig. 4, in a preferred embodiment, step S14 includes:
s141: and sending the updated path query request information to each node of the nodes included in the connected path information except the path query request information so as to execute the path query method.
The transaction replacement principle of the above embodiment can refer to the method shown in fig. 2, and is not described herein again.
Fig. 5 is a flowchart of a data transmission method according to an embodiment of the present invention. As shown in fig. 5, in this embodiment, the present invention provides a data transmission method, including:
s22: acquiring a plurality of pieces of path information between the current node and a second node according to a path query method;
s24: and transmitting the data information to the second node according to the acquired information of each path.
Specifically, taking the application scenario shown in fig. 1, the transmission mode for transmitting the data information to the second node according to the acquired information of each path is configured to be a shortest path selected from the paths obtained by the queries, and the shortest path is used to transmit the data information to the second node as an example;
in step S22, the node a obtains a plurality of path information between the node a and the node B according to the path query method, where the path information includes a-C-F-B, a-D-B, and a-E-G-H-B;
s24: and selecting the shortest path A-D-B from the paths obtained by the queries, and transmitting the data information to the node B according to the path information of the A-D-B.
In the above embodiments, the data transmission method provided by the present invention is described by taking an example of configuring a transmission mode of transmitting data information to the second node according to the acquired path information as selecting a shortest path from the queried paths, and transmitting the data information to the second node using the shortest path.
Fig. 6 is a flowchart of step S24 in a preferred embodiment of the method shown in fig. 5.
S241: establishing a communication connection with a second node:
when the communication connection with the second node is successfully established, step S242 is executed: transmitting the data information to the second node;
when the communication connection cannot be established with the second node, step S243 is executed: and selecting first path information with the shortest path from the path information, and transmitting the data information to the second node according to the first path information.
Specifically, the node a has acquired the IP address of the node B through the updated path query request information, and in step S241, the node a establishes a communication connection with the node B:
when the node a successfully establishes the communication connection with the node B, step S242 is executed: transmitting the data information to the node B;
when the node a cannot establish the communication connection with the node B, the step S243 is executed: and selecting the shortest path A-D-B from the path information, and transmitting the data information to the node B according to the path information of the A-D-B.
Fig. 7 is a flowchart of step S24 in a preferred embodiment of the method shown in fig. 5.
S245: encrypting the data information using the public key of the second node;
s246: and transmitting the encrypted data information to the second node according to the acquired path information, so that the second node decrypts the encrypted data information by using a private key after receiving the encrypted data information.
Specifically, in step S245, the node a encrypts the data information using the public key Pub _ B of the node B;
in step S246, the node a transmits the encrypted data information to the node B according to the acquired path information, so that the node B decrypts the encrypted data information by using the private key Pri _ B after receiving the encrypted data information.
According to the embodiment, the encrypted data information is accurately sent, the encrypted data is prevented from being sent to the whole network nodes in the P2P network, network flow consumption is low during data transmission, the privacy of the data is better protected, and user experience is further optimized.
Fig. 8 is a schematic structural diagram of an apparatus according to an embodiment of the present invention. As shown in fig. 8, as another aspect, the present application also provides an apparatus 800 including one or more Central Processing Units (CPUs) 801 that can perform various appropriate actions and processes according to a program stored in a Read Only Memory (ROM)802 or a program loaded from a storage section 808 into a Random Access Memory (RAM) 803. In the RAM803, various programs and data necessary for the operation of the apparatus 800 are also stored. The CPU801, ROM802, and RAM803 are connected to each other via a bus 804. An input/output (I/O) interface 805 is also connected to bus 804.
The following components are connected to the I/O interface 805: an input portion 806 including a keyboard, a mouse, and the like; an output section 807 including a signal such as a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, and a speaker; a storage portion 808 including a hard disk and the like; and a communication section 809 including a network interface card such as a LAN card, a modem, or the like. The communication section 809 performs communication processing via a network such as the internet. A drive 810 is also connected to the I/O interface 805 as necessary. A removable medium 811 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is mounted on the drive 810 as necessary, so that a computer program read out therefrom is mounted on the storage section 808 as necessary.
In particular, according to an embodiment of the present disclosure, the path query method and the data transmission method described in any of the above embodiments may be implemented as a computer software program. For example, embodiments of the present disclosure include a computer program product comprising a computer program tangibly embodied on a machine-readable medium, the computer program comprising program code for performing a path query method and a data transmission method. In such an embodiment, the computer program can be downloaded and installed from a network through the communication section 809 and/or installed from the removable medium 811.
As yet another aspect, the present application also provides a computer-readable storage medium, which may be the computer-readable storage medium included in the apparatus of the above-described embodiment; or it may be a separate computer readable storage medium not incorporated into the device. The computer-readable storage medium stores one or more programs for one or more processors to execute the path query method and the data transmission method described in the present application.
The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present invention. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
The units or modules described in the embodiments of the present application may be implemented by software or hardware. The described units or modules may also be provided in a processor, for example, each of the described units may be a software program provided in a computer or a mobile intelligent device, or may be a separately configured hardware device. Wherein the designation of a unit or module does not in some way constitute a limitation of the unit or module itself.
The above description is only a preferred embodiment of the application and is illustrative of the principles of the technology employed. It will be appreciated by those skilled in the art that the scope of the invention herein disclosed is not limited to the particular combination of features described above, but also encompasses other arrangements formed by any combination of the above features or their equivalents without departing from the spirit of the present application. For example, the above features may be replaced with (but not limited to) features having similar functions disclosed in the present application.
Claims (8)
1. A path inquiry method, wherein each node stores a public key and an IP address of each node connected thereto, comprising:
receiving path inquiry request information, and adding the IP address of the node into the path information of the path inquiry request information;
inquiring whether the first public key of the node is the same as the second public key included in the path inquiry request information:
if not, the updated path query request information is sent to each node connected with the node, so that each node connected with the node executes the path query method;
if so, adding the IP address of the second node into the path information of the path query request information, and sending the updated path query request information to the first node;
the path query request information is generated by the first node according to a second public key of the second node in response to a communication request for communicating with the second node, and is sent to each node connected with the first node.
2. The method of claim 1, wherein adding the IP address of the second node to the path information of the path query request message and sending the updated path query request message to the first node comprises:
establishing a communication connection with the first node:
when the communication connection with the first node is successfully established, adding the IP address of the second node into the path information of the path inquiry request information and sending the updated path inquiry request information to the first node;
and when the communication connection with the first node cannot be established, adding the IP address of the second node into the path information of the path inquiry request information, and returning the updated path inquiry request information according to the updated path information so that the received node continues to return the updated path inquiry request information until the first node receives the updated path inquiry request information.
3. The method according to claim 1, wherein the sending the updated path query request information to each connected node for executing the path query method comprises:
and sending the updated path query request information to each node of the connected nodes in the path information except the path query request information for executing the path query method.
4. A data transmission method, for a first node, comprising:
the path query method according to claim 1, acquiring a plurality of path information between the current node and the second node;
and transmitting data information to the second node according to the acquired path information.
5. The method of claim 4, wherein transmitting data information to the second node according to each of the obtained path information comprises:
establishing a communication connection with the second node:
when the communication connection with the second node is successfully established, transmitting data information to the second node;
and when the communication connection with the second node cannot be established, selecting first path information with the shortest path from the path information, and transmitting data information to the second node according to the first path information.
6. The method of claim 4, wherein transmitting data information to the second node according to each of the obtained path information comprises:
encrypting the data information using the public key of the second node;
and transmitting the encrypted data information to the second node according to the acquired path information, so that the second node decrypts the encrypted data information by using a private key after receiving the encrypted data information.
7. A computer device, the device comprising:
one or more processors;
a memory for storing one or more programs,
the one or more programs, when executed by the one or more processors, cause the one or more processors to perform the method recited in any of claims 1-6.
8. A storage medium storing a computer program, characterized in that the program, when executed by a processor, implements the method according to any one of claims 1-6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910365947.5A CN110071875B (en) | 2019-05-05 | 2019-05-05 | Path query method, data transmission method, device and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910365947.5A CN110071875B (en) | 2019-05-05 | 2019-05-05 | Path query method, data transmission method, device and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110071875A CN110071875A (en) | 2019-07-30 |
| CN110071875B true CN110071875B (en) | 2021-04-09 |
Family
ID=67369840
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910365947.5A Active CN110071875B (en) | 2019-05-05 | 2019-05-05 | Path query method, data transmission method, device and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110071875B (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112000695B (en) * | 2020-06-07 | 2023-06-09 | 建信金融科技有限责任公司 | Path query method, path query device, electronic equipment and computer readable storage medium |
| CN111639140A (en) * | 2020-06-08 | 2020-09-08 | 杭州复杂美科技有限公司 | Distributed data storage method, device and storage medium |
| CN112836078B (en) * | 2021-02-20 | 2021-10-22 | 山东省计算中心（国家超级计算济南中心） | Method, device, system and storage medium for safely inquiring shortest path on graph |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6301662B1 (en) * | 1998-08-21 | 2001-10-09 | Nortel Networks Corporation | Authentication of routing data using variable output length one-way functions |
| CN102447679A (en) * | 2010-10-09 | 2012-05-09 | 中兴通讯股份有限公司 | Method and system for ensuring safety of peer-to-peer (P2P) network data |
| CN106254069A (en) * | 2016-09-07 | 2016-12-21 | 广东工业大学 | Multi-layer security method for secret protection for content center network |
| CN106411964A (en) * | 2016-12-16 | 2017-02-15 | 北京瑞卓喜投科技发展有限公司 | Traceable and encrypted data transmission method and device |
| CN107948124A (en) * | 2016-10-13 | 2018-04-20 | 中兴通讯股份有限公司 | A kind of arp entry renewal management method, apparatus and system |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US10050951B2 (en) * | 2015-07-20 | 2018-08-14 | Cisco Technology, Inc. | Secure access to virtual machines in heterogeneous cloud environments |
| US20180091301A1 (en) * | 2016-05-06 | 2018-03-29 | ZeroDB, Inc. | Method and system for switching public keys in ciphertexts |
-
2019
- 2019-05-05 CN CN201910365947.5A patent/CN110071875B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6301662B1 (en) * | 1998-08-21 | 2001-10-09 | Nortel Networks Corporation | Authentication of routing data using variable output length one-way functions |
| CN102447679A (en) * | 2010-10-09 | 2012-05-09 | 中兴通讯股份有限公司 | Method and system for ensuring safety of peer-to-peer (P2P) network data |
| CN106254069A (en) * | 2016-09-07 | 2016-12-21 | 广东工业大学 | Multi-layer security method for secret protection for content center network |
| CN107948124A (en) * | 2016-10-13 | 2018-04-20 | 中兴通讯股份有限公司 | A kind of arp entry renewal management method, apparatus and system |
| CN106411964A (en) * | 2016-12-16 | 2017-02-15 | 北京瑞卓喜投科技发展有限公司 | Traceable and encrypted data transmission method and device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110071875A (en) | 2019-07-30 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110071875B (en) | Path query method, data transmission method, device and storage medium | |
| US10951395B2 (en) | Data fetching in data exchange networks | |
| US20180198752A1 (en) | Bluetooth low energy address resolving | |
| US20070094273A1 (en) | System topology for secure end-to-end communications between wireless device and application data source | |
| US20180278672A1 (en) | Method and system for replicating a communication application on an auxiliary computing device | |
| US9984158B2 (en) | Finding services in a service-oriented architecture (SOA) network | |
| CN110915188A (en) | Probabilistic relaying for efficient propagation in block-chain networks | |
| US10581804B2 (en) | End-to-end caching of secure content via trusted elements | |
| US20150381716A1 (en) | Method and system for sharing files over p2p | |
| US11388058B2 (en) | System and method for a distributed computing cluster architecture | |
| CN112769761B (en) | Signal transmission mode selection method and device based on service classification, electronic equipment and storage medium | |
| US20210058376A1 (en) | Anonymization and randomization of device identities | |
| CN113300999B (en) | Information processing method, electronic device, and readable storage medium | |
| CN109286636A (en) | Key management method, key server and storage medium | |
| US20030206638A1 (en) | Increasing peer privacy by forwarding a label | |
| US7865715B2 (en) | Increasing peer privacy | |
| CN111093194A (en) | Edge computing virtual base station management method and device based on block chain | |
| CN113852624A (en) | Data cross-network transmission method, device and computer medium thereof | |
| CN113364869A (en) | Block chain message transmission method, equipment and storage medium | |
| CN111404961B (en) | Federation link point data transmission method, equipment and storage medium | |
| CN115118727B (en) | Data transmission method, device, equipment and storage medium of distributed computing architecture | |
| CN112995205B (en) | Query method, device, equipment and storage medium based on block chain | |
| US20120316922A1 (en) | Method and system for creating similarity-based overlay network of micro-markets | |
| WO2021121628A1 (en) | Dynamic distribution of a computational graph | |
| JP2016052047A (en) | Anonymous message system, terminal node, public node, method, and program |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |