专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

21. 发明授权

US07574598B2 Identifying and coalescing identical objects encrypted with different keys 失效
标题翻译：识别和合并使用不同键加密的相同对象
公开(公告)号：US07574598B2
公开(公告)日：2009-08-11
申请号：US11150801
申请日：2005-06-10
申请人： John R. Douceur , William J. Bolosky , Marvin M. Theimer
发明人： John R. Douceur , William J. Bolosky , Marvin M. Theimer
IPC分类号： H04L29/06
CPC分类号： H04L9/3236 , H04L9/3247 , Y10S707/99953 , Y10S707/99955
摘要： Cryptographic protocols and methods of employing the same are described. The described protocols advantageously enable two or more identical encryptable objects that are coded for encryption with different keys to be identified as identical without access to either the unencrypted objects or the keys that are used in the encryption process. Additionally, the protocols enable two or more identical encryptable objects to be processed with different encryption keys, yet be stored in a manner so that the total required storage space is proportional to the space that is required to store a single encryptable object, plus a constant amount for each distinct encryption key. In various embodiments, the encryptable objects comprise files and the cryptographic protocols enable encrypted files to be used in connection with single instance store (SIS) systems.
摘要翻译：描述了使用它们的密码协议和方法。所描述的协议有利地使得被编码用于具有不同密钥的加密的两个或更多个相同的可加密对象被识别为相同，而不访问加密过程中使用的未加密对象或密钥。另外，这些协议允许使用不同的加密密钥来处理两个或多个相同的可加密对象，但是以一定的方式存储，使得所需的总存储空间与存储单个可加密对象所需的空间成正比，加上常数每个不同加密密钥的数量。在各种实施例中，可加密对象包括文件，并且加密协议使加密文件能够与单实例存储（SIS）系统相关联使用。

22. 发明申请

US20090077629A1 INTEREST ALIGNED MANUAL IMAGE CATEGORIZATION FOR HUMAN INTERACTIVE PROOFS 有权
标题翻译：用于人际交往项目的兴趣对齐手动图像分类
公开(公告)号：US20090077629A1
公开(公告)日：2009-03-19
申请号：US11856371
申请日：2007-09-17
申请人： John R. Douceur , Jeremy Eric Elson , Jonathan Ryan Howell
发明人： John R. Douceur , Jeremy Eric Elson , Jonathan Ryan Howell
IPC分类号： G06F7/04
CPC分类号： H04L63/10 , G06F21/36 , H04L63/08
摘要： A system and method that facilitates and effectuates distinguishing a human from a non-human user. A human interactive proof (HIP) employs images from a large private database of manually categorized images to display as part of a Turing test challenge. The private database contains a sufficient quantity of images, such that the more economical manner to pass the HIP is to employ a human to take the challenge. The owner of the private database makes the database available to the presenter of the HIP due to an alignment of interests between both parties. The HIP is displayed with ads on behalf of the owner of the private database and the presenter of the HIP gains access to a large quantity of private manually categorized images.
摘要翻译：促进和实现将人与非人类用户区分开的系统和方法。人类交互式证明（HIP）使用来自手动分类图像的大型私人数据库的图像作为图灵测试挑战的一部分显示。私人数据库包含足够数量的图像，以便通过HIP的更经济的方式是采用人类来应对挑战。由于双方之间的利益一致，私人数据库的所有者使数据库可供HIP主持人使用。 HIP与私人数据库的所有者一起显示广告，并且HIP的主持人可以访问大量私人手动分类的图像。

23. 发明授权

US07401220B2 On-disk file format for a serverless distributed file system 有权
公开(公告)号：US07401220B2
公开(公告)日：2008-07-15
申请号：US11014491
申请日：2004-12-16
申请人： William J. Bolosky , Gerald Cermak , Atul Adya , John R. Douceur
发明人： William J. Bolosky , Gerald Cermak , Atul Adya , John R. Douceur
IPC分类号： H04L29/00
CPC分类号： G06F17/30097 , G06F19/00 , H04L9/0656 , H04L9/3239 , H04L9/3249 , H04L2209/20 , H04L2209/38 , H04L2209/60
摘要： A file format for a serverless distributed file system is composed of two parts: a primary data stream and a metadata stream. The data stream contains a file that is divided into multiple blocks. Each block is encrypted using a hash of the block as the encryption key. The metadata stream contains a header, a structure for indexing the encrypted blocks in the primary data stream, and some user information. The indexing structure defines leaf nodes for each of the blocks. Each leaf node consists of an access value used for decryption of the associated block and a verification value used to verify the encrypted block independently of other blocks. In one implementation, the access value is formed by hashing the file block and encrypting the resultant hash value using a randomly generated key. The key is then encrypted using the user's key as the encryption key. The verification value is formed by hashing the associated encrypted block using a one-way hash function. The file format supports verification of individual file blocks without knowledge of the randomly generated key or any user keys. To verify a block of the file, the file system traverses the tree to the appropriate leaf node associated with a target block to be verified. The file system hashes the target block and if the hash matches the access value contained in the leaf node, the block is authentic.

24. 发明申请

US20080115121A1 Reducing Bandwidth Requirements for Peer-to-Peer Gaming Architectures 有权
标题翻译：降低对等游戏架构的带宽要求
公开(公告)号：US20080115121A1
公开(公告)日：2008-05-15
申请号：US11559338
申请日：2006-11-13
申请人： John R. Douceur , Jacob R. Lorch , Jeffrey Anson Pang , Frank Christopher Uyeda
发明人： John R. Douceur , Jacob R. Lorch , Jeffrey Anson Pang , Frank Christopher Uyeda
IPC分类号： G06F9/44 , G06N5/00 , G06F15/16
CPC分类号： A63F13/34 , A63F13/12 , A63F13/67 , A63F2300/407 , A63F2300/408 , A63F2300/6027 , H04L67/104 , H04L67/1059 , H04L67/30 , H04L67/38
摘要： Techniques enable the reduction of bandwidth requirements for peer-to-peer gaming architectures. In some embodiments, these techniques allow differentiation among players to decide which players should receive continuous updates and which should receive periodic updates. For those gaming systems receiving periodic updates, guided artificial intelligence is employed to simulate activity of a game object based on guidance provided by the periodic updates. Conversely, for those gaming systems receiving continuous updates, the continuous updates may be employed to update the activity of the game object rather than simulating the activity.
摘要翻译：技术可以减少对等游戏体系结构的带宽需求。在一些实施例中，这些技术允许玩家之间的区分，以决定哪些玩家应该接收连续的更新，哪些玩家应该接收周期性的更新。对于接收定期更新的那些游戏系统，采用引导人工智能来基于定期更新提供的指导来模拟游戏对象的活动。相反，对于接收连续更新的那些游戏系统，可以采用连续更新来更新游戏对象的活动，而不是模拟活动。

25. 发明授权

US07310644B2 Locating potentially identical objects across multiple computers 有权
标题翻译：在多个计算机上定位潜在的相同对象
公开(公告)号：US07310644B2
公开(公告)日：2007-12-18
申请号：US09876377
申请日：2001-06-06
申请人： Atul Adya , William J. Bolosky , John R. Douceur , Marvin M. Theimer
发明人： Atul Adya , William J. Bolosky , John R. Douceur , Marvin M. Theimer
IPC分类号： G06F17/30
CPC分类号： G06F17/30156
摘要： Potentially identical objects (such as files) across multiple computers are located. In one embodiment, a computer generates object information for an object stored on the computer. The object information can be generated in a variety of manners (e.g., based on hashing the object, based on characteristics of the object, and so forth). The object information is then transferred to one or more database server computers, where the object information can be compared to object information from other computers to determine whether the object is potentially identical to another object on one of the other computers.
摘要翻译：位于多个计算机上的潜在相同对象（如文件）。在一个实施例中，计算机生成存储在计算机上的对象的对象信息。可以以各种方式生成对象信息（例如，基于对象的散列，基于对象的特征等）。然后将对象信息传送到一个或多个数据库服务器计算机，其中可以将对象信息与来自其他计算机的对象信息进行比较，以确定对象是否与其他计算机之一上的另一个对象潜在地相同。

26. 发明授权

US06983365B1 Encryption systems and methods for identifying and coalescing identical objects encrypted with different keys 失效
标题翻译：用于识别和合并用不同密钥加密的相同对象的加密系统和方法
公开(公告)号：US06983365B1
公开(公告)日：2006-01-03
申请号：US09565821
申请日：2000-05-05
申请人： John R. Douceur , William J. Bolosky , Marvin M. Theimer
发明人： John R. Douceur , William J. Bolosky , Marvin M. Theimer
IPC分类号： H04L9/00
CPC分类号： H04L9/3236 , H04L9/3247 , Y10S707/99953 , Y10S707/99955
摘要： Cryptographic protocols and methods of employing the same are described. The described protocols advantageously enable two or more identical encryptable objects that are coded for encryption with different keys to be identified as identical without access to either the unencrypted objects or the keys that are used in the encryption process. Additionally, the protocols enable two or more identical encryptable objects to be processed with different encryption keys, yet be stored in a manner so that the total required storage space is proportional to the space that is required to store a single encryptable object, plus a constant amount for each distinct encryption key. In various embodiments, the encryptable objects comprise files and the cryptographic protocols enable encrypted files to be used in connection with single instance store (SIS) systems.
摘要翻译：描述了使用它们的密码协议和方法。所描述的协议有利地使得被编码用于具有不同密钥的加密的两个或更多个相同的可加密对象被识别为相同，而不访问加密过程中使用的未加密对象或密钥。另外，这些协议允许使用不同的加密密钥来处理两个或多个相同的可加密对象，但是以一定的方式存储，使得所需的总存储空间与存储单个可加密对象所需的空间成正比，加上常数每个不同加密密钥的数量。在各种实施例中，可加密对象包括文件，并且加密协议使加密文件能够与单实例存储（SIS）系统相关联使用。

27. 发明授权

US06546430B2 Negotiating optimum parameters in a system of interconnected components 有权
公开(公告)号：US06546430B2
公开(公告)日：2003-04-08
申请号：US09954470
申请日：2001-09-17
申请人： Donald M. Gray, III , John R. Douceur , Adam Glass
发明人： Donald M. Gray, III , John R. Douceur , Adam Glass
IPC分类号： G06F954
CPC分类号： G06F9/54
摘要： In a network of interconnected multimedia source, transfer, and sink ports, the described subject matter defers port parameter selection until substantially all relevant information is available. Specifically, parameters are negotiated between multiple ports by specifying parameter sets corresponding to the ports. Each parameter set is expressed as a list of constraints on allowable values or ranges of values. When connecting multiple ports, the constraints on their parameter sets are conjoined to form a parameter set intersection. The parameter sets of the ports are limited to values included in the parameter set intersection. Parameter sets relating to other ports are potentially limited based on the intersection results. The conjoining and limiting operations are repeated until the various parameter sets exhibit no further limitations in response to further repetitions. This process is repeated for all port interconnections. Subsequently, values for the port parameters are selected from the limited parameter sets.

28. 发明授权

US06247061B1 Method and computer program product for scheduling network communication packets originating from different flows having unique service requirements 失效
标题翻译：用于调度源自具有独特服务要求的不同流的网络通信分组的方法和计算机程序产品
公开(公告)号：US06247061B1
公开(公告)日：2001-06-12
申请号：US09094045
申请日：1998-06-09
申请人： John R. Douceur , Yoram Bernet , Ofer Bar , Carol Ann Bell , Tsung-Yuan Charles Tai , Rajendra S. Yavatkar
发明人： John R. Douceur , Yoram Bernet , Ofer Bar , Carol Ann Bell , Tsung-Yuan Charles Tai , Rajendra S. Yavatkar
IPC分类号： G06F1516
CPC分类号： H04L47/32 , H04L47/10 , H04L47/21 , H04L47/215 , H04L47/22 , H04L47/2433 , H04L47/2441 , H04L47/28 , H04L47/50 , H04L47/564 , H04L47/60 , H04L47/621 , H04L47/627
摘要： A method and computer program product for scheduling network communication packets in a multimedia environment where different packet streams have reservations of network bandwidth to form packet flows. The present invention divides the packet scheduling function into distinct components that may be implemented as separate drivers in a layered driver environment as exists, for example, in the Microsoft Windows NT operating system. One component is called a conformer and will generate and assign to each packet in the packet flow at least one conformance time that signifies the earliest a packet may be sent and still conform to the network resource requirements associated with the flow. Many different conformance algorithms can be supported so that the best algorithm is used for a particular packet flow and the service requirements that it represents. Should it be necessary to actually hold a packet until the conformance time is met, a shaper component is used to delay the packets. Finally, a sequencer component will send packets out as fast as possible over the network interface card. Each flow of packets processed by the sequencer component has at least two priorities, one for when the packets are conforming and one for when the packets are non-conforming. The sequencer component maintains priority lists of packet flow queues and will service the highest priority queue list followed by each successive priority list until no packets remain for transmission or the network interface card is unable to handle more packets. Each priority list will have a queue discipline associated therewith that will determine in what order the packets are taken off of the respective flow queues.
摘要翻译：一种用于在多媒体环境中调度网络通信分组的方法和计算机程序产品，其中不同分组流具有网络带宽的预留以形成分组流。本发明将分组调度功能划分为不同的组件，其可以被实现为分层驱动程序环境中的独立驱动程序，例如在Microsoft Windows NT操作系统中。一个组件被称为构图器，并且将生成并分配给分组流中的每个分组至少一个一致的时间，其表示分组可以被发送的最早的一致性，并且仍然符合与流相关联的网络资源需求。可以支持许多不同的一致性算法，以便将最佳算法用于特定数据包流及其所代表的服务要求。如果需要在一致性时间之前实际保存数据包，则会使用整形器来延迟数据包。最后，定序器组件将通过网络接口卡尽快发送数据包。由定序器组件处理的每个流的流具有至少两个优先级，一个用于当数据包一致时，一个用于当数据包不符合时。定序器组件保持分组流队列的优先级列表，并且将服务于优先级最高的队列列表，随后是每个连续的优先级列表，直到没有分组保留用于传输或网络接口卡不能处理更多分组。每个优先级列表将具有与其相关联的队列规则，其将以什么顺序确定分组从相应的流队列中取走。

29. 发明授权

US6134596A Continuous media file server system and method for scheduling network resources to play multiple files having different data transmission rates 失效
标题翻译：连续媒体文件服务器系统和方法，用于调度网络资源，播放具有不同数据传输速率的多个文件
公开(公告)号：US6134596A
公开(公告)日：2000-10-17
申请号：US934972
申请日：1997-09-18
申请人： William J. Bolosky , John R. Douceur
发明人： William J. Bolosky , John R. Douceur
IPC分类号： H04L12/56 , H04L29/06 , H04L29/08 , H04N21/21 , H04N21/23 , G06F15/16 , G06F15/167
CPC分类号： H04L65/4084 , H04L29/06 , H04L49/90 , H04L67/1097 , H04L67/325 , H04L69/329 , H04N21/21 , H04N21/23 , H04L29/06027
摘要： A continuous media file server system has a controller connected to multiple data servers. Each data server supports at least one storage disk. Data files are distributed across the data servers so that data blocks of the data files are stored on each of the storage disks. The data files have different data transmission rates at which they are served over a network to clients in the form of data streams. A scheduling unit maintains a network schedule that provides a relative ordering of transmission times of requested data streams. The transmission times indicate when the data servers are to transmit corresponding data blocks of the requested data files over the network to stream the data to clients. The block play times for all data files have a fixed duration, with the size of the data blocks from data file to data file varying according to the data transmission rates of the files. When a transmission time for a data file block approaches, the scheduling unit instructs the appropriate data server to read a data block for that data file from the disk prior to the transmission time in the network schedule. In this manner, disk reads are scheduled implicitly according to the network schedule. The data is temporarily stored in buffer memory, and later transmitted over the network. When a request for a new data stream is received, the scheduling unit evaluates whether the new data stream can be inserted into the network schedule without overburdening the data servers' ability to serve the existing data streams on the network schedule.
摘要翻译：连续的媒体文件服务器系统具有连接到多个数据服务器的控制器。每个数据服务器至少支持一个存储磁盘。数据文件分布在数据服务器上，使数据文件的数据块存储在每个存储磁盘上。数据文件具有不同的数据传输速率，它们以数据流的形式通过网络向客户端提供服务。调度单元维护提供所请求数据流的传输时间的相对排序的网络调度。传输时间表示数据服务器何时通过网络传输所请求的数据文件的相应数据块，以将数据流传输到客户端。所有数据文件的块播放时间具有固定的持续时间，数据块的数据块的大小根据文件的数据传输速率而变化。当数据文件块的传输时间接近时，调度单元指示适当的数据服务器在网络调度中的发送时间之前从盘读取该数据文件的数据块。以这种方式，磁盘读取根据网络调度隐含调度。数据临时存储在缓冲存储器中，然后通过网络传输。当接收到对新的数据流的请求时，调度单元评估新数据流是否可以被插入到网络调度中，而不会使数据服务器在网络调度上服务于现有数据流的能力过高。

30. 发明授权

US5838893A Method and system for remapping physical memory 失效
标题翻译：重新映射物理内存的方法和系统
公开(公告)号：US5838893A
公开(公告)日：1998-11-17
申请号：US777165
申请日：1996-12-26
申请人： John R. Douceur
发明人： John R. Douceur
IPC分类号： G06F12/02 , G11C29/00 , G06F11/22 , G06F12/00
CPC分类号： G11C29/76 , G06F12/02 , G11C29/88
摘要： A method and system for remapping physical memory that is malfunctioning. The physical memory has memory locations with addresses. The addresses are ordered from a lowest to a highest address, and each address has bits ordered from a highest-order bit to a lowest-order bit. The system scans physical memory to determine which memory locations are malfunctioning. The system identifies a lowest address and a highest address of the memory locations that are malfunctioning. The system then identifies the highest-order, contiguous bits of the lowest address that are the same as the highest-order, contiguous bits of the highest address. The system generates a remapping value whose highest-order bits are equal to the inverse of the identified highest-order, contiguous bits of the address and whose lowest-order bits are all zeroes. When the system receives an address to access physical memory, the system generates a remapped address by performing a bitwise exclusive-OR of the received address with the remapping value. The system then accesses physical memory using the generated remapped address.
摘要翻译：用于重新映射故障的物理内存的方法和系统。物理内存具有地址的存储单元。地址从最低地址排序到最高地址，每个地址都有从最高位到低位的位。系统扫描物理内存以确定哪些内存位置发生故障。系统识别故障的存储器位置的最低地址和最高地址。然后，系统识别与最高地址的最高位连续位相同的最低地址的最高位连续位。该系统产生一个重映射值，其最高位与所识别的地址的最高位连续比特的倒数相等，其最低位都全为零。当系统接收访问物理存储器的地址时，系统通过执行接收到的地址与重映射值的按位异或来生成重映射地址。然后，系统使用生成的重映射地址访问物理内存。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式