Abstract: Techniques for running diagnostic rules across multiple nodes are disclosed. A root cause of an error occurring on a particular node is determined. A root cause of an error on the particular node is identified based on a metric corresponding to another node and/or based on a previously-reported error on another node. Additionally or alternatively, an error is predicted to occur on a particular node. The error is predicted based on a trend associated with a metric corresponding to another node.

Abstract: Techniques for running diagnostic rules across multiple nodes are disclosed. A root cause of an error occurring on a particular node is determined. A root cause of an error on the particular node is identified based on a metric corresponding to another node and/or based on a previously-reported error on another node. Additionally or alternatively, an error is predicted to occur on a particular node. The error is predicted based on a trend associated with a metric corresponding to another node.

Abstract: The present invention relates to relates to the efficient and secure transfer of information over a distributed computer network such as the Internet. The system provides parallel communication paths between the source and destination. Each path includes a dedicated route point to eliminate intermediate ISPs. Each source is associated with an archive and each route point is coupled to the archive. Upon receipt of the message at a route point the message is copied to the archive and then transmitted to the destination. Message archival and storage of transmission-related information enables data-mining features not presently available using email or a point-and-click browser. Since two messages are transmitted from the source to the common destination across separate and distinct communication paths, message latency is improved and the chance of lost messages is reduced or even eliminated.

Abstract: A method that provides for the reliable and timely transfer of messages on a distributed communication network includes choosing a plurality of candidate overlay route processors from the distributed communication network, the candidate overlay route processors being coupled to a message source and a message destination of the network. Thereafter, the identity of intervening network components in the network paths between the message source and each of the candidate overlay route processors is ascertained. Next, at least two selected overlay route processors are selected from the candidate overlay route processors based on minimizing the number of overlapping intervening network components in the network paths between the message source and the at least two selected overlay route processors. A message is the transferred from the message source to the at least two selected overlay route processors along the network paths with a minimized number of overlapping intervening network components.

Abstract: The present invention relates to relates to the efficient and secure transfer of information over a distributed computer network such as the Internet. The system provides parallel communication paths between the source and destination. Each path includes a dedicated route point to eliminate intermediate ISPS. Each source is associated with an archive and each route point is coupled to the archive. Upon receipt of the message at a route point the message is copied to the archive and then transmitted to the destination. Message archival and storage of transmission-related information enables data-mining features not presently available using email or a point-and-click browser. Since two messages are transmitted from the source to the common destination across separate and distinct communication paths, message latency is improved and the chance of lost messages is reduced or even eliminated.