Abstract: The method disclosed includes scanning data items stored in the first plurality of nodes of a first cluster. While scanning, creating a partition group index indexing the data items into a plurality of partition groups. Each partition group corresponds to a node of the first plurality of nodes and comprises a subset of data items stored in the node. Storing the index. Instantiating a second cluster, comprising generating per node data, for each node of a second plurality of nodes, based on mappings between the partition groups and the first plurality of nodes. Identifying the data items included in the partition groups according to the partition group index and loading the data items included in the partition groups onto the second plurality of nodes.

Abstract: [Problem] Provided are a management device and a cryptocurrency system capable of smoothly operating an entire system by detecting fraud on cryptocurrencies without using enormous calculation amounts. [Solution] A management device connected to a plurality of user devices via a network, the management device including: an issued information storage area that stores a cryptocurrency ID of an issued cryptocurrency; an account information storage area that stores account information in association with one or a plurality of cryptocurrency IDs; and a history information storage area that stores history information of a cryptocurrency in association with a cryptocurrency ID.

Abstract: The method disclosed is for instantiating a second cluster based on a first cluster. For at least one node of a second plurality of nodes, generating per node data based on mappings between a plurality of partition groups and a first plurality of nodes, the first plurality of nodes corresponding to the first cluster. The method further discloses identifying data items included in the plurality of partition groups based on the mappings between the plurality of partition groups and the first plurality of nodes. The method further discloses each partition group corresponding to a node of the first plurality of nodes and comprising a subset of data items stored in the node. The method further discloses loading the data items included in the plurality of partition groups onto the second plurality of nodes, the second plurality of nodes corresponding to the second cluster.

Abstract: A method for migration of data is provided. The method includes triggering a rebuild of data according to a first migration mechanism from a first storage drive to a second storage drive. Monitoring space utilization associated with the second storage drive, and adaptively switching the migration of the data from the first migration mechanism to a second migration mechanism based on the monitoring.

Abstract: A rack switch coupling system includes a switch device and a plurality of computing devices that are positioned in a rack in a stacked orientation. Each of the computing devices includes a top surface that corresponds with a first plane associated with that computing device, and a bottom surface that corresponds with a second plane associated with that computing device. A port extender system is positioned in the rack and includes respective first ports cabled to each of the computing devices, with each of the respective first ports located adjacent the computing device to which it is cabled and between the first plane and the second plane associated with that computing device. The port extender device also includes a plurality of second ports that are each located adjacent and cabled to switch device, with each respective first port connected to one of the plurality of second ports.

Abstract: A mapped RAID system with a protection group of physical data storage drives calculates an affinity value for each pair of physical data storage drives in the protection group that is equal to a total number of RAID extents to which at least one drive extent is allocated from each of the physical data storage drives in the pair. A change from a previous level of RAID protection to a new level of RAID protection provided by one of the RAID extents is detected. The new level of RAID protection provided by the RAID extent uses fewer drive extents than the previous level of RAID protection provided by the RAID extent. The disclosed technology selects one of the drive extents previously allocated to the RAID extent for deallocation such that the range of the affinity values is minimized after deallocation of the drive extent.

Abstract: Techniques are provided for block allocation for persistent memory during aggregate transition. In a high availability pair including first and second nodes, the first node makes a determination that control of a first aggregate is to transition from the first node to the second node. A portion of available free storage space is allocated from a first persistent memory of the first node as allocated pages within the first persistent memory. Metadata information for the allocated pages is updated with an identifier of the first aggregate to create updated metadata information reserving the allocated pages for the first aggregate. The updated metadata information is mirrored to the second node, so that the second node also reserves those pages. Control of the first aggregate is transitioned to the second node. As a result, the nodes do not attempt allocating the same free pages to different aggregates during a transition.

Abstract: Described herein is a computer implemented method for repairing data inconsistency between a first mirror node and a primary cluster. The method comprises retrieving a snapshot of the one or more objects from a primary cluster; determining from the snapshot of the objects, one or more operations for the mirror node to perform to ensure data consistency between the mirror node and the primary cluster; and performing the operations.

Abstract: A non-volatile dual in-line memory module (NVDIMM) instantiates first and second partitions of non-volatile memory. The first partition is reserved and is not accessible to an operating system instantiated. The second partition is accessible to the operating system. A processor detects a first bad memory location in the second partition, stores a first system physical address of the first bad memory location to a system bad memory locations list, and stores a first DIMM physical address of the first bad memory location to a first NVDIMM bad memory locations list in the first partition.

Abstract: Methods and systems for backing up and restoring sets of electronic files using sets of pseudo-virtual disks are described. The sets of electronic files may be sourced from or be stored using one or more different data sources including one or more real machines and/or one or more virtual machines. A first snapshot of the sets of electronic files may be aggregated from the different data sources and stored using a first pseudo-virtual disk. A second snapshot of the sets of electronic files may be aggregated from the different data sources subsequent to the generation of the first pseudo-virtual disk and stored using the first pseudo-virtual disk or a second pseudo-virtual disk different from the first pseudo-virtual disk.

Abstract: A method comprises predefining a reference data item; creating a relation and inserting a given data item of the set of data items into the relation; inserting each data item of the set of data items into the created relation using a traversal method, wherein the order comparing step comprises in case a comparison result of the currently traversed data item with the reference data item is different from a comparison result of the to be inserted data item with the reference data item inverting the decision logic, and using the inverted decision logic in the decision step; and providing the created relation.

Abstract: Disclosed are systems, computer-readable mediums, and methods for managing input/output operations within a system including at least one client and a storage system. A processor receives information regarding allocated input-output operations (IOPS) associated with a client accessing a storage system storing client data. The information includes a number of allocated total IOPS, a number of allocated read IOPS, and a number of allocated write IOPS. The processor also receives a requested number of write IOPS associated with the at least one client's request to write to the storage system. The processor determines a target write IOPS based on the number of allocated total IOPS, the number of allocated write IOPS and the requested number of write IOPS, and executes the determined target write IOPS within the first time period.

Abstract: A RAID storage-device-assisted RMW system includes a RAID primary data drive that retrieves second primary data via a DMA operation from a host system, and XOR's it with its first primary data to produce first interim parity data that it writes via a DMA operation to a RAID parity data drive. The RAID parity data drive XOR's its first parity data and the first interim parity data to produce second parity data that overwrites the first parity data. The RAID parity data drive also performs GF operations on the first interim parity data and its second interim parity data and XOR's the results to produce interim Q data that it writes via a DMA operation to a RAID Q data drive. The RAID Q data drive XOR's its first Q data and the interim Q data to produce second Q data that overwrites the first Q data.

Abstract: Techniques are provided for replay of metadata and data operations. During initial execution of operations, identifiers of objects modified by the execution of each operation are identified and stored in association with the operations. When the operations are to be replayed (e.g., executed again, such as part of a replication operation or as part of flushing content from a cache to persistent storage), the identifiers are evaluated to determine which operations are independent with respect to one another and which operations are dependent with respect to one another. In this way, independent operations are executed in parallel and dependent operations are executed serially with respect to the operations from the dependent operations depend.

Abstract: Methods for use in a dispersed storage network (DS) to determine appropriate resources for storing data. An example method, implemented by one or more devices of a dispersed storage network (DSN), includes obtaining storage characteristics relating to data stored in a first pool of storage units associated with a first storage tier, the data stored as a set of encoded data slices. Based on the storage characteristics, the method determines to move the data to a target storage pool of storage units associated with a second storage tier. The method also determines whether to re-encode the data for storage in the target storage pool of storage units. When not re-encoding the data, the method includes retrieving the set of encoded data slices, translating associated slice names into translated slice names, and facilitating storage of the encoded data slices in the target storage pool utilizing the translated slice names.

Abstract: A computing device includes an interface configured to interface and communicate with a dispersed storage network (DSN), a memory that stores operational instructions, and a processing module operably coupled to the interface and memory such that the processing module, when operable within the computing device based on the operational instructions, is configured to perform various operations. A computing device receives a data access request for an encoded data slice (EDS) associated with a data object. The computing device compares a slice name of the data access request with slice names stored within RAM. When the data access request slice name compares unfavorably with those stored slice names, the computing device transmits an empty data access response that includes no EDS to the other computing device without needing to access a hard disk drive (HDD) that stores EDSs. Alternatively, the computing device transmits a data access response that includes the EDS.

Abstract: Embodiments of the present invention provide a method and system for managing a storage area. In one embodiment of the present invention, there is provided a method for managing a storage areas, comprising: obtaining a storage area in a storage system according to a predefined dividing rule; determining status regarding whether the storage area has been used; setting a status identifier for the storage area based on the use status; and managing the storage area based on the status identifier. In another embodiment, there is proposed a system for managing a storage area, comprising: one or more processors; a memory coupled to at least one processor of the one or more processors; computer program instructions stored in the memory which, when executed by the at least one processor, cause the system to execute a method for managing a storage area.

Abstract: According to certain aspects, a client computing system can be configured to map stored database data into a plurality of second data units having a second level of granularity larger than first data units; store a mapping of the second data units to the first data units; monitor writes to the database data by the database application; identify of the writes changed first data units of the first data units which have changed as a result of the writes; use the mapping to identify changed second data units of the second data units which each include at least one of the changed first data units; maintain a table listing the changed second data units; and in response to instructions to create a secondary copy of the database data, consult the table to identify the changed second data units, and forward the changed second data units to secondary storage controller computer(s).

Abstract: A disk access method is provided. The method includes: generating an input/output IO request, where the IO request carries a logical unit number LUN and a virtual address of to-be-accessed data; finding, based on the LUN, an LU to be accessed, and determining, based on the virtual address, a virtual address space into which the virtual address falls; determining, based on the determined virtual address space, an access path corresponding to the virtual address space (S230); and delivering, along the access path, the IO request to a controller pointed by the access path.

Abstract: Provided are a computer program product, system, and method for using at least one machine learning module to select a priority queue from which to process an Input/Output (I/O) request. Input I/O statistics are provided on processing of I/O requests at the queues to at least one machine learning module. Output is received from the at least one machine learning module for each of the queues. The output for each queue indicates a likelihood that selection of an I/O request from the queue will maintain desired response time ratios between the queues. The received output for each of the queues is used to select a queue of the queues. An I/O request from the selected queue is processed.

Abstract: The present inventors devised techniques and technologies that streamline the protection of data stored on shared file storage e.g., on file servers, network-attached storage (NAS), share drives, network shares, etc., in a data storage management system. Some embodiments feature a proxy-less backup configuration in which backup services hosts are assigned to perform a secondary copy job, at job runtime, based on host attributes relative to the data source. Some embodiments are configured to, at job runtime, automatically resolve data paths to the source data, and automatically mount the data paths, rather than requiring data paths to be expressly pre-administered on all possible candidate backup machines. Some embodiments automatically protect data from shared file storage that was not expressly given a backup plan (“undefined” data) by applying default preferences for protecting undefined data.

Abstract: A system and method for retaining dynamic random access memory (DRAM) data when reprogramming reconfigurable devices with DRAM memory controllers such as field programmable gate arrays (FPGAs). The DRAM memory controller is utilized in concert with a data maintenance block collocated with the DRAM memory and coupled to an I2C interface of the reconfigurable device, wherein the FPGA drives the majority of the DRAM input/output (I/O) and the data maintenance block drives the self-refresh command inputs. Even though the FPGA reconfigures and the majority of the DRAM inputs are tri-stated, the data maintenance block provides stable input levels on the self-refresh command inputs.

Abstract: In some examples, a system converts a virtual volume from a first volume type to a second volume type without modifying the virtual volume, the converting comprising accessing a source metadata associated with the virtual volume, the source metadata including information for the first volume type, and generating a destination metadata associated with the virtual volume, the destination metadata including information for the second volume type. While the virtual volume is being converted from the first volume type to the second volume type, the system processes a write operation that accesses a portion of the virtual volume and changes data in the accessed portion of the virtual volume.

Abstract: This application relates to apparatus and methods for communication with and management of datacenters, such as cloud datacenters employing multiple servers. A control server may identify a plurality of datacenters from which to request block storage status. The control server may identify a user request to execute multiple requests to obtain the block storage status from the plurality of datacenters. Based on the user request, the control server may generate the plurality of requests. The control server may transmit the plurality of requests to the plurality of datacenters. The control server may determine if a response to the requests is received. The response may include block storage status data identifying whether a service managing storage blocks for the datacenter is operational. The control server may also provide the block storage status for display.

Abstract: In some examples, a tracker receives a write request that is acknowledged upon receipt by a destination media controller without waiting for achievement of persistence of write data associated with the write request. The tracker adds an identifier of the destination media controller to a tracking structure in response to the identifier not already being present in the tracking structure. The tracker sends a request to persist write operations to media controllers identified by the tracking structure.

Abstract: A storage control system generates a striped storage volume in an array of data storage devices. The striped storage volume includes multiple stripe sets, each associated with a different stripe type, and each having stripes that are assigned the stripe type associated with the stripe set. The stripe type represents a block size of the stripes included in the stripe set. A background stripe defragmentation process is performed to defragment stripes in a target stripe set and generate empty stripes. The empty stripes generated by the background stripe defragmentation process are added into an empty stripe set of the striped storage volume. The empty stripes in the empty stripe set have unassigned stripe types. A stripe type is assigned to an empty stripe in the empty stripe which is selected for removal and inclusion in the stripe set associated with the stripe type assigned to the empty stripe.

Abstract: A method of increasing the accuracy of predicting future IO operations on a storage system includes creating a snapshot of a production volume, linking the snapshot to a thin device, mounting the thin device in a cloud tethering subsystem, and tagging the thin device to identify the thin device as being used by the cloud tethering subsystem. When data read operations are issued by the cloud tethering subsystem on the tagged thin device, the data read operations are executed by a front-end adapter of the storage system to forward data associated with the data read operations to a cloud repository. The cache manager, however, does not use information about data read operations on tagged thin devices in connection with predicting future IO operations on the cache, so that movement of snapshots to the cloud repository do not skew the algorithms being used by the cache manager to perform cache management.

Abstract: Techniques for data deduplication may include: receiving write operations that write first data; partitioning the first data into a plurality of data portions; generating, using a first hash function, a plurality of data deduplication hash values for the plurality of data portions, wherein a first data deduplication hash value of the plurality of data deduplication hash values is produced by said generating for a first of the plurality of data portions; performing first processing using a Bloom filter to determine whether the first data deduplication hash value has a corresponding first entry in a data store of deduplication hash values; and responsive to the first processing determining the first data deduplication hash value does not have the corresponding first entry in the data store of deduplication hash values, performing second processing, said second processing including adding the corresponding first entry in the data store of deduplication hash values.

Abstract: A method, computer program product, and computing system for identifying one or more first layer metadata blocks with a plurality of entries mapping to a plurality of entries of one or more second layer metadata blocks. The one or more second layer metadata blocks mapped to by the one or more first layer metadata blocks may be identified. A common back pointer for at least a subset of the plurality of entries of the one or more second layer metadata blocks may be generated, the common back pointer pointing from the at least a subset of the plurality of entries of the one or more second layer metadata blocks to the one or more first layer metadata blocks.

Abstract: A method, a system, an apparatus for allocating a hard disk to a placement group, and a storage medium. An allocated placement group count of each candidate hard disk in a pool of candidate hard disks is acquired, where the allocated placement group count is increased by one count unit, each time said hard disk is allocated to any placement group. A table of allocated placement group counts is established based on the allocated placement group count, where the table reflects a correspondence between candidate hard disks and placement group counts. Candidate hard disks are selected from the table based on an ascending order of the allocated placement group count, to obtain target hard disks, where a quantity of the candidate hard disks is equal to a quantity of hard disks required by a target placement group. The target hard disks are allocated to the target placement group.

Abstract: Example distributed storage systems, controller nodes, and methods provide distributed and redundant data blocks accessed based on storage path cost values. Storage elements are accessible through hierarchical storage paths traversing multiple system components. Data blocks are distributed among the storage elements. System costs are calculated based on the storage path for reaching each storage element and a storage path is selected based on a comparison of the system costs for each storage element. Data blocks are accessed through the selected storage path.

Abstract: A system and method for effectively scheduling read and write operations among a plurality of solid-state storage devices. A computer system comprises client computers and data storage arrays coupled to one another via a network. A data storage array utilizes solid-state drives and Flash memory cells for data storage. A storage controller within a data storage array comprises an I/O scheduler. The storage controller is configured to receive a read request targeted to the data storage medium, and identify at least a first storage device of the plurality of storage devices which contains data targeted by the read request. In response to either detecting or predicting the first storage device will exhibit variable performance, the controller is configured to generate a reconstruct read request configured to obtain the data from one or more devices of the plurality of storage devices other than the first storage device.

Abstract: A notification system for monitoring a multi-component system is disclosed. The notification system comprises a notification processing module and an event processing module. The event processing module comprises an event input and an event classifier module. The event input is configured to receive an event signal that comprises at least one status parameter being indicative of at least one of a status and a status change of at least one component of the multi-component system. The event classifier module is configured to classify the event signal into at least one event class based on the at least one status parameter. The notification processing module is configured to generate no user notification or at least one user notification based on the at least one event class. Further, a method of monitoring a multi-component system is disclosed.

Abstract: A processing system for processing data defining behavior of a physical system, the processing system being configured to operate on: (i) a plurality of data definition objects, each data definition object defining a method for computing one or more output result values for that object in dependence on one or more input values for that object; and (ii) a dependency schema defining one or more dependencies among the data definition objects, each dependency being such that a first data object is dependent on a second data object when the first data object takes as a required input value an output value of the second data object; the data processing system being capable of raising each data definition object to a computed state by executing the method defined in the respective data definition object to thereby compute one or more output values for that data definition object; and being configured to receive from a user an instruction indicating a request to raise a specific data definition object to a computed s

Abstract: Techniques are provided for managing snapshot volume trees in a snapshot-enabled data storage system. A snapshot management system is configured to maintain a snapshot volume tree for a storage volume of a storage system, wherein the snapshot volume tree comprises a data structure which comprises a plurality of snapshot volume nodes corresponding to respective ones of (i) a root volume and (ii) multiple snapshots related directly or indirectly to the root volume, wherein the snapshot volume nodes comprise respective generation times which denote times that the respective snapshot volume nodes were created. The generation times are used in conjunction with write times of data items that are written to the snapshot volume nodes to manage snapshot reading and deletion operations.

Abstract: A computer system has a first node including a first baseboard management controller (BMC) and a first host of the first BMC. The first node determines that the first node is an active node. The first node operates a first storage service at the first host. The first host is a first storage device connected to one or more storage drives. The first storage service manages a first Remote Direct Memory Access (RDMA) controller for accessing user data stored on the one or more storage drives. The first node indicates to a second node that the first node is operating normally. The first node syncs data available on the first node with the second node.

Abstract: Intelligently moving data between storage systems, including: identifying characteristics associated with a plurality of data communications paths between a source storage system and a plurality of target storage systems; identifying characteristics associated with a plurality of data communications paths between two or more target storage systems; selecting, using the characteristics associated with the plurality of data communications paths between the source storage system and the plurality of target storage systems and the characteristics associated with a plurality of data communications paths between two or more target storage systems, an optimal path between the source storage system and each of the target storage systems; and migrating data stored on the source storage system to each of the target storage systems utilizing the optimal paths.

Abstract: Embodiments disclosed herein provide systems, methods, and computer readable media for sub-cluster recovery in a data storage environment having a plurality of storage nodes. In a particular embodiment, the method provides scanning data items in the plurality of nodes. While scanning, the method further provides indexing the data items into an index of a plurality of partition groups. Each partition group includes data items owned by a particular one of the plurality of storage nodes. The method then provides storing the index.

Abstract: A video management apparatus includes a storage processing unit configured to store, in a storage unit, video data received through a network, a determination unit configured to determine whether or not video data groups stored in the storage unit are analyzed based on a first period of time indicating a period of time until a free capacity becomes insufficient in the storage unit and a second period of time indicating a maximum analysis time required for analysis of the video data groups, a first calculation unit configured to analyze the video data groups to calculate a predetermined statistic in a case where it is determined that the video data groups are analyzed, and a deletion unit configured to delete the analyzed video data groups.

Abstract: The present disclosure generally relates to methods of operating storage devices. The storage device comprises a controller and a storage unit divided into a plurality of zones. The storage unit comprises a plurality of dies, where each die comprises two planes. One erase block from each plane of a die is selected for zone formation. Each erase block comprises a plurality of wordlines. A zone comprises one or two dies dedicated to storing parity data and a plurality of dies dedicated to storing user data. The zone further comprises space devoted for controller metadata. The storage device restricts a host device to send write commands in a minimum write size to increase programming efficiency. The minimum write size equals one wordline from one erase block from each plane of each die in the zone dedicated to storing user data minus the space dedicated to metadata.

Abstract: Techniques for managing disks involve determining, based on a parameter related to a capability of a plurality of disks, a reference capability parameter for each of the plurality of disks. In addition, the techniques involve determining a used capability parameter for each of the plurality of disks. Moreover, the techniques involve determining from the plurality of disks a first disk to be adjusted, a used capability parameter of the first disk exceeds a reference capability parameter of the first disk. The techniques further involve causing data of at least one disk slice in the first disk to be moved to a second disk of the plurality of disks, such that a difference between the used capability parameter of the first disk and reference capability parameter of the first disk is below a predetermined threshold. Accordingly, a balanced operation among respective storage disks can be achieved.

Abstract: Disclosed herein are methods, systems, and apparatus, including computer programs encoded on computer storage devices, for data processing and storage. One of the methods includes receiving, by a storage system, a plurality of write requests for storing a respective plurality of blockchain data in the storage system. Each of the plurality of the blockchain data includes: a value of one or more of a block, a transaction, or a state of a blockchain network, and a key corresponding to the value. The storage system appends the plurality of the blockchain data to a data log file according to a chronological order of the plurality of the blockchain data, and refrains from sorting the plurality of the blockchain data in the data log file according to respective keys of values in the plurality of the blockchain data.

Abstract: An example system includes a storage device. The system also includes a file creation component to create a blank file on the storage device. The system further includes a block copy component to edit the blank file to include a block-for-block copy of a boot partition. The system further includes a logical copy component to copy data determined to be live from a root partition to the blank file. The root partition includes live and unreferenced versions of a stored file.

Abstract: This disclosure provides techniques hierarchical address virtualization within a memory controller and configurable block device allocation. By performing address translation only at select hierarchical levels, a memory controller can be designed to have predictable I/O latency, with brief or otherwise negligible logical-to-physical address translation time. In one embodiment, address transition may be implemented entirely with logical gates and look-up tables of a memory controller integrated circuit, without requiring processor cycles. The disclosed virtualization scheme also provides for flexibility in customizing the configuration of virtual storage devices, to present nearly any desired configuration to a host or client.

Abstract: Techniques involve determining a stripe width of an array and metadata of candidate disks available for allocating a new array, the metadata indicating a total slice number in each of the candidate disks and a number of used slices in the candidate disks. The techniques further involve determining, based on the width and the total slice number, a first number of slices in the candidate disks that are available. The techniques further involve determining, based on the number of the used slices, a second slice number in the used slices that are available; and determining, based on the first number and the second number, utilization rates of the candidate disks for the allocation for the new array. Such techniques may make the utilization rates of the candidate disks more accurate, which ensures uniform use of the respective candidate disks and improves the performance of the candidate disks.

Abstract: An autonomous RAID data storage device locking system includes first RAID data storage device(s) that store data included in a data stripe, and that are coupled to a second RAID data storage device. The second RAID data storage device receives a command to perform a data update operation on a subset of data included in the data stripe, and transmits a locking request to each first RAID data storage device. When the second RAID data storage device receives a locking confirmation that indicates that each first RAID data storage device is locked, it completes the data update operation on the subset of data included in the data stripe. The second RAID data storage device then transmits an unlocking request to each first RAID data storage device to cause them to unlock, and transmits a completion communication that indicates that the data update operation has been performed.

Abstract: A RAID storage management system includes a plurality of RAID storage devices and a controller configured to manage the plurality of RAID storage devices. The RAID storage management system also includes at least one expander operatively connected to the controller and operatively connected to the plurality of RAID storage devices. The expander is configured to receive a request from the controller for a RAID operation. The expander is also configured to, upon receiving the request, operate to assist the controller in performing the requested RAID operation.

Abstract: Methods and systems for backing up and restoring different point in time versions of a virtual machine, an application, a database, or an electronic file using independently managed snapshot chains are described. In some cases, different point in time versions of a virtual machine may be captured and stored using one or more snapshot chains. Each snapshot chain may correspond with a base image (e.g., a full image snapshot) and one or more incremental files (e.g., two forward incremental files) that derive from the base image. A snapshot chain may be split into a plurality of shards or sub-chains such that the width of each shard or the maximum data size of the files in each shard is less than a threshold data size (e.g., is less than 1 TB). Data operations (e.g., consolidation and reverse operations) may be performed on the individual shards or sub-chains in parallel.

Abstract: Example implementations relate to hard zoning capabilities for devices using Internet small computer system interface (iSCSI) protocol. For example, a method includes creating a virtual local area network (VLAN) at an Ethernet switch between an initiator and target adapter. The method includes assigning an access control list (ACL) to the VLAN, The method includes segregating a device of a plurality of devices connected to the SAN into a zone group. The method also includes controlling access of a zone group based on the ACL and frame filtering.

Abstract: An ALUA path distribution system includes host devices coupled to storage subsystems by aggregated networking devices. A first aggregated networking device snoops communications between the host devices and the storage subsystems to identify first snooped information, receives second snooped information identified by a second aggregated networking device, and uses the snooped information to build a path distribution table identifying each active-optimized path provided by the aggregated networking devices between the host devices and respective LUNs on the storage subsystems.