AT10551U1 - PROCEDURE FOR MONITORING AND PROVIDING INFORMATION ON A PEER TO PEER NETWORK - Google Patents

Description

2 AT 010 551 U1

FIELD OF THE INVENTION

The present invention provides a method for monitoring transmissions and selectively providing information over a peer-to-peer network and, in particular, for monitoring peer-to-peer networks to receive information, in particular preselected information requests, and for monitoring the sources of such requests and providing information in the fulfillment of each such request.

BACKGROUND OF THE INVENTION

As used herein, peer-to-peer networks, which are the subject of the present invention, comprise multiple nodes, each node typically consisting of both a file server and a client, which provides data or information to or from send and receive a node to which one is connected.

In a peer-to-peer network, each node is connected to other nodes via a communication medium, such as the Internet, either directly or via a type of proxy. For example, when a search request is issued, such an originating node sends a search request to all those nodes to which it is connected (see Fig. 1). These nodes search their list of available files, and if a match is found, they return a response with the location. However, a peer-to-peer proxy network typically consists of a node A connected to a node B, and node B is connected to a node C (see Fig. 2). Node A is not connected to node C so that when node A issues a search request, it will be forwarded to node B and node B will search its available data and, if a match is found, send a response back to node A. becomes. Node B will then forward the request from node A to node C, and node C will search its available files, and if a match is found, it will send a reply back to node B. Node B will then forward this response to node A. Fig. 3 discloses a network with loops without proxy, each node being directly connected to the others.

Some peer-to-peer networks use a leaf node / master node proxy topology (see FIG. 4) in which some nodes are classified as master nodes and the remaining nodes are classified as leaf nodes , Leaf nodes can only be connected to main nodes. Only main nodes can be connected to other main nodes. When a leaf node issues a search request, it sends the request to the main node to which it is connected. The master node then forwards the request to other leaf nodes connected to it and also to each parent node to which it is connected. These master nodes forward the request to all leaf nodes connected to them.

In peer-to-peer networks, information requests are sent to the nodes to which they are connected, and conversely, each of these nodes sends the information requests to other nodes to which they are connected. The current peer-to-peer networks do not have a centralized search facility, as the " older " Networks such as Napster and the like had. Because most of the newer peer-to-peer networks lack centralization, it is difficult, if not impossible, to control the information content that is sent and received over the network. This is particularly problematic with regard to the use of such networks to send specified information to and from the requestors on the network, if that information is either not available for such distribution or if the material is of societal concern, especially for minors.

Various attempts have been made to obstruct or disrupt such network transmissions and transmissions. However, these attempts have not generally been successful, especially in the " older " Peer-to-peer networks. And despite such attempts, the peer-to-peer networks have grown and the amount of either illegal or incorrect traffic has grown and has deprived many information owners of their possessions.

Overall, the peer-to-peer networks are made up of millions of individual users, all of whom are looking for specific types of information. Due to the density of users, there is an opportunity for targeted and non-targeted advertising by monitoring user searches and responses with advertising information.

Accidental communication of information occurs regularly among unsuspecting users for a variety of reasons. Terrorists are known to exploit this problem and to use the networks to obtain sensitive and secret information from private individuals, organizations and public bodies, such as governments. Because of the camouflage features these networks provide, terrorists also use these networks to communicate with each other.

Accordingly, it is an object of the present invention to provide a method for monitoring peer-to-peer networks for selected information requests and providing information in response to such requests. It is a further object of the present invention to provide a method for monitoring the peer-to-peer networks for specific and indefinite requirements and to provide advertising information in response to such requests. It is a further object of the invention to provide a method for identifying terrorists, their activities and their level of threat. It is a further object of the invention to provide a method for reducing the nodes in a peer-to-peer network which receive the requested information. It is a further object of the invention to provide a method for monitoring selected or preselected requests for information over a peer-to-peer network and to protect against unauthorized receipt of requested information. It is yet another object of the invention to provide a method for monitoring any or selected information transmitted or requested over a peer-to-peer network to obtain a record of such transmissions and requests by, among other things, client IP To provide addresses. It is a further object of the invention to provide at least one dummy node located in a peer-to-peer network.

BRIEF SUMMARY OF THE INVENTION

In general, the present invention provides a method for monitoring search requests for selected objects by means of a node on a peer-to-peer network having at least two nodes and for providing a response to substantially all such requesting nodes. The preferred method comprises the following steps: a. Inserting at least one pseudo node onto a peer-to-peer network, the pseudo node being configured to provide at least one IP address and, optionally, at least one network address, the pseudo node comprising at least one selected object stored therein; b. Searching the network by at least one of the dummy nodes to detect requests that match at least one of the stored objects; c. Determining a unique ID (" Identification ") generated by each network node requesting the object matching the stored object; and d. Responses essentially to every node that represents an ID. 4 AT 010 551 U1

Therefore, the present invention provides a method of monitoring peer-to-peer networks using at least one pseudo-node to receive search requests and respond to such requests by providing information to at least one or more of the requesting nodes of such a network. The invention does not require that any such responding information be identical to the requested information. In such an embodiment, the inventive method provides a dummy node configured to change its IP address as well as its client ID in a random or predetermined manner.

In another embodiment of the invention, a method of monitoring a peer-to-peer network includes at least one dummy node configured to reduce data transmission and retrieval on such networks by inserting searches, such as unauthorized connection activities with other nodes on the network. The method provides a pseudo-node comprising nodes that respond to searches for incorrect or out-of-order information and that also remove search requests from the network so that other non-pseudo nodes do not respond.

This invention also provides a method wherein at least one pseudoknot verifies each search request on the network for a preselected information criterion. If a search matches the preselected criterion, then the dummy node will respond with information used to advertise a product, service, or thing.

This invention also provides a method in which at least one pseudo-node responds to each search request with information used to advertise a product, service, or thing independent of the search term.

The invention also provides a method wherein at least one pseudo-node checks each search request or response on the network for predetermined informational criteria associated with terrorist activity, and such information is then used to identify terrorist activity.

The invention also provides a method wherein at least one pseudoknot verifies each search request or response on the network for a predetermined information criterion related to terrorist activities, and wherein such information is then used to identify terrorist information or information Identify patterns.

The invention also provides a method wherein at least one pseudoknot verifies each search request or response on the network for a predetermined information criterion associated with terrorists, and such information is then used to identify terrorists, and then, when identified, to record further useful information for locating the terrorist.

The invention also provides a method in which at least one pseudo-node issues a search request for predetermined information related to terrorists, reviews the responses, and performs threat determination using generally accepted principles and methods.

This invention also provides a method wherein at least one pseudoknot verifies each search request on the network for a predetermined information criterion or actions. If a search matches pre-selected criteria, then the pseudo node will limit the transmission and retrieval of the selected data by replies with false or stale information. 5 AT 010 551 U1

The dummy node, in a preferred embodiment, responds to search requests and returns false data so that successful data collection is reduced. In another embodiment of the invention, the dummy node is configured to " confuse " the network node from which a search originates by one or more of the methods set forth below. These methods are also useful in peer-to-peer networks in which certain nodes cache file information by configuring the pseudo-node to specifically address the caching nodes in the network.

These methods include: 1. Sending a response that it owns the data, such data being not the requested information but being other data or having no data at all. 2. Send a response by embodying a node in the network. 3. Send a response by embodying multiple nodes such that the data looks as if it is available from multiple network nodes rather than from the dummy nodes. 4. Sending a response that causes the sender of the search to cease its function or significantly restrict its operation. 5. Sending a response listing random file names or file sizes available from single or multiple nodes on the network. 6. Returning a response filling the ad window of the node with irrelevant information.

To appear as a node in the network, the dummy node uses its configured list of addresses or an address randomly generated by the dummy node. These addresses may or may not exist in the peer-to-peer network. However, if these addresses do not exist in the network, the dummy node will make it look as if they did.

Another method is provided to remove searches from the network. The dummy node is configured to present itself as a network node on a proxy-based network, for example, by the method described above. When network nodes issue search requests that pass through the dummy node, it compares each search request with a set of preselected criteria or with a criterion based on an expert system or a fuzzy logic. If a match is found with these criteria, the dummy node drops the search request. The leaf node and main nodes do not receive dropping data and therefore respond as if no searches met the criteria.

Finally, most nodes in a peer-to-peer network can only support a defined maximum number of connected nodes. In such a case, the pseudoknot according to the invention is configured to appear in the network as multiple nodes establishing multiple connections to network nodes. These multiple connections reduce and limit the ability of network nodes to accept connections from other network nodes.

In another embodiment of the invention, a dummy node is configured to connect to multiple network nodes. This method is particularly useful with extremely large networks containing a large number of nodes. In addition, multiple pseudoknotes can be configured to connect to other network nodes in order to increase the ability to receive search requests for selected criteria. These multiple pseudoknotes may be located at a physical location or at many different physical locations to increase the chance of receiving a search according to the preselected criteria.

In the case of multiple dummy nodes, it is advantageous to configure such dummy nodes to share a common list of connected network nodes such that each pseudo node is configured to control connections that are not running to the same network nodes. Alternatively, or in conjunction with, the multiple pseudoknotes may also be configured to capture, store, and control the IP and network addresses of the network nodes for the multiple network nodes.

In another embodiment, one or a plurality of dummy nodes compares searches for the preselected criterion and forwards the address of a network node that started the search to a second dummy node. The second dummy node is configured to send information to the network node that started the search. The information sent may be incorrect or ineffective in the case of searches for unauthorized material. In each case, the first pseudo node removes the search from the network so that other network nodes do not respond.

In all of these embodiments, the dummy node is configured to include one or more of the features listed below. These features are used in the methods of monitoring peer-to-peer networks to provide improved search and response capabilities as compared to the network nodes in the particular network being addressed. Therefore, not all of the capabilities in each dummy node need to be programmed to monitor and respond to the network. The currently preferred configurations include:

The dummy node is configured to connect to a large number of network nodes. Typical network nodes in peer-to-peer networks support 1 to 10 connections, the pseudo node according to the invention can support thousands.

The dummy node is configured to change its peer-to-peer network reported IP address.

The dummy node is configured to change its IP address at selected event entries.

The dummy node is configured to change its client ID at selected event entries.

The dummy node is configured to change its GUID on selected event entries.

The dummy node is configured to generate multiple search responses containing random file names and file sizes from random network nodes.

The dummy node is configured to generate search requests containing the same file with different file sizes so as to reduce the ability of network nodes to sort them for the user.

The dummy node is configured to embody multiple network nodes.

Other advantages of the present invention will become apparent upon reading the following detailed description of the presently preferred embodiments of the invention together with the accompanying drawings. 7 AT 010 551 U1

BRIEF DESCRIPTION OF THE DRAWINGS

Fig. 1 is a simplified schematic illustration of a two-node peer-to-peer network;

Fig. 2 is a simplified schematic illustration of a peer-to-peer proxy network;

Fig. 3 is a simplified schematic view of a peer-to-peer network with loops without a proxy;

Fig. 4 is a simplified schematic illustration of a peer-to-peer leaf / master node network;

FIGS. Figures 5 and 6 are schematic representations of a network in which node B is a dummy node used in the presently described method of the invention just described to ward off search requests.

Fig. 7 is a simplified schematic illustration for use in explaining the location of a true IP address of a node.

FIG. 8 is a simplified schematic diagram for use in explaining how to locate all files sharing (or sharing) or downloading a node.

9 is a flowchart illustration of programming or configuring a pseudo-node to perform certain preferred aspects of the present invention; and

Fig. 10 is a simplified schematic for use in explanation in the message saturation described below.

DESCRIPTION OF THE PRESENTLY PREFERRED EMBODIMENTS

Referring to Figs. 1 to 4, the preferred methods according to the invention advantageously use at least one pseudo node. The pseudoknot may have the appearance of any one of FIGS. 1-4, or be such a node, and has certain preferred features. These features are configured for the particular type of peer-to-peer search request and response monitoring desired by the end user. When monitoring peer-to-peer networks after searching and transferring files authorized by the respective owners, the pseudo node is advantageously configured to change its reported peer-to-peer network IP address , It is also preferably configured to change its IP address on selected event entries and to change its client ID. For certain tasks, it is preferably configured to change its GUID for selected event entries.

In a preferred embodiment of the present invention, a pseudoknot comprises both a hardware system, such as a computer, a so-called "thin-appliance", an ASIC-based device, or other similar device that has particular logic or program code. ie, a software) can be programmed. In the preferred embodiments, the device preferably has the ability to connect to a physical network, either directly or through the use of an interface or gateway. The programming logic equips the device with the ability to transmit and receive on both physical and peer-to-peer networks, which typically rely on a physical network. In the preferred embodiment of the invention, the programming logic is a software program, but it may also be hardware-encoded, non-variable operation information typically found in an ASIC-based device.

Now, referring generally to FIG. 9, a flow chart discloses a method for the programming logic that configures a device that acts as a dummy node to interface with a peer-to-peer network. This dummy node accepts search requests and responses from nodes participating in the network. These nodes may begin search requests or responses, or may forward a search or response as part of their participation in the network.

The programming logic is configured to receive search requests and responses and compare them to a list of points entered into the user by the user and then to perform a certain event depending on whether a match was found or not. The programming logic can do this by dropping the search request or response and not passing it to other nodes. This procedure may be performed automatically depending on trigger points such as a load, or it may be configured by the user of the programming logic to expire.

The method of comparison may include intermediate strings, full strings, substrings, a fuzzy logic, patricia tree, or any other method that could be used to compare the similarity of two or more strings or parts of two or more strings. String comparison may be performed in parallel with other searches to increase throughput, or they may be compared serially (i.e., one at a time). If a match is found, the programming logic may build a response to the search request, if programmed. This search response contains the IP address of the pseudo node and the peer-to-peer client ID of the programming logic. Because peer-to-peer networks use path forwarding as opposed to address routing, and because the client addresses are not controlled by a central authority, but instead are randomly selected, the response can be constructed to hold any IP address and any client ID address that selects the programming logic, whether it exists or not.

There are no requirements as to which files or file sizes are reported in the response. Therefore, the programming logic may be configured to return random file names or file sizes or certain file names and file sizes. The programming logic may also be configured to send the same search request to the network and to respond to the original viewfinder with the file names and file sizes returned to it. The program logic may also be configured to merely forward to the original search request, and when responses are received, it will replace the IP address and client address with random values and forward them back to the original viewfinder. The program logic may be configured to send many search responses, each with a different IP address and client ID, to make it look like several nodes have the information.

Peer-to-peer networks use path routing (instead of address routing). In the path brokerage, each search request is marked with a unique ID, which is generated when the search request is generated. When the search request is passed from one node to the next, each node records the path through which the search request was received. From this point, if a node receives a search request with the same message ID via another path, the search request is dropped. It does this to avoid duplicate search requests caused by loops in the network. Using this path switching approach allows search responses to go back the same path that the search request took. The programming logic may be configured to accept a search request from a node and to pass the search request on to other nodes. If these other nodes respond with response messages, the programming logic may be configured to drop the answers. This prevents the original node that started the search from getting results in two ways. First, because the pseudo-node has dropped the answer, the searching node does not receive these responses. Second, if they received the message from other paths because they had already seen the message ID, other nodes would not respond to the original node looking for the message and would drop the search request as a duplicate. The dummy node may also be configured to accept a search request from a node and replace the search string with a random set of numbers and letters, but maintain the same message ID. He would then forward the message to other nodes. This prevents the original node that started the search from receiving results because no matches have occurred to generate the responses. Further, no node that receives the search request with the correct search term will respond because they have already seen the same message ID and would drop that message as a duplicate.

The programming logic may also be configured to search for particular search terms and respond to a file containing information that informs the user that he infringes copyrights. This information may be a visual or audio message, such as a recording in an audio file or a message in a document file. The filename may also be a message, for example " warning_you_ hurt_ copyright.txt ".

Nodes on peer-to-peer networks may be asked to send a file to other nodes. This will be " push " called the file and is commonly used when nodes are behind firewalls. As described below, the present invention uses this feature of peer-to-peer networks to find out an identity of a node. Therefore, if a node is behind a firewall, no connections can be made to it; therefore, if he shares files for sharing, no nodes will be able to retrieve them. " pushing " Solves this problem by asking the node behind the firewall to establish an outbound connection, which is usually unprotected. Each client can start a push request. The only information needed is the client ID of the node that will push the file and the file index number of the file being requested. The push request contains both this information and the TCP / IP address and port (or port) of the node requesting the push. When a node receives a push request, it compares the client ID in the message with its own. If it matches, it then checks to see if it has the referenced file index number. If it exists, the node attempts to connect to the requesting node via the TCP / IP using the IP address in the request. Once connected, the node sends a header containing its client ID, file index number, and file name. The requesting node will then continue to upload the file to itself.

The programming logic may be configured to use this " push " method to obtain the IP address of most nodes. The programming logic would be programmed with the other node client IDs and a file index number. The programming logic would then issue the push request on the network. The node in the push request would receive the message and try to push that file to the dummy node. The actual IP address of the node will be revealed as soon as an out-of-band connection is made over the TCP / IP between the node and the program logic. The node will then send its client ID, file index number, and file name. The programming logic will store this information and disconnect before the file is transferred. At this point, the programming logic has a list of correct correlation between IP address client ID.

This method can also be used to retrieve a list of files on a node. In peer-to-peer networks, files are found only through a keyword search. There is no way to search a specific node for a list of 10 AT 010 551 U1

To ask files. Using the above method, the programming logic would use the client ID of a node and a file number " 1 " be configured. It would output the request to the node and, if the node connects to the dummy node and sends the header information, will store the file name and client ID in a table. It will then drop the connection before the file is transferred. The programming logic will then set the file index number to " 2 " increase and repeat the process. It will then record the information for file index 2. The program logic will continue to increment the file index number and repeat the process until the node no longer responds.

It is well known that certain ranges of IP addresses typically cover certain geographic areas, such as a city or a village. Authorities can use this file list feature along with IP ranges of known terrorist states to check for and search for terrorist activity by looking up what files are available on these nodes, downloading them and verifying them. Companies can also use this feature to search for copyrighted information on a particular computer. Companies may also use the collected information for statistical purposes or to build user profiles based on what they have downloaded or shared.

The programming logic can be configured to track searches as well as searches that have met a particular criterion. The programming logic can be configured to accept numbers that are matched against these statistics to calculate dollar amounts, such as business losses. For example, the programming logic may be configured to use the search term " MP3 " to track and tag him with " 15 " and multiply that number to the user as a loss of business. These numbers can also be recorded for "before / after" comparisons.

The programming logic may be configured to look for searches using particular expressions and therefore may be used to determine if any user of the network is searching for them and if anyone is answering. This would be useful for a software company to find out if their software is being copied in black, how often and by whom.

The programming logic has the ability to store client IDs and IP addresses by looking up search queries and extracting the client IDs. With the client ID, it can then build a push packet that is used to discover the IP address of the node, and that information can be stored in a file. This information can be used to generate statistics about the growth and size of the network. It should be noted that in many of the monitoring applications of the invention it is not necessary to have a list of preselected data objects to search for. It is possible to monitor all search requests and record them for reporting or statistical functions.

The programming logic can be configured to record both search requests and their responses. This information can be written to a file that can later be used in court or for other purposes that need to be documented.

The programming logic may be configured to store property information received from a node. For example, the programming logic may request a search for " MP3 " and then record information such as the IP addresses or client IDs of those nodes that respond. 11 AT 010 551 U1

In one embodiment of the invention, it is desirable to convert pseudo IP addresses of the peer-to-peer nodes to proper ones. Peer-to-peer networks are often session-based networks that rely on the Internet. Nodes in peer-to-peer networks have network numbers that are not controlled by any authorized entity, and therefore unauthorized recipients of information and files are difficult to locate. (The Internet is made up of nodes, each with a specific address, which is managed by the ARIN (American Registry for Internet Numbers) Authority, making it relatively easy to figure out who is for a particular computer responsible on the internet). While nodes in the peer-to-peer network have true network IP addresses so that they can communicate with their direct neighbors, they do not need to transmit their valid IP addresses in their peer-to-peer network messages.

Referring generally to Figs. 5 and 6, peer-to-peer networks use a message ID / path switch so that they do not need to transmit valid IP addresses to function. Each message sent over a peer-to-peer network has a unique message ID associated with it. This message ID is a unique 16-byte number and is generated when each new message is generated. When peer-to-peer nodes receive messages, they record over what IP port (or port) they were received, along with the message ID, so that if there is an answer, they know will be how to send it back.

If using the network shown in Figure 6, node A attempts to retrieve the " Yellowstone.txt " retrieves a search request with a message ID of " abcdefg " with the search term " Yellowstone.txt " and forwards the request to Node B. Node B records that it has a message with an ID, for example, " abcdefg " via port 1, has received. Node B then forwards the search request to nodes C, D, and E. Node C records that it has a message with an ID of " abcdefg " via port 3 has received. Node D records that it has a message with an ID of " abcdefg " via port 2 has received. Node E records that it has a message with an ID of " abcdefg " via port 4 has received. Node C forwards the search request to node F. Node F records that it has received a message with an ID of " abcdefg " received via port 5. All nodes look through their local files, and only node F finds a match. Node F becomes the message ID " abcdefg " Look up in his tables and see that he has received them via Terminal 5. He will generate a response message that includes his IP addresses, a file index, and his peer-to-peer network address. He will then send an answer via port 5. Node C will receive the response message and in its tables look for the message ID " abcdefg " search and see that it was received via Terminal 3. He will then forward the answer via port 3. Node B will receive the response message and look in its tables for message ID " abcdefg " search and see that it was received via port 1. He will then send a response via port 1, but not via ports 2 and 4. Node A will receive the response and in his tables look for the message ID " abcdefg " search and find out that he has started the search and will then process the package.

As is well known, peer-to-peer network nodes allow a user to enter any IP address that they themselves are to identify. This IP address is embedded in the response message along with a peer-to-peer client ID, which is a unique 16-digit number. This client ID is generated randomly, but the node does not change it until it is restarted. The IP address embedded in the response is used by the searching node to contact the node with the file out of band (outside the network). On peer-to-peer networks, search and control communication occurs on the peer-to-peer network, but data transfers occur at the level of the Internet or an actual network. Without a correct IP address, the node looking for the file would not be able to retrieve the file. Many nodes in the 12 AT 010 551 U1

Peer-to-peer network randomly create their IP address to prevent disclosure of their identity. Without knowing the true IP address of a node, no one searching for the node would be able to discover its true identity. It is therefore advantageous if a pseudo IP address can be converted to a true IP address. 5

The present invention provides a method to find the true IP address of the node by using the method that peer-to-peer networks use to bypass firewalls. In a peer-to-peer network, if the requesting node can not contact the node having the file, the requesting node may issue a " push " request to the node having the file. This is done by sending a specialized message to the client ID embedded in the original search response message. This push request causes the node containing the file to contact the requesting node and upload the file. Once the node containing the file is connected to the requesting client, its true IP address is disclosed and can be retained.

Referring to Fig. 7, node A is a dummy node which requests a search to node B with a message ID " 123456 " after the file " Madonna.mp3 " outputs. Node B records that it received a search request with a message ID " 123456 " via port 20 1 has received. He searches his file list and finds " Madonna.mp3 ". He sends one

Search response message to node A, which specifies the file name, the file index, its pseudo IP address " 192.168.0.1 " and its client ID " ABCDEF " contains. Node A receives the search response and records the client ID of node β in a table. He then generates a push request for the client ID " ABCDEF " for the file index that was returned. He sends this push request to Node B. Node B receives the response and finds out that it is a push request for itself. Node B connects to node A out of band over the transport network (i.e., the Internet). Node A accepts the connection. Once connected, Node A now has the true IP address of Node B because Node B, in order to communicate out-of-band with Node A, must disclose Node B its true IP address 30. Node B then sends a message indicating its client ID, filename, and file index of " Madonna.mp3 " contains. Node A looks in his tables for the client ID, finds that he has sent a push request, and records the true IP address. He then breaks the connection without receiving the file. Node A now has the IP address and client ID of Node B. 35

It is important to be able to identify all files shared by a network node in a peer-to-peer network. Currently, in peer-to-peer networks, the only way to locate files is by keyword search, and therefore one can not see all available files unless the viewfinder knows which 40 files a node is sharing. If a node on the network shares unauthorized files for sharing, such as a copyrighted movie or song, it is desirable to look for any other unauthorized files that the node might share with others. This invention provides a method of viewing all the files that a particular shared node 45 releases by generating multiple " push requests " and recording their answers.

The " push request " was functionally incorporated into peer-to-peer networks to reach nodes that are behind a firewall. In a peer-to-peer network, nodes look for files using the peer-to-peer network, but load those files from other nodes by directly connecting to them and requesting the file. If the node containing the file is behind a firewall, it will not be able to connect to it. To get around this problem, peer-to-peer network engineers have found a way to send a specialized packet through the peer-to-peer peer network to the peer-to-peer node behind the firewall 13 AT 010 551 U1 may be requested by asking the file to the requesting node " pushed " (Uploads). Because the node behind the firewall is allowed to establish outbound connections through its firewall, it can successfully transfer the file to the requesting node as long as the requesting node is not itself behind a firewall.

The " push request " contains four key fields. The first is the peer-to-peer client ID of the node holding the file. The second is a file index number. The file index number is a numeric representation of the other shared file. When a node boots the first time, it indexes its files, which are available starting with 1. For example:

File 1 .txt file index 1

File 2.txt file index 2

File 3.txt file index 3

File 4.txt File Index 4

The third field is the IP address of the requesting node. The fourth field is the TCP / IP port number of the requesting node.

Once the requesting node establishes the push request, it sends it to the network. Each of the nodes on the network looks at the message and if the client ID is its own, it will process it (see Figure 8). If a node finds that it is prompted to push a file and if the file index exists on the node, it will try to tie down to the requesting node. Once connected, it will transmit a header containing its client ID as well as the file index and name of the file. He will then try to send the file. Because the node sends the file name in the header, there is a method of locating all files that the node shares for sharing by issuing multiple push requests requesting different file indexes. Preferably, the push request for a file index " 1 " begin and incrementally (i.e., " 2 ", " 3 ", " 4 ") continue working and stop if the other node no longer responds with file names.

In Fig. 8, node A is a dummy node which wishes to retrieve a list of all files which node B shares for sharing. Node A establishes a push request which includes its IP address, TCP / IP port, Node B client ID (ABCDEF), and file index " 1 " contains. Node A then sends this request to Node B. Node B detects that the client ID is its own so that it processes the request. He sees the file ID " 1 " and find out that she " Madonna1.mp3 " is. He tries to contact node A out of bounds through the IP address and port included in the push request. Node B connects to Node A and sends a header that has its client ID, file index " 1 " and the filename " Madonna1.mp3 " contains. Node A then disconnects before Node B can transfer the file. Node A then repeats the same steps, except this time for a push request with a file index " 2 " sends to node B. Node B receives the push request and recognizes that it is for itself, so that it processes the request. He finds out that the file index " 2 " for " sting1.mp3 " stands. Node B connects out of bounds to Node A through the IP address and port included in the push request. He then sends a header which has his client ID, file index " 2 " and the file name " sting1.mp3 " contains. This process is run through again and again, and each time node A increments the file index number. As soon as node B stops responding to node A, node A will recognize that node B has not shared any other files for shared use. 14 AT 010 551 U1

EXAMPLES

The following examples illustrate various embodiments of the methods of the invention. For Examples 1-6, reference is made to FIG.

example 1

This example illustrates a method for responding to a request in a peer-to-peer network. Referring to Figure 1, node B acts as a dummy node and is configured to respond to each node that makes a search request for a file named " X " outputs.

If Node A makes a search request on the network for a file named " X " Node B will detect this search and compare the search string of Node A with its configured list of strings. Because node A looks for a file named " X " and Node B is configured to search for a file named " X " To answer, Node B will return a response to Node A asking for the file named " X " even if it is not really the case. If node A attempts to retrieve the file from node B, an error condition will result because the file does not exist at node B. This limits data transmission and retrieval in two ways. First, because other nodes may have responded to node A, the node will have to search all the results to select the correct file to retrieve. This increases the time it takes to successfully retrieve the file. Second, if node A attempts to retrieve the file from node B, because of the lack of the file, time and resources are consumed by node A. This causes confusion and frustration at node A due to recurring failures.

Example 2

This example illustrates a method for responding to a request with data that differs from the requested one. In this case, Node B acts as a dummy node and is configured to respond to each node that makes a search request for a file named " X " outputs.

When nodes submit a search request on the network for a file named " X " Node B will detect this search and compare the search string of Node A with its configured list of strings. Because node A looks for a file named " X " and Node B is configured to search for a file named " X " To answer, Node B will return a response to Node A asking for the file named " X " has. If node A tries to retrieve the file from node B, node B will send a file that is different from the one that is expected. This file can be any file and its purpose is to make node A believe that it has the true file " X " downloads. This limits data transmission and retrieval in two ways. First, because other nodes may have responded to node A, node A will have to search all the results to select the correct file to retrieve. This increases the time it takes to successfully retrieve the file. Second, if node A attempts to retrieve the file from node B, the time and resources of node A are consumed because the file is not the correct one. This creates confusion and frustration at node A due to recurring failures.

Example 3

This example illustrates the embodiment of a network node through a dummy node. Therefore, node B acts as a dummy node and is configured to respond to each node that requests a search for a file named " X " outputs. If Node 15 AT 010 551 U1 A searches for a file on the network for a file named " X " Node B will detect this search and compare the search string of Node A with its configured list of strings. Because node A looks for a file named " X " and Node B is configured to search for a file named " X " In response, node B will send a response to node A that node C will see the file named " X " while in reality node C does not exist in the network. If node A attempts to retrieve the file from node C, an error condition will result because node C does not exist. This limits data transmission and retrieval in two ways. First, because other nodes may have responded to it, node A will have to search all the results to select the correct file to retrieve. This increases the time it takes to successfully retrieve the file. Second, if node A attempts to retrieve the file from node C because node C does not exist, time and resources are consumed by node A. This causes confusion and frustration at node A due to recurring failures.

Example 4

In this example, a dummy node acts as a multiple network node to make information look as if it is available from multiple network nodes. In this case, node B acts as a dummy node and is configured to respond to each node that makes a search request for a file named " X " outputs.

If Node A makes a search request on the network for a file named " X " Node B will detect this search and compare the search string of Node A with its configured list of strings. Because node A looks for a file named " X " and Node B is configured to search for a file named " X " In response, Node B will return multiple responses to Node A that several nodes will return the file named " X " while in reality these nodes do not exist in the network. If node A attempts to retrieve the file from any of these nonexistent nodes, it will result in an error condition because these nodes do not exist. This limits data transmission and retrieval in two ways. First, because other nodes may have responded to it, node A will have to search all the results to select the correct file to retrieve. This increases the time it takes to successfully retrieve the file. Second, if node A attempts to retrieve the file from non-existent nodes, node A's time and resources are consumed because the nodes do not exist. This confuses Node A and generates frustration due to recurring failures.

Example 5

This example illustrates a method of responding with a list of random file names or sizes from at least one network node. In this case, Node B acts as a dummy node and is configured to respond to each node that makes a search request for a file named " X " outputs.

If Node A makes a search request on the network for a file named " X " Node B will detect this search and compare the search string of Node A with its configured list of strings. Because node A looks for a file named " X " and Node B is configured to search for a file named " X " In response, node B will return responses to node A indicating that either a single node or multiple nodes have variations of the file named " X " have. For example, if the file " hopkins.txt " With a file size of 1,000 bytes, node B will send replies that node C has a file named " hopki.txt " having a file size of 1,000 bytes, although node C does not exist in the network. He could also add variations in file size, such as changing the 1,000 bytes to a random number, such as 2,002. These random file names and file sizes can be generated at random, or Node B can be configured with a list of names and sizes, with which it responds. For example, node B can be configured to work with " hopki.txt " always answer when searching for " hopkins.txt " is requested. If node A attempts to retrieve the file from one of these nonexistent nodes, an error condition will result because these nodes do not exist. This limits data transmission and retrieval in two ways. First, because other nodes may have responded to it, node A will have to search all the results to select the correct file to retrieve. This increases the time it takes to successfully retrieve the file. Second, if node A attempts to retrieve the file from non-existent nodes, node A's time and resources are consumed because the nodes do not exist. This causes confusion and frustration at node A due to recurring failures.

Example 6

This example illustrates a response from a dummy node that fills the requesting node display windows with irrelevant data. In this case, Node B acts as a dummy node and is configured to respond to each node that makes a search request for a file named " X " outputs.

If Node A makes a search request on the network for a file named " X " Node B will detect this search and compare the search string of Node A with its configured list of strings. Because node A looks for a file named " X " and Node B is configured to search for a file named " X " Node B will return enough responses to fill the Node A display window. These responses will contain information that multiple nodes have the file named " X " while in reality these nodes do not exist in the network. If node A attempts to retrieve the file from any of these nonexistent nodes, an error condition is generated because those nodes do not exist. This limits data transmission and retrieval in three ways. First, because other nodes may have responded to it, node A will have to search all the results to select the correct file to retrieve. This increases the time it takes to successfully retrieve the file. Second, if node A attempts to retrieve the file from non-existent nodes, node A's time and resources are consumed because the nodes do not exist. This causes confusion and frustration at node A due to repetitive failures. Third, because the display window of node A will be populated with invalid information, information from valid nodes will not be displayed.

Example 7

Referring to Figure 2, this example illustrates an embodiment for reducing or eliminating searches on a peer-to-peer network. In this case, node B acts as a dummy node and as a proxy. Node B is configured to complete any search requests for the " X " to drop. This effectively removes searches for " X " from the network and prevents other nodes from responding with valid results.

If Node A makes a search request on the network for a file named " X " Node B will detect this search and compare the search string of Node A with its configured list of strings. Because node A looks for a file named " X " and Node B is configured to search for a file named " X " Node X will drop the search request and not forward to node C. Node A will assume that because it does not get any search returns, its search did not match any file on the network.

Example 8

Referring to Fig. 6, this example illustrates another embodiment of the 17 AT 010 551 U1

Prevent unauthorized downloading of files over a peer-to-peer network. In this example, a method is applied to a low bandwidth network. Example 9 describes a method for higher bandwidth networks.

In peer-to-peer networks, each sent search request has a unique message ID associated with it. No other request will have the same message ID. When a node receives a search request, it will record both the connection the search request came in and the message ID. If the node should receive the same message ID over another connection, it will not respond or forward it, but will drop it instead. The node does this because in peer-to-peer networks it is possible to loop around the network as described in FIG. If the node responded to both messages, it would essentially reply in duplicate, wasting bandwidth on the network. If a node receiving the request owns matching files, it will return the results over the connection that received the message first.

A method for reducing search results may be used, wherein a pseudo node according to the invention accepts the search packet from a node, removes the search term from the packet and replaces it with a random letter sequence while maintaining the same message ID. This modified package will then be sent over the network. When network nodes receive the search request, they will record the message ID and drop any future messages received with the same message ID. Because the search term in the search request was replaced with a random letter string, it should not match any files on other network nodes. As a result, these other nodes will not respond to the message ID of the true search term if they receive it over other routes.

Using the above method and referring to Figure 6, each node in the network has the file named "X" other than node A. available. In this network, node B is a dummy node and is configured to use the saturator just described if it looks for a search for the file named " X " meets.

In this example, node A searches for a file named " X " by issuing a request to its associated network nodes (nodes B and C). This search request has a message ID " abcd " on. Node C records that it made a search request over connection 2 with a message ID " abcd " has received. Because Node B is configured to search for file " X " because node A has a request for file " X " Node B records that he has received a message with an ID of " abcd " via connection 3, it will remove the search term from the message and replace it with a random string of letters and then send the request to node D. Node D records that it is searching with an ID of " abcd " via connection 1 and forwards the search to nodes E, F and C. Because node C already has a search request with an ID " abcd " he drops the request. Node E records that it is searching with an ID " abcd " via connection 5. Node F records that it is doing a search with an ID " abcd " received via connection 6. Node C forwards the search request with an ID of " abcd " at node D on. Because node D already has a message ID " abcd " over connection 1, it drops the search request from node C. Nodes C, D, E and F process the search. Nodes D, E and F find that they do not have matching files and therefore do not respond. Node C finds out that he has a file named " X " contains, so that he the message response after " abcd " via connection 2 sends. Node A receives a response from node C to connection 2. Although the file exists at three other locations, node A will only receive one response.

In another example of an embodiment of this method, each node in the AT 010 551 U1

In Fig. 10, except node A, the file named " Yellowstone.txt " is available. In this network, Node B is the pseudo node and is configured to use the low bandwidth saturation device above to search for the file named " Yellowstone.txt " to answer.

For example, suppose node A returns a search request for the file named " Yellowstone.txt " by sending a request with the expression " Yellowstone.txt " with a message ID " abcd " at node B and node C out. When node C receives the search request, it records the message ID. However, when Node B receives the search request, it finds that it matches " Yellowstone.txt " which is a stored object and which has been configured to be searched. Node B then replaces the yellowstone.txf search term with " abcdefghijklmnopqrstuvwxyz " and keeps the message ID " abcd " at. Node B will then forward this message to node D. Node D records this message ID and forwards the message to nodes E, F, and C. Nodes E and F record this message ID. Because node C already has a search request with a message ID " abcd " received, it drops the search request from node D. Nodes D, E, and F search for files which are " abcdefghijklmnopqrstuvwxyz " contain. On the other hand, node C searches for files that have the expression " Yellowstone.txt " contain. Nodes D, E and F will not find any matching files and will not respond. Node C will find out that a file matches and will respond. The end result is that in this example, the file existed in four places, but node A receives only one answer for the file from a location.

Example 9

This example illustrates a preferred embodiment of the currently considered saturator applied to high bandwidth networks. In a preferred method, if a pseudo-node receives a search request that meets its criteria, it will forward that search request to all other nodes to which it is connected. These nodes, in turn, will forward the request to all other network nodes to which they are connected, and so on. If any matches are found at any node, they will be sent back through links which eventually lead to the pseudo node. Under normal operating conditions of a peer-to-peer network, the pseudo-node should forward the search results through it and to the node that started the request. In this method according to the invention, the search is received by the dummy node and sent to the other nodes as usual. However, as soon as the response returns to the pseudo node, the pseudo node will drop the results.

This method saturates the network and reduces the total number of nodes responding to the requesting entity.

In particular, and with reference to FIG. 10, if node A becomes the file " X " by submitting a request for it to its associated nodes (Node B and Node C), its search request has a message ID, for example, "abcd". Because Node B acts as a dummy node and is configured to search for file " X " Look out and because node A sends him a request for file " X " Node B records that he has received a message with an ID of " abcd " on connection 3, and sends the request to node D. Node D records that it is performing a search with an ID of " abcd " via connection 1 and then forwards the search to nodes E and F. Node E records that it is searching with an ID " abcd " received via compound 5. Node F records that it is doing a search with an ID " abcd " received via connection 6. Node C records that it is searching with ID " abcd " via connection 2 and sends the search on to node D. Because node D already has a message ID " abcd " via connection 1, it drops the search request from node C 19 AT 010 551 U1. Nodes C, D, E and F process the search. All nodes find out they own the file and provide search replies for the message ID " abcd " out. Node F fails the message ID " abcd " and finds out that it has been received over connection 6 so that it has the message response for " abcd " sends out to this connection. Node E fails the message ID " abcd " and finds out that it has been received over connection 5 so that it has the message response for " abcd " sends out to this connection. Node D receives replies from nodes E and F and also has its own response for message ID " abcd ". Node D fails the message ID " abcd " and finds out that it was received over connection 1 and forwards its response and the replies from nodes E and F via this connection. Node B receives the response from node D and drops the response. Node B receives the response from node E and drops the response. Node B receives the response from node F and drops the response. Node C fails the message ID " abcd " and finds out that she has been received over connection 2 so that he has his message response regarding " abcd " via this connection. Node A receives a response from node C to connection 2. The net result is that in this example, the file existed in four places, but node A receives only one response for the file from a location.

Example 10

This example shows a preferred embodiment of the " scrub " (Deleting data from temporary storage). In a preferred method, if a pseudo-node receives a search request that matches its criteria, it will forward that search request to all other nodes to which it is connected. These nodes, in turn, will forward the request to all the other network nodes to which they are connected, and so on. If any matches are found at any node, it will respond back through links that eventually lead to the dummy node. Under normal operating conditions of a peer-to-peer network, the dummy node should pass the search results through itself and to the node that started the request. In this method according to the invention, the search is received by the dummy node and sent to the other nodes as usual. However, once the response returns to the dummy node, the pseudo node will change the IP address and / or the client ID address of the response and then forward the modified response message to the sender of the search. These may either be completely random addresses or they may be addresses set on the dummy node. The end result is that the node that started the search gets valid file names and file sizes, but will be the locations of nodes that do not exist.

This method saturates the network and reduces the total number of nodes responding to the requesting entity. Moreover, this allows the pseudo node to respond back with file names and file sizes that the requesting entity would find at any other typical node, making it look valid. Filenames and file sizes are changing in peer-to-peer networks for a variety of reasons. Using this method allows the pseudo node to always respond with the just accepted file names and file sizes for the files in question.

In particular, and referring to Fig. 10, if node A searches for the file " X " by issuing a request thereafter to its associated nodes (Node B and Node C), have a message ID, such as " abcd ". Because Node B is configured to look for searches for File X, and because Node A requests it to file " X " Node B records that he has received a message with an ID of " abcd " on connection 3 and sends the request to node D. Node D records that it has a search with an ID of " abcd " via connection 1 and forwards the search to nodes E and F. Node E records that it is searching with an ID " abcd " via connection 5. Node F records a search with an ID " abcd " received via connection 6. Node C records that it is searching with ID " abcd " via connection 2 and forwards the search to node D. Because node D already has a message ID " abcd " over connection 1, it drops the search request from node C. Nodes C, D, E and F process the search. All nodes find out they own the file and provide search replies for the message ID " abcd " out. Node F fails the message ID " abcd " and finds out that it has been received over connection 6 so that it has the message response for " abcd " but this connection sends out. Node E fails the message ID " abcd " and finds out that it has been received over connection 5 so that it has the message response for " abcd " via this connection. Node D receives replies from nodes E and F and also has its own response to message ID " abcd ". Node D fails the message ID " abcd " and finds out that it was received over connection 1, and forwards its response and the replies of nodes E and D via this connection. Node B receives the response from node D and replaces the IP address with a random value and replaces the client ID value with " G ". Node B receives the response from node E and replaces the IP address with a random value and replaces the client ID value with " H ". Node B receives the response from node F and replaces the IP address with a random value and replaces the client ID value with Y. Node B then fails the message ID " abcd " and finds out that it was received over connection 3 so that it sends the message responses over that connection. Node C fails the message ID " abcd " and finds out that she has been received over connection 2 so that he has his message response for " abcd " sends over this connection. Node A receives responses from D, E and F on connection 3 and a response from node C on connection 2. Node A receives four files named " X " presented, which are available at the following storage locations:

Node G

Node H

Node I

Node C

Because nodes G, H and I do not exist, the user wastes resources trying to retrieve the files.

Example 11

This example illustrates an embodiment for promoting users of peer-to-peer networks. In this example, a user searches for " Madonna " and the dummy node outputs an advertisement to the user in response. In this case, node B acts as a dummy node and is configured to respond to each node that makes a search request for " Madonna " outputs. The answer Node B is configured to send out is "Buy Madonna's CD on its website".

If Node A makes a search request on the network for " Madonna " Node B will detect this search and compare the search string of Node A with its configured list of strings. Because node A searches for " Madonna " and Node B is configured to search for " Madonna " to answer, Node B will use the advertisement " Buy Madonna's CD on their website " reply.

Example 12

This example illustrates another embodiment for advertising users of 21 AT 010 551 U1

Peer-to-peer networks. In this example, a dummy node is configured to advertise users who issue searches, regardless of the search term. In this case, node B acts as a dummy node and is configured to respond to each node issuing a search request. The answer which node B is configured to send is called " Buy Madonna's CD on their website ".

If Node A issues a search request on the network, Node B will detect this search. Because node A searches and node B is configured to respond to searches, node B is labeled " Buy Madonna's CD on its website " reply.

Example 13

This example illustrates another embodiment for promoting users of peer-to-peer networks. In this example, a dummy node is configured to advertise users who issue search requests, regardless of the search term. In this case, node B acts as a dummy node and is configured to respond to each node issuing a search request. The answer which node B is configured to send is the original search term combined with a message.

In this example, Node B is configured as a pseudo node, the message " Buy Madonna's CD on its Web site " add to the original search term and send this response back to the searching node.

Node A returns a search request on the network after the song " Holiday " from Madonna. Node B will detect this search. Because Node A searches and Node B is configured to respond to searches, Node B will post his original search message and use the advertisement "Holiday - Buy Madonna's CD on his website". reply.

Example 14

This example illustrates a method for identifying terrorists and terrorist activities on a peer-to-peer network. In this case, node B acts as a dummy node and is configured to locate terrorists by issuing terrorism-related searches and recording any responses.

Node B gives a search for " disintegrant " out. Node A has 15 files that match and replies with the 15 files. Node B records these results along with the IP address of Node A.

Node B gives a search for " bomb " out. Node A has 12 files that match, and responds with the 12 files. Node C has 6 files and answers with the 6 files. Node B records these results along with the IP address of Node A and Node C.

Node B gives a search for " jihad " out. Node A has 7 files that match and replies with the 7 files. Node C has 2 files and answers with the 2 files. Node D has 9 files and responds with 9 files. Node B records these results along with the IP address of Node A, Node C and Node D.

Node B gives a search for " Egypt " out. Node A has four files that match and responds with the 4 files. Node E has 2 files and responds with the 2 files. Node F has 9 files and responds with the 9 files. Node B records these results along with the IP address of Node A, Node E, and Node F.

The results are compared, and node A and node C are considered terrorist

Claims (43)

22 AT 010 551 U1 Nature identified. In addition, since Node A owns Egypt files, there is a higher likelihood that Egypt is the center of terrorist activity for Node A. While presently preferred embodiments of the invention have been particularly described, the invention may be practiced otherwise in the scope of the appended claims. Claims 1. A method of monitoring search requests for selected objects by means of a node on a peer-to-peer network, the network having at least two nodes, and providing a response to substantially all such requesting nodes, the method being as follows Steps includes: a. Inserting at least one pseudo-node into the network, wherein the pseudo node is configured to provide at least one IP address and optionally at least one client ID, and comprises at least one stored object corresponding to a queried object stored at the dummy node; b. Monitoring the network by at least one of the dummy nodes to detect requests that match the at least one of the stored objects; c. Determining a unique ID generated by each network node requesting the object matching the stored object; and d. Responses to essentially every node that represents an ID. 2. The method of claim 1, wherein the IP address and / or the client ID is changed upon the occurrence of a predetermined event or predetermined events. The method of claims 1 and 2, wherein the responding comprises transmitting idle data to each of the nodes having a determined ID. The method of claims 1 and 2, wherein the responding comprises communicating data to each of the nodes having a determined ID, wherein the information contained in the response consists of data different from those requested. The method of claims 1 and 2, wherein the responding comprises transmitting data to each of the nodes having a determined ID, such data being a message that notifies the node that they may violate or violate copyright. The method of claims 1 and 2, wherein the reply includes transmitting information to each of the nodes having a determined ID comprising file names that are in a form to notify the node with the determined ID that it is Copyright infringed or could violate. The method of claims 1 and 2, wherein the answering comprises filename information which is the result of a second search emanating from at least one of the dummy nodes. The method of claims 1 and 2, wherein the responding comprises transmitting information to each of the nodes having a determined ID that is the result of forwarding a search request to other nodes and receiving a response. 9. dummy node for use on a peer-to-peer network, with an IP address and optionally at least one client ID, which is changeable upon the occurrence of a preselected event, and with a list which at least one searchable data object, the pseudo node having means for monitoring the network to receive search requests therefrom and to compare each of the received search requests with the list of data objects and to respond to such a request. A method of calculating statistics for search requests and responses for selected objects by means of a node on a peer-to-peer network having at least two nodes, the method comprising the steps of: a. Inserting at least one pseudo-node configured in the network; b. Monitoring the network by at least one of the dummy nodes to capture requests and responses; and c. Use the collected requests and responses to calculate statistics. The method of claim 10, wherein the computed statistics are lost business statistics. The method of claim 10, wherein the computed statistics are requests and responses, or both, that have occurred in the network. The method of claim 10, wherein the computed statistics are used to provide before / after comparisons of network searches, responses, or both. The method of claim 10, wherein the computed statistics are used to provide proof or documentation for other purposes. The method of claim 10, wherein the computed statistics are used to provide statistics on the types of files shared over the network. 16. A method for viewing available files at a particular node on a peer-to-peer network having at least two nodes, comprising the steps of: a. Inserting at least one pseudo-node configured in the network; b. Requesting a particular node to upload a file index number starting at N to the dummy node, where N is an integer; c. Recording the particular file name that has been sent; and d. Incrementing the file index number and repeating the request until the time the particular node no longer responds. The method of claim 16, wherein the method is used at certain nodes suspected of providing terrorist information or information that is detrimental to national security. The method of claim 16, wherein the method is used to locate copyrighted or illegal information. The method of claim 16, wherein the method is used to build user profiles and what they have downloaded. 20. The method of claim 16, wherein the method is used for advertising purposes. A method of obtaining an IP address to identify a node on a peer-to-peer network having at least two nodes, the method comprising the following steps: a. Inserting at least one pseudo-node configured in the network; b. Requesting that the particular node upload a file index number to the dummy node beginning at N, where N is an integer; and c. Record an IP address of a node that is in communication with the dummy node. 22. A method of obtaining property information from nodes on a peer-to-peer network having at least two nodes, the method comprising the steps of: a. Inserting at least one pseudo-node configured in the network; b. Sending at least one search request containing specific or generic expressions or by forwarding to real requests from other nodes of the pseudo node; and c. Record the requested property information of those nodes that respond. The method of claim 22, wherein the property information is an IP address. 24. The method of claim 22, wherein the property information is a client ID. 25. The method of claim 22, wherein the property information can be used to identify the node. 26. A method for monitoring search responses for selected objects by means of a node on a peer-to-peer network having at least two nodes and for removing responses from the network, the method comprising the steps of: a. Inserting at least one pseudo-node into the network, the pseudo-node being configured to provide at least one IP address and optionally at least one client ID, and having at least one selected requested object stored at the dummy node; b. Monitoring the network by at least one of the dummy nodes to identify requests that match the at least one stored object; c. Forward the request to other nodes of the network; and d. Dropping the received answers. A method of monitoring search requests for selected objects by means of a node on a peer-to-peer network having at least two nodes and removing the responses from the network, the method comprising the steps of: a. Inserting at least one pseudo-node into the network, the pseudo-node being configured to provide at least one IP address and optionally at least one client ID, and having at least one selected requested object stored at the dummy node; b. Monitoring the network by at least one of the dummy nodes to capture requests that match the at least one of the stored objects; c. Replacing the search term within the search request with random characters; and d. Forward the request to other nodes in the network. A method of monitoring search requests for objects by means of a node on a peer-to-peer network, the network comprising at least two nodes, the method comprising the steps of: a. Inserting at least one pseudo node into the network, wherein the pseudo node is configured to provide at least one IP address and optionally at least one client ID; and b. Monitoring the network by at least one of the dummy nodes to detect search requests from nodes in the peer-to-peer network. 29. The method of claim 28, wherein the detected search requests are stored on the dummy node. 30. The method of claim 29, wherein the acquired search requests are detected by the pseudo-node and a unique ID, which is generated by the network node requesting the search, is at least temporarily stored by the dummy node. The method of claim 30, wherein the dummy node responds to the requesting node 5. 32. A method of advertising on a peer-to-peer network having at least two nodes, the method comprising: a. Inserting at least one pseudo-node configured in the network; b. Monitoring the network by at least one of the io dummy nodes to capture requests; and c. Answers with information used to promote a product or service. The method of claim 32, wherein the responding is in response to a particular request. 15 34. A method for identifying terrorist activity on a peer-to-peer network having at least two nodes, the method consisting of: a. Inserting at least one pseudo-node configured in the network; b. Monitoring the network by at least one of the dummy nodes to detect requests or responses; and 20 c. Targeted data mining ("data mining") in the captured requirements and responses to terrorist information or patterns. 35. A method of identifying terrorists on a peer-to-peer network having at least two nodes, the method comprising: a. Inserting at least one pseudo-node configured thereto into the network; b. Cause the dummy node to send a request for a particular term; c. targeted data mining ("data mining") in the identified requests or responses to terrorist information or patterns; and d. Record the client ID of the answering node. 36. A method for identifying the terrorist threat level of a node or user on a peer-to-peer network having at least two nodes, the method consisting of: a. Inserting at least one pseudo-node configured in the network; b. Cause the dummy node to send a request for a particular term; c. Going through the list of files of each responding node; and 35 d. Make a threat determination using generally accepted policies and procedures. 37. A method for reporting which files are currently being procured on a peer-to-peer network with at least two nodes, the method consisting of: a. Inserting at least one pseudo node configured thereto into the network; and b. Monitoring the network by at least one of the dummy nodes to detect search requests that are in a file name format. 38. A method for automatically collecting and recording the location of files on a peer-to-peer network, the method comprising: a. Inserting at least one pseudo-node configured in the network; b. Requesting from a list of client IDs that they upload a file index number to the dummy node starting at N, where N is an integer; c. Recording the particular file name sent; d. automatically incrementing the file index number and repeating the request until the nodes no longer respond; and e. automatically record the client identifier and its responses in a data collection system. 39. The method of claim 38, wherein the list is generated by recording the client identifier 55 from nodes that respond to requests. 26 AT 010 551 U1 40. The method of claim 38, wherein the list is generated by recording the client identifier of nodes that respond to a particular search request. 41. The method of claim 38, wherein the list is generated by recording the client identifier from nodes whose responses match a particular term. 42. The method of claim 38, wherein the list is generated by recording the client identifier of nodes that respond to the dummy node when the pseudo node sends out a particular request. 43. A method of monitoring additional search requests for selected objects by means of a node on a peer-to-peer network comprising at least two nodes, and providing a response to substantially all such requesting nodes, the method comprising the steps of: a , Inserting at least one pseudo node into the network, wherein the pseudo node is configured to provide at least one IP address and optionally at least one client ID, the pseudoknot having at least one stored object corresponding to a query object stored at the pseudo node; b. Monitoring the network by at least one of the dummy nodes to detect additional search requests that match at least one of the stored objects; c. Obtaining a unique ID generated by each network node requesting the object that matches the stored object; d. Responding to each node representing an ID that the request is available on the dummy node; and e. Transmitting invalid data to the node when connecting to the dummy node. For this purpose 6 sheets of drawings