Abstract: A method, computer program product, and computing system for defining one or more computing system requirements for desired data storage array. One or more design criteria is defined for the desired data storage array. At least one recommended data storage array is identified for the desired data storage array based, at least in part, upon the one or more computing system requirements and the one or more design criteria.

Abstract: Described are techniques for determining data storage system configurations. Inputs are provided to a data storage system configuration generator. The inputs include first inputs and second inputs. The first inputs include a performance objective, a storage capacity, and input(s) characterizing an I/O workload. The second inputs characterize performance of data storage system components and costs of the data storage system components. First processing is performed by the data storage system configuration generator in accordance with the inputs to determine a set of one or more candidate data storage system configurations. The data storage system configuration selects, in accordance with one or more criteria, a first candidate data storage system configuration from the set.

Abstract: A system for facilitating data discovery on a network, wherein the network has one or more data storage devices. The system may include a crawler program configured to select at least a first set of files and a second set of files, each of the first set of files and the second set of files being stored in at least one of the one or more data storage devices. The system may also include a data fetcher program configured to obtain a copy of the first set of files, the data fetcher program being further configured to resist against obtaining a copy of the second set of files. The system may also include circuit hardware implementing one or more functions of one or more of the crawler program and the data fetcher program.

Abstract: A system for facilitating data discovery on a network, wherein the network has one or more data storage devices. The system may include a crawler program configured to select at least a first set of files and a second set of files, each of the first set of files and the second set of files being stored in at least one of the one or more data storage devices. The system may also include a data fetcher program configured to obtain a copy of the first set of files, the data fetcher program being further configured to resist against obtaining a copy of the second set of files. The system may also include circuit hardware implementing one or more functions of one or more of the crawler program and the data fetcher program.

Abstract: The present invention concerns a technique for providing Class-of-Service Routing in an ATM network (10) that utilizes the Private Network-Network Interface (PNNI) protocol. An originating node seeking to route a call to a terminating node does so by initially determining the class-of-service and then selecting a shortest length path there-between. Each successive link on the selected path is examined for sufficient available bandwidth and available depth (i.e., bandwidth not reserved for other services) for the Class-of-Service of the call. If every link possesses sufficient available bandwidth, then the call passes on the selected path. Otherwise, should a link on the selected path lack sufficient bandwidth and available depth, then a crankback message is sent to the originating node, and the originating node selects the next shortest path. Thereafter, the process of examining each link for sufficient bandwidth is repeated. If no path is found, the call is ultimately blocked.

Abstract: A node in a network running a link-state routing protocol identifies certain routing control messages and stores the identified messages in separate queues. The queues are weighted such that each message type is allotted a predetermined amount of processing overhead to optimize the message processing by a node. In one embodiment, the node processor processes the queued messages in accordance with the entries in a weighted round robin polling table. An upper limit of processing time can be specified for each visit to a particular message queue.

Abstract: A node in a network running a link-state routing protocol identifies certain routing control messages and stores the identified messages in separate queues. The queues are weighted such that each message type is allotted a predetermined amount of processing overhead to optimize the message processing by a node. In one embodiment, the node processor processes the queued messages in accordance with the entries in a weighted round robin polling table. An upper limit of processing time can be specified for each visit to a particular message queue.

Abstract: A network utilizing a link-state protocol includes a plurality of nodes with associated trunks that recover in a staggered manner. A first trunk associated with a first node is selected for recovery. After the first trunk is recovered, further trunks are selected such that N or less trunks recover at the same time until all trunks associated with the first node are selected for recovery. Node recovery is staggered at selected intervals to minimize or eliminate overload conditions. Staggered recovery in accordance with the present invention can reduce the likelihood of trunk loss due to excessive HELLO messages in an OSPF system and retransmission and retransmission lockout.

Abstract: The present invention concerns a technique for providing Class-of-Service Routing in an ATM network (10) that utilizes the Private Network-Network Interface (PNNI) protocol. An originating node seeking to route a call to a terminating node does so by initially determining the class-of-service and then selecting a shortest length path there-between. Each successive link on the selected path is examined for sufficient available bandwidth and available depth (i.e., bandwidth not reserved for other services) for the Class-of-Service of the call. If every link possesses sufficient available bandwidth, then the call passes on the selected path. Otherwise, should a link on the selected path lack sufficient bandwidth and available depth, then a crankback message is sent to the originating node, and the originating node selects the next shortest path. Thereafter, the process of examining each link for sufficient bandwidth is repeated. If no path is found, the call is ultimately blocked.

Abstract: The priority of the flow of packets representing calls or other connection requests within a packet network (10) is determined from the Class-of-Service of the call. Upon receipt of a call, a recipient router (121, 122, 123) identifies available paths, typically by exchanging messages with the other routers in the network. After selecting the path, the recipient router or centralized bandwidth broker determines whether the links comprising the selected path have available bandwidth for the class of service of the call. If so, the router routes the call to the next hop along the path. Otherwise, the router selects another path(s) and checks whether the links on the path possess sufficient bandwidth for the class of service of the call.

Abstract: An originating switch (110) in a packet-based telecommunications network (100) routes calls to a terminating switch using the combination of Success-to-the Top (STT) and Class-of-Service criterion. In routing a call to the terminating switch, the originating switch 110 checks for available bandwidth for the class of service of the call on the direct path (116) between switches. If the path has available bandwidth, the originating switch routes on the direct path. Otherwise, the originating switch searches for the most recently successful one of a plurality the via switches (1181-118n) linking the originating and terminating switches to determine whether that via switch can successfully route the call to the terminating switch. If the most recently successful one of the via switches possesses available bandwidth to route the call in accordance with its class of service, the originating switch 110 selects that via switch to route the call.

Abstract: A method for increasing the capability of the network to provide intelligent services can be accessed by any flow and allows the flow to install the services specific features to the flow. The present invention allows the software agents to be dynamically loaded into the network component to provide the services desired by the user. The present invention provides a detector in a switch in the network processing the flow that detects the presence of a predetermined control packet in the flow, and upon detection of this control packet, the detector loads a particular software object from a library of objects into the switch or router, which software object is then immediately executed by the switch to process the flow. This enables the user of the switch to request additional service from the switch after the data flow has been initiated, or to modify the flow parameters in a seamless manner.