公开(公告)号：US07356573B2

公开(公告)日：2008-04-08

申请号：US11177880

申请日：2005-07-08

申请人： Samar Sharma ,  Roy M. D'Cruz ,  Sanjaya Kumar ,  Prashant Billore ,  Dinesh G. Dutt ,  Thomas J. Edsall

发明人： Samar Sharma ,  Roy M. D'Cruz ,  Sanjaya Kumar ,  Prashant Billore ,  Dinesh G. Dutt ,  Thomas J. Edsall

IPC分类号： G06F15/16 ,  G06F15/167 ,  G06F3/00 ,  H04L12/50

CPC分类号： H04L67/1097 ,  H04L63/00 ,  H04L63/30

摘要： Disclosed are methods and apparatus for data tapping within a storage area network (SAN) and providing tapped data to a third party device, such as an appliance. In general, mechanisms are provided in a SAN to allow a data tap of data flowing between an initiator and a target. In one implementation, a data virtual target (DVT) in created in a network device to intercept data sent by a specific initiator to a specific logical unit of a specific target. The data or a copy of the data is sent to both the specific logical unit of the specific target and to an appliance. The data routing may be accomplished by use of a virtual initiator (VI), which is configured to send the data (or a copy of the data) to the specific target and the appliance. In a transparent mode of operations, the DVT has a same PWWN (port world wide name) and FCID (fibre channel identifier) as the specific target. In a first proxy mode of operation, the DVT has a different PWWN and FCID than the specific target. In a second proxy mode of operation, the DVT has a same PWWN and different FCID than the specific target.

摘要翻译： 公开了用于在存储区域网络（SAN）内进行数据窃取的方法和装置，并且向第三方设备（例如设备）提供分接数据。 通常，在SAN中提供机制以允许在启动器和目标之间流动的数据的数据抽头。 在一个实现中，在网络设备中创建的数据虚拟目标（DVT），以将由特定发起者发送的数据截取到特定目标的特定逻辑单元。 将数据或数据副本发送到特定目标的特定逻辑单元和设备。 可以通过使用虚拟启动器（VI）来实现数据路由，其被配置为将数据（或数据的副本）发送到特定目标和设备。 在透明的操作模式下，DVT具有与特定目标相同的PWWN（端口世界名称）和FCID（光纤通道标识符）。 在第一代理操作模式下，DVT具有与特定目标不同的PWWN和FCID。 在第二代理操作模式下，DVT具有与特定目标相同的PWWN和不同的FCID。

公开(公告)号：US20080034167A1

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

申请号：US11499372

申请日：2006-08-03

申请人： Samar Sharma ,  Dinesh G. Dutt ,  Fabio R. Maino ,  Sanjaya Kumar

发明人： Samar Sharma ,  Dinesh G. Dutt ,  Fabio R. Maino ,  Sanjaya Kumar

IPC分类号： G06F12/14

CPC分类号： G06F3/0665 ,  G06F3/0622 ,  G06F3/0631 ,  G06F3/067

摘要： 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.

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

公开(公告)号：US07299317B1

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

申请号：US10165572

申请日：2002-06-08

申请人： Rina Panigrahy ,  Samar Sharma

发明人： Rina Panigrahy ,  Samar Sharma

IPC分类号： G06F12/00 ,  G06F13/00 ,  G06F13/28

CPC分类号： G11C15/00

摘要： 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.

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

公开(公告)号：US06725326B1

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

申请号：US09639387

申请日：2000-08-15

申请人： Abhijit Patra ,  Rina Panigrahy ,  Samar Sharma

发明人： Abhijit Patra ,  Rina Panigrahy ,  Samar Sharma

IPC分类号： G06F1200

CPC分类号： H04L45/7453 ,  G06F12/023 ,  H04L49/90

摘要： 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.

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

公开(公告)号：US06516383B1

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

申请号：US09871321

申请日：2001-05-30

申请人： Abhijit Patra ,  Rina Panigrahy ,  Samar Sharma

发明人： Abhijit Patra ,  Rina Panigrahy ,  Samar Sharma

IPC分类号： G06F1200

CPC分类号： G11C15/00

摘要： 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.

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

公开(公告)号：US09225671B2

公开(公告)日：2015-12-29

申请号：US13588185

申请日：2012-08-17

申请人： Ankur Goyal ,  Samar Sharma ,  Manuwela Kanade

发明人： Ankur Goyal ,  Samar Sharma ,  Manuwela Kanade

IPC分类号： G06F15/177 ,  H04L12/931 ,  H04L12/24 ,  H04L12/28

CPC分类号： H04L45/02 ,  H04L12/2859 ,  H04L41/0893 ,  H04L49/65 ,  H04L49/70 ,  Y02B70/30 ,  Y02D30/30

摘要： In some embodiments, a virtual device context (vDC) domain may be advertised to other network devices. If at least a partition of each device is determined to belong to the same vDC domain, the network interface communicating with the at least one device may be activated.

摘要翻译： 在一些实施例中，虚拟设备上下文（vDC）域可以被通告给其他网络设备。 如果确定每个设备的至少一个分区属于相同的vDC域，则可以激活与该至少一个设备通信的网络接口。

公开(公告)号：US08644174B2

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

申请号：US12573815

申请日：2009-10-05

申请人： Rajesh Bhandari ,  Samar Sharma ,  Sanjaya Kumar

发明人： Rajesh Bhandari ,  Samar Sharma ,  Sanjaya Kumar

IPC分类号： H04J1/16 ,  G06F15/167 ,  G06F12/00

CPC分类号： H04L67/1097

摘要： The disclosed embodiments support improvements in network performance in networks such as storage area networks. This is particularly important in networks such as those implementing virtualization. These improvements, therefore, support improved mechanisms for performing processing in network devices such as switches, routers, or hosts. These improvements include various different mechanisms which may be used separately or in combination with one another. These mechanisms include methods and apparatus for processing traffic in an arbitrated loop, performing striping to support fairness and/or loop tenancy, performing configuration of network devices such as switches to enable virtualization to be performed closest to the storage device (e.g., disk), ascertaining a CPU efficiency that quantifies the impact of virtualization on a processor, and configuring or accessing a striped volume to account for metadata stored in each storage partition.

摘要翻译： 所公开的实施例支持诸如存储区域网络的网络中的网络性能的改进。 这在执行虚拟化的网络中尤其重要。 因此，这些改进支持在网络设备（如交换机，路由器或主机）中执行处理的改进机制。 这些改进包括可以单独使用或彼此组合使用的各种不同的机制。 这些机制包括用于处理仲裁环路中的业务的方法和装置，执行条带化以支持公平性和/或循环租赁，执行诸如交换机之类的网络设备的配置以使虚拟化最靠近存储设备（例如，盘）执行， 确定量化虚拟化对处理器的影响的CPU效率，以及配置或访问条带卷以考虑存储在每个存储分区中的元数据。

公开(公告)号：US20130182708A1

公开(公告)日：2013-07-18

申请号：US13351612

申请日：2012-01-17

申请人： Samar Sharma ,  Chandramouli Radhakrishnan ,  Sameer Merchant ,  Anand Parthasarathy ,  Murali Basavaiah

发明人： Samar Sharma ,  Chandramouli Radhakrishnan ,  Sameer Merchant ,  Anand Parthasarathy ,  Murali Basavaiah

IPC分类号： H04L12/56

CPC分类号： H04L12/4625 ,  H04L49/70 ,  H04L67/1097

摘要： Techniques and a network edge device are provided herein to extend local area networks (LANs) and storage area networks (SANs) beyond a data center while converging the associated local area network and storage area network host layers. A packet is received at a device in a network. It is determined if the packet is routed to a local or remote storage area network or local area network. In response to determining that the packet routed to a remote storage area network, storage area network extension services are performed with respect to the packet in order to extend the storage area network on behalf of a remote location. In response to determining that the packet is routed to a local local area network traffic, local area network extension services are performed with respect to the packet in order to extend the local area network on behalf of the remote location.

摘要翻译： 技术和网络边缘设备在本文中被提供以将局域网（LAN）和存储区域网络（SAN）扩展到数据中心之外，同时会聚相关联的局域网和存储区域网络主机层。 在网络中的设备处接收到分组。 确定分组是否被路由到本地或远程存储区域网络或局域网。 响应于确定分组路由到远程存储区域网络，针对分组执行存储区域网络扩展服务，以便代表远程位置扩展存储区域网络。 响应于确定分组被路由到本地局域网业务，相对于分组执行局域网扩展服务，以便代表远程位置扩展局域网。

公开(公告)号：US08274993B2

公开(公告)日：2012-09-25

申请号：US11454239

申请日：2006-06-16

申请人： Samar Sharma ,  Chandan Mishra ,  Fabio Maino

发明人： Samar Sharma ,  Chandan Mishra ,  Fabio Maino

IPC分类号： H04J3/16

CPC分类号： H04L41/0806 ,  H04L41/06 ,  H04L41/082 ,  H04L41/0886 ,  H04L67/1097

摘要： Zone information is automatically and dynamically configured and managed in a fiber channel storage area network upon detection of network events. Some examples of events that trigger automatic dynamic zone updates include virtual port creation, intrusion/anomaly detection, arbitration decision completion, misconfiguration detection, and device malfunction. The newly created/updated zones are propagated through the fiber channel fabric and provide access control.

摘要翻译： 检测到网络事件后，区域信息在光纤通道存储区域网络中自动和动态地配置和管理。 触发自动动态区域更新的事件的一些示例包括虚拟端口创建，入侵/异常检测，仲裁决定完成，配置错误检测和设备故障。 新创建/更新的区域通过光纤通道结构传播，并提供访问控制。

公开(公告)号：US08131857B2

公开(公告)日：2012-03-06

申请号：US11827474

申请日：2007-07-11

申请人： Dinesh G. Dutt ,  Sanjaya Kumar ,  Arindam Paul ,  Samar Sharma

发明人： Dinesh G. Dutt ,  Sanjaya Kumar ,  Arindam Paul ,  Samar Sharma

IPC分类号： G06F15/173 ,  G06F15/16

CPC分类号： H04L67/1097 ,  H04L47/10 ,  H04L47/13

摘要： In one embodiment, a network device receives a port login directed to a target from a first host. The network device determines whether at least one other host is currently logged in to the target. The network device may then send a port login to the target corresponding to whether at least one other host is currently logged in to the target.

摘要翻译： 在一个实施例中，网络设备从第一主机接收定向到目标的端口登录。 网络设备确定至少一个其他主机是否当前登录到目标。 然后，网络设备可以向目标发送对应于至少一个其他主机当前是否登录到目标的端口登录。