METHOD AND APPARATUS FOR CREATING SEARCHES IN PEER-TO-PEER NETWORKS

• US 20080263031A1
• Filed: 06/27/2008
• Published: 10/23/2008
• Est. Priority Date: 06/15/2005
• Status: Abandoned Application

• Current Assignee: David A. George, Jason D. La Voie, Raymond B. Jennings III
• Original Assignee: David A. George, Jason D. La Voie, Raymond B. Jennings III
• Inventors: George, David A., Jennings, Raymond B. III, La Voie, Jason D.
• Application Number:
  US12/163,469
• Publication Number:
  US 20080263031A1
• Time in Patent Office: Days
• US Class Current: 707/5
• 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/48 Retrieval characterised by using metadata, e.g. metadata not derived from the content or metadata generated manually

Abstract

One embodiment of the present method and apparatus for creating searches in peer-to-peer networks includes forming clusters comprising data from a user'"'"'s media library and formulating at least one search request message in accordance with the clusters. Formation of the clusters may be guided at least in part by data attributes that the user indicates are important. In this way, the user'"'"'s media library may be “mined” for information that will aid in creating searches for data that the user may be interested in, but may not necessarily know how to search for or may not necessarily know exists.

Claims

1. A method for searching for data in a network, said method comprising:

forming one or more clusters comprising data from a media library; and

formulating at least one search request message in accordance with said one or more clusters.

2. The method of claim 1, wherein said one or more clusters are formed in accordance with one or more data attributes.

3. The method of claim 2, wherein said one or more data attributes are supplied by said user.

4. The method of claim 2, wherein said one or more data attributes are weighted based on relative importance.

5. The method of claim 2, wherein each of said one or more clusters is defined by at least one of said one or more data attributes, said at least one defining attribute being common to data contained within an associated cluster.

6. The method of claim 1, wherein said forming comprises:

applying a clustering algorithm to said data.

7. The method of claim 6, wherein a selection of said clustering algorithm is guided at least in part by desired search results.

8. The method of claim 1, wherein said formulating is further performed in accordance with supplemental information received from an external source.

9. The method of claim 8, wherein said supplemental information relates to said data in said media library.

10. The method of claim 1, further comprising:

propagating said search request message through said network.

11. A computer readable medium containing an executable program for searching for data in a network, where the program performs the steps of:

forming one or more clusters comprising data from a media library; and

formulating at least one search request message in accordance with said one or more clusters.

12. The computer readable medium of claim 11, wherein said one or more clusters are formed in accordance with one or more data attributes.

13. The computer readable medium of claim 12, wherein said one or more data attributes are supplied by said user.

14. The computer readable medium of claim 12, wherein said one or more data attributes are weighted based on relative importance.

15. The computer readable medium of claim 12, wherein each of said one or more clusters is defined by at least one of said one or more data attributes, said at least one defining attribute being common to data contained within an associated cluster.

16. The computer readable medium of claim 11, wherein said forming comprises:

applying a clustering algorithm to said data.

17. Apparatus comprising:

means for forming one or more clusters comprising data from a media library; and

means for formulating at least one search request message in accordance with said one or more clusters.

18. A method for propagating a search request message in a network, the method comprising:

monitoring a status of said network; and

determining an optimal time to send said search request message in accordance with said network status.

19. The method of claim 18, wherein said monitoring comprises:

determining if said network has reached a substantially steady state.

20. The method of claim 18, wherein said monitoring comprises:

determining a ratio of input messages to output messages at least one neighbor node.

21. The method of claim 18, wherein said monitoring comprises:

determining a number of error messages received at least one neighbor node over a finite period of time.

22. The method of claim 18, wherein said monitoring comprises:

determining a number of rejections received at least one neighbor node over a finite period of time.

23. The method of claim 18, wherein said monitoring comprises:

determining a ratio of super neighbor nodes to non-super neighbor nodes.

24. The method of claim 18, wherein said monitoring comprises:

determining a ratio of bytes received to a number of neighbor nodes.

25. The method of claim 18, wherein said monitoring comprises:

determining a number of bytes received by an expiration of a search request message'"'"'s hop count or time to live.

26. The method of claim 18, wherein said monitoring comprises:

determining a number of bytes received per data transfer protocol present in said network.

27. The method of claim 18, wherein said monitoring comprises:

determining an average number of files being shared per node in said network.

28. The method of claim 18, further comprising:

propagating said search request message if it is determined to be an optimal time to send said search request message.

29. The method of claim 18, further comprising:

alerting a user to an optimal time to send said search request message; and

sending said search request message, if said user instructs that said search request message should be sent.

30. A computer readable medium containing an executable program for propagating a search request message in a network, where the program performs the steps of:

monitoring a status of said network; and

determining an optimal time to send said search request message in accordance with said network status.