System and method for advertising on a peer-to-peer network

• US 9,922,330 B2
• Filed: 06/11/2008
• Issued: 03/20/2018
• Est. Priority Date: 04/12/2007
• Status: Active Grant

• Current Assignee: Kroll Information Assurance LLC
• Original Assignee: Kroll Information Assurance LLC
• Inventors: Hopkins, Samuel P.
• Primary Examiner(s): Oyebisi, Ojo O
• Application Number:
  US12/157,598
• Publication Number:
  US 20080319861A1
• Time in Patent Office: 3,569 Days
• Field of Search: 705 14, 705 35, 705 25, 705 141
• CPC Class Codes: G06Q 30/02 Marketing; Price estimation or determination; Fundraising
• CPC Class Codes: G06Q 30/0256 User search
• CPC Class Codes: G06Q 30/0277 Online advertisement

Abstract

A system for advertising on a Peer-to-Peer network detects a search request of a node in a Peer-to-Peer network. After detecting a search request, the system prepares an unsolicited response (e.g., advertisement) to the search request of the node. Once the unsolicited response is prepared, the system sends the unsolicited response to the node. For example, a Peer-to-Peer network node issues a search request and a system prepares an advertisement (e.g., an unsolicited response). After preparing the advertisement, the system sends the advertisement to the Peer-to-Peer network node that issued the search request. The process of sending advertisements can be made to each node issuing a search request without discrimination. In one example, the system detects a search request of a node in a Peer-to-Peer network; prepares an advertisement in response to the search request of the node based on a predetermined search criteria; and sends the advertisement to the node for advertising on the Peer-to-Peer network.

Claims

1. A node in a Peer-to-Peer network comprising:

a processor and a memory, the processor configured to;

issue a search request in the Peer-to-Peer network;

receive an advertisement from an advertisement system coupled to the Peer-to-Peer network, where the node receives the advertisement in response to issuing the search request, and where a distance between the node and the advertisement system does not exceed a distance limit of the Peer-to-Peer network indicating a maximum distance limit each message can travel in the Peer-to-Peer network;

receive a different search request from a different node in the Peer-to-Peer network, where the different search request is similar to the search request issued by the node; and

transmit the advertisement to the different node, in response to receiving the different search request, where a distance between the different node and the advertisement system exceeds the distance limit of the Peer-to-Peer network.

2. The node according to claim 1 wherein the advertisement is sent from the advertisement system to the node in response to the search request matching a predetermined criteria.

3. The node according to claim 2 wherein the predetermined criteria is a list of keywords that have been pre-selected to monitor.

4. A node as set forth in claim 1 wherein the advertisement system is coupled to super nodes, ultra Peers, main nodes, or other centralizing node in the Peer-to-Peer network.

18. The node according to claim 1 wherein a plurality of advertisements sent from the advertisement to nodes in the Peer-to-Peer network are stored in a database coupled to the advertisement system.

5. A method for advertising on a Peer-to-Peer network, comprising:

interposing an Advertisement System on a Peer-to-Peer network;

monitoring the Peer-to-Peer network through the Advertisement System for detecting search requests;

responding to a first node in the Peer-to-Peer network with information that is used for advertising a product or service in response to the Advertisement System detecting a search request that matches a list of predetermined criteria; and

sending, by the first node, the information that is used for advertising the product or service to one or more other nodes in the Peer-to-Peer network, in response to the first node receiving a different search request that is similar to the search request detected by the Advertisement System that matches the list of predetermined criteria, wherein a distance between the first node and the Advertisement System does not exceed a distance limit of the Peer-to-Peer network indicating a maximum distance limit each message can travel in the Peer-to-Peer network and where a distance between the one or more other nodes and the Advertisement System exceeds the distance limit of the Peer-to-Peer network.

6. The method according to claim 5 wherein the distance limit is associated with a number of hops or a time-to-live.

7. The method according to claim 5 further comprising:

storing the information, corresponding to a requested object associated with the search request, at the Advertisement System;

monitoring the Peer-to-Peer network through the Advertisement System for detecting the search request related to the requested object;

acquiring a unique ID generated by the first node in the Peer-to-Peer network requesting the requested object; and

responding to the first node representing the ID requesting the requested stored object with the information that is used for advertising the product or service.

8. The method according to claim 7 wherein the information that is used for advertising the product or service is different from the requested object.

9. A computer readable medium having computer readable program codes, executed by a processor, for advertising on a Peer-to-Peer network, comprising:

detecting a search request for an object from a first node in a Peer-to-Peer network;

preparing, by an advertisement system, an advertisement in response to the search request from the first node, wherein the advertisement is different than the object requested by the first node;

sending, from the advertisement system to the first node, the advertisement over the Peer-to-Peer network, where a distance between the first node and the advertisement system does not exceed a distance limit of the Peer-to-Peer network indicating a maximum distance limit each message can travel in the Peer-to-Peer network; and

sending the advertisement from the first node to the second node in the Peer-to-Peer network upon the first node receiving another search request from the second node that is similar to the search request sent by the first node, where a distance between the second node and the advertisement system exceeds the distance limit.

10. The computer readable medium of claim 9 further comprising:

storing the advertisement corresponding to the object at the advertisement system;

acquiring a unique identification (ID) generated by the first node requesting the object; and

responding with the advertisement to first node representing the ID requesting the object, wherein the advertisement is different from the object.

11. The computer readable medium of claim 9 further comprising comparing the search request to predetermined criteria and retrieving the advertisement to send to the first node in response to the comparison.

12. A method for advertising on a Peer-to-Peer network comprising:

at an advertisement system;

detecting a search request of a first node in a Peer-to-Peer network having a distance limit indicating a maximum distance limit each message can travel in the Peer-to-Peer network,

preparing an advertisement in response to the search request the first node based on a predetermined search criteria, and

sending the advertisement to the first node for the purpose of advertising on the Peer-to-Peer network, wherein the distance between the Advertisement System and the first node is within the distance limit; and

at a second node;

issuing a search that is similar to the search request sent by the first node and detected by the advertisement system, and

receiving the advertisement from the first node in response to the second node issuing the search that is similar to the search request sent by the first node and detected by the advertisement system, the advertisement traveling a distance in the Peer-to-Peer network that exceeds the distance limit in the Peer-to-Peer network.

13. The method according to claim 12 further comprising:

storing an advertisement, corresponding to an object associated with the search request, at the Advertisement System;

monitoring the Peer-to-Peer network via the Advertisement System to detect the search request;

acquiring a unique identification (ID) generated by the first node issuing the search request; and

responding to the first node, representing the ID and requesting the object, with the advertisement that is different than the object.

14. The method according to claim 12 wherein the distance limit is associated with a number of hops or a time-to-live.

15. The method according to claim 12 further including comparing the search request from the first node to predetermined criteria and retrieving the advertisement, by the advertisement system, to send to the first node in response to the comparison.

16. The method according to claim 15 wherein comparing includes comparing the search request from the first node using inter-string, complete string, partial string, fuzzy logic, patricia tree, or any combination thereof.

17. A method for advertising on a Peer-to-Peer network comprising:

at a first node in the peer-to-peer network;

issuing a search request in the Peer-to-Peer network having a distance limit indicating a maximum distance each message can travel in the Peer-to-Peer network,

downloading a file from a second node in the Peer-to-Peer network in response to the first node issuing the search request, wherein the distance between the second node and the first node is within the distance limit of the Peer-to-Peer network, and

receiving an advertisement from the second node in the Peer-to-Peer network in response to the first node issuing the search request, the advertisement traveling a distance in the Peer-to-Peer network that exceeds the distance limit of the Peer-to-Peer network, wherein the second node received the advertisement from an advertisement system that detected a search from the second node that is similar to the search request issued by the first node.