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

1. 发明授权

US07787446B2 Packet unstopper system for a parallel packet switch 有权
标题翻译：用于并行数据包交换的数据包无限制系统
公开(公告)号：US07787446B2
公开(公告)日：2010-08-31
申请号：US12126679
申请日：2008-05-23
申请人： Francois Le Maut , Rene Glaise , Michel Poret , Rene Gallezot
发明人： Francois Le Maut , Rene Glaise , Michel Poret , Rene Gallezot
IPC分类号： H04Q11/00
CPC分类号： H04L49/153 , H04L12/5601 , H04L49/1523 , H04L49/256 , H04L49/30 , H04L49/3045 , H04L49/3081 , H04L49/50 , H04L2012/5635 , H04L2012/565 , H04L2012/5679 , H04L2012/5682
摘要： A system for controlling egress buffer saturation includes, for each data packet flow, a comparator for comparing the number of data packets ‘WPC’ temporarily stored within an egress buffer to a predefined threshold value ‘WPCth’. The packet sequence number ‘PSNr’ of a last received in-sequence data packet and each highest packet sequence number ‘HPSNj’ received through respective ones of the plurality of switching planes is stored. By comparing the last received in-sequence packet sequence number ‘PSNr’ to each highest packet sequence number ‘HPSNj’ when the number of data packets ‘WPC’ exceeds the predefined threshold value ‘WPCth’ a determination as to which switching plane(s), among the plurality of switching planes, to unstop the flow of data packets can be made.
摘要翻译：用于控制出口缓冲器饱和的系统包括用于每个数据分组流的比较器，用于将临时存储在出口缓冲器内的数据分组“WPC”的数量与预定义的阈值“WPCth”进行比较。存储最后接收的顺序数据分组的分组序列号“PSNr”和通过多个切换平面中的相应的接收平面接收的每个最高分组序列号“HPSNj”。当数据包“WPC”的数量超过预定义的阈值“WPCth”时，通过将最后接收的按顺序分组序列号“PSNr”与每个最高分组序列号'HPSNj'进行比较，确定哪个交换平面在多个交换平面中，可以进行数据分组的流动。

2. 发明授权

US07486683B2 Algorithm and system for selecting acknowledgments from an array of collapsed VOQ's 失效
标题翻译：用于从收缩的VOQ数组中选择确认的算法和系统
公开(公告)号：US07486683B2
公开(公告)日：2009-02-03
申请号：US10894681
申请日：2004-07-20
申请人： Alain Blanc , Rene Glaise , Francois Le Maut , Michel Poret
发明人： Alain Blanc , Rene Glaise , Francois Le Maut , Michel Poret
IPC分类号： H04L12/28
CPC分类号： H04L49/3027 , H04L49/103 , H04L49/201 , H04L49/3045
摘要： A method for selecting packets to be switched in a collapsed virtual output queuing array (cVOQ) switch core, using a request/acknowledge mechanism. According to the method, an efficient set of virtual output queues (at most one virtual output queue per ingress adapter) is selected, while keeping the algorithm simple enough to allow its implementation in fast state machines. For determining a set of virtual output queues that are each authorized to send a packet, the algorithm is based upon degrees of freedom characterizing states of ingress and egress adapters. For example, the degree of freedom, derived from the collapsed virtual output queuing array, could represent the number of egress ports to which an ingress port may send packet, or the number of ingress ports from which an egress port may receive packets, at a given time. Analyzing all the ingress ports holding at least one data packet, from the lesser degree of freedom to the greater degree of freedom, the algorithm determines as many virtual output queues as possible, in the limit of the number of ingress ports (an ingress port may send only one packet per packet-cycle).
摘要翻译：一种用于使用请求/确认机制来选择在折叠虚拟输出排队阵列（cVOQ）切换核心中切换的分组的方法。根据该方法，选择一组有效的虚拟输出队列（每个入口适配器最多有一个虚拟输出队列），同时保持算法足够简单，以允许其在快速状态机中实现。为了确定每个被授权发送分组的一组虚拟输出队列，该算法基于入射和出口适配器状态的自由度。例如，从折叠的虚拟输出排队阵列导出的自由度可以表示入口端口可以发送分组的出口端口的数量，或出口端口可以从其接收分组的入口端口的数量，给定时间分析至少一个数据包的入口端口，从较小的自由度到较大的自由度，该算法在入口端口数量的限制内尽可能地确定尽可能多的虚拟输出队列（入口端口可能每个分组周期只发送一个分组）。

3. 发明申请

US20050053078A1 Algorithm and system for selecting acknowledgments from an array of collapsed VOQ's 失效
标题翻译：用于从收缩的VOQ数组中选择确认的算法和系统
公开(公告)号：US20050053078A1
公开(公告)日：2005-03-10
申请号：US10894681
申请日：2004-07-20
申请人： Alain Blanc , Rene Glaise , Francois Le Maut , Michel Poret
发明人： Alain Blanc , Rene Glaise , Francois Le Maut , Michel Poret
IPC分类号： H04L12/28 , H04L12/56
CPC分类号： H04L49/3027 , H04L49/103 , H04L49/201 , H04L49/3045
摘要： A method for selecting packets to be switched in a collapsed virtual output queuing array (cVOQ) switch core, using a request/acknowledge mechanism. According to the method, an efficient set of virtual output queues (at most one virtual output queue per ingress adapter) is selected, while keeping the algorithm simple enough to allow its implementation in fast state machines. For determining a set of virtual output queues that are each authorized to send a packet, the algorithm is based upon degrees of freedom characterizing states of ingress and egress adapters. For example, the degree of freedom, derived from the collapsed virtual output queuing array, could represent the number of egress ports to which an ingress port may send packet, or the number of ingress ports from which an egress port may receive packets, at a given time. Analyzing all the ingress ports holding at least one data packet, from the lesser degree of freedom to the greater degree of freedom, the algorithm determines as many virtual output queues as possible, in the limit of the number of ingress ports (an ingress port may send only one packet per packet-cycle).
摘要翻译：一种用于使用请求/确认机制来选择在折叠虚拟输出排队阵列（cVOQ）切换核心中切换的分组的方法。根据该方法，选择一组有效的虚拟输出队列（每个入口适配器最多有一个虚拟输出队列），同时保持算法足够简单，以允许其在快速状态机中实现。为了确定每个被授权发送分组的一组虚拟输出队列，该算法基于入射和出口适配器状态的自由度。例如，从折叠的虚拟输出排队阵列导出的自由度可以表示入口端口可以发送分组的出口端口的数量，或出口端口可以从其接收分组的入口端口的数量，给定时间分析至少一个数据包的入口端口，从较小的自由度到较大的自由度，该算法在入口端口数量的限制中尽可能地确定尽可能多的虚拟输出队列（入口端口可能每个分组周期只发送一个分组）。

4. 发明授权

US08085789B2 Algorithm and system for selecting acknowledgments from an array of collapsed VOQ's 失效
标题翻译：用于从收缩的VOQ数组中选择确认的算法和系统
公开(公告)号：US08085789B2
公开(公告)日：2011-12-27
申请号：US12365091
申请日：2009-02-03
申请人： Alain Blanc , Rene Glaise , Francois Le Maut , Michel Poret
发明人： Alain Blanc , Rene Glaise , Francois Le Maut , Michel Poret
IPC分类号： H04L12/28
CPC分类号： H04L49/3027 , H04L49/103 , H04L49/201 , H04L49/3045
摘要： A method for selecting packets to be switched in a collapsed virtual output queuing array (cVOQ) switch core, using a request/acknowledge mechanism is disclosed. An egress location for an ingress port is selected based on degrees of freedom for the selection mechanism. The degree of freedom can be derived from the collapsed virtual output queuing array by determining a number of egress locations to which an ingress port may send packets and determining a number of ingress ports from which an egress location can receive packets. Analyzing all the queued packets for assignment to an egress location, starting with a lesser degree of freedom and ending with a greater degree of freedom provides efficient switching allocations and acknowledgements.
摘要翻译：公开了一种使用请求/确认机制来选择在折叠的虚拟输出排队阵列（cVOQ）切换核心中切换的分组的方法。基于选择机制的自由度选择入口端口的出口位置。可以通过确定进入端口可以发送分组的出口位置的数量并确定出口位置可以从哪个入口端口接收分组的数目的入口端口，从折叠的虚拟输出排队阵列导出自由度。分析所有排队的分组以分配到出口位置，以较小的自由度开始，并以更大的自由度结束，从而提供有效的切换分配和确认。

5. 发明授权

US07839797B2 Event-driven flow control for a very high-speed switching node 有权
标题翻译：用于非常高速的交换节点的事件驱动流控制
公开(公告)号：US07839797B2
公开(公告)日：2010-11-23
申请号：US11856508
申请日：2007-09-17
申请人： Rene Gallezot , Rene Glaise , Francois Le Maut
发明人： Rene Gallezot , Rene Glaise , Francois Le Maut
IPC分类号： H04L1/00
CPC分类号： H04L47/29 , H04L47/10 , H04L47/11 , H04L47/2433 , H04L47/2441
摘要： A method for controlling the flows of data packets that are switched or routed at nodes of high-speed communication networks is disclosed. According to the invention, resource metering units are assigned to resources shared between devices of the switch or router e.g., shared memories or link bandwidths. When the occupancy of a shared resource reaches a predetermined threshold, an event is generated and transmitted to devices sharing this resource. Furthermore, a periodic refresh of the overall flow control information is performed so that lost events are, however, eventually acted on. Thus, a new device may become active without perturbing the active flows after having gathered enough flow control information.
摘要翻译：公开了一种用于控制在高速通信网络的节点处交换或路由的数据分组的流的方法。根据本发明，资源计量单元被分配给交换机或路由器的设备之间共享的资源，例如共享存储器或链路带宽。当共享资源的占用达到预定阈值时，生成事件并发送到共享该资源的设备。此外，执行总体流量控制信息的周期性刷新，使得丢失的事件最终被起作用。因此，在收集到足够的流量控制信息之后，新的设备可以变得活跃，而不会干扰主动流。

6. 发明授权

US07430167B2 Method and system to enable an adaptive load balancing in a parallel packet switch 失效
标题翻译：在并行分组交换机中实现自适应负载均衡的方法和系统
公开(公告)号：US07430167B2
公开(公告)日：2008-09-30
申请号：US10711320
申请日：2004-09-10
申请人： Rene Glaise , Alain Blanc , Francois Le Maut , Michel Poret
发明人： Rene Glaise , Alain Blanc , Francois Le Maut , Michel Poret
IPC分类号： G06F11/00
CPC分类号： H04L47/125 , H04L49/1523 , H04L49/25 , H04L49/30 , H04L49/3045
摘要： A method and a system to adapt the load balancing of the incoming traffic over the planes of a parallel packet switch (PPS) on the basis of the monitoring of requests and acknowledgments exchanged between ingress port adapters and arrays of collapsed virtual output queues (cVOQ) situated within the plane switch cores is disclosed. According to the invention, at least one counter is associated, in each ingress port-adapter, to each individual switching plane or device to be monitored. Each of these counters is incremented when a request is sent to the corresponding individual switching plane or device and decremented when an acknowledgment is received from this individual switching plane or device. When the range of values taken by the counters of a same ingress port-adapter reaches a predetermined threshold, less (or none) incoming traffic is further transmitted to the individual switching plane or device associated to the higher value counter. An alarm signal is possibly raised too e.g., for replacing the defective individual switching plane or device.
摘要翻译：基于在入口端口适配器和折叠虚拟输出队列（cVOQ）阵列之间交换的请求和确认的监视来适应并行分组交换机（PPS）的平面上的入局业务的负载平衡的方法和系统，位于平面开关芯内。根据本发明，至少一个计数器在每个入口端口适配器中被关联到要监视的每个单独的切换平面或设备。当将请求发送到相应的单独的交换平面或设备时，这些计数器中的每一个递增，并且当从该单独的交换平面或设备接收到确认时递减。当相同入口端口适配器的计数器所取值的范围达到预定阈值时，较少（或无））进入流量进一步传输到与较高值计数器相关联的单独交换平面或设备。也可能引起报警信号，例如用于更换有缺陷的单独开关平面或装置。

7. 发明授权

US07324460B2 Event-driven flow control for a very high-speed switching node 失效
标题翻译：用于非常高速的交换节点的事件驱动流控制
公开(公告)号：US07324460B2
公开(公告)日：2008-01-29
申请号：US10673595
申请日：2003-09-29
申请人： Rene Gallezot , Rene Glaise , Francois Le Maut
发明人： Rene Gallezot , Rene Glaise , Francois Le Maut
IPC分类号： H04L1/00
CPC分类号： H04L47/29 , H04L47/10 , H04L47/11 , H04L47/2433 , H04L47/2441
摘要： A method for controlling the flows of data packets that are switched or routed at nodes of high-speed communication networks is disclosed. According to the invention, resource metering units are assigned to resources shared between devices of the switch or router e.g., shared memories or link bandwidths. When the occupancy of a shared resource reaches a predetermined threshold, an event is generated and transmitted to devices sharing this resource. Furthermore, a periodic refresh of the overall flow control information is performed so that lost events are, however, eventually acted on. Thus, a new device may become active without perturbing the active flows after having gathered enough flow control information.
摘要翻译：公开了一种用于控制在高速通信网络的节点处交换或路由的数据分组的流的方法。根据本发明，资源计量单元被分配给交换机或路由器的设备之间共享的资源，例如共享存储器或链路带宽。当共享资源的占用达到预定阈值时，生成事件并发送到共享该资源的设备。此外，执行总体流量控制信息的周期性刷新，使得丢失的事件最终被起作用。因此，在收集到足够的流量控制信息之后，新的设备可以变得活跃，而不会干扰主动流。

8. 发明授权

US08995445B2 System and method for re-sequencing data packets on a per-flow basis 有权
标题翻译：在每个流的基础上重新排序数据包的系统和方法
公开(公告)号：US08995445B2
公开(公告)日：2015-03-31
申请号：US10722900
申请日：2003-11-26
申请人： Francois Le Maut , Rene Glaise , Michel Poret , Rene Gallezot
发明人： Francois Le Maut , Rene Glaise , Michel Poret , Rene Gallezot
IPC分类号： H04L12/28 , H04L12/939 , H04L12/933 , H04L12/931 , H04L12/70
CPC分类号： H04L49/552 , H04L49/15 , H04L49/205 , H04L2012/565
摘要： In a network device packets are marked with sequence identifiers at ingress of the device, switched through a plurality of switching planes and re-sequenced on a per flow basis at egress of the device. The re-sequencing system includes a controller that allocates to each received data packet a temporary storage location in a packet buffer. A plurality of output registers are provided, with each one associated with a flow. A pointer uses predefined parameters to point to an output register that has been previously assigned to receive data packets from the corresponding flow. Parameters in the pointed output register are correlated with parameters in a received packet to determine if the received packet is next in sequence to packets processed through a particular queue.
摘要翻译：在网络设备中，分组在设备的入口处标记有序列标识符，通过多个交换平面切换，并且在设备的出口处以每个流为基础重新排序。重新排序系统包括对每个接收的数据分组分配分组缓冲器中的临时存储位置的控制器。提供了多个输出寄存器，每个输出寄存器与流相关联。指针使用预定义参数来指向先前已分配给从相应流程接收数据包的输出寄存器。指向输出寄存器中的参数与接收到的分组中的参数相关，以确定接收到的分组是否接下来依次通过特定队列处理的分组。

9. 发明授权

US07385993B2 Queue scheduling mechanism in a data packet transmission system 失效
标题翻译：数据包传输系统中的队列调度机制
公开(公告)号：US07385993B2
公开(公告)日：2008-06-10
申请号：US10065809
申请日：2002-11-21
申请人： Alain Blanc , Rene Gallezot , Francois Le Maut , Daniel Wind
发明人： Alain Blanc , Rene Gallezot , Francois Le Maut , Daniel Wind
IPC分类号： H04L12/56
CPC分类号： H04L47/6215 , H04L47/10 , H04L47/2433 , H04L47/245 , H04L47/39 , H04L47/50 , H04L47/626
摘要： A queue scheduling mechanism in a data packet transmission system, the data packet transmission system including a transmission device for transmitting data packets, a reception device for receiving the data packets, a set of queue devices respectively associated with a set of priorities each defined by a priority rank for storing each data packet transmitted by the transmission device into the queue device corresponding to its priority rank and a queue scheduler for reading, at each packet cycle, a packet in one of the queue devices determined by a normal priority preemption algorithm. The queue scheduling mechanism includes a credit device that provides, at each packet cycle, a value N defining the priority rank to be read by the queue scheduler from the queue device corresponding to the priority N instead of the queue device determined by the normal priority preemption algorithm. The queue scheduling mechanism further includes an exhaustive priority register that registers the value of at least one exhaustive priority rank to be read by the queue scheduler from the queue device corresponding to the exhaustive priority rank rather than from the queue device corresponding to the priority N.
摘要翻译：在数据分组传输系统中的队列调度机制，包括用于发送数据分组的传输设备的数据分组传输系统，用于接收数据分组的接收设备，分别与一组优先级相关联的一组队列设备，每个优先级由用于将由传输设备发送的每个数据分组存储到与其优先级相对应的队列设备中的优先等级，以及队列调度器，用于在每个分组周期读取由普通优先级抢占算法确定的队列中的一个队列中的分组。队列调度机制包括在每个分组周期提供定义队列调度器从对应于优先级N的队列设备中读取的优先等级的值N，而不是由正常优先级抢占确定的队列设备的信用设备算法。队列调度机制还包括一个穷举优先级寄存器，其向与队列调度器读取的至少一个穷举优先等级的值进行比较，该队列设备对应于穷举优先级而不是来自对应于优先级N的队列设备。

10. 发明授权

US06522269B2 System and method for a self-delineating serial link for very high-speed data communication interfaces 失效
公开(公告)号：US06522269B2
公开(公告)日：2003-02-18
申请号：US09938082
申请日：2001-08-23
申请人： Jean-Claude Abbiate , Alain Blanc , Francois Le Maut
发明人： Jean-Claude Abbiate , Alain Blanc , Francois Le Maut
IPC分类号： H03M520
CPC分类号： H03M5/16
摘要： The system and method encodes a binary sequence of data bits into a sequence of ternary symbols and transmits the sequence of ternary symbols over a communication link. The encoding is performed so that no two consecutive symbols of the sequence are alike. The system and method assume that, for encoding, the previously encoded non-null symbol and the previously encoded symbol must be stored in a memory system. The sequence of symbols is transmitted in lieu of the binary sequence of data bits and decoded by a receiving device in order to restore the binary sequence of data bits from the received sequence of symbols. The decoding procedure assumes that three symbols must be received before a bit can be recovered. Hence, the system and method allow a self-delineation or self-sampling of a very-high speed data communication interface that is insensitive to large timing variations and skews.

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式