Method and apparatus for providing information in a peer-to-peer network

• US 20040181607A1
• Filed: 03/13/2003
• Published: 09/16/2004
• Est. Priority Date: 03/13/2003
• Status: Abandoned Application

• Current Assignee: Hewlett-Packard Development Company, L.P. (HP Inc.)
• Original Assignee: Hewlett-Packard Development Company, L.P. (HP Inc.)
• Inventors: Xu, Zhichen, Mahalingam, Mallik, Tang, Chunqiang
• Application Number:
  US10/386,454
• Publication Number:
  US 20040181607A1
• Time in Patent Office: Days
• US Class Current: 709/239
• CPC Class Codes: G06F 16/1834 implemented based on peer-to-peer networks, e.g. gnutella p2p communication protocols H04L67/104
• CPC Class Codes: G06F 16/951 Indexing; Web crawling techniques
• CPC Class Codes: H04L 67/104 Peer-to-peer [P2P] networks
• CPC Class Codes: H04L 67/1065 Discovery involving distributed pre-established resource-based relationships among peers, e.g. based on distributed hash tables [DHT] pre-configuration of logical or physical connections H04L67/1053
• CPC Class Codes: H04L 69/329 in the application layer [OSI layer 7]

Abstract

In a method of providing information in a peer-to-peer network, a query is received and a profile is generated based on the query by applying a latent semantic indexing algorithm. The profile is routed to a selected node based on the profile falling within a zone owned by the selected node.

Claims

1. A method of providing information in a peer-to-peer network, said method comprising:

receiving a query;

generating a profile based on applying a latent semantic indexing algorithm to said query; and

routing said profile to a selected node based on said profile falling within a zone owned by said selected node.

2. The method according to claim 1, further comprising:

providing information based on arriving documents matching said profile.

3. The method according to claim 1, further comprising:

selecting a group of neighboring nodes based on said group of neighboring nodes falling within a radius of said selected node.

4. The method according to claim 3, further comprising:

selecting said radius based on a user-specified similarity threshold.

5. The method according to claim 1, further comprising:

setting a timer associated with said profile.

6. The method according to claim 5, further comprising:

deleting said profile based on said timer expiring.

7. The method according to claim 1, further comprising:

implementing an overlay network by a group of peers of said peer-to-peer network; and

dividing said overlay network into zones, each peer of said group of peers owning a respective node.

8. The method according to claim 7, further comprising:

storing key pairs, each key pair comprising a semantic vector and an associated address index, in said overlay network.

9. The method according to claim 8, further comprising:

creating groups of similar key pairs from said key pairs, each group of key pairs based on respective semantic vector of each key pair being similar.

10. The method according to claim 9, further comprising:

associating each group of similar key pairs with a respective peer of said overlay network.

11. An apparatus for providing information in a peer-to-peer network, said apparatus comprising:

means for implementing an overlay network by a group of peers of said peer-to-peer network;

means for dividing said overlay network into zones, each peer of said group of peers owning a respective node;

means for generating a profile based on applying a latent semantic indexing algorithm on a received query; and

means for routing said profile to a selected peer based on said profile falling within a respective of said selected peer.

12. The apparatus according to claim 11, further comprising:

means for providing information based on arriving documents matching said profile.

13. The apparatus according to claim 11, further comprising:

means for selecting a group of neighboring nodes based on said group of neighboring nodes falling within a radius of said selected node.

14. The apparatus according to claim 13, further comprising:

means for selecting said radius based on a user-specified similarity threshold.

15. The apparatus according to claim 11, further comprising:

means for setting a timer associated with said profile.

16. The apparatus according to claim 15, further comprising:

deleting said profile based on said timer expiring.

17. A system for providing information in a peer-to-peer network, said system comprising:

a plurality of peers;

an overlay network implemented by said plurality of peers, wherein said overlay network is configured to be divided into zones, each zone owned by a respective peer of said plurality of peers;

a plurality of indices, each index of said plurality of indices based on at least one key pair comprising a respective semantic vector and associated address index; and

a profile module stored an executed by each peer of said plurality of peers, wherein said profile module is configured to store a profile and to apply said profile to arriving information.

18. The system according to claim 17, wherein said profile module is further configured to determine a matching document based on said arriving information being similar to said profile.

19. The system according to claim 18, wherein said profile module is further configured to forward said matching information to an initiator of said received query.

20. The system according to claim 17, wherein said profile module is further configured to determine a matching document based on said arriving information matching said profile.

21. The system according to claim 17, wherein said profile module is further configured to select a group of neighboring nodes based on each neighboring node being within a radius.

22. The system according to claim 21, wherein a length of said radius is based on a similarity threshold.

23. A computer readable storage medium on which is embedded one or more computer programs, said one or more computer programs implementing a method of for providing information in a peer-to-peer network, said one or more computer programs comprising a set of instructions for:

receiving a query;

generating a profile based on applying a latent semantic indexing algorithm to said query; and

routing said profile to a selected node based on said profile falling within a zone owned by said selected node.

24. The computer readable storage medium in according to claim 23, said set of instructions further comprises:

providing information based on arriving documents matching said profile.

25. The computer readable storage medium in according to claim 23, said set of instructions further comprises:

selecting a group of neighboring nodes based on said group of neighboring nodes falling within a radius of said selected node.

26. The computer readable storage medium in according to claim 25, said set of instructions further comprises:

selecting said radius based on a user-specified similarity threshold.

27. The computer readable storage medium in according to claim 23, said set of instructions further comprises:

setting a timer associated with said profile.

28. The computer readable storage medium in according to claim 27, said set of instructions further comprises:

deleting said profile based on said timer expiring.