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

1. 发明授权

US08149695B2 Dynamic queue instantiation 有权
标题翻译：动态队列实例化
公开(公告)号：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”）的方式进行互操作。本发明既具有存储器有效性又具有处理时间有效性，因为仅需要最小数量的出口优先级队列被实例化。

2. 发明授权

US07881197B2 Interface scheduling and traffic-shaping 有权
标题翻译：接口调度和流量整形
公开(公告)号：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中的每个位与接口相关联，并且与每个接口相关联的位数决定该接口的带宽。提供调度接口的方法，其利用一个或多个位掩码来确定调度接口的顺序。本发明可以有效地实现双令牌桶算法的版本。

3. 发明申请

US20070147403A1 Interface scheduling and traffic-shaping 有权
标题翻译：接口调度和流量整形
公开(公告)号：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中的每个位与接口相关联，并且与每个接口相关联的位数决定该接口的带宽。提供调度接口的方法，其利用一个或多个位掩码来确定调度接口的顺序。本发明可以有效地实现双令牌桶算法的版本。

4. 发明申请

US20070147402A1 Dynamic queue instantiation 有权
标题翻译：动态队列实例化
公开(公告)号：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”）的方式进行互操作。本发明既具有存储器有效性又具有处理时间有效性，因为仅需要最小数量的出口优先级队列被实例化。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式