CN1732477A - A peer computer system - Google Patents
A peer computer system Download PDFInfo
- Publication number
- CN1732477A CN1732477A CNA2003801080215A CN200380108021A CN1732477A CN 1732477 A CN1732477 A CN 1732477A CN A2003801080215 A CNA2003801080215 A CN A2003801080215A CN 200380108021 A CN200380108021 A CN 200380108021A CN 1732477 A CN1732477 A CN 1732477A
- Authority
- CN
- China
- Prior art keywords
- peer
- computer system
- entity
- token
- peer computer
- 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.)
- Granted
Links
- 238000000034 method Methods 0.000 claims description 9
- 238000004590 computer program Methods 0.000 claims description 2
- 230000003321 amplification Effects 0.000 description 12
- 238000003199 nucleic acid amplification method Methods 0.000 description 12
- 238000010586 diagram Methods 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 240000000233 Melia azedarach Species 0.000 description 1
- 230000002860 competitive effect Effects 0.000 description 1
- 238000005553 drilling Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000012423 maintenance Methods 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/10—Office automation; Time management
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F15/00—Digital computers in general; Data processing equipment in general
- G06F15/16—Combinations of two or more digital computers each having at least an arithmetic unit, a program unit and a register, e.g. for a simultaneous processing of several programs
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F15/00—Digital computers in general; Data processing equipment in general
Landscapes
- Engineering & Computer Science (AREA)
- Business, Economics & Management (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- Entrepreneurship & Innovation (AREA)
- Human Resources & Organizations (AREA)
- Strategic Management (AREA)
- General Physics & Mathematics (AREA)
- Computer Hardware Design (AREA)
- Quality & Reliability (AREA)
- Tourism & Hospitality (AREA)
- Operations Research (AREA)
- General Business, Economics & Management (AREA)
- Marketing (AREA)
- Economics (AREA)
- Data Mining & Analysis (AREA)
- General Engineering & Computer Science (AREA)
- Software Systems (AREA)
- Information Transfer Between Computers (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
- Computer And Data Communications (AREA)
Abstract
A first peer computer system operable in a peer to peer network, comprising means for accessing a first piece of information, means for creating a first entity (e.g. a the first entity with the first piece of information (e.g. attaching the first piece of information to the entity) and wherein the first entity is associated with a topic of the information.
Description
Technical field
The present invention relates to reciprocity calculating field.
Background technology
It is more and more important for competitive edge to coordinate chain activity (cooperation).By cooperation, enterprise can reduce transaction cost, collects better information, saves operating cost, and improves time efficiency.The application that facilitating collaboration calculates comprises Email, little group scheduling and scheduling, Shared Folders/database, cueing discussion and customized application exploitation.
Cooperative system mainly is based on main frame peer device (host peer device) at present, and the example of employed model is synchronistic model, wherein the main frame peer device preserve data key plate this, and the user does in the local version drilling of data.Every now and then, the user be connected to the main frame peer device and with the key plate of the local version of data and data this synchronously.This model is used through being usually used in personal information management (PIM), for example calendar, Email etc.
Another computation model that catches in recent years is equity (P2P) model.This model is distributed, and comprises mutual a plurality of " peer-to-peer (peer) " mutually, and wherein peer-to-peer is similar to other peer-to-peer on ability.P2P calculates and make it possible to carry out data sharing under the situation that does not have the main frame peer device, and along with individual and mobile technology (for example, mobile phone, PDA(Personal Digital Assistant) etc.) growth, exist to support cooperation to calculate but the needs in the P2P environment that disconnects.
Yet owing to there is not the central host peer device of control peer-to-peer or data in this system, so the P2P model faces non-existent problem in synchronistic model, for example, and data tracking.
Summary of the invention
According to first aspect, the invention provides a kind of first peer computer system that can in peer-to-peer network, work, it comprises: the device that is used to visit article one information; Be used to create the device of first entity; Be used for device that first entity is associated with article one information; Wherein first entity is associated with the theme of article one information.
Preferably, first entity comprises unique identifier.More preferably, first entity comprises the date of creating first entity.More preferably, first entity comprises article one information.Yet, alternatively, first entity and article one information separated.
In a preferred embodiment, this system also comprises the device (for example, outline (schema)) that is used to define first entity.Preferably, this system also comprises the device that is used to store first entity.More preferably, this system also comprises the device that is used for first entity is sent to second peer computer system.
Preferably, provide the device that is used to create second entity, wherein second entity is associated with the sub-topics of article one information.Therefore, first entity is father's entity, and second entity is a fructification.Preferably, second entity comprises that wherein in one embodiment, this is quoted is that the father quotes to the quoting of first entity.
Suitably, second entity is associated with second information, and wherein second entity is associated with the theme that is different from first entity.More suitably, the device that is used to define can be used to be configured to reflect different scene (for example, commercial field, leisure field).
In one embodiment, article one, information is music file, and first entity comprises one or more in the following data: the data that are associated with the music file owner, the data that date, the data that are associated with the equipment of download music files that music file downloads, the date that sends institute's file in download take place, be associated with the equipment of reception institute file in download.
According to second aspect, the invention provides a kind of peer-to-peer network, it comprises: aforesaid first peer computer system; Second peer computer system; And be used for communicating devices between first peer computer system and second peer computer system.
Preferably, second peer computer system comprises the device of the renewal version that is used to visit article one information, wherein first peer computer system comprises and is used for sending to the device of second peer system to the request of upgrading version, and wherein second peer computer system comprises and is used for upgrading the device that version sends to first peer computer system.
Preferably, each peer computer system comprises the device that is used to control to the visit of this peer computer system.In a preferred embodiment, this network also comprises the main frame peer computer system.More preferably, this network also comprises the ageng of the latest edition that is used for definite information.
According to the third aspect, the invention provides a kind of method that is used for first peer computer system that can work at peer-to-peer network, it may further comprise the steps: visit article one information; Create first entity; First entity is associated with article one information; Wherein first entity is associated with the theme of this information.
According to fourth aspect, the invention provides a kind of computer program, it comprises be configured to carry out the program code devices of method as mentioned above when moving described program on computers.
In the example, use token (token) shown in the XML structure below, yet, it will be understood by those of skill in the art that and can construct token with a lot of alternate manners.
Description of drawings
Referring now to the preferred embodiment of the present invention as shown in drawings, only the present invention is described as example:
Fig. 1 shows an example of token outline (schema);
Fig. 2 A shows an example of token;
Fig. 2 B shows the renewal version of the token of Fig. 2;
Fig. 3 shows the example of sub-token of the token of Fig. 2 A;
Fig. 4 shows another example of token;
Fig. 5 is the synoptic diagram of an example of peer device and associated component thereof; And
Fig. 6 is the synoptic diagram of an example of peer device and main frame peer device.
Embodiment
" token " of the present invention by being associated with data in this environment helps the cooperation in the distributing environment.Token is represented data " theme " (i.e. the clue of Lian Guaning), and allows one or more themes of user's tracking data in this environment.In one embodiment, token comprises the excessive data that is associated with these data.In another embodiment, token comprises excessive data and this data itself that are associated with data.
Fig. 1 shows an example (also being shown as 505 at Fig. 5) of the definitions component that is used for defining token.In a preferred embodiment, definitions component is the XML outline of definition excessive data, and adopts XML structure token.As shown in Figure 1, this outline definition unique identifier (i.e. " TokenId "); If relevant, father's identifier of this token (i.e. " TokenParent "); The data that are associated with the token of being created (i.e. " TokenCreated "), just, created the user (i.e. " byClient ")-preferably of this token, the founder who has comprised this token, yet, usually keeping in the P2P environment of anonymity, this may be inappropriate, create the date (i.e. " date ") of this token, create this token method (i.e. " method ") and with the text filed data that are associated of freedom (" UserNotes "), just, the user (i.e. " client ") of free text and the date (i.e. " lastEditDate ") of the free text that last editor is associated with this user have preferably been imported.
First scene relates to the team (sellers A (Seller_A), sellers B (Seller_B) and sellers C (Seller_C)) of the software marketing personnel in the IT company.In this environment, sales force and client's initial link can cause that a lot of people execute the task with the production process that sponsors a proposal.In this scene, Team Member has related peer device.Fig. 5 shows the general view of peer device (500), can realize the present invention in peer device (500), and with reference to various scenes it is described in more detail.
With reference to Fig. 2 A and Fig. 5, preferably, peer device comprises profile (profile) (540), and it stores the unique identifier of this peer device.Preferably, this profile comprises the out of Memory (for example, the identifier that is associated with the user of peer device, security attributes etc.) that is associated with peer device.
Sellers A at first gets in touch with the client.Sellers A for example goes up article one information (highlighting with runic) of creating by word-processing application at its peer device (500).
According to the present invention, create assembly (510) and create token (200) by preferably using definitions component (505).Next, (by associated component (515)) are associated token (200) with article one information.Preferably, token (200) is stored in the storage area (545).In a preferred embodiment, the unique token--identifier and the token itself of storage area (545) storage token.Show the storage area of sellers A below:
Token primitive token (shown in Fig. 2 A)
Next, by sending assembly (520) (for example bluetooth) direct send (that is, under the situation that does not comprise the main frame peer device) of the copy (being copy 1) of token (200) arrived sellers B.In an example, sending assembly (520) scans the unique identifier of this peer device in the reciprocity profile (540) of sellers B.
In case sellers B receives the copy of token (200), then preferably, this copy is stored in the storage area (545) on the peer device (500) of sellers B.Show the storage area of sellers B below:
Token copy 1
With reference to Fig. 2 B, sellers B creates the second information (highlighting with runic) that has same thread with article one information.In the present embodiment, sellers B adds second information to copy 1, thus the amplification primitive token.
Preferably, the token (200) of amplification is stored in the storage area (545) on the peer device (500) of sellers B.Show the storage area of sellers B below:
Token copy 1; The token (shown in Fig. 2 B) of amplification.
Next, directly send to sellers C by will the increase copy (being copy 2) of token (200) of sending assembly (520) (for example passing through infrared ray).In case sellers C receives this copy, then preferably, this copy is stored in the storage area (545) on the peer device (500) of sellers C.Show the storage area of sellers C below:
Token copy 2
From this scene as can be seen, there be (shown in Fig. 2 A and Fig. 2 B) in token (200) with different states.Now, each state can independently by different way when needed develop (promptly by interpolation information).
In one embodiment, preferably, sellers A obtains the visit to the amplification token.Preferably, the peer device (500) of the peer device of sellers A (500) contact sellers B is so that send the request of visit amplification token by sending assembly (520).In one embodiment, this request comprises the token--identifier (should be appreciated that in this scene the token--identifier of amplification token is identical with the identifier of primitive token) of the token that increases and to the request of the latest edition of the token that increases.In this example, because amplification information follows the clue identical with raw information, the token that therefore increases has and primitive token identical identifier (promptly 1000).
In case the peer device (500) at sellers B locates to receive this request, then preferably, the Control Component (525) on sellers B and the peer device (500) is mutual, and wherein Control Component (525) allows sellers B refusal or accepts this request.If sellers B refuses this request, sign off then, and preferably, send the notification to the peer device (500) of sellers A.If sellers B accepts this request, then preferably, carry out search component (530) (for example, ageng, search engine), so that use the amplification token--identifier in storage area (545), to search for.If do not mate, then preferably, send the notification to the peer device (500) of sellers A.In this example, mate:
Token copy 1; Amplification token (shown in Fig. 2 B).
Preferably, carry out the latest edition locking assembly (535) really be used for determining token.In one embodiment, determine " lastEditDate " field of each version of component monitors token, wherein up-to-date " lastEditDate " value is determined the latest edition of token.In this scene, the amplification token is a latest edition, and preferably, obtains another copy (being copy 2 ') of token, and sends it to the peer device (500) of sellers A by sending assembly (520).
In case the peer device (500) at sellers A locates to receive copy 2 ', then preferably, it is stored in the storage area (545).In a preferred embodiment, in the storage area (545) of the peer device (500) of sellers A, stored primitive token (200) and copy 2 ':
Token primitive token (shown in Fig. 2 A), copy 2 '.
In optional embodiment, copy 2 ' overrides primitive token (200), thereby sellers A can only visit the more recent version of this token.
In another embodiment, sellers B contact sellers C is so that acquisition is to the visit of the latest edition of amplification token.If the version that sellers C is preserved is newer than the version that sellers B preserved, then preferably, sellers B sends to sellers A with its copy.
In optional embodiment, Team Member can automatically obtain the visit of token that the state that does not have with him or she is existed.For example, sellers A can (for example, in its profile) be provided with the option of the latest edition that allows the automatic reception primitive token.
Preferably, for the theme of information, stored the tabulation of the information that comprises that the peer device of Team Member with cooperation is associated.This option preferably includes the mechanism (for example, ageng) of the latest edition of the token of automatically searching for the storage area (545) of (trawl) all Team Members and determining to preserve in this team.Preferably, in case find, then latest edition is sent to sellers A.
Described in scene in the above, advantageously, quote identical token by allowing Team Member, can be with the flexible way shared token between the member of team.Token allows the member to being the common information pool maintenance interest of team.Along with the progress of work, each member of team can be with the more information token that increases.Therefore, though token may reside under the different states, advantageously, the member can obtain the token that exists with the state that he or she does not have.Therefore, might be in this environment trace information.Advantageously, can in the environment that does not comprise the main frame peer device, construct and shared token.
With reference to Fig. 3 and Fig. 5, now description is related to second scene of software marketing personnel's sub-team (sellers B, sellers C).In this example, this sub-team is engaged in " IT assembly " problem of client.
At first, sellers C creates the 3rd information (highlighting with runic), and wherein the 3rd information is relevant with the IT components of work, and is therefore relevant with first and second information.Create assembly (510) and create token (300), thereby the member of this sub-team can go up cooperation at the sub-topics (sub-clue) of this work.Therefore, this token is the sub-token (300) of primitive token (200).
Next, associated component (515) is associated sub-token (300) with the 3rd information.Sub-token (300) comprises and the 3rd excessive data that information is associated.Should be noted that sub-token (300) has the unique token--identifier different with father's token (200).Yet sub-token (300) comprises the excessive data that is associated with unique token--identifier of his father.
Preferably, sub-token (300) is stored in the storage area (545) on the peer device (500) of sellers C.Show the storage area of sellers C below:
Token copy 2
Token ID 1001
The sub-token of token (shown in Figure 3)
Next, by sending assembly (520) copy (being copy 3) of sub-token (300) is directly sent to sellers B.Preferably, in case receive this copy, just it is stored in the storage area (545) on the peer device (500) of sellers B.Show the storage area (545) of sellers B below:
Token copy 1; Amplification token (shown in Fig. 2 B)
Token ID 1001
Though sellers A does not participate in the sub-topics of this work, but preferably, sellers A can for example obtain the visit of antithetical phrase token (300) by said process, wherein preferably obtain the copy (being copy 3 ') of sub-token (300), and send it to the peer device (500) of sellers A.In case receive this copy, then preferably it be stored in the storage area (545) on the peer device (500) of sellers A.Show the storage area (545) of sellers A below:
Token primitive token (shown in Fig. 2 A), copy 2 '
Token ID 1001
Token copy 3 '
As described in this scene, the providing of sub-token allow sub-team handle may be not directly related with original clue the work clue.This has reflected people's cooperation way, because under truth, can or can not share with whole team from the information that sub-team generates.Advantageously, the member outside the sub-team still can obtain from the information of sub-team generation.In addition, in the sub-token to father's token quote permission " token track ", thereby can trace information, and make it keep linking up.
With reference to Fig. 4 and Fig. 5, now description is related to the 3rd scene of software marketing personnel team (sellers A, sellers D).Sellers A creates the 4th information (highlighting with runic), so that send it to sellers D.In this scene, the 4th information has nothing to do with first, second and the 3rd information.
Create assembly (510) and create token (400), and associated component (515) is associated token (400) with the 4th information.Preferably, token (400) is stored in the storage area (545) on the peer device (500) of sellers A.Show the storage area (545) of sellers A below:
Token primitive token (shown in Fig. 2 A), copy 2 '
Token ID 1001
Token copy 3 '
Token ID 1100
Token primitive token (shown in Figure 4),
Next, by sending assembly (520) copy (being copy 4) of token (400) is directly sent to sellers D.Preferably, in case receive this copy, then it is stored in the storage area (545) on the peer device (500) of sellers D.Show the storage area (545) of sellers D below:
Token ID 1100
Token copy 4
As described in this scene, as can be seen, Team Member's (being sellers A) can preserve different tokens (that is, 1000,1001,1100), and wherein each token is represented the different themes (clue) or the sub-topics (sub-clue) of information.Therefore, along with the more information of Team Member's acquisition about particular topic, he or she can add it to suitable token, and cooperates with this suitable token.
In another embodiment, provide a kind of " mixing " system, it comprises main frame peer device (it can be considered to " unit's equity (meta peer) " equipment) and peer device.Preferably, in the present embodiment, peer device (600) comprises sending assembly (605), Control Component (610) and reciprocity profile (613).Preferably, in the present embodiment, main frame peer device (615) comprises definitions component (620), creates assembly (625), associated component (630), sending assembly (635), search component (640) and definite assembly (645).
Main frame peer device (615) is also preferably stored peer device profile (650) and token information (655).In a preferred embodiment, all versions of main frame peer device (610) storage token.Advantageously, because the storage that has kept all versions of token, so this is useful information (intelligence) source.In optional second embodiment, the latest edition of main frame peer device (610) storage token.
In this environment, with reference to first scene, sellers A goes up article one information of creating at its peer device (600).Preferably, by sending assembly (605) this information is sent to main frame peer device (615) with the request that sends this information to sellers B.In case receive, then, create token by creating assembly (625) by preferably using definitions component (620).Next, (by associated component (630)) are associated this token with article one information.Preferably, this token is stored in the storage area (655).More preferably, unique token--identifier that will be generated in constructive process sends to the peer device (600) of sellers A.
In a preferred embodiment, also by sending assembly (635) unique token--identifier being sent to sellers B (is to be understood that, sending assembly (635) is communicated by letter with the peer device profile (650) of being stored, so that find the peer device identifier of the peer device (600) of sellers B).In one embodiment, also send the notification to sellers B, wherein this notice comprises the relevant information of sender's (being sellers A) with token.
More preferably, the peer device of sellers B (600) uses unique token--identifier and main frame peer device (615) contact, so that obtain the visit to token.In one embodiment, token is sent to the peer device (600) of sellers B.In another embodiment, sellers B checks token and related information on main frame peer device (615).
In this environment, with reference to first scene, preferably, sellers A obtains the visit to the latest edition of primitive token.
Preferably, the peer device of sellers A (600) contact. host peer device (615) is so that send the latest edition of request with access token by sending assembly (605).
In one embodiment, this request comprises the token--identifier of primitive token and the request of checking the latest edition of token.
In case locate to receive this request at main frame peer device (615), then preferably, main frame peer device (615) sends the notification to the peer device of sellers B, thereby notifies the request of sellers A to sellers B.Preferably, this causes carrying out the Control Component (610) on the peer device (600), thereby allows sellers B refusal or accept this request.
If sellers B refuses this request, sign off then, and preferably, send the notification to the peer device (600) of sellers A.If sellers B accepts this request, then preferably, this causes carrying out search component (640), and then, search component (640) uses token--identifier to search in storage area (655).In case find each version of token, then preferably, to carry out and determine assembly (645), it determines the latest edition of token.In case the latest edition of finding then provides visit to it to sellers A.
In one embodiment, the peer device (600) that the latest edition and the related information of token sent to sellers A.In another embodiment, sellers A checks token and related information on main frame peer device (615).
Provide the main frame peer device to system, and peer device provides dirigibility for the user, because preferably, they can use the model that is suitable for its current geographic position and infrastructure environment most.Should be appreciated that in this commingled system if transmit token between peer device, then in order to obtain the latest edition of token, peer device is the contact. host peer device preferably.
Advantageously, providing the main frame peer device to allow this mechanism is " lightweight ", because peer device can only use unique token--identifier to communicate by letter.In addition, in a preferred embodiment, on the main frame peer device, preserve related information, and peer device can be checked this related information on the main frame peer device.Therefore, this has improved the memory capacity on the peer device.
In one implementation, the present invention can be used to follow the tracks of music file.In this was realized, the music file founder created token, and its additional (promptly related) arrived music file.Preferably, definitions component is configured to define the data relevant with the music file founder, the data, the data that are associated with the equipment of downloading, the data that are associated with the date that sends institute's file in download that are associated with the date of generation download and the data that are associated with the equipment that receives this download.When music file when a peer device passes to another peer device, upgrade token data, thereby create " track ".This track helps the tracking of music file.
In another implementation, mechanism of the present invention can be used for the prior art such as e-mail system.A problem that is associated with e-mail system is all the other man-hours that send an email to team as the user, if forgetting to certain Team Member, the user sends, unless then one of other Team Members send this Email, otherwise this Team Member can not see this Email.Advantageously, mechanism of the present invention allows any renewal of any Team Member acquisition to this information.In one embodiment, (for example, passing through ageng) takes place in this process automatically, therefore, do not need Team Member to know that whom they cooperate with.
Token provides the mechanism that is used to write down with organizational information, thus allow the user obtain knowledge and acquisition point or the user select later the time, it is shared with other people.
Advantageously, the present invention allows to cooperate under the situation that does not have the central host peer device, and this is much flexible, because token can needn't allow peer device wait for till they are connected to the main frame peer device transmitting between the peer device.
Together Xie Zuo Team Member also to form with the information that is associated with this team be the community that sets up at center.All members of this team can consult any renewal to information.
Except these characteristics, token also comprises life historical information that allow to explore the relation between the token (for example, father's token information etc.).Can merge and analyze this information afterwards.
Claims (25)
1. first peer computer system that can work in peer-to-peer network comprises:
Be used to visit the device of article one information;
Be used to create the device of first entity;
Be used for device that first entity is associated with article one information;
Wherein first entity is associated with the theme of article one information.
2. first peer computer system as claimed in claim 1, wherein first entity comprises unique identifier.
3. first peer computer system as claimed in claim 1 or 2, wherein first entity comprises the date of creating first entity.
4. as each described first peer computer system in the claim of front, wherein first entity comprises article one information.
5. as each described first peer computer system in the claim of front, also comprise the device that is used to define first entity.
6. as each described first peer computer system in the claim of front, also comprise the device that is used to store first entity.
7. as each described first peer computer system in the claim of front, also comprise the device that is used for first entity is sent to second peer computer system.
8. as each described first peer computer system in the claim of front, also comprise the device that is used to create second entity, wherein second entity is associated with the sub-topics of article one information.
9. first peer computer system as claimed in claim 8, wherein second entity comprises quoting first entity.
10. first peer computer system as claimed in claim 9, wherein this to quote be that the father quotes.
11. each described first peer computer system as in the claim of front also comprises the device that is used to create the 3rd entity, wherein the 3rd entity is associated with second information.
12. as each described first peer computer system in the claim 5 to 11, the device that wherein is used to define is configurable.
13. as each described first peer computer system in the claim of front, wherein article one information is music file.
14. first peer computer system as claimed in claim 13, wherein first entity comprises the data that are associated with the music file owner.
15. as claim 13 or described first peer computer system of claim 14, wherein first entity comprises the date that is associated with the download of music file.
16. first peer computer system as claimed in claim 15, wherein first entity comprises and the related data of downloading associated device.
17. first peer computer system as claimed in claim 16, wherein first entity comprises and sends the date that institute's file in download is associated.
18. first peer computer system as claimed in claim 17, wherein first entity comprises and the related data that receives institute's file in download associated device.
19. a peer-to-peer network comprises:
As each described first peer computer system in the claim 1 to 18;
Second peer computer system; And
Be used for communicating devices between first peer computer system and second peer computer system.
20. peer-to-peer network as claimed in claim 19, wherein second peer computer system comprises the device of the renewal version that is used to visit article one information, wherein first peer computer system comprises and is used for sending to the device of second peer system to the request of upgrading version, and wherein second peer computer system comprises and is used for upgrading the device that version sends to first peer computer system.
21. as claim 19 or 20 described peer-to-peer networks, wherein each peer computer system comprises the device that is used to control to the visit of described peer computer system.
22. each the described peer-to-peer network as in the claim 19 to 21 also comprises the main frame peer computer system.
23., also comprise the ageng of the latest edition that is used for definite information as each the described peer-to-peer network in the claim 19 to 22.
24. a method that is used for first peer computer system that can work at peer-to-peer network may further comprise the steps:
Visit article one information;
Create first entity;
First entity is associated with article one information;
Wherein first entity is associated with the theme of this information.
25. a computer program comprises the program code devices that is configured to carry out the method for claim 1 when moving described program on computers.
Applications Claiming Priority (3)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
GBGB0315204.8A GB0315204D0 (en) | 2003-06-28 | 2003-06-28 | A peer computer system |
GB0315204.8 | 2003-06-28 | ||
PCT/GB2003/004891 WO2005004018A2 (en) | 2003-06-28 | 2003-11-12 | A peer computer system |
Publications (2)
Publication Number | Publication Date |
---|---|
CN1732477A true CN1732477A (en) | 2006-02-08 |
CN1732477B CN1732477B (en) | 2012-05-09 |
Family
ID=27676308
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN2003801080215A Expired - Fee Related CN1732477B (en) | 2003-06-28 | 2003-11-12 | A peer computer system working in peer network and method thereof |
Country Status (7)
Country | Link |
---|---|
US (1) | US8626839B2 (en) |
KR (1) | KR100763565B1 (en) |
CN (1) | CN1732477B (en) |
AU (1) | AU2003282229A1 (en) |
GB (1) | GB0315204D0 (en) |
TW (1) | TWI291106B (en) |
WO (1) | WO2005004018A2 (en) |
Family Cites Families (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20020062336A1 (en) | 2000-11-22 | 2002-05-23 | Dan Teodosiu | Resource coherency among resources cached in a peer to peer environment |
US7222156B2 (en) * | 2001-01-25 | 2007-05-22 | Microsoft Corporation | Integrating collaborative messaging into an electronic mail program |
US20030078918A1 (en) | 2001-10-23 | 2003-04-24 | Souvignier Todd J. | Method, apparatus and system for file sharing between computers |
US7328243B2 (en) * | 2002-10-31 | 2008-02-05 | Sun Microsystems, Inc. | Collaborative content coherence using mobile agents in peer-to-peer networks |
KR20030040297A (en) | 2003-04-17 | 2003-05-22 | 주식회사 네오에이지 | Peer to peer file sharing service with fee |
-
2003
- 2003-06-28 GB GBGB0315204.8A patent/GB0315204D0/en not_active Ceased
- 2003-11-12 CN CN2003801080215A patent/CN1732477B/en not_active Expired - Fee Related
- 2003-11-12 WO PCT/GB2003/004891 patent/WO2005004018A2/en active Application Filing
- 2003-11-12 KR KR1020057022704A patent/KR100763565B1/en not_active IP Right Cessation
- 2003-11-12 AU AU2003282229A patent/AU2003282229A1/en not_active Abandoned
- 2003-11-12 US US10/555,433 patent/US8626839B2/en not_active Expired - Fee Related
-
2004
- 2004-06-04 TW TW093116233A patent/TWI291106B/en not_active IP Right Cessation
Also Published As
Publication number | Publication date |
---|---|
US8626839B2 (en) | 2014-01-07 |
KR100763565B1 (en) | 2007-10-04 |
WO2005004018A2 (en) | 2005-01-13 |
AU2003282229A1 (en) | 2005-01-21 |
US20070050486A1 (en) | 2007-03-01 |
TWI291106B (en) | 2007-12-11 |
GB0315204D0 (en) | 2003-08-06 |
KR20060024387A (en) | 2006-03-16 |
CN1732477B (en) | 2012-05-09 |
TW200511042A (en) | 2005-03-16 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN1829226A (en) | Client-side presence documentation | |
US9104758B2 (en) | Methods, systems, and products for searching social networks | |
US8959341B2 (en) | Methods and systems for sharing database content | |
CN1229715C (en) | Information control system and information processing method | |
US20110154209A1 (en) | Platform for proactive discovery and delivery of personalized content to targeted enterprise users | |
CN1689006A (en) | Deploying multiple enterprise planning models across clusters of application servers | |
CN1813233A (en) | User interface for controlling access to computer objects | |
US8825509B2 (en) | System, method and computer program product for leveraging a customer relationship management system to send meeting invitations | |
US20130297699A1 (en) | Method and system for on-demand communities | |
US20050066240A1 (en) | Data quality & integrity engine | |
CN1577279A (en) | Method and apparatus for viewing and managing collaboration data from within the context of a shared document | |
CN1609857A (en) | Group shared spaces | |
CN1609873A (en) | Method, apparatus, and user interface for managing electronic mail and alert messages | |
CN1722048A (en) | Proximity-based authorization | |
CN1926564A (en) | Determining and/or using end user local time information in an ad system | |
CN1609854A (en) | Sharing computer object with association | |
CN1838981A (en) | Method and device for generating a game directory on an electronic gaming device | |
CN1946075A (en) | Method and system to determine a user specific relevance score of a message within a messaging system | |
CN101059799A (en) | Method for introducing regular file into data base | |
CN1530820A (en) | Network printer connecting updating mode for printer customer | |
CN101031886A (en) | Network system, management computer, cluster management method, and computer program | |
CN1737836A (en) | Be used to improve the method for in-house throughput rate | |
CN101520862A (en) | Method and equipment for updating electronic calendar appointment plan and method and equipment for generating electronic calendar appointment plan | |
Gentil‐Beccot et al. | Information resources in High‐Energy Physics: Surveying the present landscape and charting the future course | |
CN1823331A (en) | Inline compression of a network communication within an enterprise planning environment |
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: 20120509 Termination date: 20181112 |