Abstract: Techniques for automatically designing an application-requirement based configuration for a distributed computing system are provided. One or more application-level templates are obtained, wherein the one or more templates are representative of one or more requirements associated with one or more applications. Using the one or more application-level templates, one or more logical flows are created. The one or more logical flows are then used to generate one or more system-level configuration plans of the distributed computing system.

Abstract: A method for lifecycle management for file systems has several steps. At least one storage container adapted to support a file system is allocated. The at least one storage container and the file system are associated with a service class. The file system is created in the storage container. The service class is used during lifecycle actions performed on the file system. Lifecycle actions may comprise, e.g., creating, extending, replicating, moving, or migrating a file system. The service class for the file system may also be maintained for a lifecycle of the file system.

Abstract: Goal-based availability and change management are handled over groups of heterogeneous storage controllers. Probabilistic and deterministic methods are employed to determine the allocation and placement of storage volumes to storage controllers, as well as the degree of data redundancy necessary to achieve data availability goals The probabilistic methods can take into account past observations of controller availability, and operator beliefs, as well as the state of storage controller configuration, in coming up with a probabilistic estimate of future availability.

Abstract: The present invention is a method of doing business over a network that: receives a request for transmitting digital information after a start time and before an end time, determines the time required to transmit the digital information based on the number of packets in the information and the network speed, schedules a transmit time for the digital information, and accepts the digital information for transmission only if the time required to transmit is less than or equal to the difference between the transmit time and the end time. Pricing of the transmission can be determined by the priority of transmission, whether the information is transmitted the first time or rescheduled, and whether the user receives an acknowledgment.

Abstract: The present invention is a computer system for delivering digital information over a network. A request receiving process receives a request for transmitting digital information after a start time and before an end time. The digital information has a number of packets. A transmit time process determines the time required to transmit the digital information based on the number of packets and a network speed. A scheduler schedules a transmit time for the digital information and an acceptance process accepts the digital information for transmission only if the time required to transmit is less than or equal to the difference between the transmit time and the end time.

Abstract: The present invention is a method of doing business over a network that: receives a request for transmitting digital information after a start time and before an end time, determines the time required to transmit the digital information based on the number of packets in the information and the network speed, schedules a transmit time for the digital information, and accepts the digital information for transmission only if the time required to transmit is less than or equal to the difference between the transmit time and the end time. Pricing of the transmission can be determined by the priority of transmission, whether the information is transmitted the first time or rescheduled, and whether the user receives an acknowledgment.

Abstract: A multi-plan generation system generates a multi-plan for a multi-layer storage area network. The system generates a predetermined number of plans while generating and retaining globally optimum plans. The system dynamically calculates and orders these plans according to optimization criteria and user requirements. The system comprises a planner for each of the layers in a storage area network such as a host planner, a storage planner, a network planner, a zone planner, etc. Each of the planners applies a variance optimization, a preview optimization, and a detail optimization and interacts with a policy repository to obtain policy guidance, enabling the system to prune the set of plans. A control module invokes the planners in a predetermined order.

Abstract: The present invention is a method of doing business over a network that: receives a request for transmitting digital information after a start time and before an end time, determines the time required to transmit the digital information based on the number of packets in the information and the network speed, schedules a transmit time for the digital information, and accepts the digital information for transmission only if the time required to transmit is less than or equal to the difference between the transmit time and the end time. Pricing of the transmission can be determined by the priority of transmission, whether the information is transmitted the first time or rescheduled, and whether the user receives an acknowledgment.

Abstract: The present invention is a computer system for delivering digital information over a network. A request receiving process receives a request for transmitting digital information after a start time and before an end time. The digital information has a number of packets. A transmit time process determines the time required to transmit the digital information based on the number of packets and a network speed. A scheduler schedules a transmit time for the digital information and an acceptance process accepts the digital information for transmission only if the time required to transmit is less than or equal to the difference between the transmit time and the end time.

Abstract: The present invention is a method of doing business over a network that: receives a request for transmitting digital information after a start time and before an end time, determines the time required to transmit the digital information based on the number of packets in the information and the network speed, schedules a transmit time for the digital information, and accepts the digital information for transmission only if the time required to transmit is less than or equal to the difference between the transmit time and the end time. Pricing of the transmission can be determined by the priority of transmission, whether the information is transmitted the first time or rescheduled, and whether the user receives an acknowledgment.

Abstract: The present invention is a method of doing business over a network that: receives a request for transmitting digital information after a start time and before an end time, determines the time required to transmit the digital information based on the number of packets in the information and the network speed, schedules a transmit time for the digital information, and accepts the digital information for transmission only if the time required to transmit is less than or equal to the difference between the transmit time and the end time. Pricing of the transmission can be determined by the priority of transmission, whether the information is transmitted the first time or rescheduled, and whether the user receives an acknowledgment.

Abstract: Techniques for automatically designing an application-requirement based configuration for a distributed computing system are provided. One or more application-level templates are obtained, wherein the one or more templates are representative of one or more requirements associated with one or more applications. Using the one or more application-level templates, one or more logical flows are created. The one or more logical flows are then used to generate one or more system-level configuration plans of the distributed computing system.

Abstract: Goal-based availability and change management are handled over groups of heterogeneous storage controllers. Probabilistic and deterministic methods are employed to determine the allocation and placement of storage volumes to storage controllers, as well as the degree of data redundancy necessary to achieve data availability goals The probabilistic methods can take into account past observations of controller availability, and operator beliefs, as well as the state of storage controller configuration, in coming up with a probabilistic estimate of future availability.

Abstract: In an exemplary aspect of the invention, a method is disclosed for lifecycle management for file systems. The method comprises the following steps. At least one storage container adapted to support a file system is allocated. The at least one storage container and the file system are associated with a service class. The file system is created in the storage container. The service class is used during lifecycle actions performed on the file system. Lifecycle actions may comprise, e.g., creating, extending, replicating, moving, or migrating a file system. The service class for the file system may also be maintained for a lifecycle of the file system.

Abstract: The present invention is a method of doing business over a network that: receives a request for transmitting digital information after a start time and before an end time, determines the time required to transmit the digital information based on the number of packets in the information and the network speed, schedules a transmit time for the digital information, and accepts the digital information for transmission only if the time required to transmit is less than or equal to the difference between the transmit time and the end time. Pricing of the transmission can be determined by the priority of transmission, whether the information is transmitted the first time or rescheduled, and whether the user receives an acknowledgment.

Abstract: Goal-based availability and change management are handled over groups of heterogeneous storage controllers. Probabilistic and deterministic methods are employed to determine the allocation and placement of storage volumes to storage controllers, as well as the degree of data redundancy necessary to achieve data availability goals. The probabilistic methods can take into account past observations of controller availability, and operator beliefs, as well as the state of storage controller configuration, in coming up with a probabilistic estimate of future availability.

Abstract: The present invention is a computer system for delivering digital information over a network. A request receiving process receives a request for transmitting digital information after a start time and before an end time. The digital information has a number of packets. A transmit time process determines the time required to transmit the digital information based on the number of packets and a network speed. A scheduler schedules a transmit time for the digital information and an acceptance process accepts the digital information for transmission only if the time required to transmit is less than or equal to the difference between the transmit time and the end time.

Abstract: A computer dispatcher connected to one or more respective network buffers has stored file lists that identify one or more of the files in the database that are to be transmitted over networks connected to the respective network buffer. A scheduler(s) schedule one or more portions of one or more of the files to be written to the respective network buffers by defining transmission criteria about each of the files in the file list. These transmission criteria include a quantity to transmit criteria, defining a quantity of one or more of the portions of the respective file to transmit, and one or more release times. The release times define the time at which the respective portion is to be written to the network buffer. The system includes a dispatching process that determines an available space on one or more of the network buffers and a current system time.

Abstract: The invention is a broadband network monitoring system and method. The system has one or more RF carrier generators that generate one or more generator signals, called a reference signal, each of the generator signals having a generator signal frequency. One or more RF transient detectors sense a line signal on one or more broadband lines in the broadband network. Each line signal has one or more test signals applied by a remote RF carrier generator. Each test signal has a frequency equal to one of the reference signals. Each RF transient detector senses and compares the test signal and the reference signal in various ways to produce a transient indicator when the test signal and reference/generator signal are not the same. The transient indicator indicates that there may be a perturbation or some other problem in the respective broadband line. A controller is connected to each of the RF transient detectors and controls an RF switch and an analyzer.

Abstract: This invention is a broadband matrix switch system and method of operation. The broadband matrix switch has N number of broadband inputs, each of the broadband inputs having one or more broadband signals. The matrix switch has M number of broadband outputs. There are N number of splitters. Each of the splitters has a splitter input connected to one of the broadband inputs. Each of the splitters has M number of splitter outputs that produce the splitter output signal. There are N times M number of node switches. Each node switch is uniquely connected to one of the splitter outputs. The node switches have a control input that allows the node switch to pass the respective splitter output signal upon receiving a close command at the control input and to terminate the respective splitter output signal with an input impedance upon receiving an open command at the control input. There are M number of combiners. Each combiner has a combiner output connected to one of the broadband outputs.