公开(公告)号：US08149695B2

公开(公告)日：2012-04-03

申请号：US11315893

申请日：2005-12-22

申请人： Bakul Khanna ,  Leigh McLellan ,  Robert Lee ,  Dale Nash

发明人： Bakul Khanna ,  Leigh McLellan ,  Robert Lee ,  Dale Nash

IPC分类号： G01R31/08 ,  G06F11/00 ,  G08C15/00 ,  H04J1/16 ,  H04J3/14 ,  H04L12/26 ,  H04L12/28

CPC分类号： H04L49/90 ,  H04L47/70 ,  H04L47/722 ,  H04L47/748 ,  H04L47/805

摘要： A Point to Point Protocol (“PPP”) link running PPP Multilink Protocol with multi-class extensions (“Multilink-Extension”) having both peers on the PPP link support a number of egress priority queues negotiated during the Multilink-Extension negotiation. Each peer also establishes a number of classes equal to the negotiated number of egress priority queues. Thus, communication devices that have a different default number, or different maximum number, of egress priority queues can interoperate in a manner that ensures packets have the same per-hop behavior (“PHB”). The present invention is both memory efficient and processing time efficient because only the minimum number of egress priority queues necessary are instantiated.

摘要翻译： 在PPP链路上具有两个对等体的具有多类扩展（“多链路扩展”）的运行PPP多链路协议的点对点协议（“PPP”）链路支持在多链路扩展协商期间协商的多个出口优先级队列。 每个对等体还建立等于协商的出口优先级队列数量的类数。 因此，具有不同的出口优先级队列的默认号码或不同最大数量的通信设备可以以确保分组具有相同的每跳行为（“PHB”）的方式进行互操作。 本发明既具有存储器有效性又具有处理时间有效性，因为仅需要最小数量的出口优先级队列被实例化。

公开(公告)号：US06424629B1

公开(公告)日：2002-07-23

申请号：US09197849

申请日：1998-11-23

申请人： William F. Rubino ,  Leigh McLellan ,  Geping Chen

发明人： William F. Rubino ,  Leigh McLellan ,  Geping Chen

IPC分类号： H04L100

CPC分类号： H04Q11/0478 ,  H04L29/06 ,  H04L43/0817 ,  H04L45/10 ,  H04L45/28 ,  H04L69/32 ,  H04L2012/562 ,  H04L2012/5627 ,  H04L2012/5667

摘要： A technique for updating a routing table in a routing device operating over a logical connection in a communication network utilizes a mechanism at a first protocol layer to determine a logical connection status and trigger a routing table update at a second protocol layer based upon the logical connection status. Specifically, the first protocol layer logic monitors the status of the logical channels, and, based on the status of the logical channels, determines the status of the logical connections. When the first protocol layer logic detects a logical channel failure that results in a logical connection failure, the first protocol layer logic triggers a routing table update by sending a signal to the second protocol layer logic indicating that the logical connection failed. Likewise, when the first protocol layer logic determines that communication over the failed logical connection is restored, the first protocol layer logic triggers a routing table update by sending a signal to the second protocol layer logic indicating that the logical connection is restored.

摘要翻译： 用于在通信网络中通过逻辑连接操作的路由设备中更新路由表的技术利用第一协议层的机制来确定逻辑连接状态，并且基于逻辑连接在第二协议层触发路由表更新 状态。 具体地，第一协议层逻辑监视逻辑信道的状态，并且基于逻辑信道的状态来确定逻辑连接的状态。 当第一协议层逻辑检测到导致逻辑连接失败的逻辑信道故障时，第一协议层逻辑通过向第二协议层逻辑发送指示逻辑连接失败的信号来触发路由表更新。 类似地，当第一协议层逻辑确定通过故障逻辑连接的通信被恢复时，第一协议层逻辑通过向第二协议层逻辑发送指示逻辑连接被恢复的信号来触发路由表更新。

公开(公告)号：US07881197B2

公开(公告)日：2011-02-01

申请号：US11315894

申请日：2005-12-22

申请人： Bakul Khanna ,  Leigh McLellan ,  Robert Lee ,  Dale Nash

发明人： Bakul Khanna ,  Leigh McLellan ,  Robert Lee ,  Dale Nash

IPC分类号： G01R31/08 ,  G06F11/00 ,  G08C15/00 ,  H04J1/16 ,  H04J3/14 ,  H04J1/00 ,  H04L12/26 ,  H04L12/28 ,  H04L12/56

CPC分类号： H04L47/22 ,  H04L47/20 ,  H04L47/21 ,  H04L47/50 ,  H04L49/9063

摘要： Efficient interface scheduling that maintains fairness among the scheduled interfaces and remains efficient even when scheduling large numbers of interfaces and even when implemented in software. Systems for scheduling interfaces through a physical port are provided that utilize a bit-mask. Each bit-mask has a bit-mask-level-1 having a plurality of bits, each bit in the bit-mask-level-1 represents a unit of bandwidth with the total number of bits in the bit-mask-level-1 representing the port's line speed, each bit in a bit-mask-level-1 is associated with an interface, and the number of bits associated with each interface determines the bandwidth for that interface. Methods of scheduling interfaces are provided that utilize one or more bit-masks to determine an order in which interfaces are scheduled. The present invention can efficiently implement versions of the dual-token-bucket algorithm.

摘要翻译： 高效的接口调度在调度接口之间保持公平性，即使在调度大量接口时甚至在软件中实现时仍保持高效。 提供了通过物理端口调度接口的系统，利用位掩码。 每个比特掩码具有多个比特的比特掩码级-1，比特掩码级-1中的每一比特代表带宽的单位，其中比特掩码级1中的总比特数 表示端口线路速度，位掩码级别-1中的每个位与接口相关联，并且与每个接口相关联的位数决定该接口的带宽。 提供调度接口的方法，其利用一个或多个位掩码来确定调度接口的顺序。 本发明可以有效地实现双令牌桶算法的版本。

公开(公告)号：US20070116464A1

公开(公告)日：2007-05-24

申请号：US11532974

申请日：2006-09-19

申请人： Gautam Khera ,  Leigh McLellan

发明人： Gautam Khera ,  Leigh McLellan

IPC分类号： H04J14/00

CPC分类号： H04L12/56 ,  H04L45/122 ,  H04L45/124 ,  H04L45/20 ,  H04L45/302 ,  H04L45/40 ,  H04L45/62

摘要： A system, device, and method for supporting cut-through pats in an optical communication system involves obtaining hop count and quality of service information by an initiating device and using the hop count and quality of service information by the initiating device to make decisions relating to a cut-through path. The hop count and quality of service information is provided in a reply message that is sent by a terminating device and modified by intermediate devices between the initiating device and the terminating device. The terminating device sends the reply with a hop count equal to one and quality of service information for a first link (hop) toward the initiating device. Each intermediate device increments the hop count in the reply and adds quality of service information for a next link (hop) into the reply.

摘要翻译： 用于在光通信系统中支持直通拍摄的系统，设备和方法包括通过发起设备获取跳数和服务质量信息，并且通过启动设备使用跳数和服务质量信息来做出与 一条直通路径。 在终端设备发送并由中间设备在启动设备和终接设备之间进行修改的应答消息中提供跳数和服务质量信息。 终端设备向发起设备发送跳数等于1的回复和第一链路（跳）的服务质量信息。 每个中间设备增加回复中的跳数，并将下一个链路（跳）的服务质量信息添加到回复中。

公开(公告)号：US20070147403A1

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

申请号：US11315894

申请日：2005-12-22

申请人： Bakul Khanna ,  Leigh McLellan ,  Robert Lee ,  Dale Nash

发明人： Bakul Khanna ,  Leigh McLellan ,  Robert Lee ,  Dale Nash

IPC分类号： H04L12/56

CPC分类号： H04L47/22 ,  H04L47/20 ,  H04L47/21 ,  H04L47/50 ,  H04L49/9063

摘要： Efficient interface scheduling that maintains fairness among the scheduled interfaces and remains efficient even when scheduling large numbers of interfaces and even when implemented in software. Systems for scheduling interfaces through a physical port are provided that utilize a bit-mask. Each bit-mask has a bit-mask-level-1 having a plurality of bits, each bit in the bit-mask-level-1 represents a unit of bandwidth with the total number of bits in the bit-mask-level-1 representing the port's line speed, each bit in a bit-mask-level-1 is associated with an interface, and the number of bits associated with each interface determines the bandwidth for that interface. Methods of scheduling interfaces are provided that utilize one or more bit-masks to determine an order in which interfaces are scheduled. The present invention can efficiently implement versions of the dual-token-bucket algorithm.

摘要翻译： 高效的接口调度在调度接口之间保持公平性，即使在调度大量接口时甚至在软件中实现时仍保持高效。 提供了通过物理端口调度接口的系统，利用位掩码。 每个比特掩码具有多个比特的比特掩码级-1，比特掩码级-1中的每一比特代表带宽的单位，其中比特掩码级1中的总比特数 表示端口线路速度，位掩码级别-1中的每个位与接口相关联，并且与每个接口相关联的位数决定该接口的带宽。 提供调度接口的方法，其利用一个或多个位掩码来确定调度接口的顺序。 本发明可以有效地实现双令牌桶算法的版本。

公开(公告)号：US20070147402A1

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

申请号：US11315893

申请日：2005-12-22

申请人： Bakul Khanna ,  Leigh McLellan ,  Robert Lee ,  Dale Nash

发明人： Bakul Khanna ,  Leigh McLellan ,  Robert Lee ,  Dale Nash

IPC分类号： H04L12/56

CPC分类号： H04L49/90 ,  H04L47/70 ,  H04L47/722 ,  H04L47/748 ,  H04L47/805

摘要： A Point to Point Protocol (“PPP”) link running PPP Multilink Protocol with multi-class extensions (“Multilink-Extension”) having both peers on the PPP link support a number of egress priority queues negotiated during the Multilink-Extension negotiation. Each peer also establishes a number of classes equal to the negotiated number of egress priority queues. Thus, communication devices that have a different default number, or different maximum number, of egress priority queues can interoperate in a manner that ensures packets have the same per-hop behavior (“PHB”). The present invention is both memory efficient and processing time efficient because only the minimum number of egress priority queues necessary are instantiated.

摘要翻译： 在PPP链路上具有两个对等体的具有多类扩展（“多链路扩展”）的运行PPP多链路协议的点对点协议（“PPP”）链路支持在多链路扩展协商期间协商的多个出口优先级队列。 每个对等体还建立等于协商的出口优先级队列数量的类数。 因此，具有不同的出口优先级队列的默认号码或不同最大数量的通信设备可以以确保分组具有相同的每跳行为（“PHB”）的方式进行互操作。 本发明既具有存储器有效性又具有处理时间有效性，因为仅需要最小数量的出口优先级队列被实例化。