公开(公告)号：US20080034167A1

公开(公告)日：2008-02-07

申请号：US11499372

申请日：2006-08-03

Applicant: Samar Sharma ,  Dinesh G. Dutt ,  Fabio R. Maino ,  Sanjaya Kumar

Inventor： Samar Sharma ,  Dinesh G. Dutt ,  Fabio R. Maino ,  Sanjaya Kumar

IPC: G06F12/14

CPC classification number: G06F3/0665 ,  G06F3/0622 ,  G06F3/0631 ,  G06F3/067

Abstract: Methods and apparatus for processing a reserve request requesting a reservation of at least a portion of a volume in a system implementing network-based virtualization of storage are disclosed. More particularly, multiple ports and/or network devices together implement the virtualization of storage. When a network device or port receives a reserve request from a host requesting that at least a portion of a volume be reserved, a notification is sent indicating the at least a portion of the volume being reserved. The notification may be sent to one or more network devices or ports. A lock corresponding to the reserve request may then be obtained such that a lock of the at least a portion of the volume is acquired. When another network device or port receives a reserve intention notification, the network device or port stores information indicating that a lock of the at least a portion of the volume has been obtained. Using this information, network devices and/or ports may appropriately handle subsequent reserve requests.

Abstract translation: 公开了用于处理在实施基于网络的存储虚拟化的系统中请求预留卷的至少一部分的预留请求的方法和装置。 更具体地，多个端口和/或网络设备一起实现存储的虚拟化。 当网络设备或端口从主机接收到要求保留卷的至少一部分的保留请求时，发送指示所保留的卷的至少一部分的通知。 该通知可以被发送到一个或多个网络设备或端口。 然后可以获得与保留请求相对应的锁，使得获取卷的至少一部分的锁。 当另一个网络设备或端口接收到保留意图通知时，网络设备或端口存储指示已经获得该卷的至少一部分的锁定的信息。 使用该信息，网络设备和/或端口可以适当地处理后续的预留请求。

公开(公告)号：US07299317B1

公开(公告)日：2007-11-20

申请号：US10165572

申请日：2002-06-08

Applicant: Rina Panigrahy ,  Samar Sharma

Inventor： Rina Panigrahy ,  Samar Sharma

IPC: G06F12/00 ,  G06F13/00 ,  G06F13/28

CPC classification number: G11C15/00

Abstract: Methods and apparatus are disclosed for maintaining and using entries in one or more associative memories. A last bit of a prefix is checked, and based on this result, the entry is placed into one of two classes of associative memory entries. The entry can then be identified within the associative memory by performing a lookup operation using the prefix padded with ones if the last bit of the prefix is zero or with zeros if the last bit is one to fill out the remaining bits of the lookup word. Entries of different classes of entries are typically either stored in different associative memories, or in the same associative memory with each of these entries including a class specific identifier. Among other applications, these entries can be used to locate a prefix and to store a tree data structure in the one or more associative memories.

Abstract translation: 公开了用于维护和使用一个或多个关联存储器中的条目的方法和装置。 检查前缀的最后一位，并且基于该结果，该条目被放置在两个关联存储器条目类之一中。 然后，如果前缀的最后一位为零，则通过执行使用前缀填充的前缀的查找操作来识别该条目，或者如果最后一位是填满查找字的剩余位的则为零。 不同类别条目的条目通常存储在不同的关联存储器中，或者存储在与每个这些条目相同的关联存储器中，包括类特定的标识符。 在其他应用中，这些条目可以用于定位前缀并将树数据结构存储在一个或多个关联存储器中。

公开(公告)号：US06725326B1

公开(公告)日：2004-04-20

申请号：US09639387

申请日：2000-08-15

Applicant: Abhijit Patra ,  Rina Panigrahy ,  Samar Sharma

Inventor： Abhijit Patra ,  Rina Panigrahy ,  Samar Sharma

IPC: G06F1200

CPC classification number: H04L45/7453 ,  G06F12/023 ,  H04L49/90

Abstract: Techniques for efficient memory management that enable rapid longest prefix match lookups in memory. In general, the present invention is efficacious wherever maintenance of a good distribution of holes in a sorted list is required. This technique relies on a proactive hole management methodology to preserve a good distribution of holes in each memory region in such a way that one does not have to search for holes in order to insert or store a new entry into the list. In particular, all holes in a given region are kept in one or more contiguous sub-region. Keeping the holes contiguous requires a hole move every time there is a delete operation. The amortized cost of these operations is justified by the resulting simplification in later insert (store) and delete operations. For example, during an insert the new entry is placed at the end of the contiguous sub-region of used entries in the region. During a delete, when a hole is created in the middle of a contiguous sub-region of used entries, the last used entry is moved into the hole, thus keeping the holes contiguous. Such an organization of holes and movement of used entries within a region is permissible within the longest prefix match type of lookup table, because all entries within a region, by definition, have an IP prefix of equal length.

Abstract translation: 用于高效内存管理的技术，可在内存中实现快速最长的前缀匹配查找。 通常，本发明在需要维护排序清单中的孔的良好分布的任何地方都是有效的。 这种技术依赖于主动的孔管理方法，以保持每个存储器区域中的孔的良好分布，使得不需要搜索孔以便将新条目插入或存储到列表中。 特别地，给定区域中的所有孔保持在一个或多个连续的子区域中。 保持孔连续需要每次有删除操作时都有一个孔移动。 这些操作的摊销成本由于后来的插入（存储）和删除操作的结果简化是合理的。 例如，在插入期间，新条目被放置在区域中所使用条目的连续子区域的末尾。 在删除期间，当在所使用的条目的连续子区域的中间创建孔时，最后使用的条目被移动到孔中，从而保持孔相邻。 在查找表的最长前缀匹配类型中，允许在区域内使用的条目的这种空洞和移动的组织，因为根据定义，区域内的所有条目具有相等长度的IP前缀。

公开(公告)号：US06516383B1

公开(公告)日：2003-02-04

申请号：US09871321

申请日：2001-05-30

Applicant: Abhijit Patra ,  Rina Panigrahy ,  Samar Sharma

Inventor： Abhijit Patra ,  Rina Panigrahy ,  Samar Sharma

IPC: G06F1200

CPC classification number: G11C15/00

Abstract: Techniques for the efficient location of free entries for use in performing insert operations in a binary or ternary content addressable memory. As used in data communications and packet routing, such memories often rely on an organization that maintains entries of the same “length” within defined regions. The present invention keeps the free entries (holes) compacted into a contiguous subregion within each region, without requiring hole movement during deletes. These positive effects are accomplished by initially pre-filling the entire memory with a set of hole codes that each uniquely identify the holes in each region. A conventional memory write is then performed to load routing data into the memory. Typically, such routing information will not fill the entire memory, leaving unused entries (containing the region appropriate hole code) in each region. As entries need to be deleted, they are simply replaced by writing in the region-unique hole code. To insert an entry, the host processor searches for the desired region-unique hole and writes the data to its location. In instances where a region has no available holes, a mechanism is presented to move a hole from a nearby region.

Abstract translation: 用于有效地定位用于在二进制或三进制内容可寻址存储器中执行插入操作的自由条目的技术。 如在数据通信和分组路由中使用的，这样的存储器通常依赖于在定义的区域内维持相同“长度”的条目的组织。 本发明将每个区域内的自由条目（孔）保持在连续的区域内，而不需要在删除期间移动孔。 这些积极的作用是通过最初使用一组孔码预先填充整个存储器来实现的，每组孔码唯一地识别每个区域中的孔。 然后执行传统的存储器写入以将路由数据加载到存储器中。 通常，这样的路由信息​​不会填满整个存储器，在每个区域中留下未使用的条目（包含区域适当的孔码）。 由于条目需要删除，因此只需在区域中编写唯一的孔代码即可。 要插入条目，主机处理器将搜索所需的区域唯一孔，并将数据写入其位置。 在区域没有可用孔的情况下，呈现一个机制来移动附近区域的孔。

公开(公告)号：US09009427B2

公开(公告)日：2015-04-14

申请号：US12364416

申请日：2009-02-02

Applicant: Samar Sharma ,  Silvano Gai ,  Dinesh Dutt ,  Sanjaya Kumar ,  Umesh Mahajan

Inventor： Samar Sharma ,  Silvano Gai ,  Dinesh Dutt ,  Sanjaya Kumar ,  Umesh Mahajan

IPC: G06F12/00 ,  G06F11/20

CPC classification number: G06F11/2069 ,  G06F11/2064 ,  G06F11/2082 ,  G06F11/2087 ,  G06F2201/84

Abstract: A technique is provided for implementing online mirroring of a volume in a storage area network. A first instance of the volume is instantiated at a first port of the fiber channel fabric for enabling I/O operations to be performed at the volume. One or more mirroring procedures may be performed at the volume. In at least one implementation, the first port is able to perform first I/O operations at the volume concurrently while the mirroring procedures are being performed at the first volume. In one implementation, the mirroring procedures may be implemented at a fabric switch of the storage area network. Additionally, in at least one implementation, multiple hosts may be provided with concurrent access to the volume during the mirroring operations without serializing the access to the volume.

Abstract translation: 提供了一种用于实现存储区域网络中的卷的在线镜像的技术。 该卷的第一个实例在光纤通道结构的第一个端口处被实例化，以便在卷上执行I / O操作。 可以在体积上执行一个或多个镜像过程。 在至少一个实现中，第一个端口能够在第一个卷执行镜像过程时同时执行卷上的第一个I / O操作。 在一个实现中，可以在存储区域网络的结构交换机处实现镜像过程。 此外，在至少一个实现中，可以在镜像操作期间向多个主机提供对卷的并发访问，而不对序列化对卷的访问。

公开(公告)号：US08811214B2

公开(公告)日：2014-08-19

申请号：US13442704

申请日：2012-04-09

Applicant: Samar Sharma ,  Sanjaya Kumar ,  Srinivas Avasarala ,  Gaurav Rastogi ,  Jeevan Kamisetty

Inventor： Samar Sharma ,  Sanjaya Kumar ,  Srinivas Avasarala ,  Gaurav Rastogi ,  Jeevan Kamisetty

IPC: G01R31/08

CPC classification number: H04L49/555 ,  H04L12/4641 ,  H04L43/00 ,  H04L43/18 ,  H04L49/357 ,  H04L2212/00

Abstract: Methods and apparatus for performing SPAN for a virtual port are disclosed. Specifically, a frame is received from a first port. The frame or a copy thereof is transmitted to a second port, where the second port is identified in a header of the frame. At least one of the first port and the second port is a virtual port. The frame or a copy thereof is also transmitted to a third port, thereby enabling an analyzer coupled to the third port to analyze traffic received by the third port.

Abstract translation: 公开了用于为虚拟端口执行SPAN的方法和装置。 具体地说，从第一端口接收帧。 帧或其副本被发送到第二端口，其中第二端口在帧的标题中被识别。 第一个端口和第二个端口中的至少一个是虚拟端口。 该帧或其副本也被发送到第三端口，从而使能够耦合到第三端口的分析器来分析由第三端口接收的业务。

公开(公告)号：US20140029423A1

公开(公告)日：2014-01-30

申请号：US13557522

申请日：2012-07-25

Applicant: Devendra Mohan Badhani ,  Chao Feng ,  Samar Sharma ,  Kalyan Venkataramana

Inventor： Devendra Mohan Badhani ,  Chao Feng ,  Samar Sharma ,  Kalyan Venkataramana

IPC: H04L12/56 ,  H04L12/24

CPC classification number: H04L47/125 ,  H04L45/30 ,  H04L47/18

Abstract: Methods and apparatuses for automating return traffic redirection to a service appliance by injecting forwarding policies in a packet-forwarding element are disclosed herein. An example method for automating return traffic redirection can include: establishing a communication channel between a service appliance and a packet-forwarding element; and transmitting an out-of-band message over the communication channel to the packet-forwarding element. The message can include a forwarding policy that requests the packet-forwarding element to forward predetermined packets to the service appliance.

Abstract translation: 本文公开了通过在分组转发元件中注入转发策略来自动将返回业务重定向自动化到服务设备的方法和装置。 用于自动化返回流量重定向的示例方法可以包括：在服务设备和分组转发元件之间建立通信信道; 以及通过所述通信信道向所述分组转发单元发送带外消息。 消息可以包括请求分组转发单元将预定分组转发到服务设备的转发策略。

公开(公告)号：US08332501B2

公开(公告)日：2012-12-11

申请号：US12729975

申请日：2010-03-23

Applicant: Samar Sharma ,  Rahul Chari ,  Sanjaya Kumar

Inventor： Samar Sharma ,  Rahul Chari ,  Sanjaya Kumar

IPC: G06F15/16

CPC classification number: H04L67/1097 ,  G06F11/2028 ,  H04L69/40

Abstract: Methods and apparatus provide formation and management of intelligent application clusters in a storage area network. Disk arbitration mechanisms ensure that a cluster is owned by a single member. In the event of a network partition, each cluster member involved arbitrates to gain ownership of a cluster. High availability mechanisms allow monitoring of system resources and effective failover capabilities.

Abstract translation: 方法和装置提供了存储区域网络中智能应用集群的形成和管理。 磁盘仲裁机制确保集群由单个成员拥有。 在网络分区的情况下，每个集群成员都会仲裁以获得集群的所有权。 高可用性机制允许监视系统资源和有效的故障切换功能。

公开(公告)号：US08165136B1

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

申请号：US11114257

申请日：2005-04-25

Applicant: Samar Sharma ,  Sanjaya Kumar ,  Srinivas Avasarala ,  Gaurav Rastogi ,  Jeevan Kamisetty

Inventor： Samar Sharma ,  Sanjaya Kumar ,  Srinivas Avasarala ,  Gaurav Rastogi ,  Jeevan Kamisetty

IPC: H04B10/08 ,  H04L12/28

CPC classification number: H04L49/555 ,  H04L12/4641 ,  H04L43/00 ,  H04L43/18 ,  H04L49/357 ,  H04L2212/00

Abstract: Methods and apparatus for performing SPAN for a virtual port are disclosed. Specifically, a frame is received from a first port. The frame or a copy thereof is transmitted to a second port, where the second port is identified in a header of the frame. At least one of the first port and the second port is a virtual port. The frame or a copy thereof is also transmitted to a third port, thereby enabling an analyzer coupled to the third port to analyze traffic received by the third port.

Abstract translation: 公开了用于为虚拟端口执行SPAN的方法和装置。 具体地说，从第一端口接收帧。 帧或其副本被发送到第二端口，其中第二端口在帧的标题中被识别。 第一个端口和第二个端口中的至少一个是虚拟端口。 该帧或其副本也被发送到第三端口，从而使能够耦合到第三端口的分析器来分析由第三端口接收的业务。

公开(公告)号：US07793138B2

公开(公告)日：2010-09-07

申请号：US11316026

申请日：2005-12-21

Applicant: Gaurav Rastogi ,  Rajesh Bhandari ,  Samar Sharma ,  Fabio Maino

Inventor： Gaurav Rastogi ,  Rajesh Bhandari ,  Samar Sharma ,  Fabio Maino

IPC: G06F11/00

CPC classification number: H04L63/1458 ,  G06F11/3409 ,  H04L63/101 ,  H04L67/1097

Abstract: Disclosed are methods and apparatus for detecting anomalies in a storage area network (SAN). Provided are one or more anomaly type(s) and corresponding actions to be performed when the one or more anomaly types are detected. Traffic in the SAN is then inspected in order to detect the one or more provided anomaly type(s). When a one of the provided one or more anomaly type(s) is detected, one or more of the corresponding action(s) is performed. The provided anomaly type(s) may include one or more of the following: a read or write access pattern anomaly, excessive login or control requests, a bandwidth usage anomaly, a configuration anomaly, and a hardware anomaly. The provided corresponding actions may include logging and/or publishing the detected anomaly, enabling capture of the detected anomaly by an analysis device, re-authentication of a host that is responsible for the anomaly, disable access control for a host that is responsible for the anomaly, rate control of an anomalous link, and shut down of an anomalous link.

Abstract translation: 公开了用于检测存储区域网络（SAN）中的异常的方法和装置。 提供当检测到一个或多个异常类型时要执行的一个或多个异常类型和相应的动作。 然后检查SAN中的流量，以便检测一个或多个所提供的异常类型。 当检测到所提供的一个或多个异常类型中的一个时，执行相应动作中的一个或多个。 所提供的异常类型可以包括以下中的一个或多个：读取或写入访问模式异常，过度登录或控制请求，带宽使用异常，配置异常和硬件异常。 所提供的相应动作可以包括记录和/或发布检测到的异常，从而能够通过分析设备捕获检测到的异常，对负责异常的主机进行重新认证，禁止负责该异常的主机的访问控制 异常链路的异常速率控制，异常链路的关闭。