Abstract: Embodiments provide systems and methods for verifying paths to databases. A method for identifying paths to a database may comprise opening a database in a set of databases utilizing a known path to the database, creating an object in the database and checking for the object utilizing one or more paths in a set of paths to databases, wherein paths in the set of paths corresponding to a database containing the alias are paths to the database. By repeating the above process for multiple databases, paths to multiple databases may be verified.

Abstract: A computer-implemented method, apparatus, and computer program product are disclosed for securing node port access in a switched-fabric storage area network. Permitted combinations of fabric port identifiers and node port identifiers are specified. A node port receives a request to access the node port. A node port identifier, which identifies the device that is attempting to access the node port, is determined from the request. A fabric port identifier is determined that identifies a fabric port through which the device transmitted the request. Access to the node port is granted if the fabric port identifier and node port identifier form a permitted combination.

Abstract: A method, system and device for simulating cable failures in a network are disclosed. In a first aspect, a plurality of optical cables which couple a plurality of devices within the network to each other are provided. The method and system includes providing at least one programmable device on one of the plurality of optical cables. The at least one programmable device allows for controlled simulated cable failures. In a second aspect, the network comprises: a plurality of devices and a plurality of optical cables for interconnecting the devices. The network also includes at least one programmable device coupled to one of the optical cables, the at least one programmable device allows for controlled simulated cable failures. In a third aspect, the programmable device is used in a network for simulating cable failures in the network. The network includes a plurality of devices and a plurality of optical cables for interconnecting the devices.

Abstract: A method, system and device for simulating cable failures in a network are disclosed. In a first aspect, a plurality of optical cables which couple a plurality of devices within the network to each other are provided. The method and system includes providing at least one programmable device on one of the plurality of optical cables. The at least one programmable device allows for controlled simulated cable failures. In a second aspect, the network comprises: a plurality of devices and a plurality of optical cables for interconnecting the devices. The network also includes at least one programmable device coupled to one of the optical cables, the at least one programmable device allows for controlled simulated cable failures. In a third aspect, the programmable device is used in a network for simulating cable failures in the network. The network includes a plurality of devices and a plurality of optical cables for interconnecting the devices.

Abstract: A method, system and computer readable instructions for generating a random number consisting of a plurality of binary bits is provided. A race condition gate is set. An atomic lock is accessed wherein a first racer representing a first binary bit and a second racer representing a second binary bit race toward the atomic lock upon release of the race condition gate. A determination is made as to which of the first racer, representing the first binary bit, and the second racer, representing the second binary bit, gain access to the atomic lock earliest. The atomic lock is retrieved based on the determination of which racer gains access to the atomic lock earliest. A single binary value is then written to a data stream, the single binary value is based on which of the first racer and the second racer retrieves the atomic lock.

Abstract: A method, system and computer readable instructions for generating a random number consisting of a plurality of binary bits is provided. A race condition gate is set. An atomic lock is accessed wherein a first racer representing a first binary bit and a second racer representing a second binary bit race toward the atomic lock upon release of the race condition gate. A determination is made as to which of the first racer, representing the first binary bit, and the second racer, representing the second binary bit, gain access to the atomic lock earliest. The atomic lock is retrieved based on the determination of which racer gains access to the atomic lock earliest. A single binary value is then written to a data stream, the single binary value is based on which of the first racer and the second racer retrieves the atomic lock.