초록 ▼

The present invention provides an improved technique for accessing information in a peer-to-peer network. According to specific embodiments of the present invention, each file accessible in the peer-to-peer network is assigned a respective hash ID or fingerprint ID which is used to describe the cont

The present invention provides an improved technique for accessing information in a peer-to-peer network. According to specific embodiments of the present invention, each file accessible in the peer-to-peer network is assigned a respective hash ID or fingerprint ID which is used to describe the contents of that file. Files in the peer-to-peer network may be identified and/or accessed based upon their associated hash ID values. In this way it is possible to identify identical files stored in the peer-to-peer network which have different file names and/or other metadata descriptors. Since the content of all files having the same hash ID will be identical, an automated process may be used to retrieve the desired content from one or more of the identified files.

대표청구항 ▼

The invention claimed is: 1. A method for accessing information in a peer-to-peer network, the peer-to-peer network including a plurality of peer devices and a database system accessible by at least a portion of the plurality of peer devices, each peer device of the plurality of peer devices being

The invention claimed is: 1. A method for accessing information in a peer-to-peer network, the peer-to-peer network including a plurality of peer devices and a database system accessible by at least a portion of the plurality of peer devices, each peer device of the plurality of peer devices being configured to store information files, and further being configured to share file content from selected information files with at least a portion of other peer devices in the peer-to-peer network, wherein each shared file in the peer-to-peer network has a respective HASH ID associated therewith relating to the file content of each shared file, the HASH ID being different from a respective filename associated with each shared file, the method comprising: identifying a first peer device which has been identified as storing a first information file associated with a first HASH ID; identifying a second peer device which has been identified as storing a second information file associated with the first HASH ID; transmitting a first message including the first HASH ID to the first peer device requesting a first portion of file content of the first information file from the first peer device; transmitting a second message including the first HASH ID to the second peer device requesting a second portion of file content of the second information file from the second peer device; detecting a failure in a file transfer process associated with the first peer device; identifying a network address corresponding to a third peer device which has been identified as storing a third information file associated with the first HASH ID; and transmitting a third message to the third peer device, the third message corresponding to a request to retrieve the first portion of file content from the third information file. 2. The method of claim 1 wherein the first and second messages are initiated at a same time. 3. The method of claim 1 wherein the requesting of the first portion of file content from the first peer device occurs concurrently with the requesting of the second portion of file content from the second peer device. 4. The method of claim 1 further comprising: receiving the first portion of file content from the first peer device; receiving the second portion of file content from the second peer device; generating the third information file which includes the first and second portion of file content, wherein the file content of the third information file is identical to the file content of the first information file. 5. The method of claim 1 wherein the first portion of file content corresponds to a first chunk of bytes 1 to N of the first information file; and wherein the second portion of file content corresponds to a second chunk of bytes N+1 to 2N of the second information file. 6. A system for accessing information in a peer-to-peer network, the peer-to-peer network including a plurality of peer devices and a database system accessible by at least a portion of the plurality of peer devices, each peer device of the plurality of peer devices being configured to store information files, and further being configured to share file content from selected information files with at least a portion of other peer devices in the peer-to-peer network, wherein each shared file in the peer-to-peer network has a respective HASH ID associated therewith relating to the file content of each shared file, the HASH ID being different from a respective filename associated with each shared file, the system comprising: at least one CPU; memory; and at least one interface for communicating with other devices in the peer-to-peer network; the at least one CPU adapted to: identify a first peer device which has been identified as storing a first information file associated with a first HASH ID; identify a second peer device which has been identified as storing a second information file associated with the first HASH ID; transmit a first message including the first HASH ID to the first peer device to request a first portion of file content of the first information file from the first peer device; transmit a second message including the first HASH ID to the second peer device to request a second portion of file content of the second information file from the second peer device; detect a failure in a file transfer process associated with the first peer device; identify a network address corresponding to a third peer device which has been identified as storing a third information file associated with the first HASH ID; and transmit a third message to the third peer device, the third message corresponding to a request to retrieve the first portion of file content from the third information file. 7. The system of claim 6 wherein the first and second messages are initiated at a same time. 8. The system of claim 6 wherein the request of the first portion of file content from the first peer device occurs concurrently with the request of the second portion of file content from the second peer device. 9. The system of claim 6 wherein the CPU is further adapted to: receive the first portion of file content from the first peer device; receive the second portion of file content from the second peer device; and generate the third information file which includes the first and second portion of file content, wherein the file content of the third information file is identical to the file content of the first information file. 10. The system of claim 6 wherein the first portion of file content corresponds to a first chunk of bytes 1 to N of the first information file; and wherein the second portion of file content corresponds to a second chunk of bytes N+1 to 2N of the second information file. 11. A computer program product for accessing information in a peer-to-peer network, the peer-to-peer network including a plurality of peer devices and a database system accessible by at least a portion of the plurality of peer devices, each peer device of the plurality of peer devices being configured to store information files, and further being configured to share file content from selected information files with at least a portion of other peer devices in the peer-to-peer network, wherein each shared file in the peer-to-peer network has a respective HASH ID associated therewith relating to the file content of each shared file, the HASH ID being different from a respective filename associated with each shared file, the computer program product comprising: a non-transitory computer readable storage medium having computer readable code embodied therein, the computer readable code comprising computer code for: identifying a first peer device which has been identified as storing a first information file associated with a first HASH ID; identifying a second peer device which has been identified as storing a second information file associated with the first HASH ID; transmitting a first message including the first HASH ID to the first peer device requesting a first portion of file content of the first information file from the first peer device; transmitting a second message including the first HASH ID to the second peer device requesting a second portion of file content of the second information file from the second peer device; detecting a failure in a file transfer process associated with the first peer device; identifying a network address corresponding to a third peer device which has been identified as storing a third information file associated with the first HASH ID; and transmitting a third message to the third peer device, the third message corresponding to a request to retrieve the first portion of file content from the third information file. 12. The computer program product of claim 11 wherein the first and second messages are initiated at a same time. 13. The computer program product of claim 11 wherein the request of the first portion of file content from the first peer device occurs concurrently with the request of the second portion of file content from the second peer device. 14. The computer program product of claim 11 further comprising computer code for: receiving the first portion of file content from the first peer device; receiving the second portion of file content from the second peer device; and generating the third information file which includes the first and second portion of file content, wherein the file content of the third information file is identical to the file content of the first information file. 15. The computer program product of claim 11 wherein the first portion of file content corresponds to a first chunk of bytes 1 to N of the first information file; and wherein the second portion of file content corresponds to a second chunk of bytes N+1 to 2N of the second information file.