Peer network secure routing method based on multi-dimension distributed hash table

A technology of distributed hash table and peer-to-peer network, which is applied in the field of network security to achieve the effect of high routing efficiency

Inactive Publication Date: 2008-08-13
南京邮电大学资产经营有限责任公司
View PDF0 Cites 16 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

Through such a new DHT structure, on the one hand, it can overcome the problem that the traditional DHT algorithm cannot use the information of some adjacent nodes saved by each node to effectively identify malicious nodes; Improved routing efficiency

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
  • Peer network secure routing method based on multi-dimension distributed hash table
  • Peer network secure routing method based on multi-dimension distributed hash table
  • Peer network secure routing method based on multi-dimension distributed hash table

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0056] The method of the present invention is divided into three parts: the design of the multi-dimensional distributed hash table structure, routing forwarding, and malicious node identification method; the multi-dimensional distributed hash table divides the identification of the node into different dimensions and the responsibility of each dimension. The node organizes the nodes of the entire P2P application into a tree-like structure, thus providing the basis for safe routing forwarding and identification of malicious nodes; routing forwarding is based on the multi-dimensional DHT structure, and the routing forwarding process is converted into each target node The process of gradually approaching each dimension can achieve higher routing efficiency; the identification of malicious nodes is based on the distributed hash table structure and routing forwarding, and through the dimension information saved by nodes of the same dimension, various types of malicious nodes can be id...

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 Peer-to-Peer safe routing method based on a multidimensional distributed hash table comprises: designing of a multidimensional distributed hash table structure, routing transmission and hostile nodes recognition; the multidimensional distributed hash table organizes the whole P2P application nodes into a tree-like structure by dividing the node labels to responsible nodes of each different dimension, thus to provides a basis for safe routing transmission and hostile node recognition; the routing transmission is based on a multidimensional DHT structure, is a process that target nodes gradually approaches each dimension, thus to realize high routing efficiency; the hostile nodes recognition is based on the distributed hash table structure and the routing transmission, recognizes various types of hostile nodes by the saved dimension information of nodes having same dimension. By the structure, hostile nodes are effectively recognized, and routing efficiency is obviously improved.

Description

technical field [0001] The invention is a method for improving the application security of P2P (Peer-to-Peer: peer-to-peer network), which belongs to the technical field of network security. Background technique [0002] At present, some progress has been made in the research on the security of structured P2P overlay network. Castro et al. proposed in the literature [1] that the secure routing of P2P overlay network needs to meet three conditions, that is, secure node ID (identification) distribution, routing table security maintenance and secure routing. For the Pastry algorithm, the author proposes to add additional routing table to maintain the security of the routing table. When a node claims to be responsible for the query key (hash value) at the end of the query, the initiating node asks the node to return its routing table, and judges whether the routing is correct based on the returned routing table information. If the routing If it fails, use redundant routing to q...

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/56H04L29/06H04L12/743
Inventor 孙知信陈松乐
Owner 南京邮电大学资产经营有限责任公司
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