Abstract: A policy-based data management system, method, and apparatus are disclosed. The system, method, and apparatus are configured to operate over a distributed storage system such as a storage area network (SAN). Files to be stored on the network are each assigned a service class and a storage pool based on the application of policies to file attributes such as file name, type, user, etc. The service class and storage pool designations are stored as metadata. Files may be retrieved using the metadata to identify the storage pool where the file is stored, and the service class listed within the metadata may be used to control the manner in which the file is handled. A metadata server may be utilized to provide the appropriate service class of files in response to requests from remote clients that may be of different computing platforms.

Abstract: A policy-based data management system, method, and apparatus are disclosed. The system, method, and apparatus are configured to operate over a distributed storage system such as a storage area network (SAN). Files to be stored on the network are each assigned a service class and a storage pool based on the application of policies to file attributes such as file name, type, user, etc. The service class and storage pool designations are stored as metadata. Files may be retrieved using the metadata to identify the storage pool where the file is stored, and the service class listed within the metadata may be used to control the manner in which the file is handled. A metadata server may be utilized to provide the appropriate service class of files in response to requests from remote clients that may be of different computing platforms.

Abstract: Conflicts are resolved between competing nodes in a multi-node communications network. After a first node in the network requests an initiation of communications with a target node, the requesting node may simply initiate the requested communications with the target node if the target node is not busy. If the first node determines that the target node is busy, it proceeds to resolve the conflict. Namely, the first node repeats the process of waiting for a first delay then requesting initiation of communications with the target node. After each unsuccessful attempt, the first delay is successively increased. As an example, the delay may be increased exponentially, with a controlled randomness added. After a or more queued messages to other nodes. Following this, the first node performs another sequence to initiate communications with the target node, successively increasing the delay between unsuccessful attempts, as before.

Abstract: A distributed data processing system includes a plurality of nodes interconnected by bidirectional communication links. Each node includes a control message line for handling of control messages and a control memory for storing the control messages. Each node further includes data message line for handling of data messages and a data memory for storing the data messages. A processor in the node causes the data message line to queue and dispatch data messages from the data memory and the control message line to queue and dispatch control messages from the control memory. Each node includes N bidirectional communication links enabling the node to have at least twice as much input/output bandwidth as the control message line and data message line, combined. An input/output switch includes a routing processor and is coupled between the N bidirectional communication links, the data message line and control message line.