CN109639582A - A kind of network node treatment method and device based on distributed hashtable - Google Patents
A kind of network node treatment method and device based on distributed hashtable Download PDFInfo
- Publication number
- CN109639582A CN109639582A CN201811496806.9A CN201811496806A CN109639582A CN 109639582 A CN109639582 A CN 109639582A CN 201811496806 A CN201811496806 A CN 201811496806A CN 109639582 A CN109639582 A CN 109639582A
- Authority
- CN
- China
- Prior art keywords
- node
- network node
- network
- priority
- file
- 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
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/74—Address processing for routing
- H04L45/745—Address table lookup; Address filtering
- H04L45/7453—Address table lookup; Address filtering using hashing
-
- 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/1061—Peer-to-peer [P2P] networks using node-based peer discovery mechanisms
- H04L67/1065—Discovery involving distributed pre-established resource-based relationships among peers, e.g. based on distributed hash tables [DHT]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/50—Network services
- H04L67/52—Network services specially adapted for the location of the user terminal
Abstract
The invention relates to a kind of network node treatment method based on distributed hashtable, device, network node, distributed hashtable network and storage medium.The described method includes: obtaining the node ID of the first network node；Obtain the location information of the first network node；According to the positional information and the node ID generates the first node ID comprising node location information.Thus it can solve the problems, such as not to be associated between nodal distance and real network delay, network addressing speed and communication efficiency can be improved.
Description
Technical field
The present invention relates to field of computer technology, handle more particularly to a kind of network node based on distributed hashtable
Method, apparatus, network node, distributed hashtable network and storage medium.
Background technique
Distributed hashtable (DHT, Distributed Hash Table), is a kind of distributed storage method.It is being not required to
In the case where wanting server, each client is responsible for a small-scale routing, and is responsible for storage sub-fraction data, thus real
The now addressing and storage of entire DHT network.
There is no general ID to produce algorithm by ID in DHT, and traditional ID, which is generated, to be generated by the public spoon of user, so
And node checks are carried out using ID in communication and calculating process, due to not closed between nodal distance and real network delay
Connection, it will lead to that network addressing speed is slow and communication efficiency is low.
Summary of the invention
Embodiment of the present invention is mainly solving the technical problems that provide a kind of network node based on distributed hashtable
Processing method, device, network node, distributed hashtable network and storage medium, be able to solve nodal point separation in the prior art
The problem of from not being associated between real network delay, network addressing speed and communication efficiency can be improved.
In a first aspect, the embodiment of the present application provides a kind of network node treatment method based on distributed hashtable, institute
Method is stated for first network node, the described method comprises the following steps:
Obtain the node ID of the first network node；
Obtain the location information of the first network node；
According to the positional information and the node ID generates the first node ID comprising node location information.
In some embodiments, the method also includes:
The second node ID in the second network node comprising node location information is obtained, second network node is at least
One；
It is that second network node distributes priority level according to the first node ID and second node ID.
In some embodiments, the priority level includes at least the first priority and the second priority, and described first is excellent
First grade is higher than second priority level.
In some embodiments, the method also includes:
Obtain the file ID of file；
The second network node in the first priority of the first network node is obtained, and obtains the first network section
The nodal distance of point and the second network node each in the first priority；
The file is stored in the smallest second network node of distance in the nodal distance.
In some embodiments, the method also includes:
Obtain the file ID of file；
By the node of each second network node in the first priority of first network node described in the file ID matches
ID；
If the file ID is matched with the node ID of the second network node in first priority, from matched
The file is read in two network nodes, if each second network node in the file ID and first priority
Node ID mismatches, then continues to match each second net in the second priority of the first network node for the file ID
The node ID of network node.
In some embodiments, the location information for obtaining the first network node ID, comprising:
Obtain at least one of address longitude and latitude, countries and regions and the operator where the network node.
In some embodiments, it is described according to the positional information and the node ID generate include node location information
First node ID, comprising:
The node ID is extended, increases the X for indicating the location information newly on the basis of original node ID
Position, X is natural number.
Second aspect, the network node processing unit based on distributed hashtable that the embodiment of the present application also provides a kind of,
Described device is used for first network node, comprising:
First obtains module, for obtaining the node ID of the first network node；
Second obtains module, for obtaining the location information of the first network node；
Generation module includes the first of node location information for generating according to the location information and the node ID very much
Node ID.
The third aspect, the embodiment of the present application also provides a kind of network nodes, comprising:
At least one processor；And
The memory being connect at least one described processor communication；Wherein,
The memory is stored with the instruction that can be executed by least one described processor, and described instruction is by described at least one
A processor executes, so that at least one described processor is able to carry out above-mentioned method.
Fourth aspect, the embodiment of the present application also provides a kind of networks based on distributed hashtable, including at least one
Network node described above.
5th aspect, the embodiment of the present application also provides a kind of non-volatile computer readable storage medium storing program for executing, the calculating
Machine readable storage medium storing program for executing is stored with computer executable instructions, when the computer executable instructions are executed by processor, makes
The processor executes above-mentioned method.
Network node treatment method and device provided by the embodiments of the present application based on distributed hashtable, by obtaining the
The node ID and location information of one network node generate the first node ID comprising node location information, thus can solve node
The problem of not being associated between distance and real network delay, can improve network addressing speed and communication efficiency.
Detailed description of the invention
One or more embodiments are illustrated by the picture in corresponding attached drawing, these exemplary theorys
The bright restriction not constituted to embodiment, the element in attached drawing with same reference numbers label are expressed as similar element, remove
Non- to have special statement, composition does not limit the figure in attached drawing.
Fig. 1 is network diagram of the application based on distributed hashtable；
Fig. 2 is the flow chart of one embodiment of network node treatment method of the application based on distributed hashtable；
Fig. 3 is the flow chart of another embodiment of network node treatment method of the application based on distributed hashtable；
Fig. 4 is storage file in the one embodiment of the application based on the network node treatment method of distributed hashtable
Flow chart；
Fig. 5 is reading file in the one embodiment of the application based on the network node treatment method of distributed hashtable
Flow chart；
Fig. 6 is the structural block diagram of one embodiment of network node processing unit of the application based on distributed hashtable；
Fig. 7 is the hardware structural diagram of one embodiment of the application network node.
Specific embodiment
To keep the purposes, technical schemes and advantages of the embodiment of the present application clearer, below in conjunction with the embodiment of the present application
In attached drawing, the technical scheme in the embodiment of the application is clearly and completely described, it is clear that described embodiment is
Some embodiments of the present application, instead of all the embodiments.Based on the embodiment in the application, those of ordinary skill in the art
Every other embodiment obtained without creative efforts, shall fall in the protection scope of this application.
Network provided by the present application based on distributed hashtable, as shown in Figure 1, including first network node 20, multiple
Second network node 30 communicates to connect between the arbitrary node in first net node 20 and multiple second network nodes 30, in Fig. 1
It is only exemplary and shows the second network node A, the second network node B, the second network node C, in real network environment
It further include more second network nodes.It should be noted that first network node and the second network node are only to facilitate say
Bright the application and define, be relative concept.It is first network node, the second network section that any node in network, which can also be defined,
Point, without adhering rigidly to definition in this present embodiment.
Specifically, obtaining the node ID of first network node and the location information of first network node, believed according to position
Breath and node ID generate the first node ID comprising node location information, thus solve nodal distance and real network delay
Between the problem of not being associated with.
As shown in Fig. 2, the embodiment of the present application provides a kind of network node treatment method based on distributed hashtable, use
In first network node, comprising the following steps:
Step 202, the node ID of first network node is obtained.
Wherein, node ID is the identity of node, each node has and an only unique node ID is right therewith
It answers.There are numerous nodes, one in only numerous network nodes that the present embodiment obtains saves network in distributed hashtable
Point ID.
Step 204, the location information of first network node is obtained.
Location information includes physical location, countries and regions and the fortune of address longitude and latitude where node, certain coded format
Seek at least one in quotient.After the node ID for obtaining first network node, the location information of first network node is then obtained.
Step 206, the first node ID comprising node location information is generated according to location information and node ID.
First node ID is generated according to the node ID of first network node and the location information of first network node, raw
At first node ID contain the location information of node.
The above-mentioned network node treatment method based on distributed hashtable, by obtain first network node node ID and
Location information generates the first node ID comprising node location information, and solving does not have between nodal distance and real network delay
The problem of association, improves network addressing speed and communication efficiency.
As shown in figure 3, in one embodiment based on the network node treatment method of distributed hashtable further include:
Step 302, the second node ID in the second network node comprising node location information is obtained, the second network node is
At least one.
It step 304, is that the second network node distributes priority according to first node ID and second node ID.
Second node ID is obtained according to the node ID of the second network node and the location information of the second network node, the
Two network nodes have it is multiple, the node ID for the location information that each different network node includes be it is different, in this implementation
In example, the second network node is at least one.The priority of second network node is determined by first node ID and second node ID
Fixed, the location information as where each node ID contains node, it is possible to according to node ID as division second
The foundation of network node priority.
In one embodiment based on the network node treatment method of distributed hashtable further include: priority level is at least wrapped
The first priority and the second priority are included, the first priority is higher than the second priority.In the present embodiment, priority is for weighing
Measure a key factor of network delay, it is however generally that, priority is higher, and network delay is smaller.Priority is according to first segment
What point ID and second node ID was determined.For example, priority is divided based on actual geographical location, then setting with city
It is set to the first priority, same province is the second priority with state, divides according to national size and actual conditions, is that third is preferential with continent
Grade, and so on, can have many uncertain factors due to transnational, the division of priority determine according to the actual situation be
Can, different grades can be divided to priority, without sticking to the present embodiment.The present embodiment by the second network node into
The division of row major grade solves the problems, such as not to be associated between nodal distance and real network delay, net thus can be improved
Network addressing speed and communication efficiency.
As shown in figure 4, in one embodiment based on the network node treatment method of distributed hashtable further include:
Step 402, the file ID of file is obtained.
File ID is obtained by algorithm, each file has by calculating and only one file ID.
Step 404, the second network node in the first priority of first network node is obtained, and obtains first network section
The nodal distance of point and the second network node each in the first priority.
Step 406, file is stored in the smallest second network node of distance in nodal distance.
When carrying out file storage, need to know the node of the second network node in the first priority of first network node
Distance, file storage can select nearest node to be stored according to nodal distance.Specifically, first having to obtain first network section
Point the first priority in the second network node, then by operation obtain first network node with it is each in the first priority
The nodal distance of second network node, according to nodal distance determine file storage position, by file be stored in nodal distance in away from
From the smallest second network node.It should be noted that the second network node can have it is multiple, be elected in distance it is the smallest by the
When two network nodes refuse the storage of file, then the second network node for selecting distance second close node stored as a file,
And so on, it stores until by file to the second network node.By obtaining the file ID and calculate node distance of file, most
File is stored into nodal distance in the smallest second network node afterwards, is solved between nodal distance and real network delay
The problem of not being associated with further improves network addressing speed and communication efficiency.
As shown in figure 5, in one embodiment based on the network node treatment method of distributed hashtable further include:
Step 502, the file ID of file is obtained.
Step 504, by the node of each second network node in the first priority of file ID matches first network node
ID。
File ID is obtained by algorithm, each file has by calculating and only one file ID.File is read
When, since file ID is known, elder generation's each second net in the first priority of first network node according to file ID
The node ID of network node carries out file search.
Step 506, if file ID is matched with the node ID of the second network node in the first priority, from the second network
File is read in node, if the node ID of file ID and each second network node in the first priority mismatches,
File ID is continued to the node ID of each second network node in the second priority of matching first network node.
Specifically, file read when, file ID be it is known, with the second network node in file ID and the first priority
Node ID matched, if node ID of the file ID just with the second network node in the first priority matches,
Can file directly be read from the second network node.If the node of each second network node in file ID and the first priority
ID is uniformly matched, and is also meaned that, file not associated therewith in the first priority, then continues file ID to match the first net
The node ID of each second network node in second priority of network node.If each in file ID and the second priority
The node ID of two network nodes mismatches, then carries out each second network in the third priority of matching first network node
The node ID of node, by this present embodiment, priority is up to three-level, so when the third for being matched to first network node is excellent
When the node ID of each second network node in first grade, it can all be matched to corresponding node ID.In some other embodiment,
Priority can be multistage, divide according to the actual situation, without sticking to the present embodiment.
In one embodiment based on the network node treatment method of distributed hashtable further include: obtain network node institute
At least one of address longitude and latitude, countries and regions and operator.
At least one of address longitude and latitude, countries and regions and operator can be believed as the position of network node ID
Breath.
In one embodiment based on the network node treatment method of distributed hashtable further include: expand node ID
Exhibition, increases the position X for indicating location information newly, X is natural number on the basis of original node ID.
Specifically, node ID is increased newly on the basis of original node ID, such as node ID is 64, then for node
ID is extended, and highest 16 for indicating physical location, the country ground of address longitude and latitude where node, certain coded format
Area and operator etc..
Correspondingly, the embodiment of the present application also provides a kind of network node processing unit based on distributed hashtable, is used
In first network node, as shown in Figure 6, comprising: the first acquisition module 602, the second acquisition module 604, generation module 606,
In:
First obtains module 602, for obtaining the node ID of first network node.
Second obtains module 604, for obtaining the location information of first network node.
Generation module 606 includes node location for being generated according to the location information and node ID of first network node
The first node ID of information.
Network node processing unit provided by the embodiments of the present application based on distributed hashtable, by obtaining first network
The node ID and location information of node generate the first node ID comprising node location information, solve nodal distance and practical net
The problem of not being associated between network delay, improves network addressing speed and communication efficiency.
In one embodiment, the network node processing unit based on distributed hashtable further include distribution module 608,
With module 610, expansion module 612, memory module 614, read module 616.Distribution module 608 be used for according to first node ID and
Second node ID is that the second network node distributes priority level.Matching module 610 is used for file ID matches first network node
The first priority in each second network node node ID；If each second network in file ID and the first priority
The node ID of node mismatches, then continues file ID to match each second network in the second priority of first network node
The node ID of node.Expansion module 612 increases X newly for being extended to node ID on the basis of original node ID, and X is
Natural number.Memory module 614 is used to file being stored in the smallest second network node of distance in nodal distance.Read module 616
If being matched for file ID with the node ID of the second network node in the first priority, from matched second network node
Read file.
In one embodiment, the first acquisition module 602 can also obtain in the second network node believes comprising node location
The second node ID of breath, the second network node are at least one；Obtain the file ID of file；Obtain the first of first network node
The second network node in priority, and obtain the node of each second network node in first network node and the first priority
Distance；Obtain at least one of address longitude and latitude, countries and regions and the operator where network node.
It should be noted that the embodiment of the present application can be performed in the above-mentioned network node processing unit based on distributed hashtable
The provided network node treatment method based on distributed hashtable has the corresponding functional module of execution method and beneficial to effect
Fruit.The technical detail of detailed description not in the network node processing device embodiment based on distributed hashtable, reference can be made to this
Apply for the network node treatment method based on distributed hashtable provided by embodiment.
Fig. 7 is the hardware structural diagram of network node 10 provided by the embodiments of the present application, as shown in fig. 7, the network section
Putting 10 includes:
One or more processors 11 and memory 12, in Fig. 7 by taking a processor 11 as an example.
Processor 11 can be connected with memory 12 by bus or other modes, to be connected as by bus in Fig. 7
Example.
Memory 12 is used as a kind of non-volatile computer readable storage medium storing program for executing, can be used for storing non-volatile software journey
Sequence, non-volatile computer executable program and module, such as the network based on distributed hashtable in the embodiment of the present application
Corresponding program instruction/the module of Node Processing Method is (for example, attached shown in fig. 6 first obtains the acquisition module of module 602, second
604 and generation module 606).
Non-volatile software program, instruction and module of the processor 11 by operation storage in memory 12, thus
Execute network node various function application and data processing, i.e., realization above method embodiment based on distributed hashtable
Network node treatment method.
Memory 12 may include storing program area and storage data area, wherein storing program area can storage program area,
Application program required at least one function；Storage data area can be stored according at the network node based on distributed hashtable
Reason device uses created data etc..In addition, memory 12 may include high-speed random access memory, can also include
Nonvolatile memory, for example, at least a disk memory, flush memory device or other non-volatile solid state memory parts.
In some embodiments, it includes the memory remotely located relative to processor 11, these remote memories that memory 12 is optional
Network connection to the network node processing unit based on distributed hashtable can be passed through.The example of above-mentioned network includes but unlimited
In internet, intranet, local area network, mobile radio communication and combinations thereof.
One or more of modules are stored in the memory 12, when by one or more of processors 11
When execution, the network node treatment method based on distributed hashtable in above-mentioned any means embodiment is executed, for example, executing
Method and step 202 in Fig. 2 described above is to step 206, method and step 302 in Fig. 3 to step 304, the method in Fig. 4
Step 402 is to step 406, method and step 502 in Fig. 5 to step 506；Realize the function of the module 602 to 616 in Fig. 6.
The embodiment of the present application provides a kind of non-volatile computer readable storage medium storing program for executing, the computer-readable storage medium
Matter is stored with computer executable instructions, which is executed by one or more processors, such as in Fig. 7
One processor 11, may make said one or multiple processors can be performed in above-mentioned any means embodiment based on distribution
The network node treatment method of Hash table, for example, executing method and step 202 in Fig. 2 described above to step 206, in Fig. 3
Method and step 302 to step 304, method and step 402 in Fig. 4 to step 406, method and step 502 in Fig. 5 to step
506；Realize the function of the module 602 to 616 in Fig. 6.
The apparatus embodiments described above are merely exemplary, wherein described, unit can as illustrated by the separation member
It is physically separated with being or may not be, component shown as a unit may or may not be physics list
Member, it can it is in one place, or may be distributed over multiple network units.It can be selected according to the actual needs
In some or all of the modules achieve the purpose of the solution of this embodiment.
Through the above description of the embodiments, those of ordinary skill in the art can be understood that each embodiment
The mode of general hardware platform can be added to realize by software, naturally it is also possible to pass through hardware.Those of ordinary skill in the art can
With understand all or part of the process realized in above-described embodiment method be can be instructed by computer program it is relevant hard
Part is completed, and the program can be stored in a computer-readable storage medium, the program is when being executed, it may include as above
State the process of the embodiment of each method.Wherein, the storage medium can be magnetic disk, CD, read-only memory (Read-
Only Memory, ROM) or random access memory (RandomAcces sMemory, RAM) etc..
Finally, it should be noted that above embodiments are only to illustrate the technical solution of the application, rather than its limitations；At this
It under the thinking of application, can also be combined between the technical characteristic in above embodiments or different embodiment, step can be with
It is realized with random order, and there are many other variations of the different aspect of the application as described above, for simplicity, they do not have
Have and is provided in details；Although the application is described in detail with reference to the foregoing embodiments, the ordinary skill people of this field
Member is it is understood that it is still possible to modify the technical solutions described in the foregoing embodiments, or to part of skill
Art feature is equivalently replaced；And these are modified or replaceed, each reality of the application that it does not separate the essence of the corresponding technical solution
Apply the range of a technical solution.
Claims (11)
1. a kind of network node treatment method based on distributed hashtable, the method is used for first network node, feature
It is, the described method comprises the following steps:
Obtain the node ID of the first network node；
Obtain the location information of the first network node；
According to the positional information and the node ID generates the first node ID comprising node location information.
2. the method according to claim 1, wherein the method also includes:
The second node ID in the second network node comprising node location information is obtained, second network node is at least one
It is a；
It is that second network node distributes priority level according to the first node ID and second node ID.
3. according to the method described in claim 2, it is characterized in that, the priority level includes at least the first priority and second
Priority, first priority are higher than second priority.
4. according to the method described in claim 3, it is characterized in that, the method also includes:
Obtain the file ID of file；
Obtain the second network node in the first priority of the first network node, and obtain the first network node with
The nodal distance of each second network node in first priority；
The file is stored in the smallest second network node of distance in the nodal distance.
5. the method according to claim 3 or 4, which is characterized in that the method also includes:
Obtain the file ID of file；
By the node ID of each second network node in the first priority of first network node described in the file ID matches；
If the file ID is matched with the node ID of the second network node in first priority, from matched second net
The file is read in network node, if the node of each second network node in the file ID and first priority
ID is mismatched, then continues to match each second network section in the second priority of the first network node for the file ID
The node ID of point.
6. the method according to claim 1, wherein the position letter for obtaining the first network node ID
Breath, comprising:
Obtain at least one of address longitude and latitude, countries and regions and the operator where the network node.
7. the method according to claim 1, wherein it is described according to the positional information and the node ID is raw
At the first node ID comprising node location information, comprising:
The node ID is extended, increases the position X for indicating the location information, X newly on the basis of original node ID
For natural number.
8. a kind of network node processing unit based on distributed hashtable, described device is used for first network node, feature
It is, comprising:
First obtains module, for obtaining the node ID of the first network node；
Second obtains module, for obtaining the location information of the first network node；
Generation module, for according to the positional information and the node ID generate include node location information first node
ID。
9. a kind of network node characterized by comprising
At least one processor；And
The memory being connect at least one described processor communication；Wherein,
The memory is stored with the instruction that can be executed by least one described processor, and described instruction is by described at least one
It manages device to execute, so that at least one described processor is able to carry out the described in any item methods of claim 1-7.
10. a kind of network based on distributed hashtable, which is characterized in that including at least one net as claimed in claim 9
Network node.
11. a kind of non-volatile computer readable storage medium storing program for executing, which is characterized in that the computer-readable recording medium storage has
Computer executable instructions want the processor perform claim when the computer executable instructions are executed by processor
Seek the described in any item methods of 1-7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811496806.9A CN109639582A (en) | 2018-12-07 | 2018-12-07 | A kind of network node treatment method and device based on distributed hashtable |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811496806.9A CN109639582A (en) | 2018-12-07 | 2018-12-07 | A kind of network node treatment method and device based on distributed hashtable |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN109639582A true CN109639582A (en) | 2019-04-16 |
Family
ID=66072120
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811496806.9A Pending CN109639582A (en) | 2018-12-07 | 2018-12-07 | A kind of network node treatment method and device based on distributed hashtable |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109639582A (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110784549A (en) * | 2019-11-01 | 2020-02-11 | 深圳市网心科技有限公司 | Network node selection method and device, first network node and storage medium |
| CN110996139A (en) * | 2019-12-19 | 2020-04-10 | 浙江大华技术股份有限公司 | Video path switching processing method and device |
| JP2020524932A (en) * | 2017-06-20 | 2020-08-20 | エヌチェーン ホールディングス リミテッドＮｃｈａｉｎ Ｈｏｌｄｉｎｇｓ Ｌｉｍｉｔｅｄ | Method and system for coherent distributed memory pools in blockchain networks |
| CN112733474A (en) * | 2020-12-15 | 2021-04-30 | 西安国微半导体有限公司 | Netlist-level circuit area optimization method based on AND gate inverter diagram and storage medium |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101505262A (en) * | 2008-02-05 | 2009-08-12 | 华为技术有限公司 | Method and apparatus for establishing route |
| CN101626392A (en) * | 2008-07-08 | 2010-01-13 | 中国移动通信集团公司 | Methods and systems for storing and searching data |
| CN101771715A (en) * | 2008-12-26 | 2010-07-07 | 华为技术有限公司 | Method, device and system for establishing distribution type network |
| CN101860474A (en) * | 2009-04-08 | 2010-10-13 | 中兴通讯股份有限公司 | Peer-to-peer network and resource information processing method based on same |
| CN102223627A (en) * | 2011-06-17 | 2011-10-19 | 北京工业大学 | Beacon node reputation-based wireless sensor network safety locating method |
| CN106339450A (en) * | 2016-08-25 | 2017-01-18 | 成都索贝数码科技股份有限公司 | Index method of tree-shaped data |
| CN106789632A (en) * | 2017-02-25 | 2017-05-31 | 郑州云海信息技术有限公司 | A kind of method of the node-routing of large-scale distributed storage system |
-
2018
- 2018-12-07 CN CN201811496806.9A patent/CN109639582A/en active Pending
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101505262A (en) * | 2008-02-05 | 2009-08-12 | 华为技术有限公司 | Method and apparatus for establishing route |
| CN101626392A (en) * | 2008-07-08 | 2010-01-13 | 中国移动通信集团公司 | Methods and systems for storing and searching data |
| CN101771715A (en) * | 2008-12-26 | 2010-07-07 | 华为技术有限公司 | Method, device and system for establishing distribution type network |
| CN101860474A (en) * | 2009-04-08 | 2010-10-13 | 中兴通讯股份有限公司 | Peer-to-peer network and resource information processing method based on same |
| CN102223627A (en) * | 2011-06-17 | 2011-10-19 | 北京工业大学 | Beacon node reputation-based wireless sensor network safety locating method |
| CN106339450A (en) * | 2016-08-25 | 2017-01-18 | 成都索贝数码科技股份有限公司 | Index method of tree-shaped data |
| CN106789632A (en) * | 2017-02-25 | 2017-05-31 | 郑州云海信息技术有限公司 | A kind of method of the node-routing of large-scale distributed storage system |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2020524932A (en) * | 2017-06-20 | 2020-08-20 | エヌチェーン ホールディングス リミテッドＮｃｈａｉｎ Ｈｏｌｄｉｎｇｓ Ｌｉｍｉｔｅｄ | Method and system for coherent distributed memory pools in blockchain networks |
| JP7165148B2 (en) | 2017-06-20 | 2022-11-02 | エヌチェーン ホールディングス リミテッド | Method and system for consistent distributed memory pool in blockchain network |
| JP7165148B6 (en) | 2017-06-20 | 2022-11-28 | エヌチェーン ライセンシング アーゲー | Method and system for consistent distributed memory pool in blockchain network |
| CN110784549A (en) * | 2019-11-01 | 2020-02-11 | 深圳市网心科技有限公司 | Network node selection method and device, first network node and storage medium |
| CN110996139A (en) * | 2019-12-19 | 2020-04-10 | 浙江大华技术股份有限公司 | Video path switching processing method and device |
| CN112733474A (en) * | 2020-12-15 | 2021-04-30 | 西安国微半导体有限公司 | Netlist-level circuit area optimization method based on AND gate inverter diagram and storage medium |
| CN112733474B (en) * | 2020-12-15 | 2023-12-22 | 西安国微半导体有限公司 | Netlist-level circuit area optimization method based on AND gate inverter diagram and storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109639582A (en) | A kind of network node treatment method and device based on distributed hashtable | |
| CN109344295B (en) | Distributed graph embedding method, device, equipment and system | |
| WO2017167095A1 (en) | Model training method and device | |
| CN106991617B (en) | Microblog social relationship extraction algorithm based on information propagation | |
| CN112083933A (en) | Service function chain deployment method based on reinforcement learning | |
| Ahmad et al. | A knowledge based Indian agriculture: With cloud ERP arrangement | |
| Kosowska-Stamirowska et al. | Evolving structure of the maritime trade network: evidence from the Lloyd’s Shipping Index (1890–2000) | |
| CN107003834B (en) | Pedestrian detection device and method | |
| CN112000854B (en) | Cross-modal recommendation method and device oriented to essential computing and reasoning fusion | |
| CN109634605A (en) | Analogue data generation method and system for web front-end | |
| CN111563192A (en) | Entity alignment method and device, electronic equipment and storage medium | |
| CN108305181A (en) | The determination of social influence power, information distribution method and device, equipment and storage medium | |
| CN110292772A (en) | The method and device of map is synthesized in game | |
| CN109213831A (en) | Event detecting method and device calculate equipment and storage medium | |
| US11257222B2 (en) | Iterative approach for weakly-supervised action localization | |
| US20220165366A1 (en) | Topology-Driven Completion of Chemical Data | |
| CN105468676A (en) | Big data processing method | |
| CN109522199B (en) | Game regional pressure testing method, device, system and storage medium | |
| CN116562399A (en) | Model training method and device with end Bian Yun cooperated | |
| CN115392491A (en) | Model training method and device based on knowledge distillation and federal learning | |
| CN114528992A (en) | Block chain-based e-commerce business analysis model training method | |
| Liu et al. | Real-time graph partition and embedding of large network | |
| CN114564523A (en) | Big data vulnerability analysis method and cloud AI system for intelligent virtual scene | |
| CN106571982A (en) | Data back-to-source method, device and content delivery network system | |
| Guru et al. | Sharing Australia's nationally significant terrestrial ecosystem data: a collaboration between TERN and ANDS |
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 | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20200414 Address after: 518000 501, No. 12, Huancheng South Road, Ma'antang community, Bantian street, Longgang District, Shenzhen City, Guangdong province (i.e., Huazhong Science Park 501-2) Applicant after: Jicang Technology (Shenzhen) Co., Ltd Address before: 518000 Third Floor, Jiuxin Business Center, Meilong Road, Minzhi Street, Longhua District, Shenzhen City, Guangdong Province Applicant before: DAKE DATA (SHENZHEN) Co.,Ltd. |
|
| TA01 | Transfer of patent application right | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20190416 |
|
| RJ01 | Rejection of invention patent application after publication |