Abstract: A storage node for a distributed object storage system, comprising a control board configured to receive a parameter for setting predetermined allowable temperature ranges through a serial port, and sending a signal through said serial port for indicating one or more of said measurements of temperatures lies outside said predetermined allowable ranges. The control board is further configured to receive a parameter for controlling the switching on or off the storage elements through said serial port by sending a signal through said serial port to indicate which storage elements is switched on or off.

Abstract: The present invention is directed to a method of storing a data set in a storage system. Said storage system comprises a plurality of storage entities. The method comprises the following steps. A step of forming at least one data set block from said data set using a fragmentation entity. A step of encoding said at least one data set block by means of an encoding entity, wherein said encoding entity provides a plurality of encoded blocks based on said at least one data set block at an output of said encoding entity. And a step of distributing said encoded blocks amongst at least two of said storage entities using a distribution entity for storage thereof by said storage entities. Said encoding entity uses a rateless erasure encoding algorithm based on rateless codes for encoding said at least one data set block. The invention is further directed to a storage system and a computer program product.

Abstract: A storage node for a distributed object storage system, comprising a control board configured to receive a parameter for setting predetermined allowable temperature ranges through a serial port, and sending a signal through said serial port for indicating one or more of said measurements of temperatures lies outside said predetermined allowable ranges. The control board is further configured to receive a parameter for controlling the switching on or off the storage elements through said serial port by sending a signal through said serial port to indicate which storage elements is switched on or off.

Abstract: The present invention is directed to a method of storing a data set in a storage system. Said storage system comprises a plurality of storage entities. The method comprises the following steps. A step of forming at least one data set block from said data set using a fragmentation entity. A step of encoding said at least one data set block by means of an encoding entity, wherein said encoding entity provides a plurality of encoded blocks based on said at least one data set block at an output of said encoding entity. And a step of distributing said encoded blocks amongst at least two of said storage entities using a distribution entity for storage thereof by said storage entities. Said encoding entity uses a rateless erasure encoding algorithm based on rateless codes for encoding said at least one data set block. The invention is further directed to a storage system and a computer program product.

Abstract: A system and method for efficiently backing up and restoring computer files to a central storage system. A hashing key is computed for each file to be backed up on a target computer. The hashing key is compared to a list of hashing keys stored locally to see if the local file has been previously backed up. If the hashing key is not listed locally, then the hashing key is compared to a list of hashing keys of centrally backed up files. Only if the hashing key is not present in both the local and the central list is the file backed up. Backed up files may be renamed to their hashing key for further efficiencies.

Abstract: A system may be provided which is operable to determine a routing node for a data object. The system can comprise an identifier generator operable to generate an identifier for the data object on the basis of data content thereof, and a lookup engine operable to compare the identifier for the data object to a routing table to determine a routing node for the data element.

Abstract: A backup system can be provided, which system can comprise an identifier operable to identify a data object for possible backup and a generator operable to generate an identity representation for the data object on the basis of the content thereof. The identity representation can be transmitted to a backup store where it can be tested against identity representations for previously stored objects. The system can also comprise a receiver operable to receive from the backup store an indication of whether the data object described by the identity representation has previously been stored at the backup store. The system can be operable to transmit the data object to the backup store in the event that the data object described by the identity representation has not previously been stored at the backup store.

Abstract: A system and method for generating web based multi-tier, wiki-based control panels that provides a technique for provisioning and managing datacenter services, such as for example physical and virtual servers.

Abstract: An application level virtual private network (VPN) that provides access for individual applications running on a client computer to physical or virtual servers running in a datacenter is provided. The access connection is secure, automatically setup and does not require changing the network configuration of the client computer. The application running of a client computer, such as a keyboard-video-mouse (KVM), is automatically launched with a single click from the user.

Abstract: A virtual private datacenter system and method are provided. A method for capacity planning of a virtual private datacenter and a method for chargeback for use of the virtual private datacenter also are disclosed.

Abstract: A data backup system can be operable to determine whether to send a data file segment to backup storage. The data backup system can comprise a comparator operable to compare a boundary parameter of a candidate segment proposed for sending to backup storage to a boundary parameter of a previously stored segment to determine whether the candidate segment potentially corresponds to the previously stored segment. The data backup system can also comprise a comparator operable, if it is determined that the candidate segment potentially corresponds to the previously stored segment, to compare a checksum value for the candidate segment to a checksum value for the previously stored segment to determine whether the candidate segment has previously been stored to the second location. A storage engine can be provided to send to backup storage a segment determined not to have previously been stored.

Abstract: There can be provided a system, method and apparatus to enable a data object to be removed from a single-instancing data object store in such a way as to ensure that only data objects to which all references have been removed are actually removed from the store. Thereby, consistency and reliability of storage can be maintained while allowing a data object which genuinely needs to be deleted to be removed from the store.

Abstract: The storage system and method stores both primary data and backups of the primary data so that the need for separate storage appliances to store backups is eliminated. In one embodiment, the backup data is located on parts of a disk with lower read and write speed and the parts of the disks with the highest read and write speed are used for primary data.

Abstract: A block based storage system and method uses RAM memory to implement the buffers and is made redundant by replicating the buffer cache to an in-memory buffer cache on a separate caching unit. Replication can be done using one or more parity schemes (e.g. RAID 1, RAID 5, RAID 6) and/or other replication processes.

Abstract: A system and method for efficiently backing up and restoring computer files to a central storage system. A hashing key is computed for each file to be backed up on a target computer. The hashing key is compared to a list of hashing keys stored locally to see if the local file has been previously backed up. If the hashing key is not listed locally, then the hashing key is compared to a list of hashing keys of centrally backed up files. Only if the hashing key is not present in both the local and the central list is the file backed up. Backed up files may be renamed to their hashing key for further efficiencies.

Abstract: A system and method for efficiently backing up and restoring computer files to a central storage system. A hashing key is computed for each file to be backed up on a target computer. The hashing key is compared to a list of hashing keys stored locally to see if the local file has been previously backed up. If the hashing key is not listed locally, then the hashing key is compared to a list of hashing keys of centrally backed up files. Only if the hashing key is not present in both the local and the central list is the file backed up. Backed up files may be renamed to their hashing key for further efficiencies.

Abstract: A method and system for performing securing and controlling of a network using content identification of files in a network having a central infrastructure and local computing devices is presented. The method comprises calculating a hash value of a new file created or received on a local computing device, transmitting the hash value to the central infrastructure, comparing the hash value with a previously determined hash value stored in a database on the central infrastructure to determine whether the file is new to the network and if the file is new to the network, checking the file content with a content identifying engine, installed and updated on the central infrastructure. Content attributes are determined for the files which allow to perform appropriate actions on the local computing devices according to policy rules.

Abstract: A system and method for efficiently backing up and restoring computer files to a central storage system. A hashing key is computed for each file to be backed up on a target computer. The hashing key is compared to a list of hashing keys stored locally to see if the local file has been previously backed up. If the hashing key is not listed locally, then the hashing key is compared to a list of hashing keys of centrally backed up files. Only if the hashing key is not present in both the local and the central list is the file backed up. Backed up files may be renamed to their hashing key for further efficiencies.