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

1. 发明授权

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操作系统中。一个组件被称为构图器，并且将生成并分配给分组流中的每个分组至少一个一致的时间，其表示分组可以被发送的最早的一致性，并且仍然符合与流相关联的网络资源需求。可以支持许多不同的一致性算法，以便将最佳算法用于特定数据包流及其所代表的服务要求。如果需要在一致性时间之前实际保存数据包，则会使用整形器来延迟数据包。最后，定序器组件将通过网络接口卡尽快发送数据包。由定序器组件处理的每个流的流具有至少两个优先级，一个用于当数据包一致时，一个用于当数据包不符合时。定序器组件保持分组流队列的优先级列表，并且将服务于优先级最高的队列列表，随后是每个连续的优先级列表，直到没有分组保留用于传输或网络接口卡不能处理更多分组。每个优先级列表将具有与其相关联的队列规则，其将以什么顺序确定分组从相应的流队列中取走。

2. 发明授权

US6105039A Generation and validation of reference handles 失效
标题翻译：参考手柄的生成和验证
公开(公告)号：US6105039A
公开(公告)日：2000-08-15
申请号：US103334
申请日：1998-06-23
申请人： John R. Douceur , Yoram Bernet , Ofer Bar
发明人： John R. Douceur , Yoram Bernet , Ofer Bar
IPC分类号： G06F9/46 , G06F9/44 , G06F9/50 , G06F17/30
CPC分类号： G06F9/5016 , G06F9/4435 , Y10S707/99932 , Y10S707/99939 , Y10S707/99952
摘要： The present invention is embodied in a system and method for generating and validating reference handles for consumers requiring access to resources in a computer system. The system of the present invention includes a resource manager having a handle administrator, a plurality of consumers, and a plurality of resources. The handle administrator includes an assignment routine, a release routine, and a dereference routine. The assignment routine issues new handles, the release routine releases handles that are no longer required (thus rendering the handle invalid), and the dereference routine dereferences handles into a pointer to a resource, which entails verifying that the handle is valid. Also included is an auxiliary sub-routine for managing used and unused records, an expansion sub-routine for efficiently expanding the handle database, a handle recycling sub-routine for recycling handles, a contraction sub-routine for efficiently contracting the handle database, a hysteresis sub-routine for probabilistically contracting the handle database, and a memory allocation failure sub-routine to improve functionality in the event of memory allocation failure.
摘要翻译：本发明体现在用于生成和验证需要访问计算机系统中的资源的消费者的参考手柄的系统和方法中。本发明的系统包括具有句柄管理员，多个消费者和多个资源的资源管理器。句柄管理员包括分配例程，释放例程和取消引用例程。分配例程发出新的句柄，释放例程释放不再需要的句柄（从而使句柄无效），解引用例程解引用句柄转换为指向资源的指针，这需要验证句柄是否有效。还包括用于管理使用和未使用的记录的辅助子例程，用于有效地扩展句柄数据库的扩展子程序，用于回收句柄的句柄回收子例程，用于有效地收缩句柄数据库的收缩子例程用于概率地收缩句柄数据库的滞后子程序，以及在存储器分配失败的情况下改善功能的存储器分配故障子例程。

3. 发明授权

US06178423B1 System and method for recycling numerical values in a computer system 失效
标题翻译：用于在计算机系统中回收数值的系统和方法
公开(公告)号：US06178423B1
公开(公告)日：2001-01-23
申请号：US09103089
申请日：1998-06-23
申请人： John R. Douceur , Yoram Bernet , Ofer Bar
发明人： John R. Douceur , Yoram Bernet , Ofer Bar
IPC分类号： G06F1730
CPC分类号： G06F9/50 , Y10S707/99939 , Y10S707/99942 , Y10S707/99953
摘要： The present invention is embodied in a system and method for generating and validating reference handles for consumers requiring access to resources in a computer system. The system of the present invention includes a resource manager having a handle administrator, a plurality of consumers, and a plurality of resources. The handle administrator includes an assignment routine, a release routine, and a dereference routine. The assignment routine issues new handles, the release routine releases handles that are no longer required (thus rendering the handle invalid), and the dereference routine dereferences handles into a pointer to a resource, which entails verifying that the handle is valid. Also included is an auxiliary sub-routine for managing used and unused records, an expansion sub-routine for efficiently expanding the handle database, a handle recycling sub-routine for recycling handles, a contraction sub-routine for efficiently contracting the handle database, a hysteresis sub-routine for probabilistically contracting the handle database, and a memory allocation failure sub-routine to improve functionality in the event of memory allocation failure.
摘要翻译：本发明体现在用于生成和验证需要访问计算机系统中的资源的消费者的参考手柄的系统和方法中。本发明的系统包括具有句柄管理员，多个消费者和多个资源的资源管理器。句柄管理员包括分配例程，释放例程和取消引用例程。分配例程发出新的句柄，释放例程释放不再需要的句柄（从而使句柄无效），解引用例程解引用句柄转换为指向资源的指针，这需要验证句柄是否有效。还包括用于管理使用和未使用的记录的辅助子例程，用于有效地扩展句柄数据库的扩展子程序，用于回收句柄的句柄回收子例程，用于有效地收缩句柄数据库的收缩子例程用于概率地收缩句柄数据库的滞后子程序，以及在存储器分配失败的情况下改善功能的存储器分配故障子例程。

4. 发明授权

US6105038A Hysteresis system and method for achieving a mean constant cost per action in a computer system 失效
标题翻译：用于在计算机系统中实现每个动作的平均恒定成本的滞后系统和方法
公开(公告)号：US6105038A
公开(公告)日：2000-08-15
申请号：US103087
申请日：1998-06-23
申请人： John R. Douceur , Yoram Bernet , Ofer Bar
发明人： John R. Douceur , Yoram Bernet , Ofer Bar
IPC分类号： G06F9/50 , G06F17/00
CPC分类号： G06F9/50 , Y10S707/99932 , Y10S707/99945 , Y10S707/99952
摘要： The present invention is embodied in a system and method for generating and validating reference handles for consumers requiring access to resources in a computer system. The system of the present invention includes a resource manager having a handle administrator, a plurality of consumers, and a plurality of resources. The handle administrator includes an assignment routine, a release routine, and a dereference routine. The assignment routine issues new handles, the release routine releases handles that are no longer required (thus rendering the handle invalid), and the dereference routine dereferences handles into a pointer to a resource, which entails verifying that the handle is valid. Also included is an auxiliary sub-routine for managing used and unused records, an expansion sub-routine for efficiently expanding the handle database, a handle recycling sub-routine for recycling handles, a contraction sub-routine for efficiently contracting the handle database, a hysteresis sub-routine for probabilistically contracting the handle database, and a memory allocation failure sub-routine to improve functionality in the event of memory allocation failure.
摘要翻译：本发明体现在用于生成和验证需要访问计算机系统中的资源的消费者的参考手柄的系统和方法中。本发明的系统包括具有句柄管理员，多个消费者和多个资源的资源管理器。句柄管理员包括分配例程，释放例程和取消引用例程。分配例程发出新的句柄，释放例程释放不再需要的句柄（从而使句柄无效），解引用例程解引用句柄转换为指向资源的指针，这需要验证句柄是否有效。还包括用于管理使用和未使用的记录的辅助子例程，用于有效地扩展句柄数据库的扩展子程序，用于回收句柄的句柄回收子例程，用于有效地收缩句柄数据库的收缩子例程用于概率地收缩句柄数据库的滞后子程序，以及在存储器分配失败的情况下改善功能的存储器分配故障子例程。

5. 发明授权

US06185568B2 Classifying data packets processed by drivers included in a stack 有权
标题翻译：对包含在堆栈中的驱动程序进行处理的数据包进行分类
公开(公告)号：US06185568B2
公开(公告)日：2001-02-06
申请号：US09333797
申请日：1999-06-15
申请人： John R. Douceur , Yoram Bernet , Ofer Bar
发明人： John R. Douceur , Yoram Bernet , Ofer Bar
IPC分类号： G06F1730
CPC分类号： H04L67/322 , H04L29/06 , H04L69/22 , H04L69/32 , H04L69/324 , H04L69/329
摘要： A method and computer program product for classifying data being processed by drivers included in a stack. The computer program product is a centralized packet classifier that receives classification requests from drivers or other clients according to a defined interface. This reduces the cost for producing a driver since less code is required initially at development time as well as a corresponding reduction in maintenance costs. The present invention groups drivers or other clients that utilize a certain body of classification information into classification families. Further, reference patterns used to make classifications are stored in separate databases depending on whether they are specific or general. There exists a single specific pattern database for all specific reference patterns regardless of classification family having a constant search time and a general pattern database for each general reference pattern for each classification family defined to the system whose search time may vary according to the amount of information contained therein. When servicing a classification request, the packet classifier will first search the specific pattern database followed by a search in the appropriate general pattern database if necessary.
摘要翻译：一种方法和计算机程序产品，用于对由堆栈中包括的驱动程序正在处理的数据进行分类。计算机程序产品是一种集中式分组分类器，根据定义的接口从驱动程序或其他客户端接收分类请求。这降低了生产驱动器的成本，因为最初在开发时需要较少的代码以及相应的维护成本降低。本发明将驱动器或其他客户机组合到分类系列中，这些客户将特定身份的分类信息用于分类系列。此外，用于分类的参考模式存储在单独的数据库中，具体取决于它们是特定的还是一般的。存在用于所有特定参考模式的单个特定模式数据库，而不管具有恒定搜索时间的分类系列，以及针对系统定义的每个分类系列的每个通用参考模式的通用模式数据库，其搜索时间可根据信息量而变化其中包含。当对分类请求进行处理时，如果需要，分组分类器将首先搜索特定模式数据库，然后在适当的通用模式数据库中进行搜索。

6. 发明授权

US06185564B2 Generation and validation of reference handles in a multithreading environment 失效
标题翻译：多线程环境中引用句柄的生成和验证
公开(公告)号：US06185564B2
公开(公告)日：2001-02-06
申请号：US09103297
申请日：1998-06-23
申请人： John R. Douceur , Yoram Bernet , Ofer Bar
发明人： John R. Douceur , Yoram Bernet , Ofer Bar
IPC分类号： G06F1730
CPC分类号： G06F9/52 , Y10S707/99932 , Y10S707/99939
摘要： The present invention is embodied in a system and method for generating and validating reference handles for consumers requiring access to resources in a multi-threaded environment of a computer system. The system of the present invention includes a resource manager having a handle administrator, a plurality of consumers, and a plurality of resources. The handle administrator includes an assignment routine, a release routine, a dereference routine, and multi-threading sub-routines enabling operation of the present invention in multi-threaded environments. The assignment routine issues new handles, the release routine releases handles that are no longer required (thus rendering the handle invalid), the dereference routine dereferences handles into a pointer to a resource, which entails verifying that the handle is valid, and the multi-threading sub-routines enable safe invalidation of handles in multi-threaded environments and also ensure consistent use of pertinent values, such as array pointers and array sizes during operation of the expansion and contraction sub-routines.
摘要翻译：本发明体现在用于生成和验证需要访问计算机系统的多线程环境中的资源的消费者的参考句柄的系统和方法中。本发明的系统包括具有句柄管理员，多个消费者和多个资源的资源管理器。句柄管理员包括使得能够在多线程环境中操作本发明的分配例程，释放例程，取消引用例程和多线程子例程。分配例程发出新的句柄，释放例程释放不再需要的句柄（从而使句柄无效），解引用例程解引用到指向资源的指针，这需要验证句柄是否有效，线程子例程使得多线程环境中句柄的安全无效，并且还确保在扩展和收缩子例程的操作期间一致地使用相关值，例如数组指针和数组大小。

7. 发明授权

US6163777A System and method for reducing location conflicts in a database 失效
标题翻译：减少数据库中的位置冲突的系统和方法
公开(公告)号：US6163777A
公开(公告)日：2000-12-19
申请号：US103333
申请日：1998-06-23
申请人： John R. Douceur , Yoram Bernet , Ofer Bar
发明人： John R. Douceur , Yoram Bernet , Ofer Bar
IPC分类号： G06F17/30
CPC分类号： G06F17/30348 , Y10S707/99932 , Y10S707/99938 , Y10S707/99952
摘要： The present invention is embodied in a system and method for reducing the likelihood of the location conflicts in a system with a database of records having an initial size. A logical location of each record is dependent upon data contained in each record and the database size and wherein a change in the database size by a resizing factor creates a likelihood of a location conflict between two records. The present invention reduces the likelihood of the location conflict by maintaining a first list of unused records, wherein the first list contains unused records that, if used, would not have location conflicts with any record currently used and would not have location conflicts with any other records contained in the first list. Also, a second list of unused records is maintained, wherein the second list contains unused records that are not contained in the first list. An unused record from the first list is selected if the first list is not empty when a datum is added to the database and an unused record from the second list is selected only if the first list is empty when a datum is added to the database.
摘要翻译：本发明体现在用于减少具有初始大小的记录数据库的系统中位置冲突的可能性的系统和方法中。每个记录的逻辑位置取决于每个记录中包含的数据和数据库大小，并且其中通过调整大小因子的数据库大小的变化导致两个记录之间的位置冲突的可能性。本发明通过维护未使用的记录的第一列表来减少位置冲突的可能性，其中第一列表包含未使用的记录，如果使用的话，与当前使用的任何记录不存在位置冲突，并且不会与任何其他记录存在位置冲突记录包含在第一个列表中。此外，维护未使用记录的第二列表，其中第二列表包含未包含在第一列表中的未使用的记录。如果在将数据添加到数据库中时第一个列表不为空，并且仅当第一个列表在将数据添加到数据库时第一个列表为空时，才从第二个列表中选择未使用的记录，则选择来自第一个列表的未使用的记录。

8. 发明授权

US5995971A Apparatus and accompanying methods, using a trie-indexed hierarchy forest, for storing wildcard-based patterns and, given an input key, retrieving, from the forest, a stored pattern that is identical to or more general than the key 失效
标题翻译：用于存储基于通配符的模式的装置和伴随方法，用于存储基于通配符的模式，并且给定输入密钥从森林中检索与密钥相同或更一般的存储模式
公开(公告)号：US5995971A
公开(公告)日：1999-11-30
申请号：US933477
申请日：1997-09-18
申请人： John R. Douceur , Ofer Bar , Yoram Bernet
发明人： John R. Douceur , Ofer Bar , Yoram Bernet
IPC分类号： G06F17/30
CPC分类号： G06F17/30961 , Y10S707/99933 , Y10S707/99943
摘要： A technique, specifically apparatus and accompanying methods, which utilizes a trie-indexed hierarchy forest ("rhizome") that accommodates wildcards for retrieving, given a specific input key, a pattern stored in the forest that is identical to or subsumes the key. The rhizome contains a binary search trie and a hierarchy forest. The search trie provides an indexed path to each unique, most specific, pattern stored in a lowest level of the hierarchy forest and also possibly to increasingly general patterns at higher levels in the pattern hierarchy. The hierarchy forest organizes the patterns into nodal hierarchies of strictly increasing generality. For use as a packet classifier, the rhizome stores wildcard-based packet classification patterns at separate corresponding pattern nodes, along with, corresponding "reference" fields associated therewith. Operationally, as each different queue is established or removed, a corresponding classification pattern is either inserted into or removed from the rhizome. A search key is formed for each packet, typically by concatenating classification fields, e.g., source and destination addresses and source and destination port designations, appearing in a header of the packet. The search key is then applied to the rhizome to determine whether that key exists therein, by virtue of either matching an identical classification pattern or being completely subsumed within a more general pattern stored therein. When such a classification is found, the classifier returns the contents of the associated reference field, which for scheduling, is a designation of a transmission queue to which the packet is to be directed.
摘要翻译：一种技术，具体是装置和伴随的方法，其利用特定索引层级林（“根茎”），其适应通配符，以在给定特定输入密钥的情况下检索与森林中存储的模式相同或包含密钥。根茎含有二分搜索特技和层级森林。搜索特技提供了存储在层次结构林的最低级别中的每个独特的，最具体的模式的索引路径，并且还可能在模式层次结构中的较高级别的日益普遍的模式。层次结构林将模式组织成具有严格增加的普遍性的节点等级。为了用作分组分类器，根茎在单独的相应模式节点上存储基于通配符的分组分类模式，以及与其相关联的相应“参考”字段。在操作上，随着每个不同的队列被建立或删除，相应的分类模式被插入或从根茎去除。通常通过连接出现在分组的报头中的分类字段（例如源和目的地址以及源和目的地端口名称）来为每个分组形成搜索关键字。然后将搜索关键字应用于根茎，以通过匹配相同的分类模式或完全包含在其中存储的更一般的模式中来确定该密钥是否存在于其中。当发现这样的分类时，分类器返回相关联的参考字段的内容，其用于调度，是分组要被引导到的传输队列的指定。

9. 发明授权

US5956721A Method and computer program product for classifying network communication packets processed in a network stack 失效
标题翻译：用于对在网络堆栈中处理的网络通信分组进行分类的方法和计算机程序产品
公开(公告)号：US5956721A
公开(公告)日：1999-09-21
申请号：US933868
申请日：1997-09-19
申请人： John R. Douceur , Yoram Bernet , Ofer Bar
发明人： John R. Douceur , Yoram Bernet , Ofer Bar
IPC分类号： G06F13/00 , H04L12/56 , H04L29/06 , H04L29/08 , G06F17/30
CPC分类号： H04L67/322 , H04L29/06 , H04L69/324 , H04L69/22 , H04L69/32 , H04L69/329
摘要： A method and computer program product for classifying network communication packets being processed in a network stack. The computer program product is a centralized packet classifier that receives classification requests from drivers or other clients according to a defined interface. This reduces the cost for producing a driver since less code is required initially at development time as well as a corresponding reduction in maintenance costs. The present invention groups drivers or other clients that utilize a certain body of classification information into classification families. Further, reference patterns used to make classifications are stored in separate databases depending on whether they are specific or general. There exists a single specific pattern database for all specific reference patterns regardless of classification family having a constant search time and a general pattern database for each general reference pattern for each classification family defined to the system whose search time may vary according to the amount of information contained therein. When servicing a classification request, the packet classifier will first search the specific pattern database followed by a search in the appropriate general pattern database if necessary.
摘要翻译：一种用于对在网络堆栈中正在处理的网络通信分组进行分类的方法和计算机程序产品。计算机程序产品是一种集中式分组分类器，根据定义的接口从驱动程序或其他客户端接收分类请求。这降低了生产驱动器的成本，因为最初在开发时需要较少的代码以及相应的维护成本降低。本发明将驱动器或其他客户机组合到分类系列中，这些客户将特定身份的分类信息用于分类系此外，用于分类的参考模式存储在单独的数据库中，具体取决于它们是特定的还是一般的。存在用于所有特定参考模式的单个特定模式数据库，而不管具有恒定搜索时间的分类系列，以及针对系统定义的每个分类系列的每个通用参考模式的通用模式数据库，其搜索时间可根据信息量而变化其中包含。当对分类请求进行处理时，如果需要，分组分类器将首先搜索特定模式数据库，然后在适当的通用模式数据库中进行搜索。

10. 发明授权

US6041053A Technique for efficiently classifying packets using a trie-indexed hierarchy forest that accommodates wildcards 失效
标题翻译：使用适合通配符的特里索引索引层次结构林来有效分类数据包的技术
公开(公告)号：US6041053A
公开(公告)日：2000-03-21
申请号：US933476
申请日：1997-09-18
申请人： John R. Douceur , Ofer Bar , Yoram Bernet
发明人： John R. Douceur , Ofer Bar , Yoram Bernet
IPC分类号： H04L12/56 , H04L12/28 , G06F15/16 , G06F17/30
CPC分类号： H04L47/2441 , H04L45/00 , H04L45/742 , H04L47/2408 , Y10S707/99933
摘要： A technique, specifically apparatus and accompanying methods, which utilizes a trie-indexed hierarchy forest ("rhizome") that accommodates wildcards for retrieving, given a specific input key, a pattern stored in the forest that is identical to or subsumes the key. The rhizome contains a binary search trie and a hierarchy forest. The search trie provides an indexed path to each unique, most specific, pattern stored in a lowest level of the hierarchy forest and also possibly to increasingly general patterns at higher levels in the pattern hierarchy. The hierarchy forest organizes the patterns into nodal hierarchies of strictly increasing generality. For use as a packet classifier, the rhizome stores wildcard-based packet classification patterns at separate corresponding pattern nodes, along with, corresponding "reference" fields associated therewith. Operationally, as each different queue is established or removed, a corresponding classification pattern is either inserted into or removed from the rhizome. A search key is formed for each packet, typically by concatenating classification fields, e.g. source and destination addresses and source and destination port designations, appearing in a header of the packet. The search key is then applied to the rhizome to determine whether that key exists therein, by virtue of either matching an identical classification pattern or being completely subsumed within a more general pattern stored therein. When such a classification is found, the classifier returns the contents of the associated reference field, which for scheduling, is a designation of a transmission queue to which the packet is to be directed.
摘要翻译：一种技术，具体是装置和伴随的方法，其利用特定索引层级林（“根茎”），其适应通配符，以在给定特定输入密钥的情况下检索与森林中存储的模式相同或包含密钥。根茎含有二分搜索特技和层级森林。搜索特技提供了存储在层次结构林的最低级别中的每个独特的，最具体的模式的索引路径，并且还可能在模式层次结构中的较高级别的日益普遍的模式。层次结构林将模式组织成具有严格增加的普遍性的节点等级。为了用作分组分类器，根茎在单独的相应模式节点上存储基于通配符的分组分类模式，以及与其相关联的相应“参考”字段。在操作上，随着每个不同的队列被建立或删除，相应的分类模式被插入或从根茎去除。通常通过连接分类字段来为每个分组形成搜索关键字，例如，源和目标地址以及出现在数据包标题中的源和目标端口名称。然后将搜索关键字应用于根茎，以通过匹配相同的分类模式或完全包含在其中存储的更一般的模式中来确定该密钥是否存在于其中。当发现这样的分类时，分类器返回相关联的参考字段的内容，其用于调度，是分组要被引导到的传输队列的指定。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式