Unlock instant, AI-driven research and patent intelligence for your innovation.

Practical method of optimizing equal network double-layer matching

A peer-to-peer network and matching technology, which is applied in the practical field of optimizing the double-layer matching of peer-to-peer networks, and can solve problems such as coverage network and physical network mismatch

Inactive Publication Date: 2008-04-09
NANJING UNIV
View PDF0 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0003] The purpose of the present invention is: to propose a practical method for optimizing the double-layer matching of the peer-to-peer network, which solves the problem of mismatch between the overlay network and the physical network

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
  • Practical method of optimizing equal network double-layer matching
  • Practical method of optimizing equal network double-layer matching
  • Practical method of optimizing equal network double-layer matching

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

Average latency of the overlay network

[0008] Table 1 Symbol table

[0009] In order to specify the method of exchange, some symbols of expression are listed in Table 1. We assume that exchanges may occur between nodes u and v. The set of neighbor nodes of node u is defined as:

[0010] N(u)={i|i∈V∧((u, v)∈E∨(i, u)∈E} (1)

[0011] In order to simplify the processing of neighbor nodes, the routing table is expanded to record not only the successor nodes but also the predecessor nodes. In fact, many P2P systems have selectively recorded some predecessor nodes for the sake of fault tolerance. Therefore, the expansion of the routing table scale brought by this expansion is limited. There are some systems with symmetrical routing (like CAN) that don't even require any extensions.

[0012] At the beginning, each node u in the system obtains the address list of all its neighbor nodes and the initial local delay information ∑ i∈Nt0(u) d(u,i). Then, every fixed time T...

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 discloses a practical method for optimizing double-layer matching of a peer-to-peer network. The method comprises (1) each nodes collects the time-lag information of its neighboring node; (2) each node detects any of nodes; (3) two nodes switch time-lag information; (4) performing possible node switching according to the existing time lag information; and (5) finishing. Compared with the prior art, the inventive method has no relation to protocol, and can be used for non-structural and structural peer-to-peer network. The method can be easily implemented, and can be combined with other techniques to achieve better effect.

Description

1. Technical field [0001] The invention relates to a method for matching the covering layer and the physical network in the peer-to-peer network, and its use can effectively reduce the average time delay of the whole system. 2. Background technology [0002] In recent years, some P2P systems have been proposed, such as CAN [1] , Chord [2] , Pastry [3] , Tapestry [4] , Viceroy [5] , Cycloid [6] Wait. They provide a self-organizing infrastructure for large-scale P2P applications. Such structured P2P systems are based on Distributed Hash Tables (DHT). They use a consistent hash function (consistent hash function) to evenly map data and nodes to a key-value space (key space, or label space identifier space). The data whose key value is k is stored on the node whose label is also k. If the node does not exist, the data is stored in the node whose label is adjacent to k. With reasonable organization, the query for any data can be completed in finite steps (usually O(logn...

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/46H04L12/56
Inventor 陈贵海邱彤庆
Owner NANJING UNIV