-
1.发明申请Scalable approach to large scale queuing through dynamic resource allocation 有权通过动态资源分配进行大规模排队的可扩展方法公开(公告)号：US20050047338A1
公开(公告)日：2005-03-03
申请号：US10648624
申请日：2003-08-25
申请人： Robert Hoffman , Raymond Kloth , Alessandro Fulli
发明人： Robert Hoffman , Raymond Kloth , Alessandro Fulli
CPC分类号： H04L49/9047 , H04L47/6215 , H04L49/30 , H04L49/3045 , H04L49/90
摘要： Methods and devices are provided for the efficient allocation and deletion of virtual output queues. According to some implementations, incoming packets are classified according to a queue in which the packet (or classification information for the packet) will be stored, e.g., according to a “Q” value. For example, a Q value may be a Q number defined as {Egress port number ∥∥ Priority number∥∥ Ingress port number}. Only a single physical queue is allocated for each classification. When a physical queue is empty, the physical queue is preferably de-allocated and added to a “free list” of available physical queues. Accordingly, the total number of allocated physical queues preferably does not exceed the total number of classified packets. Because the input buffering requirements of Fibre Channel (“FC”) and other protocols place limitations on the number of incoming packets, the dynamic allocation methods of the present invention result in a sparse allocation of physical queues.
摘要翻译： 提供了方法和设备，用于有效分配和删除虚拟输出队列。 根据一些实现方式，输入分组根据其中将存储分组（或分组的分类信息）的队列进行分类，例如根据“Q”值。 例如，Q值可以是定义为{出口端口号||优先级号||入口端口号}的Q号。 每个分类只分配一个物理队列。 当物理队列为空时，物理队列优选地被去分配并被添加到可用物理队列的“空闲列表”中。 因此，分配的物理队列的总数优选地不超过分类分组的总数。 由于光纤通道（“FC”）和其他协议的输入缓冲要求对输入数据包数量的限制，本发明的动态分配方法导致物理队列的稀疏分配。
-
2.发明申请Scalable approach to large scale queuing through dynamic resource allocation 审中-公开通过动态资源分配进行大规模排队的可扩展方法公开(公告)号：US20050190779A1
公开(公告)日：2005-09-01
申请号：US10791673
申请日：2004-03-01
申请人： Robert Hoffman , Raymond Kloth , Alessandro Fulli
发明人： Robert Hoffman , Raymond Kloth , Alessandro Fulli
CPC分类号： H04L47/10 , H04L47/2441 , H04L47/30 , H04L47/39 , H04L47/50 , H04L47/621 , H04L47/6215 , H04L49/90 , H04L49/9047
摘要： Methods and devices are provided for the efficient allocation and deletion of virtual output queues. According to some implementations, incoming packets are classified according to a queue in which the packet (or classification information for the packet) will be stored, e.g., according to a “Q” value. For example, a Q value may be a Q number defined as {Egress port number∥Priority number∥Ingress port number}. Only a single physical queue is allocated for each classification. When a physical queue is empty, the physical queue is preferably de-allocated and added to a “free list” of available physical queues. Accordingly, the total number of allocated physical queues preferably does not exceed the total number of classified packets. Because the input buffering requirements of Fibre Channel (“FC”) and other protocols place limitations on the number of incoming packets, the dynamic allocation methods of the present invention result in a sparse allocation of physical queues.
摘要翻译： 提供了方法和设备，用于有效分配和删除虚拟输出队列。 根据一些实现方式，输入分组根据其中将存储分组（或分组的分类信息）的队列进行分类，例如根据“Q”值。 例如，Q值可以是定义为{出口端口号|优先级号|入口端口号}的Q号。 每个分类只分配一个物理队列。 当物理队列为空时，物理队列优选地被去分配并被添加到可用物理队列的“空闲列表”中。 因此，分配的物理队列的总数优选地不超过分类分组的总数。 由于光纤通道（“FC”）和其他协议的输入缓冲要求对输入数据包数量的限制，本发明的动态分配方法导致物理队列的稀疏分配。
-
3.发明授权Scalable approach to large scale queuing through dynamic resource allocation 有权通过动态资源分配进行大规模排队的可扩展方法公开(公告)号：US08199764B2
公开(公告)日：2012-06-12
申请号：US10648624
申请日：2003-08-25
IPC分类号： H04L12/56
CPC分类号： H04L49/9047 , H04L47/6215 , H04L49/30 , H04L49/3045 , H04L49/90
摘要： Methods and devices are provided for the efficient allocation and deletion of virtual output queues. According to some implementations, incoming packets are classified according to a queue in which the packet (or classification information for the packet) will be stored, e.g., according to a “Q” value. For example, a Q value may be a Q number defined as {Egress port number∥Priority number∥Ingress port number}. Only a single physical queue is allocated for each classification. When a physical queue is empty, the physical queue is preferably de-allocated and added to a “free list” of available physical queues. Accordingly, the total number of allocated physical queues preferably does not exceed the total number of classified packets. Because the input buffering requirements of Fiber Channel (“FC”) and other protocols place limitations on the number of incoming packets, the dynamic allocation methods of the present invention result in a sparse allocation of physical queues.
摘要翻译： 提供了方法和设备，用于有效分配和删除虚拟输出队列。 根据一些实现方式，输入分组根据其中将存储分组（或分组的分类信息）的队列进行分类，例如根据“Q”值。 例如，Q值可以是定义为{出口端口号|优先级号|入口端口号}的Q号。 每个分类只分配一个物理队列。 当物理队列为空时，物理队列优选地被去分配并被添加到可用物理队列的“空闲列表”中。 因此，分配的物理队列的总数优选地不超过分类分组的总数。 由于光纤通道（“FC”）和其他协议的输入缓冲要求对输入数据包数量的限制，本发明的动态分配方法导致物理队列的稀疏分配。
-
4.发明申请SYSTEM AND METHOD FOR IMPROVING HARDWARE UTILIZATION FOR A BIDIRECTIONAL ACCESS CONTROL LIST IN A LOW LATENCY HIGH-THROUGHPUT NETWORK 有权用于改善低延迟高通量网络中双向访问控制列表的硬件利用的系统和方法公开(公告)号：US20140032591A1
公开(公告)日：2014-01-30
申请号：US13560154
申请日：2012-07-27
IPC分类号： G06F17/30
CPC分类号： H04L63/101 , G06F17/30595 , H04L63/0236
摘要： A method in an example embodiment includes creating a first search key from variable data of a message received in a network environment, creating a second search key from constant data of the message, identifying a first database entry in a first database based on the first search key, and identifying a second database entry in a second database based on the second search key. The method can also include performing an action associated with the first database entry when a correlation is identified between the first and second database entries. In specific embodiments, the variable data are modified and the constant data are not modified. The first search key can be created prior or subsequent to forwarding the message. In further embodiments, the correlation is identified when an offset of the first database entry is the same as an offset of the second database entry.
摘要翻译： 示例实施例中的方法包括从在网络环境中接收的消息的可变数据创建第一搜索关键字，从所述消息的常数数据创建第二搜索关键字，基于所述第一搜索来识别第一数据库中的第一数据库条目 密钥，以及基于第二搜索关键字识别第二数据库中的第二数据库条目。 该方法还可以包括当在第一和第二数据库条目之间识别相关性时执行与第一数据库条目相关联的动作。 在具体实施例中，修改变量数据并且不修改常量数据。 可以在转发消息之前或之后创建第一个搜索关键字。 在另外的实施例中，当第一数据库条目的偏移量与第二数据库条目的偏移量相同时，识别相关性。
-
5.发明授权Device and method for checking whether a signal with a predetermined frequency is being received 失效用于检查是否正在接收到具有预定频率的信号的装置和方法公开(公告)号：US07224751B2
公开(公告)日：2007-05-29
申请号：US10296035
申请日：2001-05-23
IPC分类号： H04L27/14
CPC分类号： H04L27/1563
摘要： A device and method are disclosed, whereby the normally complicated and difficult frequency determination is achieved by simply arranged and executed measures, namely by means of larger, smaller and/or equal comparisons and a counting of certain events. The invention further relates to arrangements whereby the noise signal level, or the influence thereof on the verification to be carried out is reduced.
摘要翻译： 公开了一种装置和方法，由此通过简单的布置和执行的测量，即通过更大，更小和/或等同的比较和某些事件的计数来实现正常复杂和困难的频率确定。 本发明还涉及噪声信号电平或其对要进行的验证的影响减小的布置。
-
6.发明授权System and method for improving hardware utilization for a bidirectional access controls list in a low latency high-throughput network 有权用于在低延迟高吞吐量网络中提高双向访问控制列表的硬件利用率的系统和方法公开(公告)号：US09049200B2
公开(公告)日：2015-06-02
申请号：US13560154
申请日：2012-07-27
CPC分类号： H04L63/101 , G06F17/30595 , H04L63/0236
摘要： A method in an example embodiment includes creating a first search key from variable data of a message received in a network environment, creating a second search key from constant data of the message, identifying a first database entry in a first database based on the first search key, and identifying a second database entry in a second database based on the second search key. The method can also include performing an action associated with the first database entry when a correlation is identified between the first and second database entries. In specific embodiments, the variable data are modified and the constant data are not modified. The first search key can be created prior or subsequent to forwarding the message. In further embodiments, the correlation is identified when an offset of the first database entry is the same as an offset of the second database entry.
摘要翻译： 示例实施例中的方法包括从在网络环境中接收的消息的可变数据创建第一搜索关键字，从所述消息的常数数据创建第二搜索关键字，基于所述第一搜索来识别第一数据库中的第一数据库条目 密钥，以及基于第二搜索关键字识别第二数据库中的第二数据库条目。 该方法还可以包括当在第一和第二数据库条目之间识别相关性时执行与第一数据库条目相关联的动作。 在具体实施例中，修改变量数据并且不修改常量数据。 可以在转发消息之前或之后创建第一个搜索关键字。 在另外的实施例中，当第一数据库条目的偏移量与第二数据库条目的偏移量相同时，识别相关性。
-
-
-
-
-
搜索结果
6 条记录 (耗时 0.018 秒)
