公开(公告)号：US07269139B1

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

申请号：US09894199

申请日：2001-06-27

申请人： John J. Williams, Jr. ,  Thomas Dejanovic

发明人： John J. Williams, Jr. ,  Thomas Dejanovic

IPC分类号： H04L12/26

CPC分类号： H04L47/10 ,  H04L47/215 ,  H04L47/266 ,  Y02D50/10

摘要： Methods and apparatus are disclosed for an adaptive rate control mechanism reactive to flow control messages in a packet switching system and other communications and computer systems. Typically, a multiplicative increase and exponential decrease technique is used to throttle traffic. Backpressure feedback is used to calculate the initial rate at which to allow traffic after backpressure is deasserted. This reduces the probability of underrun of buffers (e.g., too little traffic being carried). The adjustment to the initial rate is made by measuring the time between the XON and XOFF in factor periods. Then a target XON time is subtracted. If the result is positive (i.e., the measured XON time was too long), the rate is multiplicatively increased (e.g., by a factor of two to the difference). If the result is negative (i.e., the measured XON time was too short), the rate is exponentially decreased (e.g., by the square root).

摘要翻译： 公开了用于在分组交换系统和其他通信和计算机系统中对流控制消息无效的自适应速率控制机制的方法和装置。 通常，使用乘法增加和指数减少技术来抑制流量。 背压反馈用于计算在反压无效后允许流量的初始速率。 这降低了缓冲器欠载的可能性（例如，传送的流量太少）。 初始速率的调整是通过测量因子周期中XON和XOFF之间的时间来进行的。 然后减去目标XON时间。 如果结果是正的（即，测量的XON时间太长），则速率被乘法地增加（例如，相对于该差异为2倍）。 如果结果为负（即，测量的XON时间太短），则速率被指数地减小（例如，以平方根计）。

公开(公告)号：US07092393B1

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

申请号：US09777095

申请日：2001-02-04

申请人： Gregg Anthony Westbrook ,  Thomas Dejanovic

发明人： Gregg Anthony Westbrook ,  Thomas Dejanovic

IPC分类号： H04L12/56

CPC分类号： H04L49/608 ,  H04L49/15 ,  H04L49/3072 ,  H04L49/552 ,  H04L2012/5652

摘要： Methods and apparatus are disclosed for distributed reassembly of large packets split into smaller packets. Larger packets are split into several smaller packets, which are marked with a sequence number, timestamp, or other ordering and reassembly indications, and sent through a system or network. These smaller packets are received at the destination location by multiple reassembly components, which distribute information as to received packets and coordinate the sending of packets from themselves so as to produce the reassembled larger packets. In one implementation, each of the multiple reassembly components maintains one or more data structures indicating packets stored locally and those packets stored anywhere or elsewhere within the multiple reassembly components. When all smaller packets comprising a larger packet are received by one of the distributed resequencing components, the reassembly components transmit their smaller packets in a coordinated fashion as to produce the original larger packet.

摘要翻译： 公开了用于分组重新分组成较小分组的大分组的方法和装置。 更大的数据包被分成几个更小的数据包，它们被标记为序列号，时间戳或其他排序和重组指示，并通过系统或网络发送。 这些较小的数据包通过多个重组组件在目的位置被接收，多个重组组件分配关于接收到的分组的信息，并协调来自它们的分组的发送，以便产生重新组装的较大分组。 在一个实施方式中，多个重组组件中的每一个维护指示本地存储的分组的一个或多个数据结构，以及存储在多个重组组件内的任何地方或其他地方的那些分组。 当包括较大分组的所有较小分组都由分布式重排组件中的一个接收时，重新组装组件以协调的方式发送它们较小的分组，以产生原始较大的分组。

公开(公告)号：US07051259B1

公开(公告)日：2006-05-23

申请号：US10266466

申请日：2002-10-08

申请人： John J. Williams, Jr. ,  Thomas Dejanovic

发明人： John J. Williams, Jr. ,  Thomas Dejanovic

IPC分类号： H03M13/00

CPC分类号： H04L1/0083 ,  H04L1/0041 ,  H04L1/0057 ,  H04L1/0072

摘要： Methods and apparatus are disclosed for communicating time and latency sensitive information in a system, such as, but not limited to a computer or communications system. A first block of data is identified and transmitted. A check code is partially determined based on this first data. While the first data is being transmitted, the time-sensitive data (e.g., flow control, other control information, etc.) is identified. This identified time-sensitive data is then contiguously transmitted after the first data. The determination of the check code is completed based on the time-sensitive data, and the check code is contiguously transmitted after the time-sensitive data. One implementation receives the first data, the time-sensitive data, and the check code. If error correction is being used and is needed, the time-sensitive data is first corrected based on the check code, and then subsequently, the first data is corrected. In this manner, the latency of the availability of this time-sensitive data may be reduced.

摘要翻译： 公开了用于在系统（例如但不限于计算机或通信系统）中传送时间和延迟敏感信息的方法和装置。 识别和传输第一个数据块。 基于该第一数据部分确定校验码。 在发送第一数据的同时，识别时间敏感数据（例如流控制，其他控制信息等）。 这个识别的时间敏感数据在第一个数据之后被连续发送。 基于时间敏感数据完成校验码的确定，并且在时间敏感数据之后连续发送校验码。 一个实现接收第一数据，时间敏感数据和检查码。 如果正在使用和需要纠错，则首先根据检查码校正时间敏感数据，然后校正第一数据。 以这种方式，可以减少该时间敏感数据的可用性的等待时间。

公开(公告)号：US07016305B1

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

申请号：US09894200

申请日：2001-06-27

申请人： Jonathan E. Michelson ,  John J. Williams, Jr. ,  Thomas Dejanovic

发明人： Jonathan E. Michelson ,  John J. Williams, Jr. ,  Thomas Dejanovic

IPC分类号： H04L12/56

CPC分类号： H04L49/50 ,  H04L49/1515 ,  H04L49/252 ,  H04L49/503 ,  H04L49/506

摘要： Methods and apparatus are disclosed for distributing flow control information in a packet switching system. In one packet switching system, flow control information is collected in a data structure in the first stage switching elements. Each of these switching elements transmit data from the flow control data structure as small messages or in fields included in packets being sent across multiple statically allocated paths. Flow control information is received by next stage elements, which are programmed to forward only flow control information received from a limited number of components or over a limited number of paths. The first stage switching elements may also periodically or occasionally delay sending flow control information or send a dummy message or information to accommodate bandwidth transmission differences between components of the packet switching system, including to accommodate bandwidth variations caused by plesiochronous timing across the network.

摘要翻译： 公开了用于在分组交换系统中分发流量控制信息的方法和装置。 在一个分组交换系统中，流控制信息被收集在第一级交换单元的数据结构中。 这些开关元件中的每一个从流控制数据结构中传送数据作为小消息，或者包含在跨多个静态分配路径发送的分组中的字段中。 流控制信息由下一级元件接收，下一级元件被编程为仅转发从有限数量的部件或有限数量的路径接收到的流控制信息。 第一级交换元件还可以周期性地或偶尔地延迟发送流控制信息或发送虚拟消息或信息以适应分组交换系统的组件之间的带宽传输差异，包括适应由网络上的同步定时引起的带宽变化。

公开(公告)号：US06967926B1

公开(公告)日：2005-11-22

申请号：US09752422

申请日：2000-12-31

申请人： John J. Williams, Jr. ,  Thomas Dejanovic ,  Jonathan E. Michelson

发明人： John J. Williams, Jr. ,  Thomas Dejanovic ,  Jonathan E. Michelson

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

CPC分类号： H04L47/24 ,  H04L47/10 ,  H04L47/26 ,  H04L47/33 ,  H04L47/34 ,  H04L49/1523 ,  H04L49/90 ,  H04L49/9094

摘要： Methods and apparatus are disclosed for using barrier phases to limit the disorder of packets which may be used in a computer or communications system. In one packet switching system, source nodes include an indication of their current barrier state in sent packets. For each barrier state, a predetermined range of sequence numbers may be used or a predetermined number of packets may be sent by a source node. The source, destination, and switching nodes are systematically switched between barrier phases, which is typically performed continuously in response to the flow of barrier request and barrier acknowledgement packets or signals. Each source node broadcasts to all forward connected nodes a barrier request to change to a next barrier state. After a switching node has received a barrier request on all incoming links, the switching node propagates the barrier request. Upon receiving barrier requests over all links, each destination stage relays an acknowledgement message to all connected source elements, which then send a barrier acknowledgement in much the same way, and each source element changes its barrier state causing the sequence number or counting space to be reset, and newly sent packets to indicate the new barrier state. Upon receiving all its barrier acknowledgement messages, each destination stage changes its barrier state, and then the destination can manipulate (e.g., resequence, reassemble, send, place in an output queue, etc.) packets marked with the previous barrier state as it knows that every packet from the previous barrier state has been received. This transition of barrier phases and limiting the number of packets sent per barrier phases may be used to limit the range of the sequence number space and the size of outgoing, resequencing, and reassembling buffers, as well providing a packet time-out mechanism which may be especially useful when non-continuous sequence numbers or time-stamps are included in packets for resequencing and/or reassembly purposes.

公开(公告)号：US06934760B1

公开(公告)日：2005-08-23

申请号：US09776793

申请日：2001-02-04

申请人： Gregg Anthony Westbrook ,  Thomas Dejanovic

发明人： Gregg Anthony Westbrook ,  Thomas Dejanovic

IPC分类号： G06F15/16 ,  G06F15/173 ,  H04L12/56

CPC分类号： H04L49/1523 ,  H04L49/552

摘要： Methods and apparatus are disclosed for distributed resequencing of packets belonging to an original stream of packets in a computer or communications system. Typically, packets of the original stream are marked with a sequence number, timestamp, or other ordering indication, and distributed among different paths and arriving at a location possibly out of their original sequence. These packets are received at the location by multiple resequencing components, which distribute information as to received packets and coordinate the sending of packets from themselves so as to produce a stream of resequenced packets. In one implementation, each of the multiple resequencing components maintains one or more data structures indicating packets stored locally and those packets stored anywhere (or elsewhere) within the multiple resequencing components. When a next packet in the original sequence has been received, the packet is sent out.

摘要翻译： 公开了用于在计算机或通信系统中分组重新分类属于分组的原始流的方法和装置。 通常，原始流的分组被标记有序列号，时间戳或其他排序指示，并且分布在不同路径之间并到达可能超出其原始序列的位置。 这些分组在该位置被多个重排组件接收，该分量分量分配关于接收分组的信息，并协调分组自身的发送，以产生重排序分组流。 在一个实施方式中，多个重排序组件中的每一个保持指示本地存储的分组的一个或多个数据结构，以及存储在多个重排序组件内的任何地方（或其他地方）的分组。 当接收到原始序列中的下一个分组时，该分组被发送出去。

公开(公告)号：US06603765B1

公开(公告)日：2003-08-05

申请号：US09621415

申请日：2000-07-21

申请人： Bruce A. Wilford ,  Thomas Dejanovic

发明人： Bruce A. Wilford ,  Thomas Dejanovic

IPC分类号： H04L1256

CPC分类号： H04L29/06 ,  H04L67/1002 ,  H04L2029/06054

摘要： The invention provides a system and method for sharing packet traffic load among a plurality of possible paths. Each packet is associated with a flow, and a hash value is determined for each flow, so as to distribute the sequence of packets into a set of hash buckets. The hash value has a relatively large number of bits, but is divided by the number of possible paths so as to achieve a relatively small modulus value; the modulus value is used to index into a relatively small table associating one selected path with each entry. The modulus value is determined by a relatively small amount of circuitry, simultaneously for a plurality of moduli, and one such modulus value is selected in response to the number of possible paths.

摘要翻译： 本发明提供一种用于在多个可能路径之间共享数据包业务负载的系统和方法。 每个分组与流相关联，并且为每个流确定哈希值，以便将分组序列分布到一组散列桶中。 哈希值具有相对较大的比特数，但是除以可能的路径的数量，以获得相对小的模数值; 模数值用于索引到将一个选定路径与每个条目相关联的较小表格中。 模数值由相对少量的电路确定，同时用于多个模量，并且响应于可能路径的数量选择一个这样的模数值。