公开(公告)号：US07421693B1

公开(公告)日：2008-09-02

申请号：US10117781

申请日：2002-04-04

Applicant: Alexander Joffe ,  Asad Khamisy

Inventor： Alexander Joffe ,  Asad Khamisy

IPC: G06F9/46 ,  C06F13/14

CPC classification number: G06F9/3851 ,  G06F9/383 ,  G06F9/52

Abstract: Logic (also called “synchronizing logic”) in a co-processor (that provides an interface to memory) receives a signal (called a “declaration”) from each of a number of tasks, based on an initial determination of one or more paths (also called “code paths”) in an instruction stream (e.g. originating from a high-level software program or from low-level microcode) that a task is likely to follow. Once a task (also called “disabled” task) declares its lack of a future need to access a shared data, the synchronizing logic allows that shared data to be accessed by other tasks (also called “needy” tasks) that have indicated their need to access the same. Moreover, the synchronizing logic also allows the shared data to be accessed by the other needy tasks on completion of access of the shared data by a current task (assuming the current task was also a needy task).

Abstract translation: 基于一个或多个路径的初始确定，协处理器（提供到存储器的接口）中的逻辑（也称为“同步逻辑”）从多个任务中的每一个接收信号（称为“声明”） （也称为“代码路径”）在任务可能遵循的指令流（例如源自高级软件程序或低级微代码）中。 一旦任务（也被称为“禁用”任务）声明其缺少访问共享数据的需要，同步逻辑允许共享数据被其他指示（也称为“需要”的任务）访问，这些任务已经表明了他们的需要 访问相同。 此外，同步逻辑还允许在当前任务完成对共享数据的访问时由其他有需要的任务访问共享数据（假设当前任务也是有需要的任务）。

公开(公告)号：US20080137666A1

公开(公告)日：2008-06-12

申请号：US11634572

申请日：2006-12-06

Applicant: Mark Fairhurst ,  Brendan Francis Durkin

Inventor： Mark Fairhurst ,  Brendan Francis Durkin

IPC: H04L12/58

CPC classification number: H04L45/00 ,  H04L45/40 ,  H04L45/60 ,  H04L47/34 ,  H04L49/90

Abstract: A cut-through system and method are provided for scheduling information in an information distribution device. The method receives a plurality of information streams. A master schedule is created to select messages from the information streams for transfer to a corresponding plurality of remote links. The messages (e.g., packets) may have either a fixed or variable length. The master schedule is responsible for managing a communication link overall maximum bandwidth, and a message bandwidth for each remote link. Concurrently, an underrun schedule is created to select segment rates for a first group of messages destined to corresponding first group of remote links, and manage the message segment rate for the first group of messages. For example, the first group of messages may be destined to remote links that are sensitive to underrun.

Abstract translation: 提供了一种用于在信息分发设备中调度信息的直通系统和方法。 该方法接收多个信息流。 创建主计划以从信息流中选择要传送到相应的多个远程链路的消息。 消息（例如，分组）可以具有固定长度或可变长度。 主计划负责管理总体最大带宽的通信链路和每个远程链路的消息带宽。 同时，创建欠运行计划以选择分配给相应的第一组远程链路的第一组消息的分段速率，并且管理第一组消息的消息分段速率。 例如，第一组消息可能注定为对欠载敏感的远程链接。

公开(公告)号：US20080123782A1

公开(公告)日：2008-05-29

申请号：US11521854

申请日：2006-09-15

Applicant: Warm Shaw Yuan

Inventor： Warm Shaw Yuan

IPC: H04L1/00 ,  H04B1/10 ,  H03M13/03

CPC classification number: H04L1/0052 ,  H04L1/0047 ,  H04L25/061 ,  H04L25/067

Abstract: A system and method are provided for maximum likelihood estimation in a channel receiving data with inter-symbol interference (ISI). The method receives a serial stream of digital information bits. Decisions are made concerning the received information bit values, which the method accepts as processed information, with soft decisions (SDs) and corresponding initial hard decisions (HDs). The method then identifies a sequence of processed information in a correction matrix, and uses the correction matrix to cross-reference the sequence to a HD look-up value. In response to accessing the HD look-up value, a modified HD is created. The modified HD is decoded, for example, by using forward error correction (FEC), creating a decoded HD. The method compares the decoded HD to the initial HD, and updates the correction matrix HD look-up value in response to the comparison.

Abstract translation: 提供了一种系统和方法，用于在具有符号间干扰（ISI）的数据接收的信道中进行最大似然估计。 该方法接收数字信息比特的串行流。 对于接收到的信息比特值，该方法是以软判决（SD）和相应的初始硬判决（HD）作为处理信息接受的决定。 然后，该方法在校正矩阵中识别处理的信息的序列，并且使用校正矩阵将该序列交叉参考到HD查找值。 响应于访问HD查找值，创建修改的HD。 修改的HD被解码，例如通过使用前向纠错（FEC），创建解码的HD。 该方法将解码的HD与初始HD进行比较，并响应于比较而更新校正矩阵HD查找值。

公开(公告)号：US07304988B2

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

申请号：US10402916

申请日：2003-03-28

Applicant: Narendra K. Bansal

Inventor： Narendra K. Bansal

IPC: H04L12/52 ,  H04Q11/04

CPC classification number: H04Q11/0421 ,  H04Q2213/13076 ,  H04Q2213/13292 ,  H04Q2213/1332

Abstract: A digital cross-connect switching system that has a single-stage architecture, a scalable bandwidth, and reduced connection memory storage requirements. The scalable bandwidth digital cross-connect switching system includes a plurality of digital cross-connect building blocks. Each digital cross-connect building block includes at least one cross-connect having a plurality of input ports and a plurality of output ports, at least one connection memory communicatively coupled to the cross-connect, and at least one OR gate. Bandwidth is scaled in the digital cross-connect switching system by interconnecting predetermined numbers of the digital cross-connect building blocks. In general, the size of the digital cross-connect switching system increases as the square of the bandwidth requirement.

Abstract translation: 具有单级架构，可扩展带宽和减少的连接存储器存储要求的数字交叉连接交换系统。 可扩展带宽数字交叉连接交换系统包括多个数字交叉连接构建块。 每个数字交叉连接构建块包括具有多个输入端口和多个输出端口的至少一个交叉连接器，至少一个通信地耦合到交叉连接的连接存储器以及至少一个或门。 通过互连预定数量的数字交叉连接构建块，数字交叉连接交换系统中的带宽被缩放。 一般来说，数字交叉连接交换系统的大小随着带宽要求的平方而增加。

公开(公告)号：US07298756B1

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

申请号：US10403979

申请日：2003-03-31

Applicant: Kirk Alvin Miller ,  Prayag Bhanubhai Patel ,  Peter John Holzer ,  John Calvin Leung ,  George Beshara Bendak ,  Jim Lew

Inventor： Kirk Alvin Miller ,  Prayag Bhanubhai Patel ,  Peter John Holzer ,  John Calvin Leung ,  George Beshara Bendak ,  Jim Lew

IPC: H04B7/212

CPC classification number: H04L49/252 ,  G06F8/34 ,  H04L49/205 ,  H04L49/3018 ,  H04L49/3027 ,  H04L49/503

Abstract: A system and method are provided for controlling packet header information in a packet communications switch fabric. The method comprises: programming the cell header overhead (OH) field definitions; accepting a packet including a plurality of cells and corresponding cell headers, each cell header including a plurality of overhead fields; defining the cell header OH fields; and, transmitting the packet. Defining the cell header OH fields includes defining cell header OH field location, position, meaning, structure, and length. In other aspects, the method comprises redefining the cell header overhead fields, once they are accepted. For example, the OH field information can be modified, relocated, or an OH field can be added to the cell header. In yet other aspects, the OH field information can be extracted and/or reformatted.

Abstract translation: 提供了一种用于控制分组通信交换结构中的分组报头信息的系统和方法。 该方法包括：对单元头开销（OH）字段定义进行编程; 接收包括多个小区和对应的小区标题的分组，每个小区头包括多个开销字段; 定义单元格头部OH字段; 并且发送分组。 定义单元格标题OH字段包括定义单元格头部OH字段位置，位置，意义，结构和长度。 在其他方面，该方法包括重新定义单元头开销字段，一旦被接受。 例如，可以修改，重定位OH字段信息，或者可以将OH字段添加到单元头。 在其他方面，可以提取和/或重新格式化OH场信息。

公开(公告)号：US07298754B1

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

申请号：US10403964

申请日：2003-03-31

Applicant: Kirk Alvin Miller ,  Prayag Bhanubhai Patel ,  George Beshara Bendak ,  Kenneth Yi Yun ,  Sushil Kumar Singh ,  Ayoob Eusoof Dooply ,  Michael John Hellmer

Inventor： Kirk Alvin Miller ,  Prayag Bhanubhai Patel ,  George Beshara Bendak ,  Kenneth Yi Yun ,  Sushil Kumar Singh ,  Ayoob Eusoof Dooply ,  Michael John Hellmer

IPC: H04L12/56

CPC classification number: H04L49/252 ,  G06F8/34 ,  H04L49/205 ,  H04L49/3018 ,  H04L49/3027 ,  H04L49/503

Abstract: A system and method are provided for configuring interface bandwidths in a packet communications switch fabric. The method comprises: interfacing data links with a first plurality of traffic managers (TMs); differentiating port card interface ports into a first plurality of subchannels associated with the first plurality of TMs; and, communicating packets information with the TMs at a first plurality of data rates corresponding to the first plurality of subchannels. More specifically, differentiating port card interface ports into a first plurality of subchannels associated with the first plurality of TMs includes: differentiating a second plurality of ingress data links into a third plurality of ingress subchannels associated with a third plurality of ingress traffic managers (iTMs); and, differentiating a fourth plurality of egress data links into a fifth plurality of egress subchannels associated with a fifth plurality of egress TMs (eTMs).

Abstract translation: 提供了一种用于在分组通信交换结构中配置接口带宽的系统和方法。 该方法包括：将数据链路与第一多个业务管理器（TM）进行接口; 将端口卡接口端口区分成与第一多个TM相关联的第一多个子信道; 以及以与所述第一多个子信道对应的第一多个数据速率与所述TM通信分组信息。 更具体地，将端口卡接口端口区分为与第一多个TM相关联的第一多个子信道包括：将第二多个入口数据链路区分为与第三多个入口业务管理器（iTM）相关联的第三多个入口子信道， ; 以及将第四多个出口数据链路区分为与第五多个出口TM（eTM）相关联的第五多个出口子信道。

公开(公告)号：US07289530B1

公开(公告)日：2007-10-30

申请号：US10413167

申请日：2003-04-14

Applicant: Warm Shaw Yuan ,  Daniel M. Castagnozzi ,  Alan Michael Sorgi ,  John Thomas Carr

Inventor： Warm Shaw Yuan ,  Daniel M. Castagnozzi ,  Alan Michael Sorgi ,  John Thomas Carr

IPC: H04J3/02 ,  H04J3/22 ,  H03M13/00

CPC classification number: H04L1/0065 ,  H03M13/1515 ,  H03M13/152 ,  H03M13/2906 ,  H03M13/2948 ,  H03M13/618 ,  H04J3/1652 ,  H04L1/005 ,  H04L1/0057

Abstract: A system and method are provided for coding a frame in a packet communications system using a G.709 Digital Wrapper Frame format. The method comprises: accepting digital information; outer encoding the digital information with a Reed Solomon (RS) encoding scheme; interleaving the outer encoded information; inner encoding the interleaved information using a BCH encoding scheme; and, forming a G.709 Digital Wrapper frame including payload and parity bytes. More specifically, a standard DW superframe is formed with 122,368 bits of payload and 8192 bits of parity. The outer encoding process uses an RS(1023,1007) parent code. In one aspect, 15 groups of RS(781,765) and 1 group of RS(778,762) codewords are formed per superframe. The inner encoding process uses a BCH(2047,1959) parent code. In one aspect, 64 groups of BCH(2040,1952) codewords are formed per superframe.

Abstract translation: 提供了一种系统和方法，用于使用G.709数字包装机帧格式对分组通信系统中的帧进行编码。 该方法包括：接收数字信息; 用里德所罗门（RS）编码方案外部编码数字信息; 交织外编码信息; 使用BCH编码方案对交错信息进行内部编码; 并且形成包括有效载荷和奇偶校验字节的G.709数字封装帧。 更具体地，标准DW超帧形成有122,368位有效负载和8192位奇偶校验。 外部编码过程使用RS（1023,1007）父代码。 在一个方面，每个超帧形成15组RS（781,765）和1组RS（778,762）码字。 内部编码过程使用BCH（2047,1959）父代码。 在一个方面，每个超帧形成64组BCH（2040,1952）码字。

公开(公告)号：US07263066B1

公开(公告)日：2007-08-28

申请号：US10395369

申请日：2003-03-24

Applicant: Kenneth Yi Yun ,  Jianfeng Shi ,  Viet Linh Do ,  Michael John Hellmer ,  Kevin Warren James ,  Kirk Alvin Miller ,  Sushil Kumar Singh ,  David Thomas Dougherty ,  John Calvin Leung

Inventor： Kenneth Yi Yun ,  Jianfeng Shi ,  Viet Linh Do ,  Michael John Hellmer ,  Kevin Warren James ,  Kirk Alvin Miller ,  Sushil Kumar Singh ,  David Thomas Dougherty ,  John Calvin Leung

IPC: H04L12/26

CPC classification number: H04L12/5601 ,  H04L49/106 ,  H04L2012/5665 ,  H04L2012/5675

Abstract: A credit-based system and method are provided for managing backplane traffic flow in a packet communications switch fabric. The method comprises: accepting information packets including cells and cell headers with destination information; modifying the destination information in the received cell headers; routing information packets between an input port card and output port cards on backplane data links through an intervening crossbar; at the input port card, maintaining a credit counter for each output port card channel; decrementing the counter in response to transmitting cells from the input port card; generating credits in response to transmitting cells from an output port card channel; and, using modified destination information, sending the generated credits to increment the counter. In some aspects, modifying the destination information in the received packet headers includes: extracting the output port card termination from the card field; and, inserting the input port card source in the card field.

Abstract translation: 提供了基于信用的系统和方法来管理分组通信交换结构中的背板业务流。 该方法包括：接收目的地信息包括小区和小区标题的信息包; 修改所接收的信元头部中的目的地信息; 在输入端口卡和背板数据链路上的输出端口卡之间通过插入的交叉开关路由信息包; 在输入端口卡处，保持每个输出端口卡通道的信用计数器; 响应于从输入端口卡传输单元而递减计数器; 响应于从输出端口卡信道发送信元而产生信用; 并且使用修改的目的地信息，发送生成的信用以递增计数器。 在一些方面，修改接收到的分组头部中的目的地信息包括：从卡片段提取输出端口卡终端; 并将输入端口卡卡插入卡片区域。

公开(公告)号：US07260114B1

公开(公告)日：2007-08-21

申请号：US10213238

申请日：2002-08-06

Applicant: Joseph Rash ,  Herbert Rivera Sanchez ,  Daniel Yingling ,  Robert Oden

Inventor： Joseph Rash ,  Herbert Rivera Sanchez ,  Daniel Yingling ,  Robert Oden

IPC: H04J3/24

CPC classification number: H04L43/00 ,  H04L43/022 ,  H04L43/0829

Abstract: A system and method are provided for tracking connections in a network bundle including a plurality of network links. The method comprises: receiving packet fragments in a plurality of sampling rounds; for a current sampling round, recording which links have supplied a packet fragment; and, advancing a record of the received packet fragments in response a packet fragment on each link. Typically, the packet fragments are received with a corresponding first plurality of sequence numbers. Then, the lowest sequence number in the completed current sampling round is recorded. Some aspects of the method additionally comprise: for the current sampling round, establishing a flag register with a flag for each link; establishing a next lowest sequence number (Mn) register; and, establishing a current lowest sequence number (Mc) register. Then, a flag register flag is toggled in response to receiving a packet fragment on a corresponding link.

Abstract translation: 提供了一种用于跟踪包括多个网络链路的网络束中的连接的系统和方法。 该方法包括：在多个采样周期中接收分组片段; 对于当前采样周期，记录哪些链路已经提供分组片段; 并且响应于每个链路上的分组片段，推进所接收的分组片段的记录。 通常，以相应的第一多个序列号接收分组片段。 然后，记录完成的当前采样周期中的最低序列号。 该方法的一些方面还包括：对于当前采样周期，为每个链路建立具有标志的标志寄存器; 建立下一个最低序列号（Mn）寄存器; 并建立当前最低序列号（Mc）寄存器。 然后，响应于在相应链路上接收到分组片段，翻转标志寄存器标志。

公开(公告)号：US20070177512A1

公开(公告)日：2007-08-02

申请号：US11670873

申请日：2007-02-02

Applicant: Cedell A. Alexander

Inventor： Cedell A. Alexander

IPC: H04J3/14 ,  H04L12/28

CPC classification number: H04L45/742 ,  H04L45/12 ,  H04L45/122 ,  H04L45/46

Abstract: The solution to the shortest path between a source node and multiple destination nodes is accelerated using a grouping of nodes, where the nodes are grouped based on distance from the source node, and a corresponding set of memory locations that indicate when a group includes one or more nodes. The memory locations can be quickly searched to determine the group that represents the shortest distance from the source node and that includes one or more nodes. Nodes may be grouped into additional groupings that do not correspond to the set of memory locations, when the distance from the source node to the nodes exceeds the range of memory locations. Advantageously, the disclosed system and method provide the ability to reach asymptotically optimal performance.

Abstract translation: 使用一组节点来加速在源节点和多个目的地节点之间的最短路径的解决方案，其中根据与源节点的距离对节点进行分组，以及相应的一组存储器位置，其指示组何时包括一个或 更多的节点。 可以快速搜索存储器位置以确定代表距离源节点的最短距离并且包括一个或多个节点的组。 当从源节点到节点的距离超过存储器位置的范围时，节点可以被分组成不对应于该组存储器位置的附加分组。 有利地，所公开的系统和方法提供达到渐近最佳性能的能力。