CN101494664B - P2P push type network storage method based on JXTA - Google Patents
P2P push type network storage method based on JXTA Download PDFInfo
- Publication number
- CN101494664B CN101494664B CN2009100965653A CN200910096565A CN101494664B CN 101494664 B CN101494664 B CN 101494664B CN 2009100965653 A CN2009100965653 A CN 2009100965653A CN 200910096565 A CN200910096565 A CN 200910096565A CN 101494664 B CN101494664 B CN 101494664B
- Authority
- CN
- China
- Prior art keywords
- peer
- file
- super
- network
- document
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Fee Related
Links
- 238000000034 method Methods 0.000 title claims abstract description 11
- 238000004891 communication Methods 0.000 claims abstract description 8
- 230000005540 biological transmission Effects 0.000 claims description 7
- 238000007689 inspection Methods 0.000 claims description 6
- 238000012217 deletion Methods 0.000 claims description 3
- 230000037430 deletion Effects 0.000 claims description 3
- 230000004044 response Effects 0.000 claims description 2
- 238000005516 engineering process Methods 0.000 abstract description 4
- 238000012546 transfer Methods 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000002950 deficient Effects 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 230000018109 developmental process Effects 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
- 238000012827 research and development Methods 0.000 description 1
- 230000011218 segmentation Effects 0.000 description 1
- 230000001360 synchronised effect Effects 0.000 description 1
Images
Landscapes
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
- Information Transfer Between Computers (AREA)
Abstract
The invention provides a P2P push type network storage method base on JXTA, which combines the network storage and JXTA technology, uses the JXTA2.0 characteristics to store files in the Super-peer. The other Peer download files from the Super-peer or uploads files to the Super-peer after landing the network: firstly, when the Peer needs to download the files, the Peer lands to the P2P network, if there is super-peer stored with files that Peer is requested to download in the P2P network it informs the peer to download the file; secondly, when the Peer is needed to store in the P2P network, it sends request to the super-peer in the P2P network, the super-peer that has received the request detect whether the local has a memory space capable of storing the file, if so, sending a notice agreed to upload files to the Peer; Peer establishes communication channel upload files after receiving the notice agreed to upload files.
Description
Technical field
The present invention relates to a kind of network storage method, in particular, relate to a kind of P2P pushing-type network storage method based on JXTA.
Background technology
At nearest several years, P2P (Peer-to-Peer) became a big focus of internet, and it is a kind of application model of internet, and any equipment in network comprises large-scale computer, PC, PDA, mobile phone etc., can directly connect through this application model.
At present, the representativeness of P2P research and development product and technology have following several kinds:
(1) instant communication software of ICQ class.The communication of supporting a plurality of users to carry out literal and file exchanges, and can be interconnected with other communication equipment, weakens even breaks away from the dependence to central server, and such communication is more near the non-internet communication pattern.
(2) Napster class software.The user can realize sharing, retrieving and xcopy of file, and can find up-to-date listed files automatically through this type of software is installed.
(3) Netbatch (Intel) type of collaborative software for calculation.Can make full use of the idle disposal ability of these computers through the computer of up to ten thousand of connections, carry out Distributed Calculation.
(4) BitTorrent (Chinese full name bit stream is called for short BT) is meant the P2P software that a multiple spot is downloaded.Be not both BT with FTP a plurality of transmission points are arranged.When you are downloading, also uploading simultaneously, make everybody all be in the state of synchronous driving.BT is a most successful application of current P2P.
These several types of P2P have a serious defective, and they each other can not be compatible.That is to say ICQ class software can not with the mutual transfer files of Napster class software.The appearance of JXTA has solved this problem.JXTA is the agreement that a cover is independent of various platforms and language.The P2P application program that various language in network are realized only need be rewritten the code of network portion, just can be transformed on the JXTA platform.This has just saved workload greatly, attracts other to adopt the software of non-Java language exploitation to join JXTA.
In the network of JXTA, the transmission of message is real-time, and any one Peer can only send message or transmit file to online Peer.If the other side is not online, or owing to the network service reason, can't be search the other side, message and file can't pass to the other side.
Summary of the invention
In the network of JXTA, the transmission of message is real-time, and any one Peer can only send message or transmit file to online Peer.If the other side is not online, or owing to the network service reason, can't be search the other side, message and file can't pass to the other side.
In order to solve this problem of file, the present invention has combined six degree segmentation theories to propose the pushing-type network storage to be used for addressing this problem.The pushing-type network storage is with the generation that combines of the network storage and JXTA technology.The pushing-type network storage utilizes the characteristics of JXTA2.0, and in Super-peer, other Peer gives Super-peer from Super-peer file in download or upload file after landing network with file storage.
P2P pushing-type network storage method based on JXTA may further comprise the steps:
One, Peer file in download
When Peer needed file in download, initial landing and was announced at local storage file in the P2P network.The super-peer that receives the Peer logon information in the P2P network upgrades shared resource distributed index SRDI, and other super-peer in the notice P2P network.If the super-peer that has Peer request file in download is arranged in the P2P network, then notifies the peer file in download.After file transmitted and finishes, the super-peer that provides file to download changed the file_flag in this document summary into 0, and is published to summary in the P2P network, notified other super-peer that preserves this document deletion this document.
Two, Peer upload file
When Peer need be with file storage in the P2P network time; The super-peer retrieval P2P topology of networks of request is received in its super-peer transmission request in the P2P network at first in the P2P network, transmit to other super-peer successively according to the height order of criticality and ask; Whether the super-peer inspection this locality of receiving request has the memory space that can store this document; If have, then send the notice of agreeing upload file, otherwise will not response to Peer; Peer sets up the communication pipe upload file after receiving and agreeing notice that file uploads, and upload file is accomplished the back and notified and receive the super-peer of request at first; All receive the super-peer of files and generate corresponding document according to the life cycle of the title of file, transmit leg, recipient, file.When the local zone time of the super-peer that receives file surpasses the file_lifecircle in the document, will delete this document automatically, and need not to issue the summary of this document.
In said process; File_num in the initial document receives the number of the super-peer of request for all; When a super-peer who receives request leaves the P2P network, the file_num in the document is subtracted 1, and document is published in the P2P network.Other receives that the super-peer of request receives the topological structure of summary back retrieval network, according to the height order of criticality successively in network other super-peer that receive request send the request that file is uploaded, also send to the other side to document simultaneously; Receive that whether super-peer inspection this locality of request has stored this document, does not have only when this document is stored in this locality just can receive uploading of file; After super-peer had received this document, the file_num in the document added 1, simultaneously new document was published in the network; When the file_num in document equaled the super-peer number of the request that receives in all P2P networks, upload file finished.
Compared with prior art, the invention has the beneficial effects as follows:
1, solved the file transfer problem under the off-line case in the P2P network.During present P2P used, the transmission of file needed the transmit leg of file and recipient all online.The very flexible of this mode, transmit leg and recipient will notify the other side online when transmitting file.The pushing-type network storage can let among transmit leg and the recipient either party get at any time as required or deviated from network, and need not be restricted.
2, eliminated pregnable object.In centralized network, server is an object under attack.In a single day server is damaged, and whole network all will be affected.The network of P2P is acentric network, does not have the server that can influence whole network.The various functions of server all are dispersed to each Peer in the network.
3, make full use of Internet resources, reduced the restriction of bottleneck.In centralized network, the performance of network relies on the ability of server.But the load of each server all has individual threshold values, can be very slow above the processing speed of server behind this threshold values, even collapse.Common solution is to buy the better hardware of performance, and this is a makeshift, is not the way of dealing with problems for a long time.And in the P2P network, along with the raising of computer hardware performance, the disposal ability of every equipment is more and more stronger in the network, and memory space is also increasing.Pushing-type storage can make full use of the disposal ability and idle space of each Peer in the network, and this be than will saving a large amount of funds through the performance solve problem that improves server, and can obtain bigger performance boost.
4, improved responding ability.Distributed management has been avoided centralized because the long situation of time-delay that request too much causes.Peer in the network can download or upload file from nearest Super-peer, and this can bring many-sided benefit: because the delay of network reduces, the corresponding time also is reduced; Can carry out subregion to storage demand, with the request of better method for organizing memory allocated.
5, compatible good, widely applicable.The pushing-type network storage is on the platform of JXTA2.0, to construct; One of characteristics of JXTA can be used multiple development language developing application exactly; The pushing-type network storage can use different language in different platforms equipment, to realize that it has suit property.
Description of drawings
Fig. 1 is the schematic flow sheet during the Peer file in download in the specific embodiment of the present invention;
Fig. 2 is the schematic flow sheet during the Peer upload file in the specific embodiment of the present invention.
Embodiment
In conjunction with accompanying drawing, the present invention is further specified through specific embodiment.
In Fig. 1, Peer logs in the P2P network, has created a pipeline, and stores its file announcement in this locality; Super-peer1 upgrades the SRDI index after receiving the logon information of Peer, and notifies other Super-peer; Super-peer6 has Peer needs downloaded files, when it finds to notify the Peer file in download after Peer lands; After file transmitted and finishes, Super-peer6 changed the file_flag in the document into 0, and is published to document on the net, notified other Super-peer that preserves this document deletion this document.
In Fig. 2, Peer need be with file storage in the P2P network, its Super-peer transmission request in network; Super-peer1 receives the topological structure of request back retrieval network at first, transmits request to other Super-peer successively according to the height order of criticality; With super-pee3 is example, and the local discovery of inspection has the memory space that can store this document after its request of receiving, sends the notice of agreeing upload file to Peer; After Peer receives the notice of Super-peer3, set up the communication pipe upload file, notice Super-peer1 after upload file is accomplished with Super-peer3; Super-peer3 generates corresponding document according to the life cycle of the title of file, transmit leg, recipient, file.When the local zone time of Super-peer3 has surpassed the file_lifecircle in the document, will delete this document automatically, and need not to issue the summary of this document.
It should be noted that; In said process; File_num in the initial document receives the number of the Super-peer of request for all; When a Super-peer who receives request leaves the P2P network, the file_num in the document is subtracted 1, and document is published in the P2P network.Other Super-peer that receives request receives the topological structure of summary back retrieval network; According to the height of criticality order successively in network other Super-peer that receive request send the file upload request, also send to the other side to document simultaneously.Receive that whether Super-peer inspection this locality of request has stored this document, does not have only when this document is stored in this locality just can receive uploading of file; After Super-peer had received this document, the file_num in the document added 1, simultaneously new document was published in the network; When the file_num in document equaled the Super-peer number of the request that receives in all P2P networks, upload file finished.
At last, it is also to be noted that what more than enumerate only is practical implementation example of the present invention.Obviously, the invention is not restricted to above examples of implementation, many distortion can also be arranged.All distortion that those of ordinary skill in the art can directly derive or associate from content disclosed by the invention all should be thought protection scope of the present invention.
Claims (1)
1. based on the P2P pushing-type network storage method of JXTA, it is characterized in that, may further comprise the steps:
One, Peer file in download
When Peer needed file in download, initial landing and was announced at local storage file in the P2P network; The super-peer that receives the Peer logon information in the P2P network upgrades shared resource distributed index SRDI, and other super-peer in the notice P2P network; If the super-peer that has Peer request file in download is arranged in the P2P network, then notifies the Peer file in download; After file transmitted and finishes, the super-peer that provides file to download changed the file_flag in this document summary into 0, and is published to summary in the P2P network, notified other super-peer that preserves this document deletion this document;
Two, Peer upload file
When Peer need be with file storage in the P2P network time; The super-peer retrieval P2P topology of networks of request is received in its super-peer transmission request in the P2P network at first in the P2P network, transmit to other super-peer successively according to the height order of criticality and ask; Whether the super-peer inspection this locality of receiving request has the memory space that can store this document; If have, then send the notice of agreeing upload file, otherwise will not response to Peer; Peer sets up the communication pipe upload file after receiving and agreeing notice that file uploads, and upload file is accomplished the back and notified and receive the super-peer of request at first; All receive the super-peer of files and generate corresponding document according to the life cycle of the title of file, transmit leg, recipient, file; When the local zone time of the super-peer that receives file surpasses the file_lifecircle in the document, will delete this document automatically, and need not to issue the summary of this document;
In said process; File_num in the initial document receives the number of the super-peer of request for all; When a super-peer who receives request leaves the P2P network, the file_num in the document is subtracted 1, and document is published in the P2P network; Other receives that the super-peer of request receives the topological structure of summary back retrieval network, according to the height order of criticality successively in network other super-peer that receive request send the request that file is uploaded, also send to the other side to document simultaneously; Receive that whether super-peer inspection this locality of request has stored this document, does not have only when this document is stored in this locality just can receive uploading of file; After super-peer had received this document, the file_num in the document added 1, simultaneously new document was published in the network; When the file_num in document equaled the super-peer number of the request that receives in all P2P networks, upload file finished.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2009100965653A CN101494664B (en) | 2009-03-09 | 2009-03-09 | P2P push type network storage method based on JXTA |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2009100965653A CN101494664B (en) | 2009-03-09 | 2009-03-09 | P2P push type network storage method based on JXTA |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101494664A CN101494664A (en) | 2009-07-29 |
| CN101494664B true CN101494664B (en) | 2012-04-18 |
Family
ID=40925062
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2009100965653A Expired - Fee Related CN101494664B (en) | 2009-03-09 | 2009-03-09 | P2P push type network storage method based on JXTA |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101494664B (en) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102170456A (en) * | 2010-02-27 | 2011-08-31 | 华为技术有限公司 | Method, device and system for acquiring content in PPN (peer-to-peer network) |
| CN102710430B (en) * | 2012-04-19 | 2015-04-29 | 广州中国科学院先进技术研究所 | Heterogeneous resource measuring system and scheduling method based on cloud computing |
| CN104243538A (en) * | 2013-06-24 | 2014-12-24 | 腾讯科技（深圳）有限公司 | Resource sharing method and system |
| CN109347968B (en) * | 2018-11-07 | 2021-09-24 | 网宿科技股份有限公司 | Method, equipment and system for downloading data blocks of resource file |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1767543A (en) * | 2004-10-08 | 2006-05-03 | 汤姆森许可贸易公司 | Method for establishing communication between peer-groups |
| EP1657939A1 (en) * | 2004-11-16 | 2006-05-17 | Vodafone Group PLC | System and Method for facilitating distribution of information in a network |
-
2009
- 2009-03-09 CN CN2009100965653A patent/CN101494664B/en not_active Expired - Fee Related
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1767543A (en) * | 2004-10-08 | 2006-05-03 | 汤姆森许可贸易公司 | Method for establishing communication between peer-groups |
| EP1657939A1 (en) * | 2004-11-16 | 2006-05-17 | Vodafone Group PLC | System and Method for facilitating distribution of information in a network |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101494664A (en) | 2009-07-29 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101764807B (en) | Multisource internet resource device and method based on meta search engine | |
| CN100544261C (en) | A kind of data distributing/obtaining method of information Network Based | |
| CN1692616A (en) | Network traffic control in peer-to-peer environments | |
| CN101841553A (en) | Method, user node and server for requesting location information of resources on network | |
| CN101355591A (en) | P2P network and scheduling method thereof | |
| CN102420864B (en) | Massive data-oriented data exchange method | |
| WO2012025052A1 (en) | System and method for internet search based on point-to-point network | |
| CN102333127A (en) | Resource downloading method, device and system | |
| CN101494664B (en) | P2P push type network storage method based on JXTA | |
| CN104967677A (en) | File transmission method and apparatus based on NDN cache optimization | |
| CN111046065A (en) | Extensible high-performance distributed query processing method and device | |
| CN102244670A (en) | Idle node assistance method for P2P (peer-to-peer) file transmission | |
| CN101064715A (en) | Realization of embedded system based P2P technique | |
| CN1937553B (en) | Reciprocal network data dispatching method based on flow media data frame | |
| CN101465753A (en) | Method, device and system for managing P2P system set | |
| Cherbal et al. | A survey of DHT solutions in fixed and mobile networks | |
| CN101686172B (en) | Method, system and equipment for selecting gateway node | |
| Cao et al. | Load-balancing schemes for a hierarchical peer-to-peer file search system | |
| Tran et al. | Decentralized online social network using peer-to-peer technology | |
| CN101662494A (en) | Method, system and device for realizing content supply | |
| CN101040506B (en) | Method for initializing a peer-to-peer data network | |
| Zarrin et al. | A self-organizing and self-configuration algorithm for resource management in service-oriented systems | |
| CN100433657C (en) | Peer-to-peer network member managing method for large-scale stream media live sysetm | |
| CN101496358A (en) | Audio and video communication system | |
| CN101394415B (en) | Method and device of resource broadcast interaction mechanism used in structured coverage network |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20120418 |