Rapid data positioning method based on path division and multi-distributed-directory

A data positioning and multi-distribution technology, which is applied in data exchange networks, digital transmission systems, electrical components, etc., can solve the problems of low data positioning efficiency, poor stability and robustness, etc.

Inactive Publication Date: 2009-06-03
BEIJING INSTITUTE OF TECHNOLOGYGY
View PDF0 Cites 27 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0006] The purpose of the present invention is to propose a fast data location based on path division and multiple distribution directories in order to solve the problems of low efficiency of data location and poor effectiveness, stability and robustness existing in the Squirrel system based on the structured peer-to-peer network method

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
  • Rapid data positioning method based on path division and multi-distributed-directory
  • Rapid data positioning method based on path division and multi-distributed-directory

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0086] According to the above technical solutions, the present invention will be described in detail below in conjunction with the accompanying drawings and embodiments.

[0087] Step 1. Design the method of path division

[0088] Take the two link paths of the campus network of Beijing Institute of Technology as an example:

[0089] PATH1=www.bit.edu.cn / news / file1

[0090] PATH2=www.bit.edu.cn / tongzhi / file2

[0091] According to the definition of data path similarity in the present invention, the path similarity between PATH1 and PATH2 is 1.

[0092] The following describes the path division method of the present invention in detail for the path PATH1=www.bit.edu.cn / news / file1.

[0093] When r=1, it can be specifically described as follows:

[0094] A 32-bit path key ID is (hash(www.bit.edu.cn / news / file1)&ffffffff).

[0095] When r=2, it can be specifically described as follows:

[0096] If a 32-bit path key ID is divided into two parts, the sizes are 16 and 16 respecti...

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 invention relates to a rapid data positioning method based on path division and multi-distributed-directory, and the method belongs to the technical field of computer applications. The method introduces the data path division, the data path similarity, the multi-distributed-directory and other mechanisms for a structured peer-to-peer network application system which can only store data in local nodes, thereby solving the problems of low efficiency of data positioning, poor effectiveness, poor stability and poor robustness of a Squirrel system which is based on the structured peer-to-peer network. The method can be widely applied in the structured peer-to-peer network application systems which store the data in the local nodes; the method takes an ID marker of a data object path as the input, rapidly and stably positions the position of the node located by the distributed directory containing the position of the data in the similar nodes within the range of (key1 path host node, HOME path host node) and further achieves the high-efficient data positioning.

Description

technical field [0001] The invention relates to a fast data location method based on path division and multi-distribution directories, and belongs to the technical field of computer applications. Background technique [0002] The status of each node in the computer peer-to-peer (P2P) network is the same. Each node acts as a server to provide services to other nodes, and also acts as a client to enjoy the services provided by other nodes. [0003] At present, computer peer-to-peer networks can be divided into two categories: unstructured peer-to-peer networks and structured peer-to-peer networks. Unstructured peer-to-peer networks include unstructured peer-to-peer networks with central servers, purely decentralized unstructured peer-to-peer networks, and hybrid peer-to-peer networks with super nodes. It is a broadcast mechanism, or there is a super node management problem. In the structured peer-to-peer network systems that have emerged in recent years, distributed hash tab...

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
Patent Type & Authority Applications(China)
IPC IPC(8): H04L12/56H04L12/24H04L12/701
Inventor 古志民任小金付引霞程慧芳杨明花
Owner BEIJING INSTITUTE OF TECHNOLOGYGY
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