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

1. 发明授权

US08116229B2 Reducing packet drops in networks guaranteeing in-order delivery 有权
标题翻译：减少网络中的丢包，确保按顺序传送
公开(公告)号：US08116229B2
公开(公告)日：2012-02-14
申请号：US12033874
申请日：2008-02-19
申请人： Prashanth Pappu , Ronak Desai , Ankur Goyal , Tejas Kokje
发明人： Prashanth Pappu , Ronak Desai , Ankur Goyal , Tejas Kokje
IPC分类号： H04L12/28
CPC分类号： H04L45/00 , H04L45/22 , H04L47/10 , H04L47/32 , H04L47/34
摘要： In one embodiment, the convergence node switches of a destination node switch in a network having multiple equal paths between a source switch and destination switch are identified. When a new equal cost path is added to the network, packets are flushed up to the convergence node switch closest to the source switch.
摘要翻译：在一个实施例中，标识在源交换机和目的地交换机之间具有多个相等路径的网络中的目的地节点交换机的汇聚节点交换机。当将新的等价路径添加到网络时，数据包将被刷新到最接近源交换机的汇聚节点交换机。

2. 发明申请

US20090207737A1 REDUCING PACKET DROPS IN NETWORKS GUARANTEEING IN-ORDER DELIVERY 有权
标题翻译：减少网络中的分组丢包保证订单交付
公开(公告)号：US20090207737A1
公开(公告)日：2009-08-20
申请号：US12033874
申请日：2008-02-19
申请人： Prashanth Pappu , Ronak Desai , Ankur Goyal , Tejas Kokje
发明人： Prashanth Pappu , Ronak Desai , Ankur Goyal , Tejas Kokje
IPC分类号： H04L12/56
CPC分类号： H04L45/00 , H04L45/22 , H04L47/10 , H04L47/32 , H04L47/34
摘要： In one embodiment, the convergence node switches of a destination node switch in a network having multiple equal paths between a source switch and destination switch are identified. When a new equal cost path is added to the network, packets are flushed up to the convergence node switch closest to the source switch.
摘要翻译：在一个实施例中，标识在源交换机和目的地交换机之间具有多个相等路径的网络中的目的地节点交换机的汇聚节点交换机。当将新的等价路径添加到网络时，数据包将被刷新到最接近源交换机的汇聚节点交换机。

3. 发明申请

US20100027427A1 Hop cost as secondary metric for equal cost multi-paths 有权
标题翻译： Hop成本作为等成本多路径的次要度量
公开(公告)号：US20100027427A1
公开(公告)日：2010-02-04
申请号：US12221143
申请日：2008-07-31
申请人： Tejas Kokje , Ankur Goyal , Ronak Desai
发明人： Tejas Kokje , Ankur Goyal , Ronak Desai
IPC分类号： G01R31/08
CPC分类号： H04L45/20 , H04L45/12 , H04L45/122
摘要： Systems, methods, and other embodiments associated with computing path costs based on link cost as a primary metric and hop cost as a secondary metric are presented. The secondary metric facilitates distinguishing between what would be equal cost multi-paths if only link cost was employed. One example method includes computing a modified link cost for a plurality of paths between switches. The example method may also include determining a lowest modified link cost associated with a path between the switches. The example method may also include providing a signal identifying the lowest modified link cost.
摘要翻译：呈现了基于作为主要度量的链路成本和作为次要度量的跳跃成本的计算路径成本的系统，方法和其他实施例。如果仅使用链路成本，次要度量有助于区分什么是相等的成本多路径。一个示例性方法包括计算交换机之间的多个路径的修改的链路成本。示例性方法还可以包括确定与开关之间的路径相关联的最低修改的链路成本。示例性方法还可以包括提供标识最低修改的链路成本的信号。

4. 发明授权

US08154990B2 Less loss in-order delivery protocol for fibre connection architecture 有权
标题翻译：光纤连接体系结构的丢失按顺序传送协议较少
公开(公告)号：US08154990B2
公开(公告)日：2012-04-10
申请号：US12480447
申请日：2009-06-08
申请人： Tejas Kokje , Ankur Goyal , Hariharan Balasubramanian , Ronak Desai
发明人： Tejas Kokje , Ankur Goyal , Hariharan Balasubramanian , Ronak Desai
IPC分类号： G01R31/08
CPC分类号： H04L49/552 , H04L49/00 , H04L49/3027 , H04L49/357
摘要： Methods and apparatus for providing in-order delivery in Fibre Channel (FC) fabric are disclosed. A topological change between a first switch and a second switch is evaluated to determine whether the topological change may result in out-of-order delivery. If it is determined that the topological change may result in out-of-order delivery, a flush frame is sent to the second switch and stop-on-mark is performed on all interfaces of affected links. Upon receiving the flush frame, the second switch drains all virtual output queues (VOQs) and sends an acknowledgement frame to the first switch. The first switch resumes in-order-delivery in an affected link after receiving the acknowledgement frame or expiration of a lifetime time of a frame.
摘要翻译：公开了在光纤通道（FC）结构中提供按顺序传送的方法和设备。评估第一开关和第二开关之间的拓扑变化以确定拓扑变化是否可能导致无序传送。如果确定拓扑变化可能导致无序传送，则将冲洗帧发送到第二交换机，并且在受影响的链路的所有接口上执行停止标记。在接收到刷新帧时，第二开关排出所有虚拟输出队列（VOQ），并向第一交换机发送确认帧。第一个交换机在接收到确认帧或帧的终身时间到期后，在受影响的链路中恢复按顺序传送。

5. 发明授权

US07995481B2 Hop cost as secondary metric for equal cost multi-paths 有权
标题翻译： Hop成本作为等成本多路径的次要度量
公开(公告)号：US07995481B2
公开(公告)日：2011-08-09
申请号：US12221143
申请日：2008-07-31
申请人： Tejas Kokje , Ankur Goyal , Ronak Desai
发明人： Tejas Kokje , Ankur Goyal , Ronak Desai
IPC分类号： G01R31/08
CPC分类号： H04L45/20 , H04L45/12 , H04L45/122
摘要： Systems, methods, and other embodiments associated with computing path costs based on link cost as a primary metric and hop cost as a secondary metric are presented. The secondary metric facilitates distinguishing between what would be equal cost multi-paths if only link cost was employed. One example method includes computing a modified link cost for a plurality of paths between switches. The example method may also include determining a lowest modified link cost associated with a path between the switches. The example method may also include providing a signal identifying the lowest modified link cost.
摘要翻译：呈现了基于作为主要度量的链路成本和作为次要度量的跳跃成本的计算路径成本的系统，方法和其他实施例。如果仅使用链路成本，次要度量有助于区分什么是相等的成本多路径。一个示例性方法包括计算交换机之间的多个路径的修改的链路成本。示例性方法还可以包括确定与开关之间的路径相关联的最低修改的链路成本。示例性方法还可以包括提供标识最低修改的链路成本的信号。

6. 发明申请

US20100310253A1 LESS LOSS IN-ORDER DELIVERY PROTOCOL FOR FIBRE CONNECTION ARCHITECTURE 有权
标题翻译：用于光纤连接架构的LOS LOS订单交付协议
公开(公告)号：US20100310253A1
公开(公告)日：2010-12-09
申请号：US12480447
申请日：2009-06-08
申请人： Tejas Kokje , Ankur Goyal , Hariharan Balasubramanian , Ronak Desai
发明人： Tejas Kokje , Ankur Goyal , Hariharan Balasubramanian , Ronak Desai
IPC分类号： H04J14/00
CPC分类号： H04L49/552 , H04L49/00 , H04L49/3027 , H04L49/357
摘要： Methods and apparatus for providing in-order delivery in Fibre Channel (FC) fabric are disclosed. A topological change between a first switch and a second switch is evaluated to determine whether the topological change may result in out-of-order delivery. If it is determined that the topological change may result in out-of-order delivery, a flush frame is sent to the second switch and stop-on-mark is performed on all interfaces of affected links. Upon receiving the flush frame, the second switch drains all virtual output queues (VOQs) and sends an acknowledgement frame to the first switch. The first switch resumes in-order-delivery in an affected link after receiving the acknowledgement frame or expiration of a lifetime time of a frame.
摘要翻译：公开了在光纤通道（FC）结构中提供按顺序传送的方法和设备。评估第一开关和第二开关之间的拓扑变化以确定拓扑变化是否可能导致无序传送。如果确定拓扑变化可能导致无序传送，则将冲洗帧发送到第二交换机，并且在受影响的链路的所有接口上执行停止标记。在接收到刷新帧时，第二开关排出所有虚拟输出队列（VOQ），并向第一交换机发送确认帧。第一个交换机在接收到确认帧或帧的终身时间到期后，在受影响的链路中恢复按顺序传送。

7. 发明申请

US20110228670A1 N_Port ID Virtualization node redundancy 有权
标题翻译： N_Port ID虚拟化节点冗余
公开(公告)号：US20110228670A1
公开(公告)日：2011-09-22
申请号：US12661679
申请日：2010-03-22
申请人： Christian Sasso , Hariharan Balasubramanian , Vithal Shirodkar , Ronak Desai , Ankur Goyal , Santosh Rajagopalan
发明人： Christian Sasso , Hariharan Balasubramanian , Vithal Shirodkar , Ronak Desai , Ankur Goyal , Santosh Rajagopalan
IPC分类号： G06F11/00
CPC分类号： H04L45/12 , H04L41/0668 , H04L45/02 , H04L45/22 , H04L45/28 , H04L45/586 , H04L49/357 , H04L49/70
摘要： In one embodiment, a method includes establishing a link between two N_Port Identifier Virtualization (NPIV) switches, the link having a high cost assigned thereto. The NPIV switches are in communication with a plurality of hosts through an N_Port Virtualization (NPV) device. The method further includes receiving at a first of the NPIV switches, an indication of a failure at a second of the NPIV switches, receiving data at the first NPIV switch, the data destined for one of the hosts associated with a domain of the second NPIV switch, and forwarding the data to the NPV device for delivery to the host, wherein a Fibre Channel Identifier (FCID) of the host is the same before and after the failure at the second NPIV switch. An apparatus is also disclosed.
摘要翻译：在一个实施例中，一种方法包括在两个N_Port标识符虚拟化（NPIV）交换机之间建立链路，该链路具有高成本分配给它。 NPIV交换机通过N_Port虚拟化（NPV）设备与多个主机通信。该方法还包括在第一NPIV交换机处接收在第一NPIV交换机的第二个NPIV交换机处的故障的指示，在第一NPIV交换机处接收数据，指向与第二NPIV的域相关联的主机之一的数据切换并将数据转发到NPV设备以传送到主机，其中主机的光纤通道标识符（FCID）在第二NPIV交换机故障之前和之后是相同的。还公开了一种装置。

8. 发明授权

US08593943B2 N—port ID virtualization node redundancy 有权
标题翻译： N端口ID虚拟化节点冗余
公开(公告)号：US08593943B2
公开(公告)日：2013-11-26
申请号：US12661679
申请日：2010-03-22
申请人： Christian Sasso , Hariharan Balasubramanian , Vithal Shirodkar , Ronak Desai , Ankur Goyal , Santosh Rajagopalan
发明人： Christian Sasso , Hariharan Balasubramanian , Vithal Shirodkar , Ronak Desai , Ankur Goyal , Santosh Rajagopalan
IPC分类号： G01R31/08 , H04L12/28
CPC分类号： H04L45/12 , H04L41/0668 , H04L45/02 , H04L45/22 , H04L45/28 , H04L45/586 , H04L49/357 , H04L49/70
摘要： In one embodiment, a method includes establishing a link between two N_Port Identifier Virtualization (NPIV) switches, the link having a high cost assigned thereto. The NPIV switches are in communication with a plurality of hosts through an N_Port Virtualization (NPV) device. The method further includes receiving at a first of the NPIV switches, an indication of a failure at a second of the NPIV switches, receiving data at the first NPIV switch, the data destined for one of the hosts associated with a domain of the second NPIV switch, and forwarding the data to the NPV device for delivery to the host, wherein a Fibre Channel Identifier (FCID) of the host is the same before and after the failure at the second NPIV switch. An apparatus is also disclosed.
摘要翻译：在一个实施例中，一种方法包括在两个N_Port标识符虚拟化（NPIV）交换机之间建立链路，该链路具有高成本分配给它。 NPIV交换机通过N_Port虚拟化（NPV）设备与多个主机通信。该方法还包括在第一NPIV交换机处接收在第一NPIV交换机的第二个NPIV交换机处的故障的指示，在第一NPIV交换机处接收数据，指向与第二NPIV的域相关联的主机之一的数据切换并将数据转发到NPV设备以传送到主机，其中主机的光纤通道标识符（FCID）在第二NPIV交换机故障之前和之后是相同的。还公开了一种装置。

9. 发明授权

US08699497B2 Domain-independent persistent fibre channel identifiers 有权
标题翻译：与域无关的持久性光纤通道标识符
公开(公告)号：US08699497B2
公开(公告)日：2014-04-15
申请号：US12911848
申请日：2010-10-26
申请人： Christian Sasso , Ankur Goyal , Siddharth Kasat , Ronak Desai
发明人： Christian Sasso , Ankur Goyal , Siddharth Kasat , Ronak Desai
IPC分类号： H04L12/56
CPC分类号： H04L61/6045 , H04L29/12254 , H04L29/12801 , H04L29/12886 , H04L41/0803 , H04L61/2038 , H04L61/6004
摘要： A Fiber Channel switch is provided for a relative addressing scheme for domain values to avoid losing portions of a Fiber Channel identifier. At a Fiber Channel switch, data is stored that assigns a relative domain field value to a run-time domain. The relative domain field value used for a Fiber Channel identifier is determined for devices connected to the switch based on the run-time domain of the devices and the virtual storage area network in which the devices are active. A Fiber Channel identifier is stored in a memory of the switch that comprises the relative domain field value determined for the device together with area and port values for the device. The relative domain value is either a reserved domain field value for an existing virtual storage area network or any of the regular domain field values for a new virtual storage area network.
摘要翻译：提供光纤通道交换机用于域值的相对寻址方案，以避免丢失光纤通道标识符的部分。在光纤通道交换机中，存储将相对域字段值分配给运行时域的数据。基于设备的运行时域和设备处于活动状态的虚拟存储区域网络，为连接到交换机的设备确定用于光纤通道标识符的相对域字段值。光纤通道标识符存储在交换机的存储器中，该存储器包括为设备确定的相对域字段值以及该设备的区域和端口值。相对域值是现有虚拟存储区域网络的保留域字段值或新虚拟存储区域网络的任何常规域字段值。

10. 发明授权

US09632930B2 Sub-area FCID allocation scheme 有权
公开(公告)号：US09632930B2
公开(公告)日：2017-04-25
申请号：US12716955
申请日：2010-03-03
申请人： Christian Sasso , Siddharth Kasat , Ankur Goyal , Ronak Desai , Hariharan Balasubramanian
发明人： Christian Sasso , Siddharth Kasat , Ankur Goyal , Ronak Desai , Hariharan Balasubramanian
IPC分类号： G06F15/177 , G06F12/06 , G06F15/173 , H04L12/54
CPC分类号： G06F12/06 , G06F15/173 , H04L12/56
摘要： Certain embodiments of the present disclosure generally relate to allocating a sub-area of Fiber Channel addresses (FCIDs) to a device. A range of addresses may be assigned to the device using a mask address, where the most significant bits represent a mask and the least significant bits represent a sub-range of FCIDs available to be assigned to the device. Therefore, routing information may be stored efficiently in a Ternary Content Addressable Memory (TCAM) by storing a single entry in the TCAM for each sub-area of FCIDs allocated to a device, instead of storing an entry for each FCID. The single entry may indicate the mask address and the width of the mask.

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式