Method of high performance distributed Hash table in P2P system

A high-performance, hash table technology, applied in the transmission system, electrical components, etc., can solve the problems of large routing delay and the difficulty of widely applying the distributed hash table method, and achieve the effect of node load balancing and small network topology diameter

Inactive Publication Date: 2007-12-26
NAT UNIV OF DEFENSE TECH
View PDF0 Cites 7 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

The traditional distributed hash table method has a relatively large routing delay when the node degree is a

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Method of high performance distributed Hash table in P2P system
  • Method of high performance distributed Hash table in P2P system
  • Method of high performance distributed Hash table in P2P system

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0024] In the present invention, the identifier of the resource object is a ternary string with a length of 100 and different adjacent bits. In order to make the identification of each resource object deterministic and evenly distributed in the identification space, the present invention designs the K_Hash naming algorithm, which generates a 100-bit target string ξ for the resource object according to the keyword key. The algorithm uses the parameters p and n, and the specific process is as follows: first, 0, 1, ..., p are appended to the string key to obtain key0, key1, ..., keyp, and then implement the SHA-1 algorithm on them respectively get the binary string D 0 、D 1 ,...,D p . connection 0 、D 1,...,D p Get the binary string D, then convert D to the ternary string R', and take the lower n bits of R' to get R. Then convert the ternary string R, and merge the same adjacent bits in R (that is, the sequence b...b(b∈{0, 1, 2}) composed of any identical numbers in R uses ...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The method comprises: using the character string whose adjacent bit is different as the resource object ID and the node ID; using the 'ID left shifting' and topological relation invariant to construct regular organization neighboring relation; when node is added or quits, using a 'locally optimizing' dynamical balance mechanism to release the resource object to the node whose node ID is its prefix; when the resource location message is replayed, it is executed according the ' ID left shifting' and 'postfix matching' rule.

Description

technical field [0001] The invention relates to a resource management method in a large-scale network computing system, in particular to a high-performance distributed hash table method for effectively locating resources in a network computing system supporting a P2P mode. Background technique [0002] At present, network computing systems have broad application prospects in important fields such as scientific research, e-commerce, e-government and military applications. The goal of network computing is to organize and integrate various resources such as computing, storage, information, and instruments distributed in a wide area through the network, so as to realize the effective sharing and comprehensive utilization of network resources. Resource location is the basis of resource sharing and collaboration in network computing systems. According to resource organization modes, network computing systems can generally be divided into two types: C / S (Client / Server) mode and P2...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
IPC IPC(8): H04L29/08
Inventor 李东升卢锡城张一鸣刘锋
Owner NAT UNIV OF DEFENSE TECH
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap