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

1. 发明授权

US06498781B1 Self-tuning link aggregation system 失效
标题翻译：自调整链路聚合系统
公开(公告)号：US06498781B1
公开(公告)日：2002-12-24
申请号：US09374003
申请日：1999-08-13
申请人： Brian Mitchell Bass , Jean Louis Calvignac , Marco C. Heddes , Clark Debs Jeffries , Loren Douglas Larsen , Jeffrey James Lynch , Mark Anthony Rinaldi , Michael Steven Siegel
发明人： Brian Mitchell Bass , Jean Louis Calvignac , Marco C. Heddes , Clark Debs Jeffries , Loren Douglas Larsen , Jeffrey James Lynch , Mark Anthony Rinaldi , Michael Steven Siegel
IPC分类号： H04L1226
CPC分类号： H04L41/5025 , H04L43/0829 , H04L43/16
摘要： A data processing system and method in a computer network are disclosed for improving performance of a link aggregation system included in the network. Parameters are established which are utilized to determine performance criteria of the link aggregation system. A performance of the link aggregation system is determined by determining the performance criteria. The performance of the link aggregation system changes in response to a flow traffic burden on the link aggregation system changing. The link aggregation system dynamically modifies the parameters in response to the changing performance of the link aggregation system. The link aggregation system is self-tuning and capable of automatically adjusting to a changing flow traffic burden on the link aggregation system.
摘要翻译：公开了一种计算机网络中的数据处理系统和方法，用于改善网络中包括的链路聚合系统的性能。建立了用于确定链路聚合系统性能标准的参数。通过确定性能标准来确定链路聚合系统的性能。链路聚合系统的性能响应链路聚合系统的流量负担变化而变化。链路聚合系统根据链路聚合系统的性能变化动态修改参数。链路聚合系统是自调整的，能够自动调整链路聚合系统上流量流量负担的变化。

2. 发明授权

US06728253B1 Mixed queue scheduler 失效
标题翻译：混合队列调度程序
公开(公告)号：US06728253B1
公开(公告)日：2004-04-27
申请号：US09405691
申请日：1999-09-24
申请人： Clark Debs Jeffries , Marco C. Heddes , Mark Anthony Rinaldi , Michael Steven Siegel
发明人： Clark Debs Jeffries , Marco C. Heddes , Mark Anthony Rinaldi , Michael Steven Siegel
IPC分类号： H04L1256
CPC分类号： H04L47/50 , H04L2012/5682
摘要： A method and system are disclosed for allocating data input bandwidth from a source link to a plurality of N data queues each having a variable occupancy value, Qi(t), and a constant decrement rate, Di, where i designated the ith queue among the N queues. First, a threshold occupancy value, T, is designated for the N queues. During each time step of a repeating time interval, &Dgr;t, the occupancy value, Qi, is compared with T. In response to each and every of said N data queues having occupancy values exceeding T, pausing data transmission from the source link to the N data queues, such that overflow within the data queues is minimized. In response to at least one of the N data queues having an occupancy value less than or equal to T, selecting one among the N data queues to be incremented, and incrementing the selected data queue, such that underflow of the selected queue is minimized. In the context of scheduling one cell per time step, the value of T is one. Furthermore, the method of the present invention guarantees that output port occupancy shall never, in that context, exceed two cells.
摘要翻译：公开了一种用于将数据输入带宽从源链路分配给多个N个数据队列的方法和系统，每个N个数据队列具有可变占用值Qi（t）和常数递减率Di，其中i指定i < 排队N队列。首先，为N个队列指定阈值占有率T。在重复时间间隔的每个时间步长，Deltat，占用值Qi与T进行比较。响应于具有超过T的占用值的所述N个数据队列中的每一个，暂停从源链路到N的数据传输数据队列，使数据队列中的溢出最小化。响应于具有小于或等于T的占用值的N个数据队列中的至少一个，选择要增加的N个数据队列中的一个，并增加所选择的数据队列，使得所选队列的下溢最小化。在每个时间步长调度一个单元格的上下文中，T的值为1。此外，本发明的方法保证输出端口占用在这方面永远不超过两个小区。

3. 发明授权

US07107265B1 Software management tree implementation for a network processor 失效
标题翻译：网络处理器的软件管理树实现
公开(公告)号：US07107265B1
公开(公告)日：2006-09-12
申请号：US09545100
申请日：2000-04-06
申请人： Jean Louis Calvignac , Marco C. Heddes , Clark Debs Jeffries , Piyush Chunilal Patel , Mark Anthony Rinaldi
发明人： Jean Louis Calvignac , Marco C. Heddes , Clark Debs Jeffries , Piyush Chunilal Patel , Mark Anthony Rinaldi
IPC分类号： G06F17/30 , G06F15/00 , G06F9/44
CPC分类号： H04L45/742 , G06F17/30961 , G06F17/30985 , Y10S707/99933 , Y10S707/99936 , Y10S707/99937
摘要： Novel data structures, methods and apparatus for a Software Managed Tree (SMT) which provides a mechanism to create tree structures that follow a search mechanism defined by a control point processor. The search mechanism does not require storage on the previous pointer and uses only a forward pointer along with a next bit or group of bits to test thereby reducing storage space for nodes. The search mechanism processes multiple filter rules for an application without requiring multiple searches and also allows various filter rules to be chained. Two patterns of the same length are stored in each leaf to define a range compare. A compare at the end operation is either a compare under range or a compare under mask. In a compare under range, the input key is checked to determine if it is in the range defined by the two patterns. In a compare under mask, the bits in the input key are compared with the bits in a first leaf pattern under a mask specified in a second leaf pattern.
摘要翻译：用于软件管理树（SMT）的新型数据结构，方法和装置，其提供了一种机制，用于创建遵循由控制点处理器定义的搜索机制的树结构。搜索机制不需要在前一个指针上存储，并且仅使用前向指针以及下一个位或一组位来进行测试，从而减少节点的存储空间。搜索机制处理应用程序的多个过滤器规则，而不需要多次搜索，并且还允许链接各种过滤器规则。在每个叶中存储相同长度的两个图案以定义范围比较。在最终操作中的比较是在范围之下的比较或掩码下的比较。在范围比较范围内，检查输入键以确定是否在两种模式定义的范围内。在掩码下的比较中，将输入密钥中的比特与在第二叶图案中指定的掩码下的第一叶图案中的比特进行比较。

4. 发明授权

US06298340B1 System and method and computer program for filtering using tree structure 失效
标题翻译：使用树结构进行过滤的系统和方法以及计算机程序
公开(公告)号：US06298340B1
公开(公告)日：2001-10-02
申请号：US09312148
申请日：1999-05-14
申请人： Jean Louis Calvignac , Everett Arthur Corl, Jr. , Anthony Matteo Gallo , Marco C. Heddes , Clark Debs Jeffries , Piyush Chunilal Patel , Mark Anthony Rinaldi , Colin Beaton Verrilli
发明人： Jean Louis Calvignac , Everett Arthur Corl, Jr. , Anthony Matteo Gallo , Marco C. Heddes , Clark Debs Jeffries , Piyush Chunilal Patel , Mark Anthony Rinaldi , Colin Beaton Verrilli
IPC分类号： G06F1730
CPC分类号： G06F17/30961 , Y10S707/99931 , Y10S707/99933 , Y10S707/99943 , Y10S707/99944
摘要： A classification system includes a software managed tree testing bits from a key which labels an item. The bits are chosen by application of the Choice Bit Algorithm to the Rules in a Database of Rules. A controller including logic parses an unknown Key for bits to be tested in the decision nodes of a binary tree. Tests dictated by the tree are conducted in a predetermined way until all but one Rule from the database or all but a few Rules from the database are eliminated from consideration, whereupon the Key is fully tested by the one remaining Rule or in a lattice constructed of the remaining plurality of Rules, to determine an action to enforce on the item. Certain compare tests are used in the binary tree for the case that otherwise identical or similar rules are applied to integer ranges of key values which do not fall upon power of 2 boundaries. Furthermore, some very frequently occurring rules in such final tests might be designated as secondary rules, the remaining rules designated as primary rules, the entire decision tree recalculated using only primary rules, and the primary rules then connected to secondary rules only when logically necessary by means of a system of pointers making use of relative priorities of rules.
摘要翻译：分类系统包括从标签项目的键的软件管理树测试位。通过将选择位算法应用于规则数据库中的规则来选择位。包含逻辑的控制器在二叉树的决策节点中解析要测试的位的未知密钥。由树进行的测试以预定的方式进行，直到从数据库中除了一个规则之外的所有除了数据库中的所有规则或从数据库中除了少数几个规则之外的所有测试都被消除，由此Key被完整的一个规则或由剩余的多个规则，以确定对该项目执行的操作。在二叉树中使用某些比较测试，否则相同或相似的规则应用于不落在2边界的幂的关键值的整数范围。此外，这些最终测试中的一些非常频繁出现的规则可能被指定为次要规则，剩余的规则被指定为主要规则，仅使用主要规则重新计算的整个决策树，然后仅在逻辑上必要时连接到次级规则的主要规则使用指针的相对优先级的指针系统的手段。

5. 发明授权

US06657962B1 Method and system for managing congestion in a network 失效
标题翻译：管理网络拥塞的方法和系统
公开(公告)号：US06657962B1
公开(公告)日：2003-12-02
申请号：US09546651
申请日：2000-04-10
申请人： Peter Irma August Barri , Brian Mitchell Bass , Jean Louis Calvignac , Ivan Oscar Clemminck , Marco C. Heddes , Clark Debs Jeffries , Michael Steven Siegel , Fabrice Jean Verplanken , Miroslav Vrana
发明人： Peter Irma August Barri , Brian Mitchell Bass , Jean Louis Calvignac , Ivan Oscar Clemminck , Marco C. Heddes , Clark Debs Jeffries , Michael Steven Siegel , Fabrice Jean Verplanken , Miroslav Vrana
IPC分类号： H04L1256
CPC分类号： H04L47/2441 , H04L47/10 , H04L47/12 , H04L47/30 , H04L47/32 , H04L49/103 , H04L49/3018 , H04L49/50 , H04L49/90
摘要： A system for minimizing congestion in a communication system is disclosed. The system comprises at least one ingress system for providing data. The ingress system includes a first free queue and a first flow queue. The system also includes a first congestion adjustment module for receiving congestion indications from the free queue and the flow queue. The first congestion adjustment module generates end stores transmit probabilities and performs per packet flow control actions. The system further includes a switch fabric for receiving data from the ingress system and for providing a congestion indication to the ingress system. The system further includes at least one egress system for receiving the data from the switch fabric. The egress system includes a second free queue and a second flow queue. The system also includes a second congestion adjustment module for receiving congestion indications from the second free queue and the second flow queue. The second congestion adjustment module generates and stores transmit probabilities and performs per packet flow control actions. Finally, the system includes a scheduler for determining the order and timing of transmission of packets out the egress system and to another node or destination. A method and system in accordance with the present invention provides for a unified method and system for logical connection of congestion with the appropriate flow control responses. The method and system utilizes congestion indicators within the ingress system, egress system, and the switch fabric in conjunction with a coarse adjustment system and fine adjustment system within the ingress device and the egress device to intelligently manage the system.
摘要翻译：公开了一种用于最小化通信系统中的拥塞的系统。该系统包括用于提供数据的至少一个入口系统。入口系统包括第一空闲队列和第一流队列。该系统还包括用于从空闲队列和流队列接收拥塞指示的第一拥塞调整模块。第一拥塞调整模块生成终端存储发送概率并执行每个分组流控制动作。该系统还包括用于从入口系统接收数据并向入口系统提供拥塞指示的交换结构。该系统还包括用于从交换结构接收数据的至少一个出口系统。出口系统包括第二空闲队列和第二流队列。该系统还包括第二拥塞调整模块，用于从第二空闲队列和第二流队列接收拥塞指示。第二拥塞调整模块生成并存储发送概率，并执行每个分组流控制动作。最后，该系统包括一个调度器，用于确定出口系统和另一个节点或目的地的分组传输的顺序和定时。根据本发明的方法和系统提供了用于将拥塞与适当流控制响应逻辑连接的统一方法和系统。该方法和系统利用入口系统，出口系统和交换结构中的拥塞指示符与入口设备和出口设备内的粗调系统和精细调整系统结合，智能地管理系统。

6. 发明授权

US07911960B1 Delayed-start method for minimizing internal switch congestion 失效
标题翻译：用于最小化内部交换机拥塞的延迟启动方法
公开(公告)号：US07911960B1
公开(公告)日：2011-03-22
申请号：US09373837
申请日：1999-08-13
申请人： Metin Aydemir , Marco C. Heddes , Clark Debs Jeffries , Steven Paul Woolet
发明人： Metin Aydemir , Marco C. Heddes , Clark Debs Jeffries , Steven Paul Woolet
IPC分类号： H04L1/00 , H04L12/26 , H04J3/14 , G08C15/00 , G06F11/00
CPC分类号： H04L49/506 , H04L47/266 , H04L47/30
摘要： A data flow control method and system within a data switch. The data switch includes a plurality of input sections each having an associated input buffer and each transmitting data to an output section. In response to a detection of congestion within the output section, data transmissions from the plurality of input sections to the output section are paused. Input buffer occupancies of each of the input sections are then determined. Thereafter, and in response to a backpressure relief signal, the restart of said data transmission from each of the input sections to the output section is delayed in inverse proportion to each of the determined input buffer occupancies.
摘要翻译：数据交换机内的数据流控制方法和系统。数据开关包括多个输入部分，每个输入部分具有相关联的输入缓冲器，并且每个输入部分将数据发送到输出部分。响应于输出部分内的拥塞的检测，暂停从多个输入部分到输出部分的数据传输。然后确定每个输入部分的输入缓冲器占用。此后，并且响应于背压释放信号，从每个输入部分到输出部分的所述数据传输的重新开始被延迟与所确定的输入缓冲器占用中的每一个成反比。

7. 发明授权

US06785278B1 Methods, systems and computer program products for hashing address values 失效
标题翻译：用于散列地址值的方法，系统和计算机程序产品
公开(公告)号：US06785278B1
公开(公告)日：2004-08-31
申请号：US09210222
申请日：1998-12-10
申请人： Jean Louis Calvignac , Marco C. Heddes , Clark Debs Jeffries , Ross Boyd Leavens , Gerald Arnold Marin , Piyush Chunilal Patel , Atef Omar Zaghloul
发明人： Jean Louis Calvignac , Marco C. Heddes , Clark Debs Jeffries , Ross Boyd Leavens , Gerald Arnold Marin , Piyush Chunilal Patel , Atef Omar Zaghloul
IPC分类号： H04L1228
CPC分类号： H04L12/4625 , H04L45/745
摘要： Methods systems and computer program products are provided for hashing address values that exhibit banding in a plurality of regions of an address space defined by at least two segments of the address values, by performing at least one of a translation and a rotation of the at least two segments to thereby map the at least two segments from the plurality of regions to one of the plurality of regions.
摘要翻译：提供了方法系统和计算机程序产品，用于通过执行至少一个地址值的平移和旋转中的至少一个来散列地址值，所述地址值在由地址值的至少两个段定义的地址空间的多个区域中呈现带状从而将多个区域中的至少两个区段映射到多个区域中的一个区域。

8. 发明授权

US06674718B1 Unified method and system for scheduling and discarding packets in computer networks 失效
标题翻译：计算机网络中调度和丢弃数据包的统一方法和系统
公开(公告)号：US06674718B1
公开(公告)日：2004-01-06
申请号：US09547280
申请日：2000-04-11
申请人： Marco C. Heddes , Clark Debs Jeffries
发明人： Marco C. Heddes , Clark Debs Jeffries
IPC分类号： G01R3108
CPC分类号： H04L47/30 , H04L47/10 , H04L47/29
摘要： A method and system for controlling pipes in a computer network is disclosed. The network includes processor(s) having a switch and a queue used for transmitting traffic through the switch. Minimum and maximum flows are set for each pipe. The queue level, any excess bandwidth and offered rate of packets are determined for the queue. A global transmit fraction is controlled using the queue level and offered rate so that the global transmit fraction and queue level are critically damped if the queue level is between certain levels. A transmit fraction for a flow is set to the minimum of the global and differential transmit fractions. The differential transmit fraction linearly increases the flow based on the minimum or maximum flow if excess bandwidth exists and the flow is less than the maximum and exponentially decreases the flow based on the minimum or maximum flow if excess bandwidth does not exist and the flow exceeds the minimum.
摘要翻译：公开了一种用于控制计算机网络中的管道的方法和系统。网络包括具有交换机的处理器和用于通过交换机传输业务的队列。为每个管道设置最小和最大流量。为队列确定队列级别，任何超出的带宽和数据包的提供速率。使用队列级别和提供的速率来控制全局传输分数，使得如果队列级别在某个级别之间，则全局传输分数和队列级别被严重衰减。流的传输分数被设置为全局和差分传输分数的最小值。如果存在超量带宽并且流量小于最大值，则差分传输分数基于最小或最大流量线性增加流量，并且如果超出带宽不存在则基于最小或最大流量指数地减少流量，并且流量超过最低

9. 发明授权

US07054855B2 Method and system for performing a pattern match search for text strings 失效
公开(公告)号：US07054855B2
公开(公告)日：2006-05-30
申请号：US09898253
申请日：2001-07-03
申请人： Claude Basso , Jean Louis Calvignac , Philippe Damon , Gordon Taylor Davis , Marco C. Heddes , Clark Debs Jeffries
发明人： Claude Basso , Jean Louis Calvignac , Philippe Damon , Gordon Taylor Davis , Marco C. Heddes , Clark Debs Jeffries
IPC分类号： G06F17/30
CPC分类号： G06F17/30985 , H04L29/12132 , H04L29/12594 , H04L61/1552 , H04L61/30 , Y10S707/99933 , Y10S707/99942
摘要： A method and system for performing a pattern match search for a data string having a plurality of characters separated by delimiters. In accordance with the method of the present invention a search key is constructed by generating a full match search increment comprising the binary representation of a data string element, wherein the data string element comprises all characters between a pair of delimiters. The search key is completed by concatenating a pattern search prefix to the full match search increment, wherein the pattern search prefix is a cumulative pattern search result of each previous full match search increment. A full match search is then performed within a lookup table utilizing the search key. In response to finding a matching pattern within the lookup table, the process returns to constructing a next search key. In response to not finding a matching pattern, the previous full match search result is utilized to process the data string.

10. 发明授权

US06928162B1 Method and system for manipulating and telescoping a hash function 失效
标题翻译：用于操纵和伸缩散列函数的方法和系统
公开(公告)号：US06928162B1
公开(公告)日：2005-08-09
申请号：US09543674
申请日：2000-04-07
申请人： Marco C. Heddes , Clark Debs Jeffries , Piyush Chunilal Patel
发明人： Marco C. Heddes , Clark Debs Jeffries , Piyush Chunilal Patel
IPC分类号： H04L12/56 , G06F15/00 , H04L9/28
CPC分类号： G06F17/10
摘要： A method and system for providing a hash and a complement of the hash for an item in a computer system are disclosed. The method and system include providing a plurality of components from the item. The plurality of components include a first component and a last component. Each of the plurality of components includes a particular number of bits. The method and system also include cascading the plurality of components through at least one XOR to provide a plurality of resultants. The plurality of resultants includes a first resultant and a final resultant. The final resultant includes only the last component. The first resultant includes an XOR of the first component and remaining cascaded components of the plurality of components. The method and system also include applying an invertible hash function and an invertible hash function complement to at least the first resultant to provide the hash. The complement of the hash includes the plurality of resultants except the first resultant. In another aspect, the method and system include applying the invertible hash function and its complement to at least the first component of the plurality of components, before the plurality of components are cascaded through the at least one XOR. In this aspect, the hash includes the first resultant. The complement of the hash includes the plurality of resultants except the first resultant.
摘要翻译：公开了一种用于为计算机系统中的项提供散列和散列的补码的方法和系统。该方法和系统包括从该项目提供多个组件。多个部件包括第一部件和最后部件。多个组件中的每一个包括特定数量的位。该方法和系统还包括通过至少一个XOR级联多个组件以提供多个结果。多个结果包括第一结果和最终结果。最后的结果只包括最后一个组件。第一结果包括第一组分的XOR和多个组分的剩余级联组分。所述方法和系统还包括对至少第一结果应用可逆散列函数和可逆散列函数补码以提供散列。散列的补码包括除了第一个结果之外的多个结果。在另一方面，所述方法和系统包括在通过所述至少一个XOR级联所述多个组件之前，将所述可逆散列函数及其补码应用于所述多个组件的至少第一组件。在这方面，散列包括第一结果。散列的补码包括除了第一个结果之外的多个结果。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式