Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Idle node assistance method for P2P (peer-to-peer) file transmission

A technology for idle nodes and file transmission, applied in transmission systems, electrical components, etc., can solve problems such as network upload bandwidth bottlenecks, idle upload bandwidth and download bandwidth, small upload bandwidth, etc.

Inactive Publication Date: 2011-11-16
PEKING UNIV +2
View PDF4 Cites 14 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

This method is more efficient in the C / S mode, but in the P2P file exchange network, this kind of asymmetric network access users can only provide relatively small upload bandwidth, so that the entire network faces the bottleneck of upload bandwidth
[0007] At the same time, there is a lot of unused upload bandwidth in the network
On the one hand, some users are not eager to exit the P2P client downloader after downloading the file data they need. These users can be regarded as still existing in the P2P network, but the upload bandwidth and download bandwidth are both idle.

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
  • Idle node assistance method for P2P (peer-to-peer) file transmission
  • Idle node assistance method for P2P (peer-to-peer) file transmission
  • Idle node assistance method for P2P (peer-to-peer) file transmission

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0043] Such as Figure 5 As shown, in this embodiment, the idle node selects a chunk for downloading and uploading.

[0044] After an idle node establishes a connection with an ordinary node, a node list is used to record the information of all ordinary nodes connected to the idle node, and all ordinary nodes connected to the idle node are called the neighbor nodes of the idle node. And use a bitmap (bitmap) to record the situation that all the neighbor nodes of the idle node have chunks, and each neighbor node corresponds to a bitmap.

[0045] When the connection relationship between idle nodes and ordinary nodes changes, update the node list. For example, when an idle node receives a disconnection message sent by an ordinary node, it deletes the ordinary node from its node list, such as image 3 and Figure 4 shown. When the status of the chunk owned by the neighbor node of the idle node changes, the change information is sent to the idle node, and the idle node changes ...

Embodiment 2

[0050] Such as Figure 6 As shown, in this embodiment, the idle node selects the last piece of a chunk for downloading and uploading. Since a piece is the smallest unit of data transmission between nodes, the nodes download the pieces in the chunk sequentially, so if a chunk is not recorded in the bitmap of a node, there must be no last piece of the chunk. The difference between this embodiment and embodiment 1 is:

[0051] Every 10 seconds, each idle node performs a chunk selection. After receiving the request from the idle node, the normal node sends the last piece of the requested chunk to the idle node. After receiving the piece, the idle node directly sends the piece to the neighbor node that lacks the chunk by means of "push".

Embodiment 3

[0053] Such as Figure 7 As shown, in this embodiment, an idle node selects a piece for downloading and uploading.

[0054] After an idle node establishes a connection with an ordinary node, it uses a node list to record the information of each ordinary node connected to it, and all ordinary nodes connected to the idle node are called the neighbor nodes of the idle node. And use bitmap (bitmap) to record the data download situation of all neighbor nodes of this idle node, each neighbor node corresponds to a bitmap.

[0055] When the connection relationship between idle nodes and ordinary nodes changes, update the node list. When the status of the neighbor nodes of the idle node owning the piece changes, the change information is sent to the idle node, and the idle node changes the status of the neighbor node owning the piece.

[0056] Every 20-second period, each idle node performs a piece selection. From all the pieces that have not been downloaded yet, select a piece that...

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 an idle node assistance method for P2P (peer-to-peer) file transmission, and belongs to the technical field of network file transmission. The traditional P2P file transmission network is restricted by narrow upload bandwidth due to asymmetry between the upload bandwidth and download bandwidth in the Internet. The idle node assistance method comprises the following steps: firstly idle nodes are randomly added to a P2P file transmission network; then the idle nodes are connected with common nodes; and finally the idle nodes selectively download a part of data every a preset time interval and upload date to all the common nodes which do not contain the data part and are connected with the idle nodes. The idle node assistance method has the beneficial effects that the upload bandwidth of the whole network is increased and the file download time needed by the common nodes is reduced.

Description

technical field [0001] The invention belongs to the technical field of network file transmission, and in particular relates to an idle node assistance method for P2P file transmission. Background technique [0002] P2P (Peer-to-Peer, peer-to-peer) technology, also known as peer-to-peer network technology, is a technology for directly exchanging information between terminal device users without going through an intermediate device. These terminal equipment users are nodes, and the relationship between them is equal and directly connected, and each node has the function of information processing and provision. Nodes that need the same file form a P2P file transfer network by joining the same P2P network. [0003] P2P file transfer technology solves the server and bandwidth bottlenecks that are difficult to break through in the traditional client / server (C / S) mode. Most of the traditional file distributors adopt the client / server (C / S) mode. In this mode, when the user needs ...

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/08H04L29/06
Inventor 劳丰张行功蓝善祯郭宗明
Owner PEKING UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

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

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com