CN112187963A - Distributed hash table implementation method, computer device and storage medium - Google Patents
Distributed hash table implementation method, computer device and storage medium Download PDFInfo
- Publication number
- CN112187963A CN112187963A CN202010841474.4A CN202010841474A CN112187963A CN 112187963 A CN112187963 A CN 112187963A CN 202010841474 A CN202010841474 A CN 202010841474A CN 112187963 A CN112187963 A CN 112187963A
- Authority
- CN
- China
- Prior art keywords
- node
- information
- connection
- implementation method
- hash table
- 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.)
- Granted
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L61/00—Network arrangements, protocols or services for addressing or naming
- H04L61/09—Mapping addresses
- H04L61/25—Mapping addresses of the same type
- H04L61/2503—Translation of Internet protocol [IP] addresses
- H04L61/256—NAT traversal
-
- 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
- H04L45/745—Address table lookup; Address filtering
-
- 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/14—Session management
- H04L67/141—Setup of application sessions
Abstract
The invention discloses a distributed hash table implementation method, a computer device and a storage medium, wherein the distributed hash table implementation method comprises the steps of finding out at least one third node, sending query information to the third node, returning information of a fourth node to a first node by the third node, sending information of the first node to a fourth node, wherein the fourth node is the node closest to the first node, requesting connection with the first node by the fourth node, establishing connection with the second node when detecting the existence of the second node in each fourth node, and the like. The distributed hash table implementation method of the invention applies the principle of intranet penetration technology, thereby realizing the discovery of any node without depending on a centralized penetration server even if the node does not have a public network address when the distributed hash table is implemented in the network, and reducing the application limit of the distributed hash table.
Description
Technical Field
The invention relates to the technical field of computer networks, in particular to a distributed hash table implementation method, a computer device and a storage medium.
Background
The existing distributed hash table implementation technology requires that nodes in a network have public network addresses, so that the distributed hash table needs to rely on network attached devices or attached network settings to discover the nodes, which limits the application of the distributed hash table.
Interpretation of terms:
network address translation: the full english name is Network Address Translation, abbreviated as NAT, and also called Network masking or IP masquerading (IP masquerading), which is a technology for rewriting a source IP Address or a destination IP Address when an IP packet passes through a router or a firewall. This technique is commonly used in private networks that have multiple hosts but access the internet through only one public IP address. The server used to implement NAT may be referred to as a NAT server. Since intranet traversal is typically applied in NAT scenarios, intranet traversal may also be referred to as NAT traversal.
Distributed hash table: the method is a network structure for constructing a macro hash table on a plurality of nodes. Any node can write a key value pair in the DHT, and the DHT automatically finds a group of nodes in the network to record the key value pair. Any node can then look for the stored value in the network based on the stored key. The data that can theoretically be stored in the DHT increases as the number of participants increases. The DHT can be used for discovering nodes in the network, and all nodes participating in the DHT can be mapped to a uniform node mark. The node marks are used for inquiring in the network, the nodes in the network can be found through the uniform node marks, different types of networks can be linked, and mapping of different node access modes is achieved. Meanwhile, due to the distributed characteristic of the DHT, the offline of partial nodes in the network cannot influence the operation of the whole system.
Disclosure of Invention
In view of at least one of the above technical problems, an object of the present invention is to provide a distributed hash table implementation method, a computer apparatus, and a storage medium.
In one aspect, an embodiment of the present invention includes a method for implementing a distributed hash table, including:
finding out at least one third node; the third node is the node closest to the second node;
sending query information to the third node; the third node responds to the query information, returns information of at least one fourth node to the first node, and sends the information of the first node to the fourth node, wherein the fourth node is the node closest to the first node; the fourth node responds to the information of the first node and requests to establish connection with the first node;
when the presence of the second node is detected from each of the fourth nodes, a connection is established with the second node in response to a request for connection establishment by the second node.
Further, the distributed hash table implementation method further includes:
establishing a buffer area;
storing information of each third node in the buffer area; the buffer is configured to provide the stored information of part or all of the third node when the step of sending query information to the third node is performed.
Further, the distributed hash table implementation method further includes:
when the second node is not detected to exist in each fourth node, storing the information of each fourth node in the buffer area;
carrying out duplicate removal processing on the information stored in the buffer area;
information of a number of nodes furthest away from the first node is deleted from the buffer.
Further, the fourth node sends a fourth data packet to the first node in response to the information of the first node.
Further, the distributed hash table implementation method further includes:
and sending the first data packet to the fourth node.
Further, the establishing a connection with the second node specifically includes:
when the connection with the second node is established within the preset time, maintaining the established connection;
when the connection establishment with the second node is not completed within the preset time, responding to the connection establishment request of the fourth node, and establishing connection with at least one fourth node except the second node; the fourth node establishing the connection is used for forwarding data between the first node and the second node.
Further, the establishing a connection with the second node specifically includes:
acquiring the address of the second node according to the information of the second node;
and when the plurality of addresses of the second node are acquired, selecting the address to be connected from the plurality of addresses of the second node according to the priority order of the local address, the internal network address with the lowest delay, the internal network address with higher delay, the public network address with the lowest delay and the public network address with higher delay.
Further, the information of the node includes identification information and connection information of the node.
In another aspect, an embodiment of the present invention further includes a computer apparatus, including a memory and a processor, where the memory is used to store at least one program, and the processor is used to load the at least one program to perform the method of the embodiment.
In another aspect, the present invention further includes a storage medium, in which a program executable by a processor is stored, and the program executable by the processor is used for executing the method of the embodiment when being executed by the processor.
The invention has the beneficial effects that: the distributed hash table implementation method in the embodiment implements the distributed hash table by applying the principle of an intranet penetration technology, and decentralized node penetration can be implemented by searching for a third node, a fourth node and other technical means, so that when the distributed hash table is implemented in a network, discovery of any node can be implemented without depending on a centralized penetration server even if the node does not have a public network address, and therefore, when the distributed hash table is applied and the node needs to be discovered, network auxiliary equipment or auxiliary network setting is not required, and application limitation of the distributed hash table is reduced.
Drawings
FIG. 1 is a diagram illustrating a network architecture in which a DHT implementation method is implemented according to an embodiment;
FIG. 2 is a flowchart of a DHT implementation method in an embodiment.
Detailed Description
In this embodiment, the distributed hash table implementation method may be applied to a network as shown in fig. 1. In the network shown in fig. 1, there are a plurality of nodes, each node locally maintains a routing table, and the routing table records identification information, connection information, and mapping relationship between the identification information and the connection information of the node and other nodes. Therefore, each node can inquire the identification information and the connection information of a plurality of nodes closest to a certain target node from a locally stored routing table.
In the network shown in fig. 1, each node may be a computer device such as a router or a client. The network shown in fig. 1 illustrates a topology of connection relationships between nodes, where some nodes are connected to the network or other nodes through NAT servers, and these nodes may be regarded as a combination of routers and NAT servers, and such a case may be referred to as "router behind NAT server".
In this embodiment, the first node may be denoted as C, and the second node may be denoted as T.
In this embodiment, the first node C executes the distributed hash table implementation method. Referring to fig. 2, the distributed hash table implementation method includes the following steps:
s1, finding out at least one third node;
in this embodiment, the first node C searches for identification information and connection information of each node from a locally stored routing table, calculates a distance between each node and the second node T with the second node T as a target node, and then selects a node closest to the second node T, where the nodes are third nodes in this embodiment;
in this embodiment, the first node C may locally establish a buffer before executing step S1, and store the identification information and the connection information of each third node in the buffer; then reads out some or all of i third nodes from the buffer as { M }1,M2,…Mi}；
S2, sending query information to a third node;
the query information includes identification information and connection information of the first node C itself to indicate that the query information comes from the first node C; the query information further includes instructions to cause the third node { M }1,M2,…MiResponding to the instruction, inquiring identification information and connection information of each node from a routing table stored locally, calculating a distance between each node and a first node C, and then selecting one or more nodes closest to the first node C, wherein the nodes are fourth nodes in the embodiment;
third node { M1,M2,…MiReturning the identification information and the connection information of the fourth nodes inquired respectively to the first node C, and summarizing and screening k fourth nodes by the first node C, wherein the fourth nodes can be expressed as { N }1,N2,…Nk}; third node { M1,M2,…MiSending the identification information and connection information of the first node C to the fourth node N1,N2,…Nk}, fourth node { N1,N2,…NkRequesting to establish a connection with a first node C;
s3, from the fourth node { N1,N2,…NkDetects the presence of the second node T, if the fourth node N1,N2,…NkThere is a second node T, i.e. a fourth node { N } to which a connection is to be established1,N2,…NkIf a fourth node in the list is the second node T, the first node C responds to the request for establishing connection with the second node T (referred to as the fourth node from now on), establishes connection with the second node T, and ends the distributed hash table implementation method;
s4, if the fourth node { N1,N2,…NkIf there is no second node T, i.e. there is no fourth node as the second node T, then every fourth node { N }1,N2,…NkStoring the identification information and the connection information of the electronic device in a buffer area;
s5, after the step S4 is executed, the buffer area stores a fourth node { N }1,N2,…NkIdentification information and connection information of { M }, and a third node { M }1,M2,…MiThe identification information and the connection information of the fourth nodes are subjected to duplicate removal processing, wherein some fourth nodes may also be the third nodes at the same time;
s6. for the third node M stored in the buffer area1,M2,…MiAnd a fourth node { N }1,N2,…NkCalculating the distance between the first node C and the first node C, and deleting the identification information and the connection information of a plurality of nodes farthest from the first node C from the buffer area, so that identification information and connection information of r nodes are left in the buffer area, wherein the r nodes may be all third nodes, may be all fourth nodes, may be part of fourth nodes, and may be part of third nodes;
after the step S6 is completed, the node id information and the connection information stored in the buffer are updated, and the process returns to step S1 to start the process again until the step S3 is performed to establish a connection with the second node, or the number of cycles reaches a predetermined value.
In this embodiment, when the fourth node requests to establish a connection with the first node, a fourth data packet may be further sent to the first node, where the content of the fourth data packet includes data requesting verification and feedback of the first node, so as to test whether the connection with the first node is successfully established.
In this embodiment, when the first node establishes a connection with the second node, a first data packet may also be sent to the second node, where the content of the first data packet includes data requesting verification and feedback of the second node, so as to test whether the connection is successfully established with the second node.
In this embodiment, the steps S1-S6 implement the distributed hash table by applying the principle of the intranet tunneling technology, and decentralized node tunneling can be implemented by searching for the third node and the fourth node, so that when the distributed hash table is implemented in a network, discovery of any node can be implemented without relying on a centralized tunneling server even if the node does not have a public network address, and thus, when the distributed hash table is applied and a node needs to be discovered, the distributed hash table does not need to rely on network attached devices or attached network settings, and application limitations of the distributed hash table are reduced.
In this embodiment, the step S3, that is, the step of establishing a connection with the second node, specifically includes:
s301, when the connection with the second node T is established within the preset time, maintaining the established connection;
s302, when the connection with the second node T is not completed within the preset time, the second node T is a fourth node { N1,N2,…NkOne node of { N } and a fourth node of { N }1,N2,…NkThe first node C is connected with at least one fourth node except the second node T; these fourth nodes, which establish a connection with the first node C, serve as data transfer nodes between the first node C and the second node T, thereby establishing a connection between the first node C and the second node T.
In this embodiment, the step S3, that is, the step of establishing a connection with the second node, specifically includes:
s303, acquiring the address of the second node T according to the information of the second node T;
s304, when the plurality of addresses of the second node are obtained, the address to be connected is selected from the plurality of addresses of the second node according to the priority sequence of the local address, the internal network address with the lowest delay, the internal network address with the higher delay, the public network address with the lowest delay and the public network address with the higher delay.
In this embodiment, the second node T may operate in a subnet of the router, even a nested structure of multiple subnets, and therefore the router of the second node T may have one or more addresses, where the addresses include a local address, an intranet address, a public network address, and the like.
When a plurality of internal network addresses and a plurality of public network addresses exist, the delay of each internal network address is generally different, the delay of each public network address is generally different, compared with the internal network address with higher delay, the first node C preferentially selects the internal network address with lower delay of the second node T to be connected with the second node T, and when the internal network address with lower delay is unavailable, the first node C selects the internal network address with higher delay of the second node T to be connected with the second node T; and compared with the public network address with higher delay, the first node C preferentially selects the public network address with lower delay of the second node T to be connected with the second node T, and when the public network address with lower delay is unavailable, the first node C selects the public network address with higher delay of the second node T to be connected with the second node T.
In this embodiment, a computer apparatus includes a memory and a processor, where the memory is used to store at least one program, and the processor is used to load the at least one program to execute the distributed hash table implementation method in the embodiment, so as to achieve the same technical effects as those described in the embodiment.
In the present embodiment, a storage medium stores therein a program executable by a processor, and the program executable by the processor is used to execute the distributed hash table implementation method in the embodiments, thereby achieving the same technical effects as those described in the embodiments.
It should be noted that, unless otherwise specified, when a feature is referred to as being "fixed" or "connected" to another feature, it may be directly fixed or connected to the other feature or indirectly fixed or connected to the other feature. Furthermore, the descriptions of upper, lower, left, right, etc. used in the present disclosure are only relative to the mutual positional relationship of the constituent parts of the present disclosure in the drawings. As used in this disclosure, the singular forms "a", "an", and "the" are intended to include the plural forms as well, unless the context clearly indicates otherwise. In addition, unless defined otherwise, all technical and scientific terms used in this example have the same meaning as commonly understood by one of ordinary skill in the art. The terminology used in the description of the embodiments herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the invention. As used in this embodiment, the term "and/or" includes any combination of one or more of the associated listed items.
It will be understood that, although the terms first, second, third, etc. may be used herein to describe various elements, these elements should not be limited by these terms. These terms are only used to distinguish one element of the same type from another. For example, a first element could be termed a second element, and, similarly, a second element could be termed a first element, without departing from the scope of the present disclosure. The use of any and all examples, or exemplary language ("e.g.," such as "or the like") provided with this embodiment is intended merely to better illuminate embodiments of the invention and does not pose a limitation on the scope of the invention unless otherwise claimed.
It should be recognized that embodiments of the present invention can be realized and implemented by computer hardware, a combination of hardware and software, or by computer instructions stored in a non-transitory computer readable memory. The methods may be implemented in a computer program using standard programming techniques, including a non-transitory computer-readable storage medium configured with the computer program, where the storage medium so configured causes a computer to operate in a specific and predefined manner, according to the methods and figures described in the detailed description. Each program may be implemented in a high level procedural or object oriented programming language to communicate with a computer system. However, the program(s) can be implemented in assembly or machine language, if desired. In any case, the language may be a compiled or interpreted language. Furthermore, the program can be run on a programmed application specific integrated circuit for this purpose.
Further, operations of processes described in this embodiment can be performed in any suitable order unless otherwise indicated herein or otherwise clearly contradicted by context. The processes described in this embodiment (or variations and/or combinations thereof) may be performed under the control of one or more computer systems configured with executable instructions, and may be implemented as code (e.g., executable instructions, one or more computer programs, or one or more applications) collectively executed on one or more processors, by hardware, or combinations thereof. The computer program includes a plurality of instructions executable by one or more processors.
Further, the method may be implemented in any type of computing platform operatively connected to a suitable interface, including but not limited to a personal computer, mini computer, mainframe, workstation, networked or distributed computing environment, separate or integrated computer platform, or in communication with a charged particle tool or other imaging device, and the like. Aspects of the invention may be embodied in machine-readable code stored on a non-transitory storage medium or device, whether removable or integrated into a computing platform, such as a hard disk, optically read and/or write storage medium, RAM, ROM, or the like, such that it may be read by a programmable computer, which when read by the storage medium or device, is operative to configure and operate the computer to perform the procedures described herein. Further, the machine-readable code, or portions thereof, may be transmitted over a wired or wireless network. The invention described in this embodiment includes these and other different types of non-transitory computer-readable storage media when such media include instructions or programs that implement the steps described above in conjunction with a microprocessor or other data processor. The invention also includes the computer itself when programmed according to the methods and techniques described herein.
A computer program can be applied to input data to perform the functions described in the present embodiment to convert the input data to generate output data that is stored to a non-volatile memory. The output information may also be applied to one or more output devices, such as a display. In a preferred embodiment of the invention, the transformed data represents physical and tangible objects, including particular visual depictions of physical and tangible objects produced on a display.
The above description is only a preferred embodiment of the present invention, and the present invention is not limited to the above embodiment, and any modifications, equivalent substitutions, improvements, etc. within the spirit and principle of the present invention should be included in the protection scope of the present invention as long as the technical effects of the present invention are achieved by the same means. The invention is capable of other modifications and variations in its technical solution and/or its implementation, within the scope of protection of the invention.
Claims (10)
1. A distributed hash table implementation method, executed by a first node, includes:
finding out at least one third node; the third node is the node closest to the second node;
sending query information to the third node; the third node responds to the query information, returns information of at least one fourth node to the first node, and sends the information of the first node to the fourth node, wherein the fourth node is the node closest to the first node; the fourth node responds to the information of the first node and requests to establish connection with the first node;
when the presence of the second node is detected from each of the fourth nodes, a connection is established with the second node in response to a request for connection establishment by the second node.
2. The DHT implementation method of claim 1, further comprising:
establishing a buffer area;
storing information of each third node in the buffer area; the buffer is configured to provide the stored information of part or all of the third node when the step of sending query information to the third node is performed.
3. The DHT implementation method of claim 2, further comprising:
when the second node is not detected to exist in each fourth node, storing the information of each fourth node in the buffer area;
carrying out duplicate removal processing on the information stored in the buffer area;
information of a number of nodes furthest away from the first node is deleted from the buffer.
4. The DHT implementation method of any one of claims 1-3, wherein the fourth node sends a fourth packet to the first node in response to the information of the first node.
5. The DHT implementation method of claim 4, further comprising:
and sending the first data packet to the fourth node.
6. The DHT implementation method according to any one of claims 1 to 3, wherein the establishing of the connection with the second node specifically includes:
when the connection with the second node is established within the preset time, maintaining the established connection;
when the connection establishment with the second node is not completed within the preset time, responding to the connection establishment request of the fourth node, and establishing connection with at least one fourth node except the second node; the fourth node establishing the connection is used for forwarding data between the first node and the second node.
7. The DHT implementation method according to any one of claims 1 to 3, wherein the establishing of the connection with the second node specifically includes:
acquiring the address of the second node according to the information of the second node;
and when the plurality of addresses of the second node are acquired, selecting the address to be connected from the plurality of addresses of the second node according to the priority order of the local address, the internal network address with the lowest delay, the internal network address with higher delay, the public network address with the lowest delay and the public network address with higher delay.
8. The DHT implementation method according to any one of claims 1 to 3, wherein the node information includes node identification information and connection information.
9. A computer apparatus comprising a memory for storing at least one program and a processor for loading the at least one program to perform the method of any one of claims 1-8.
10. A storage medium having stored therein a program executable by a processor, wherein the program executable by the processor is adapted to perform the method of any one of claims 1-8 when executed by the processor.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010841474.4A CN112187963B (en) | 2020-08-20 | 2020-08-20 | Distributed hash table implementation method, computer device and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010841474.4A CN112187963B (en) | 2020-08-20 | 2020-08-20 | Distributed hash table implementation method, computer device and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112187963A true CN112187963A (en) | 2021-01-05 |
| CN112187963B CN112187963B (en) | 2023-02-28 |
Family
ID=73923925
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010841474.4A Active CN112187963B (en) | 2020-08-20 | 2020-08-20 | Distributed hash table implementation method, computer device and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112187963B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113239098A (en) * | 2021-07-14 | 2021-08-10 | 腾讯科技（深圳）有限公司 | Data management method, computer and readable storage medium |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2011035646A1 (en) * | 2009-09-24 | 2011-03-31 | 中兴通讯股份有限公司 | Method and node for loading in one-hop distributed hash table overlay network |
| CN102404372A (en) * | 2010-09-16 | 2012-04-04 | 中国移动通信集团江苏有限公司 | Method, system and node device for storing content in WEB cache in distributed mode |
| US20130024510A1 (en) * | 2011-07-22 | 2013-01-24 | Alcatel-Lucent Usa Inc. | Content Popularity Extraction In Distributed Hash Table Based Peer-To-Peer Networks |
| CN109857913A (en) * | 2019-01-15 | 2019-06-07 | 苏州链读文化传媒有限公司 | A kind of distributed content lookup method |
| CN110958303A (en) * | 2019-11-14 | 2020-04-03 | 杭州复杂美科技有限公司 | Block storage and query method, equipment and storage medium |
| CN111352938A (en) * | 2020-02-26 | 2020-06-30 | 深圳市网心科技有限公司 | Data processing method, computer device and storage medium |
-
2020
- 2020-08-20 CN CN202010841474.4A patent/CN112187963B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2011035646A1 (en) * | 2009-09-24 | 2011-03-31 | 中兴通讯股份有限公司 | Method and node for loading in one-hop distributed hash table overlay network |
| CN102404372A (en) * | 2010-09-16 | 2012-04-04 | 中国移动通信集团江苏有限公司 | Method, system and node device for storing content in WEB cache in distributed mode |
| US20130024510A1 (en) * | 2011-07-22 | 2013-01-24 | Alcatel-Lucent Usa Inc. | Content Popularity Extraction In Distributed Hash Table Based Peer-To-Peer Networks |
| CN109857913A (en) * | 2019-01-15 | 2019-06-07 | 苏州链读文化传媒有限公司 | A kind of distributed content lookup method |
| CN110958303A (en) * | 2019-11-14 | 2020-04-03 | 杭州复杂美科技有限公司 | Block storage and query method, equipment and storage medium |
| CN111352938A (en) * | 2020-02-26 | 2020-06-30 | 深圳市网心科技有限公司 | Data processing method, computer device and storage medium |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113239098A (en) * | 2021-07-14 | 2021-08-10 | 腾讯科技（深圳）有限公司 | Data management method, computer and readable storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112187963B (en) | 2023-02-28 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| KR101055048B1 (en) | Information communication system, information processing apparatus and method, and recording medium | |
| US11579808B2 (en) | Fabric driven non-volatile memory express subsystem zoning | |
| US7620732B2 (en) | Apparatus for and method of setting communication path | |
| US10574570B2 (en) | Communication processing method and apparatus | |
| EP3219087B1 (en) | Methods, systems, and computer readable media for facilitating the resolving of endpoint hostnames in test environments with firewalls, network address translators(nats), or clouds | |
| US20070288613A1 (en) | Providing support for responding to location protocol queries within a network node | |
| US11696110B2 (en) | Distributed, crowdsourced internet of things (IoT) discovery and identification using Block Chain | |
| KR20150113597A (en) | Method and apparatus for processing arp packet | |
| CN109525684B (en) | Message forwarding method and device | |
| CN112333017B (en) | Service configuration method, device, equipment and storage medium | |
| US9344399B2 (en) | Relay server and relay communication system | |
| CN113364741A (en) | Application access method and proxy server | |
| US20170052809A1 (en) | Management device, control device, and management method | |
| WO2016133066A1 (en) | Name identification device, name identification method and recording medium | |
| CN112187963B (en) | Distributed hash table implementation method, computer device and storage medium | |
| WO2014142278A1 (en) | Control device, communication system, communication method, and program | |
| US9847927B2 (en) | Information processing device, method, and medium | |
| JP2008098887A (en) | File transfer server | |
| JP2008311939A (en) | Network communication equipment | |
| CN114827015B (en) | Data forwarding method and virtualized cloud network architecture | |
| CN106789666B (en) | Method and device for determining converted port | |
| JP6605149B2 (en) | Method and apparatus for detecting shared terminal | |
| CN113014682B (en) | Method, system, terminal equipment and storage medium for realizing network dynamic property | |
| JP6470640B2 (en) | COMMUNICATION DEVICE, ITS CONTROL METHOD, COMPUTER PROGRAM | |
| KR20200006521A (en) | Distributed scanning |
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 |