The present invention provides a method for using an Enhancement. System on a peer-to-peer network to enhance the experience of a user.
As used herein, peer-to-peer networks which are one of the subjects of the present invention comprise multiple nodes, each node typically consisting both of file server and client that can send and receive data or “Communication messages” to or from a node to which such is connected and other nodes on the network. Common peer-to-peer networks and software applications are Gnutella, FastTrack, Edonkey, NeoNet, Kazaa, Limewire. Morpheus, Bear Share, Bit. Torrent, Shareaza, Emule, and Freenet. This list is not inclusive of all peer-to-peer file applications but rather serves as a general list.
In some peer-to-peer networks, each node is connected to other nodes over a communication medium such as the Internet either directly or through some type of proxy. For example, when a search request is issued such originating node sends a search request to all of the nodes to which it is connected, (see
Some peer-to-peer networks utilize a leaf node/main node proxy topology (See
Referring to
Each node on a peer-to-peer network generally has 2-3 connections to the peer-to-peer network so that they can increase their odds of finding information. Because each connection is to a random node on the peer-to-peer network, each connection generally searches & different group of nodes. Because searches are “repeated” by nodes on the network, sometimes connections have overlapping coverage in that a search sent out via one connection searches nodes available on another connection. This is known as an inefficient connection configuration.
Because the network enforces restrictions when a user searches and because of the nature of the architecture, the user can only search a limited number of nodes on the network. For instance, if the network is composed of twelve million users, a user searching for information may only be able to search 3,000 other users. If the user is searching for a file that is not popular it may not be within the searching radius of the user and the file will not be found, even if it is located on another node elsewhere on the network. It would therefore be advantageous if a user could search more nodes on a network then they normally could with a standard peer-to-peer application or system, thus raising the chance that they would find the information they are looking for.
Generally, the present invention provides a system for allowing a user to search more nodes on a peer-to-peer network then they normally would have access to. The preferred system comprises the steps of:
Thus, the present invention provides a system and method for enhanced experience with a peer-to-peer network.
More specifically, the present invention is directed to a system and method for implementing a peer to peer (P2P) network that includes a plurality of nodes, wherein each of a majority of the nodes has less than a threshold number of P2P connections to other nodes in the network. A P2P network connection is established between a first node from the majority and an enhanced connection node in the network, wherein the enhanced connection node has more than the threshold number of P2P connections to other nodes in the network. A search request is issued from the first node by transmitting the search request from the first node to the enhanced connection node, and then forwarding the search request from the enhanced connection node to other nodes in the network. Responses to the search request are collected at the enhanced connection node, and thereafter at least one of the following is performed by the enhanced connection node: (i) filtering the responses, and then forwarding results of the filtering to the first node; (ii) ranking the responses, and then forwarding ranked responses to the first node; and (iii) adding additional content (e.g., an advertisement selected in response to one or more search terms included in the search request) to the responses, and forwarding said additional content and at least some of the responses to the first node.
In some embodiments, the enhanced connection node accesses user profile information associated with the first node, and at least one of the following is performed by the enhanced connection node: (i) filtering the responses in accordance with the profile information, and then forwarding results of the filtering to the first node; (ii) ranking the responses in accordance with the profile information, and then forwarding ranked responses to the first node; and (iii) adding additional content to the responses, wherein, the additional content is selected at least in part using the profile information, and forwarding the additional content and at least some of the responses to the first node.
In some embodiments, the enhanced connection node includes dedicated content that is unavailable on all other nodes in the network, or pointers to dedicated content that is unavailable on all other nodes in the network.
In some embodiments, the first node uses middleware on the first node to establish the P2P network connection between the first node and the enhanced connection node. In such embodiments, the middleware may monitor for transmission of content that should not be shared on the P2P network and perform at least one of the following: (i) block transmission of the content that should not be shared; and (ii) notify another system that there has been transmission of content that should not be shared.
In some embodiments, the enhanced connection node sends a cached list of search responses back to the first node.
Other advantages of the present invention will become apparent from a perusal of the following detailed description of presently preferred embodiments of the invention.
The present invention provides a system for allowing a user to search more nodes on a peer-to-peer network than one normally would have access to or by returning information that otherwise would not be available for searching on the peer-to-peer network. It also provides a system and method for filtering any search results that may be returned to the users. It also provides a system and method for adding its own results, such as advertisements, to any search results that may be returned to the user. It also provides a system and method for ranking any results that may be returned to a user, it also provides a system and method for storing attributes of the searcher, the searches that they issue, and the responses mat they receive. It also provides a system and method for storing a WWW browser cookie in the browser of the user based on their searches or any results that may be returned to them. It also provides a system and method to reduce traffic on the peer-to-peer network, and/or increase the speed of search by caching search results. Other advantages of the present invention will become apparent from a perusal of the following detailed description of presently preferred embodiments of the invention.
Generally the invention is comprised of an Enhancement System that is connected to a peer-to-peer network and has more nodes available to search than what a normal peer-to-peer user would have access to and/or it has access to dedicated information that would not be generally available for a peer-to-peer user to search for on the peer-to-peer network. A peer-to-peer user connects to the Enhancement System and sends his peer-to-peer messages (such as searches) to this system. The Enhancement System relays these messages to the peer-to-peer nodes to which it is connected to, which is more than what the peer-to-peer user would normally have been able to access. The Enhancement System receives results back then forwards these results to the peer-to-peer user, thus increasing the amount of results and/or the breadth of their search.
The Enhancement System has access to more nodes or dedicated information on the peer-to-peer network by using different methods. This may include having more connections into the peer-to-peer network than a normal user might or by using highly efficient connections so that each connection or combination of connections accesses more nodes than would a normal connection or combination of normal connections. The Enhancement System could be connected to more hub nodes than the user normally would be or could be. The Enhancement System could contain dedicated information and no connections to the peer-to-peer network. In this case the Enhancement System would have access to dedicated information not available for generalized searching on the peer-to-peer network. The Enhancement System could contain dedicated information and also access to more nodes than what a normal user would commonly have access to.
The Enhancement System may be comprised of multiple systems that share information and workload or ones that operate independently. The Enhancement System may have a system that primarily handles client connections, while other portions of the Enhancement System handle connections to the peer-to-peer network. The Enhancement System could contain filtering systems or systems that contain dedicated content. The Enhancement System may cache search results so that it does not have to issue searches onto the peer-to-peer network that have occurred within a certain time limit.
Generally the system works by connecting into the peer-to-peer network in a way that allows it to have access to more nodes than a normal peer-to-peer user would. A user wishing for enhanced access connects to the Enhancement System using his peer-to-peer application and by utilizing standard peer-to-peer protocols. This allows the user to use any peer-to-peer application that he chooses. The user's peer-to-peer application may also connect to a piece of middleware software that is located on his computer system or another system. This middleware software would then connect to the Enhancement System. The middleware would communicate with the peer-to-peer software application utilizing standard peer-to-peer protocols so that the user can use any peer-to-peer application that he would choose. The middleware application may connect to the Enhancement System and communicate using standard peer-to-peer protocols or it could communicate with a proprietary protocol. The middleware application may be configured to program or change the configuration of the peer-to-peer client application. For instance, the middleware software may configure the peer-to-peer client application so that the peer-to-peer client application connects to the middleware without any user intervention. The peer-to-peer client application could also be programmed with “support” for the middleware application and as such, if it detects that the middleware is installed, it will pass control over to the middleware for communications.
If the Enhancement System Middleware is located on the peer-to-peer user's system and can monitor data traffic it could also be configured to monitor the transmission of files. The Enhancement System Middleware could be configured to monitor for the transmission of files that should not be shared, such as personal information and block this transmission if it detects it. It could also be configured to notify another system if it detects that a file has been sent or received.
The Enhancement system will forward searches it receives from the peer-to-peer network to those peer-to-peer users that are utilizing it. The Enhancement System could be configured to filter and/or remove searches so that the user connected to the Enhancement System would be protected from malicious searches. The Enhancement System could be configured to not forward any searches at all, or to only forward selected searches. The Enhancement System could be configured to always remove certain terms. For instance, if an organization wanted to limit searches for their information the Enhancement System could be configured to not pass these searches in either direction.
Once the peer-to-peer user is utilizing the Enhancement System, either directly or through middleware, any searches or other messages that the user sends will be sent to the Enhancement System. There may be occasions when the peer-to-peer user would also want to search the peer-to-peer network by utilizing the Enhancement System and standard connections to the peer-to-peer network at the same time. In this case the user's peer-to-peer application would be configured to connect to the Enhancement System or Enhancement System Middleware and also to other standard nodes on the peer-to-peer network.
If the Enhancement System detects a search from the peer-to-peer user it will relay the search to the nodes on the peer-to-peer network that it is connected to. The Enhancement System may choose not to forward the search, if for instance if it would result in matches of copyrighted information or some other topic. In this instance, the Enhancement System may choose to respond back to the user with information alerting the user that the search may result in copyrighted or protected information. The Enhancement System could also record the search into a list or database. It could also record the IP address of the peer-to-peer user to a list or database. It could also record to a list or database any attributes it has access to concerning the communication. It could also analyze the search by comparing it to some criteria and setting a “Browser Cookie” in the peer-to-peer user's web browser. The cookie could be used to relay information to a website for target marketing or to enhance the user's experience on a website. It could be used to offer specials or services. It could be used to tailor web usage to the user's searching habits.
If the search that the peer-to-peer user issues would result in an excessive amount of responses (such in the case of a popular artist) the Enhancement System could choose to limit the number of nodes it relays the search to. It could also just drop the search. This would allow for throttling of responses and aim to not overload the Enhancement System or other nodes on the network. The Enhancement System could also choose to limit the number of searches from any one user, or any group of users.
The Enhancement System could change or modify the user's search so that it results in more, less, or more accurate results. It could also create multiple searches, relay these onto the peer-to-peer network and relay the combined list back to the peer-to-peer user as one result set. For instance, a user searches for Madonna and the Enhancement System relays, “Madonna” and “Madonna 2006”.
If two or more users are using the Enhancement System and they search for the same term, or the Enhancement System realizes that the terms would result in the same matches, and it's within certain criteria such as time, the Enhancement System could send a cached list of responses back to the second client. This would reduce the amount of searches that are relayed to other nodes of the network.
The Enhancement System could compare the search term to a list of criteria and respond back with a result set that contained a message. The message could be in the form of a file title, a file containing a message, or a pointer to file that contains a message. The message could be a warning that the user is searching for copyrighted information, that copyrighted information may result, or it could be an advertisement. It could also be a file with information different than what the user had asked for. For example a user could issue a search for “Madonna” and the Enhancement System could respond back with an advertisement on how to purchase tickets for her nest concert, or it may respond back with a video of Madonna that she has released for usage on the peer-to-peer network.
Once the Enhancement System issues the search onto the network and receives responses it will relay these responses back to the peer-to-peer user that issued the search. Before sending the results to the peer-to-peer user, the Enhancement System could change the ranking or order of the results, or modify the results to change the ranking or order. The Enhancement System could filter any results, for instance if results contain copyrighted works. It could do this by comparing the file titles, the contents, hashes, file size, or any combination thereof. The Enhancement System could send a message. The message could be in the form of a file title, or a file containing a message. The message may be a warning that the user is searching for copyrighted information or it could be an advertisement. It could also be a file with information different than what the user had asked for. The Enhancement System could send a pointer to a different file. For instance the Enhancement System could send a pointer to a lower quality version of the file or the file with an advertisement inserted into it. The Enhancement System could also record the IP address of the searcher and the results that were relayed and/or received into a list or database. The Enhancement System could be configured to not respond at all.
The Enhancement System could download files from the peer-to-peer network and cache these. If a user issues a search for something the Enhancement System is caching, the Enhancement System would provide pointers to these files.
The Enhancement System could also be utilized to perform filtering of the results so that when a user issues a search, any results would be scrubbed of erroneous files, filenames, or unavailable nodes on the network. This would increase the accuracy of the results that are sent back to the user. The Enhancement System could be configured to drop any results from a node on the network. It might do this because the node was rated low or has a high instance of sending incorrect data.
The Enhancement System could also create its own list of results and send these to the peer-to-peer user either as a replacement of the results or in addition to the results. It could be configured to not relay searches for certain information to the peer-to-peer network but rather create its own list of results. These results could point to files that are on dedicated servers for special purposes. For instance, a peer-to-peer user might search for the popular show “CSI Las Vegas” currently being aired on CBS. CBS could place CSI episodes onto a dedicated peer-to-peer server and when the user searches for “CSI” the Enhancement System would not relay the search to the peer-to-peer network but rather send results back consisting of all of the available CSI shows on the dedicated CBS server.
The Enhancement System might not be used to expand the breadth of the peer-to-peer user's search but rather provide information that would not otherwise be available for the user to search as it is not a part of the peer-to-peer network but merely communicates with the peer-to-peer protocol. For instance, a company could install a peer-to-peer client and add dedicated information but not allow their peer-to-peer client to connect to the peer-to-peer network. The Enhancement System would be configured so that if a user connects to it and searches for the company's information, the Enhancement System would respond back with pointers to files on the dedicated system. The peer-to-peer user could then download the files from the company's dedicated server.
The Enhancement System could utilize a database of IP addresses connected to it to provide information on their availability to other peer-to-peer users. It could also send peer-to-peer users that are connect to it a message and use the response times to determine a ranking. It could then use this information to modify search results back to other peer-to-peer users utilizing the Enhanced System.
The user's peer-to-peer client application could be configured to inform the Enhancement System Middleware program with a list of files that it is sharing. The Enhancement System Middleware could be configured to upload this information the Enhancement System of available files so that the Enhancement System would not have to issue searches onto the peer-to-peer network.
The Enhancement System Middleware could be configured to read the configuration of the user's peer-to-peer client application and build its own list of files available for sharing. The Enhancement System Middleware could be configured to upload this information the Enhancement System of available files so that the Enhancement System would not have to issue searches onto the peer-to-peer network.
An Enhancement System could comprise a hardware system such as a computer, thin appliance, ASIC based device or other similar device, which can be programmed with specific logic or programming code (i.e. software). The device preferably has the capability of being connected with a physical network either directly or though the use of a gateway. The programming logic provides the device with the capability to transmit and receive on both physical networks as well as the peer to peer networks which typically ride on top of a physical network. Programming logic is a software program but may also be hardcoded non-changeable procedural information such as typically found on an ASIC based device.
An Enhancement System Middleware could comprise a hardware system such as a computer, thin appliance, ASIC based device or other similar device, which can be programmed with specific logic or programming code (i.e. software). The device preferably has the capability of being connected with a physical network either directly or though the use of a gateway. The programming logic provides the device with the capability to transmit and receive on both physical networks as well as the peer to peer networks which typically ride on top of a physical network. Programming logic is a software program but may also be hardcoded non-changeable procedural information such as typically found on an ASIC based device.
The following Examples illustrate various embodiments of the systems according to the present Invention.
This example describes a standard peer-to-peer user issuing a search to an Enhancement System where the Enhancement System has eight connections to the peer-to-peer network. Referring to
Peer-to-Peer User
This example describes a standard peer-to-peer user issuing a search to an Enhancement System with eight connections to the peer-to-peer network and the Enhancement System filtering results. Referring to
Peer-to-Peer User
This example describes a standard Peer-to-Peer user issuing a search to an Enhancement System with eight connections to the peer-to-peer network and the Enhancement System adding an advertisement for “Madonna”. Referring to
Peer-to-Peer User
Finally, it will be appreciated by those skilled in the art that, changes could be made to the embodiments described above without departing from the broad inventive concept thereof. It is understood, therefore, that this invention is not limited to the particular embodiments disclosed, but is intended to cover modifications within the spirit and scope of the present invention as defined in the appended claims.
The present application claims priority to U.S. Provisional Application No. 60/857,334 entitled “System and Method for Enhanced Experience with a Peer-to-Peer Network” filed Nov. 7, 2006, incorporated herein by reference.
Number | Name | Date | Kind |
---|---|---|---|
111604 | Bailey | Feb 1871 | A |
5949760 | Stevens et al. | Sep 1999 | A |
5987011 | Toh | Nov 1999 | A |
6069896 | Borgstahl et al. | May 2000 | A |
6076088 | Paik et al. | Jun 2000 | A |
6205146 | Rochberger et al. | Mar 2001 | B1 |
6397246 | Wolfe | May 2002 | B1 |
6611196 | Mynatt et al. | Aug 2003 | B2 |
6668289 | Cheng et al. | Dec 2003 | B2 |
6732180 | Hale et al. | May 2004 | B1 |
6839769 | Needham et al. | Jan 2005 | B2 |
6855660 | Tsou et al. | Feb 2005 | B2 |
6918113 | Patel et al. | Jul 2005 | B2 |
6950821 | Faybishenko et al. | Sep 2005 | B2 |
6965591 | Roy | Nov 2005 | B1 |
6983320 | Thomas et al. | Jan 2006 | B1 |
7003514 | Dutta et al. | Feb 2006 | B2 |
7010534 | Kraft | Mar 2006 | B2 |
7027994 | Verdi et al. | Apr 2006 | B2 |
7035653 | Simon et al. | Apr 2006 | B2 |
7089301 | Labio et al. | Aug 2006 | B1 |
7120145 | Ohba et al. | Oct 2006 | B2 |
7120619 | Drucker et al. | Oct 2006 | B2 |
7174382 | Ramanathan et al. | Feb 2007 | B2 |
7177295 | Sholander et al. | Feb 2007 | B1 |
7206841 | Traversat et al. | Apr 2007 | B2 |
7308445 | Bharat et al. | Dec 2007 | B2 |
7318092 | Sutler | Jan 2008 | B2 |
7327683 | Ogier et al. | Feb 2008 | B2 |
7418455 | Fan et al. | Aug 2008 | B2 |
7441180 | Kaczmarek et al. | Oct 2008 | B1 |
7574523 | Traversat et al. | Aug 2009 | B2 |
7587367 | Mengerink | Sep 2009 | B2 |
7600033 | Bauer et al. | Oct 2009 | B2 |
7703040 | Cutrell et al. | Apr 2010 | B2 |
20010003191 | Kovacs et al. | Jun 2001 | A1 |
20010037325 | Biderman et al. | Nov 2001 | A1 |
20010045949 | Chithambaram et al. | Nov 2001 | A1 |
20020016786 | Pitkow et al. | Feb 2002 | A1 |
20020044549 | Johansson et al. | Apr 2002 | A1 |
20020059204 | Harris | May 2002 | A1 |
20020065832 | Mack | May 2002 | A1 |
20020069098 | Schmidt | Jun 2002 | A1 |
20020073204 | Dutta et al. | Jun 2002 | A1 |
20020087885 | Peled et al. | Jul 2002 | A1 |
20020129140 | Peled et al. | Sep 2002 | A1 |
20020138471 | Dutta et al. | Sep 2002 | A1 |
20020143989 | Huitema et al. | Oct 2002 | A1 |
20020152262 | Arkin et al. | Oct 2002 | A1 |
20020161844 | Overtoom | Oct 2002 | A1 |
20020181395 | Foster et al. | Dec 2002 | A1 |
20020184310 | Traversat et al. | Dec 2002 | A1 |
20020188735 | Needham et al. | Dec 2002 | A1 |
20030005035 | Rodgers | Jan 2003 | A1 |
20030037167 | Garcia-Luna-Aceves et al. | Feb 2003 | A1 |
20030050966 | Dutta et al. | Mar 2003 | A1 |
20030050980 | Dutta et al. | Mar 2003 | A1 |
20030055892 | Huitema et al. | Mar 2003 | A1 |
20030078889 | Lee et al. | Apr 2003 | A1 |
20030088544 | Kan et al. | May 2003 | A1 |
20030095660 | Lee et al. | May 2003 | A1 |
20030112823 | Collins et al. | Jun 2003 | A1 |
20030126136 | Omoigui | Jul 2003 | A1 |
20030126199 | Kadri et al. | Jul 2003 | A1 |
20030135495 | Vagnozzi | Jul 2003 | A1 |
20030145093 | Oren et al. | Jul 2003 | A1 |
20030182428 | Li et al. | Sep 2003 | A1 |
20030191828 | Ramanathan et al. | Oct 2003 | A1 |
20030195852 | Campbell et al. | Oct 2003 | A1 |
20030202468 | Cain et al. | Oct 2003 | A1 |
20030208621 | Bowman | Nov 2003 | A1 |
20030212710 | Guy | Nov 2003 | A1 |
20040019650 | Auvenshine | Jan 2004 | A1 |
20040030651 | Kim et al. | Feb 2004 | A1 |
20040034652 | Hofmann et al. | Feb 2004 | A1 |
20040039921 | Chuang | Feb 2004 | A1 |
20040044790 | Loach et al. | Mar 2004 | A1 |
20040044996 | Atallah | Mar 2004 | A1 |
20040088348 | Yeager et al. | May 2004 | A1 |
20040098370 | Garland et al. | May 2004 | A1 |
20040103297 | Risan et al. | May 2004 | A1 |
20040111604 | Fournier | Jun 2004 | A1 |
20040122958 | Wardrop | Jun 2004 | A1 |
20040133571 | Horne et al. | Jul 2004 | A1 |
20040139211 | Baker et al. | Jul 2004 | A1 |
20040143842 | Joshi | Jul 2004 | A1 |
20040148275 | Achlioptas | Jul 2004 | A1 |
20040148434 | Matsubara et al. | Jul 2004 | A1 |
20040153472 | Rieffanaugh | Aug 2004 | A1 |
20040153658 | Gunyakti et al. | Aug 2004 | A1 |
20040157641 | Chithambaram et al. | Aug 2004 | A1 |
20040158630 | Chang et al. | Aug 2004 | A1 |
20040196784 | Larsson et al. | Oct 2004 | A1 |
20040218532 | Khirman | Nov 2004 | A1 |
20040220926 | Lamkin et al. | Nov 2004 | A1 |
20040230572 | Omoigui | Nov 2004 | A1 |
20040236945 | Risan et al. | Nov 2004 | A1 |
20040250106 | Annese et al. | Dec 2004 | A1 |
20040250122 | Newton | Dec 2004 | A1 |
20040260761 | Leaute et al. | Dec 2004 | A1 |
20040260801 | Li | Dec 2004 | A1 |
20050027821 | Alexander et al. | Feb 2005 | A1 |
20050028012 | Amamiya et al. | Feb 2005 | A1 |
20050038898 | Mittig et al. | Feb 2005 | A1 |
20050043548 | Cates | Feb 2005 | A1 |
20050060297 | Najork | Mar 2005 | A1 |
20050080858 | Pessach | Apr 2005 | A1 |
20050091167 | Moore et al. | Apr 2005 | A1 |
20050091202 | Thomas | Apr 2005 | A1 |
20050091397 | Roberts et al. | Apr 2005 | A1 |
20050108203 | Tang et al. | May 2005 | A1 |
20050108248 | Natunen | May 2005 | A1 |
20050114709 | Moore | May 2005 | A1 |
20050119998 | Greco et al. | Jun 2005 | A1 |
20050125374 | Curtis et al. | Jun 2005 | A1 |
20050125673 | Cheng et al. | Jun 2005 | A1 |
20050144288 | Liao | Jun 2005 | A1 |
20050163050 | Hopkins | Jul 2005 | A1 |
20050163133 | Hopkins | Jul 2005 | A1 |
20050163135 | Hopkins | Jul 2005 | A1 |
20050187942 | Dutta et al. | Aug 2005 | A1 |
20050203851 | King et al. | Sep 2005 | A1 |
20050203892 | Wesley et al. | Sep 2005 | A1 |
20050229243 | Svendsen et al. | Oct 2005 | A1 |
20050229255 | Gula et al. | Oct 2005 | A1 |
20050265259 | Thubert et al. | Dec 2005 | A1 |
20050267945 | Cohen et al. | Dec 2005 | A1 |
20060020814 | Lieblich et al. | Jan 2006 | A1 |
20060029093 | Van Rossum | Feb 2006 | A1 |
20060034177 | Schrempp | Feb 2006 | A1 |
20060039297 | McNab | Feb 2006 | A1 |
20060117372 | Hopkins | Jun 2006 | A1 |
20060136837 | Ben-Shachar et al. | Jun 2006 | A1 |
20060206486 | Strickland | Sep 2006 | A1 |
20060209819 | Jennings et al. | Sep 2006 | A1 |
20060248062 | Libes et al. | Nov 2006 | A1 |
20070124721 | Cowing et al. | May 2007 | A1 |
20070153703 | Floyd | Jul 2007 | A1 |
20070162463 | Kester et al. | Jul 2007 | A1 |
20080263013 | Hopkins | Oct 2008 | A1 |
20090024618 | Fan et al. | Jan 2009 | A1 |
20110066695 | Hopkins | Mar 2011 | A1 |
Number | Date | Country |
---|---|---|
101606143 | Dec 2009 | CN |
1107512 | Jun 2001 | EP |
2010-509674 | Mar 2010 | JP |
WO 03009524 | Jan 2003 | WO |
WO 2005074229 | Aug 2005 | WO |
WO 2005074230 | Aug 2005 | WO |
WO2006110823 | Oct 2006 | WO |
WO 2006124027 | Nov 2006 | WO |
WO2008127608 | Oct 2008 | WO |
Entry |
---|
International Search Report mailed May 14, 2008 in connection with PCT Application No. PCT/US07/23321. |
Hessing, Steven, “Peer to Peer Messaging Protocol,” Internet-Draft, Apr. 2002, pp. 1-57. |
Lindemann, C., et al., “A Distributed Search Service for Peer-to-Peer File Sharing in Mobile Applications,” Peer-to-Peer Computing, 2002, Proceedings of the Second International Conference on Peer-to-Peer Computing, Sep. 5-7, 2002. |
Mondal, A., et al., “Effective load-balancing of peer-to-peer systems,” Online, Mar. 2002, XP002299388. |
Oram, A., “Peer-to-Peer: Harnessing the Power of Disruptive Technologies,” Ch.10 Interoperability Through Gateways, Mar. 2001, p. 381-392. |
Shi, W., et al., “Tuxedo: A Peer-to-Peer Caching System,” Department of Computer Science, Wayne University. |
Zhenyun Zhuang, et al. “Hybrid Periodical Flooding in Unstructured Peer-to-Peer Networks,” Proceedings of the 2003 International Conference on Parallel Proceeding. |
Zhu, et al., “SDQE: Towards Automatic Semantic Query Optimization in P2P Systems,” Information Processing & Management, 42(1), pp. 222-236 Oct. 26, 2006. |
Hwang, J., and Aravamudham, P., “Proxy-Based Middleware Services for Peer-to-Peer Computing in Virtually Clustered Wireless Grid Networks,” School of Information Studies, Syracuse University, CST 4-291. |
United States House of Representatives Committee on Government Reform—Staff Report Prepard for Rep. Tom Davis and Rep. Henry A. Waxman, “File-Sharing Programs and Peer-to-Peer Networks Provacy and Security Risk,” May 13, 2003, pp. 1-12. |
United States General Accounting Office, Report to the Chairman and Ranking Minority Member, Committee on Government Reform, House of Representatives, “File Sharing Programs—Peer-To-Peer Networks Provide Ready Accessto Child Pornography,” Feb. 2003, pp. 1-32. |
Couch, William, “Peer-To-Peer File-Sharing Networks: Security Risk,” SANS Institute InfoSec Reading Room, 2002, pp. 1-11. |
Davidson, Alan, “Peer-To-Peer File Sharing Privacy and Security,” Center for Democracy and Technology, May 15, 2003, pp. 1-16. |
AA-2002.02—File Sharing Activity Part 1 of 2—Security Implications of Using Peer-to-Peer File Sharing Software, May 12, 2002, pp. 1-5. |
Phemus, “Secret Manual for Downloading: Final Second Part of Answers to Questions for Downloading”, PC Japan, vol. 5, 11, pp. 174-179, Nov. 1, 2000. |
Office Action, dated Jan. 6, 2011 on U.S. Appl. No. 12/082,407 and subsquent reply. |
Office Action, dated Jun. 15, 2011 on U.S. Appl. No. 12/082,407 and subsequent reply. |
International Search Report and Written Opinion of the ISA mailed Feb. 26, 2009 in connection with PCT Application No. PCT/US08/004614. |
International Search Report and Written Opinion of the ISA mailed Sep. 12, 2007 in connection with PCT Application No. PCT/US06/13666. |
International Search Report and Written Opinion of the ISA mailed Jun. 15, 2005 in connection with PCT Application No. PCT/US05/001622. |
Andersen, S., et al., Changes to Functionality in Microsoft Windows XP Service Pack 2 Part 2: Network Protection Technologies, Online, Sep. 15, 2004, pp. 1-56, XP002330123. |
Brandon Wiley, Freenet, “Inoperability Through Gateways,” Chapter 19, pp. 381-392. |
Findeli, M., “Peer-to-Peer (P2P) Networkgin,” On Line, Jul. 1, 2001, pp. 1-21. |
Goel, S., et al., “A Resilient Network That Can Operate Under Duress: To Support Communication Between Government Agencies during Crisis Situations,” IEEE, Proceedings of the 37th Annual Hawaii International Conference pp. 1-11, Jan. 2004. |
Kim, K., and Park , D., “Subway: Peer-to-Peer Clustering of Clients for Web Proxy,” Department of Electrical Engineering and Computer Science, [on line, Retrieved on Sep. 25, 2007]. Retrieved from the Internet URL:http://66.102.1.104/scholar?h1=en&1r=&q=cache:Cljbt8-S9ckJ:ideal.cecs.missouri.edu/IMC/papers/377PD . . . |
Liu, Jiangchuan, et al., “Distributed Distance Measurement for Large-Scale Networks,” Computer Networks 41 (2003) pp. 177-192. |
Marmor, Michael S., “Make the P2P Lead with Toadnode,” www.webtecniques.com, Dec. 2000, pp. 44-49. |
Markatos, E.P., Tracing a large-scale peer to peer system: an hour in the life of Gnutella, Cluster Computing and the Grid 2nd IEEE/ACM International Symposium CCGRID, 2002 Berlin, Germany, May 21-24, 2002, IEEE Comput. Soc., US, pp. 65-74. |
Scarlata, V., et al., “Responder Anonymity and Anonymous Peer-to-Peer File Sharing,” Proceedings of the International Conference on Network Protocols, Nov. 11, 2001, pp. 272-280. |
Siu Man Lui, et al., “Interoperability of Peer-To-Peer File Sharing,” ACM SlGecom Exchanges, vol. 3, No. 3, Aug. 2002, pp. 25-33. |
Tiversa, Inc., et al v. Cohen & Grigsby, P.C., Civil Division, Case No. GD 07/001515, Court of Common Pleas of Allegheny County, Pennsylvania, “Complaint,” 89 pages, dated Sep. 5, 2007. |
Tiversa, Inc., et al v. Cohen & Grigsby, P.C., Court of Common Pleas of Allegheny County, Pennsylvania, “Preliminary Objections and Brief in Support of Preliminary Objections,” 18 pages, dated Oct. 15, 2007. |
Tiversa, Inc., et al v. Cohen & Grigsby, P.C., Court of Common Pleas of Allegheny County, Pennsylvania, “First Amended Complaint,” 90 pages, dated Nov. 5, 2007. |
Tiversa, Inc., et al v. Cohen & Grigsby, P.C., Civil Division, Case No. GD 07/001515, Court of Common Pleas of Allegheny County, Pennsylvania, “Defendant's Preliminary Objections to First Amended Complaint and Brief in Support,” 14 pages, dated Nov. 21, 2007. |
Tiversa, Inc., et al v. Cohen & Grigsby, P.C., Civil Division, Case No. GD 07/001515, Court of Common Pleas of Allegheny County, Pennsylvania, “Court Order re: Defendant's Preliminary Objections to First Amended Complaint and Brief in Support,” 14 pages, dated Nov. 27, 2007. |
Tiversa, Inc., et al v. Cohen & Grigsby, P.C., Civil Division, Case No. GD 07/001515, Court of Common Pleas of Allegheny County, Pennsylvania, “Second Amended Complaint,” 89 pages, dated Dec. 11, 2007. |
Tiversa, Inc., et al v. Cohen & Grigsby, P.C., Civil Division, Case No. GD 07/001515, Court of Common Pleas of Allegheny County, Pennsylvania, “Answer to Second Amended Complaint,” 29 pages, dated Jan. 30, 2008. |
Tiversa, Inc., et al v. Cohen & Grigsby, P.C., Civil Division, Case No. GD 07/001515, Court of Common Pleas of Allegheny County, Pennsylvania, “Reply to New Matter,” 16 pages, dated Feb. 19, 2008. |
Ueda, et al., “Peer-to-Peer Network Topology Control within a Mobile Ad-hoc Network,” 2003 IEEE, pp. 243-247. |
Xiao, et al., “Mutual Anonymity Protocols for Hybrid Peer-to-Peer Systems,” Proceedings of the 23rd International Conference on Distributed Computing Systems, May 19-22, 2003. |
Zhu, et al., “SDQE: Towards Automatic Semantic Query Optimization in P2P Systems,” Information Processing & Management, 42(1), pp. 222-236 Oct. 26, 2004. |
Zupeng, et al., “Research of Peer-to-Peer Network Architecture,” Proceedings of ICCT2003, pp. 312-315. |
Number | Date | Country | |
---|---|---|---|
20080140780 A1 | Jun 2008 | US |
Number | Date | Country | |
---|---|---|---|
60857334 | Nov 2006 | US |