Eureka AIR delivers breakthrough ideas for toughest innovation challenges, trusted by R&D personnel around the world.

Distributed hash table in opposite account

A distributed hash table and distributed hash technology, applied in the field of resource location technology, can solve problems such as lack of resources, poor network scalability, and slow query response

Inactive Publication Date: 2006-02-08
NANJING UNIV OF POSTS & TELECOMM
View PDF0 Cites 33 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

An important problem that P2P needs to solve is: in a dynamic environment that lacks a centralized server, each node can maintain consistent network topology information.
The downside is that broadcasting queries can cause a lot of network traffic; unrelated computers are forced to perform queries
The network does not scale well; query responses are slow due to the query negotiation mechanism

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
  • Distributed hash table in opposite account
  • Distributed hash table in opposite account
  • Distributed hash table in opposite account

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0049] figure 1 is an example map of consistent hashing. Among them, those starting with N represent node identifiers, and those starting with K represent resource key identifiers. For example, the node with the IP address of 120.10.10.1 in the figure gets the identifier K54 after SHA1 hashing, which is stored in its successor node identifier N56; and the identifier after the hash of the keyword "LifAtGo" is K30, which is stored in Its successor node identifier N32.

[0050] figure 2 BChord data organization instance. Among them, those starting with N represent node identifiers, and those starting with K represent resource key identifiers. Each node only needs to maintain a routing table consisting of at most m entries, which is called a finger table. If the N8 node can query information through N(8+16), that is, the N24 operation, but there is no N24 node, so the N8 node can query the information of the successor node N32 of N24 through the N(8+16) operation. Similarly...

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

This invention relates to a distributed-type chord used in the condition of open peer-to-peer, which provides a rapid, effective and reliable source-locating technology to motivate the application of p2p. The invention is attained by mapping compatibly in clockwise and counter-clock wise directions in chord space ring to compensate for the non-uniform of source location in one direction, and makes the set points in p2p net form a distributed chord ring, every set points maps to several general homologue points, which can reduce the time of source location and expand effective management region of p2p net.

Description

technical field [0001] The present invention is an open peer-to-peer computing (Peer-to-peer, abbreviated as P2P) environment, using a distributed hash table (Distributed Hash Table, abbreviated as DHT) BChord (Bchord type of the distributed The name of the hash table) provides a fast, effective, and reliable resource location technology for peers (Peer), thereby promoting the wide application of peer-to-peer computing. The technology belongs to the cross-technical application field of computer network, distributed computing and algorithm design and analysis. Background technique [0002] Peer-to-peer networks are a class of distributed systems that utilize Internet (Internet) edge resources (storage, computing, content, etc.), are decentralized, self-organizing, and all or most of the connections are symmetric. In the P2P environment, each participating node acts as both a client (dient) and a server (server), and obtains and shares resources in the P2P network by providin...

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): H04L12/24H04L12/00
Inventor 王汝传陈宏伟
Owner NANJING UNIV OF POSTS & TELECOMM
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
Eureka Blog
Learn More
PatSnap group products