公开(公告)号：US20050240574A1

公开(公告)日：2005-10-27

申请号：US10833202

申请日：2004-04-27

申请人： James Challenger ,  Raymond Jennings ,  Jason LaVoie

发明人： James Challenger ,  Raymond Jennings ,  Jason LaVoie

IPC分类号： G06F17/30

CPC分类号： G06F16/9574

摘要： A method and apparatus are provided for pre-fetching resources based upon a query request to a resource lookup service. A monitoring application snoops for requests/replies from clients. Web content is pre-fetched via a web proxy based on the requests. Thus, the web content is made available to the client more efficiently.

摘要翻译： 提供了一种基于对资源查找服务的查询请求来预取资源的方法和装置。 监控应用程序会窥探客户端的请求/回复。 基于请求，Web内容通过Web代理预取。 因此，更有效地向客户提供网页内容。

公开(公告)号：US20050131939A1

公开(公告)日：2005-06-16

申请号：US10737213

申请日：2003-12-16

申请人： Frederick Douglis ,  Purushottam Kulkarni ,  Jason LaVoie ,  John Tracey

发明人： Frederick Douglis ,  Purushottam Kulkarni ,  Jason LaVoie ,  John Tracey

IPC分类号： G06F17/00

CPC分类号： H03M7/30 ,  G06F11/1453

摘要： A redundancy elimination mechanism is provided, which applies aspects of duplicate block elimination and delta encoding at the block level. The redundancy elimination mechanism divides file objects into content-defined blocks or “chunks.” Identical chunks are suppressed. The redundancy elimination mechanism also performs resemblance detection on remaining chunks to identify chunks with sufficient redundancy to benefit from delta encoding of individual chunks. Any remaining chunks that do not benefit from delta encoding are compressed. Resemblance detection is optimized by merging groups of fingerprints into super fingerprints. This merging can be constructed to ensure that if two objects have a single super fingerprint in common, they are extremely likely to be substantially similar.

摘要翻译： 提供了冗余消除机制，其在块级应用重复块消除和增量编码的方面。 冗余消除机制将文件对象分为内容定义的块或“块”。 相同的块被抑制。 冗余消除机制还对剩余的块执行相似性检测，以识别具有足够冗余度的块以从单个块的增量编码中受益。 任何不受益于delta编码的剩余块被压缩。 通过将指纹组合并成超级指纹来优化相似度检测。 可以构建这种合并，以确保如果两个对象具有共同的单个超级指纹，则它们极有可能基本相似。

公开(公告)号：US20070168511A1

公开(公告)日：2007-07-19

申请号：US11333029

申请日：2006-01-17

申请人： Jason Brochu ,  Peter Cipriano ,  Raymond Jennings ,  Jason LaVoie

发明人： Jason Brochu ,  Peter Cipriano ,  Raymond Jennings ,  Jason LaVoie

IPC分类号： G06F15/173

CPC分类号： G06Q10/107

摘要： One embodiment of the present method and apparatus for user-moderation of an online chat room in which a plurality of users are exchanging messages includes providing the chat room and controlling a manner in which the users send and receive the messages in the chat room in accordance with user feedback relating to the messages. In one embodiment, the user feedback is received in the form of user chat profiles, which describe the respective users' participation in the chat room, and flags, which users may be given in response to messages that are deemed inappropriate for the chat room.

摘要翻译： 用于对多个用户正在交换消息的在线聊天室进行用户管理的本方法和装置的一个实施例包括提供聊天室并且控制用户在聊天室中发送和接收消息的方式 用户反馈与消息有关。 在一个实施例中，以用户聊天简档的形式接收用户反馈，其描述了相应用户参与聊天室，以及标志，哪些用户可以响应于被认为不适合聊天室的消息而被给予。

公开(公告)号：US20070165519A1

公开(公告)日：2007-07-19

申请号：US11331713

申请日：2006-01-13

申请人： David George ,  Raymond Jennings ,  Jason LaVoie ,  Sambit Sahu

发明人： David George ,  Raymond Jennings ,  Jason LaVoie ,  Sambit Sahu

IPC分类号： H04J3/14

CPC分类号： H04L67/104 ,  H04L63/0421 ,  H04L67/1046 ,  H04L67/1048 ,  H04L67/1068 ,  H04L67/2814

摘要： One embodiment of the present method and apparatus for re-establishing anonymous data transfers between a first endpoint and a second endpoint in a network includes receiving, from a first node, the identity of a second node connected to the first node, where at least the first node is a neighbor node. A third node (a neighbor node) is then selected, and instructed to connect to the second node in order to establish a link for the path. In this manner, the first endpoint and the second endpoint remain unknown at least to each other (e.g., where “unknown” means that neither endpoint knows any identifying information, such as network address, about the other endpoint), and likely to all other nodes in the path as well. In another embodiment, a failure is detected at a neighbor node, where the neighbor node is part of an original path between the first endpoint and the second endpoint. The neighbor node's repair server is contacted for a repair node associated with the neighbor node, and a connection to the repair node is made such that the path is established in a manner that maintains anonymity of the first endpoint and the second endpoint relative to each other.

摘要翻译： 用于在网络中的第一端点和第二端点之间重新建立匿名数据传输的本方法和装置的一个实施例包括从第一节点接收连接到第一节点的第二节点的标识，其中至少 第一节点是邻居节点。 然后选择第三节点（邻居节点），并且指示连接到第二节点以建立路径的链路。 以这种方式，第一端点和第二端点至少彼此未知（例如，其中“未知”意味着两个端点都不知道关于另一端点的任何识别信息，例如网络地址），并且可能对所有其他端点 节点也在路径中。 在另一个实施例中，在邻居节点处检测到故障，其中相邻节点是第一端点和第二端点之间的原始路径的一部分。 与相邻节点相关联的修复节点与邻居节点的修复服务器联系，并且进行到修复节点的连接，使得以保持第一端点和第二端点相对于彼此的匿名性的方式来建立路径 。

公开(公告)号：US20070160069A1

公开(公告)日：2007-07-12

申请号：US11330826

申请日：2006-01-12

申请人： David George ,  Raymond Jennings ,  Jason LaVoie

发明人： David George ,  Raymond Jennings ,  Jason LaVoie

IPC分类号： H04L12/56 ,  H04L12/28

CPC分类号： H04L67/104 ,  H04L67/1093 ,  H04L67/28

摘要： One embodiment of the present method and apparatus for assisting a peer-to-peer connection between a first node and a second node includes receiving, at a third node, a request for connection assistance from one of the first and second nodes. The third node then connects to both the first node and the second node, receives the data from the first node and delivers the data to the second node. In this manner, data may be transferred between the first and second nodes even if the first and second nodes are unable to directly connect to each other (e.g., due to permanent or temporary limitations).

摘要翻译： 用于辅助第一节点和第二节点之间的对等连接的本方法和装置的一个实施例包括在第三节点处从第一节点和第二节点之一接收对连接协助的请求。 然后，第三节点连接到第一节点和第二节点，从第一节点接收数据并将数据传送到第二节点。 以这种方式，即使第一和第二节点不能彼此直接连接（例如，由于永久或暂时的限制），也可以在第一和第二节点之间传送数据。

公开(公告)号：US20070011347A1

公开(公告)日：2007-01-11

申请号：US11152890

申请日：2005-06-15

申请人： David George ,  Raymond Jennings ,  Jason LaVoie

发明人： David George ,  Raymond Jennings ,  Jason LaVoie

IPC分类号： G06F15/16

CPC分类号： G06Q10/107 ,  H04L51/12 ,  H04L67/104

摘要： One embodiment of the present method and apparatus for reducing spam in peer-to-peer networks includes forming a search message including at least one decoy word and sending the search request message, including the decoy word(s), to one or more nodes in the network. Embodiments of the present invention make it possible to weed out nodes in the network that send spam in response to every search message (e.g., regardless of the search message's content).

摘要翻译： 用于减少对等网络中的垃圾邮件的本方法和装置的一个实施例包括形成包括至少一个诱饵字的搜索消息，并将包括诱饵词的搜索请求消息发送到一个或多个节点 网络。 本发明的实施例使得可以根据每个搜索消息（例如，不管搜索消息的内容如何），去除发送垃圾邮件的网络中的节点。

公开(公告)号：US20060173967A1

公开(公告)日：2006-08-03

申请号：US11049808

申请日：2005-02-03

申请人： Raymond Jennings ,  Jason LaVoie

发明人： Raymond Jennings ,  Jason LaVoie

IPC分类号： G06F15/16

CPC分类号： H04L67/16 ,  H04L67/104 ,  H04L67/1068 ,  H04L67/107 ,  H04L69/28

摘要： Disclosed are methods and systems for expanding the search space in a Peer-to-Peer (“P2P”) network. In one embodiment, the search space is expanded by increasing the time-to-live value of the search request message. The P2P network may include a plurality of nodes, and the method for increasing the search space in the network includes the steps of receiving a search request message; changing a time-to-live value carried by the message; and forwarding the message to at least one peer node.

摘要翻译： 公开了用于扩展对等（“P2P”）网络中的搜索空间的方法和系统。 在一个实施例中，通过增加搜索请求消息的生存时间值来扩展搜索空间。 P2P网络可以包括多个节点，并且用于增加网络中的搜索空间的方法包括以下步骤：接收搜索请求消息; 改变消息携带的生存时间价值; 并将该消息转发到至少一个对等节点。

公开(公告)号：US20060173966A1

公开(公告)日：2006-08-03

申请号：US11048495

申请日：2005-02-01

申请人： Raymond Jennings ,  Jason Lavoie

发明人： Raymond Jennings ,  Jason Lavoie

IPC分类号： G06F15/16

CPC分类号： H04L51/04 ,  H04L51/30

摘要： In one embodiment, the present invention is a method and apparatus for inferring the read status of instant messages. One embodiment of the inventive method involves displaying the instant message on the receiver's computing device and sending a message to the sender indicating a probability with which the receiver has viewed the instant message. In one embodiment, this probability is based at least in part on an amount of the instant message that is in view on the receiver's computing device and on user input that is received by the receiver's computing device, e.g., from the receiver.

摘要翻译： 在一个实施例中，本发明是用于推断即时消息的读取状态的方法和装置。 本发明方法的一个实施例涉及在接收机的计算设备上显示即时消息，并向发送者发送指示接收机已经观看到即时消息的概率的消息。 在一个实施例中，该概率至少部分地基于在接收机的计算设备上看到的即时消息的量以及由接收机的计算设备例如从接收机接收的用户输入。

公开(公告)号：US20060023646A1

公开(公告)日：2006-02-02

申请号：US10909024

申请日：2004-07-30

申请人： David George ,  Raymond Jennings ,  Jason Lavoie ,  Sambit Sahu

发明人： David George ,  Raymond Jennings ,  Jason Lavoie ,  Sambit Sahu

IPC分类号： H04L12/28

CPC分类号： H04L63/0421 ,  H04L67/06

摘要： One embodiment of the present method and apparatus for anonymous data transfers comprises connecting first and second network endpoints to at least one relay node and transferring data from the first endpoint to the second endpoint through the at least one relay node such that the first and second endpoints are not aware of each other's identities, e.g., are not aware of an ultimate source or destination of transferred data. In further embodiments, an information field specifying a number of times that a data transfer message (e.g., a request, response or get message) should be forwarded is altered so that no receiving node can inferentially identify an originating node.

摘要翻译： 用于匿名数据传输的本方法和装置的一个实施例包括将第一和第二网络端点连接到至少一个中继节点，并且通过至少一个中继节点将数据从第一端点传送到第二端点，使得第一和第二端点 不知道彼此的身份，例如，不知道传输数据的最终来源或目的地。 在另外的实施例中，指定数据传送消息（例如，请求，响应或获取消息）应被转发的次数的信息字段被改变，使得没有接收节点可以在周边识别始发节点。

公开(公告)号：US20050065632A1

公开(公告)日：2005-03-24

申请号：US10670138

申请日：2003-09-24

申请人： Frederick Douglis ,  Frank Jania ,  Jason Lavoie ,  John Tracey

发明人： Frederick Douglis ,  Frank Jania ,  Jason Lavoie ,  John Tracey

IPC分类号： B29C45/00 ,  H04L29/06

CPC分类号： H04L29/06

摘要： A method and apparatus for scalable inquiries in a network of communicating peers are provided. The method and apparatus of the present invention make use of communal filters and randomization to determine which client devices will output a message that is to be broadcast to a community of client devices. Each message is assigned a probability value that is determined based on various criteria or may be determined randomly. The message is then transmitted to the client devices who apply their own respective display criteria to the message parameters to determine if the message is one that is of interest to the user of the client device. If the message is not of interest to the user of the client device, the message is discarded. If the message is of interest to the user, logic is applied to the parameters of the message to determine whether the message should be displayed to the user or not. This logic may involve determining whether the message has been previously displayed to the user, whether the message has been received but not previously displayed, and the like. In addition, if the message has not been previously displayed to the user, a randomly generated number, which may be weighted based on other criteria, is generated and compared with the probability value associated with the message. Based on this comparison, the message is either displayed or not displayed on the client device. This probability value of the message may be adjusted with each subsequent rebroadcast of the message to increase the size of the subset of users that will see the message.

摘要翻译： 提供了一种用于在通信对等体的网络中进行可扩展查询的方法和装置。 本发明的方法和装置利用公共过滤器和随机化来确定哪些客户端设备将向客户端设备的社区输出要广播的消息。 每个消息被分配了基于各种标准确定的概率值，或者可以随机确定。 然后将该消息发送到将其各自的显示标准应用于消息参数的客户端设备，以确定消息是否是客户端设备的用户感兴趣的消息。 如果消息对于客户端设备的用户不感兴趣，则该消息被丢弃。 如果该消息是用户感兴趣的，则将逻辑应用于该消息的参数以确定该消息是否应显示给该用户。 该逻辑可以涉及确定消息是否已经先前向用户显示，消息是否已经被接收但未被显示，等等。 此外，如果消息尚未被显示给用户，则可以根据其他标准加权的随机生成的数字被生成并与与该消息相关联的概率值进行比较。 基于此比较，消息被显示或不显示在客户端设备上。 消息的这个概率值可以随着消息的每个后续重播进行调整，以增加将看到消息的用户子集的大小。