Storage medium and system for managing and distributing data objects of different types between computers connected to a network A data management and distribution system has been described that includes router processes for controlling data communications between child processes running on computers connected by a network. Preferably, a router process runs on each computer, with the application processes running on the computer connected directly to the router process. As a result, all interprocess communications must pass through the routers. Each router process includes a connection table listing its connections with all other router and application processes, as well as an interest table listing the type of objects that each of the other processes are interested in receiving. Data communication is accomplished by an application process providing an object to its local router, which then distributes the object to all other interested routers. The object includes a destination list indicating which processes are to receive the object. Thus, with the use of routers, application processes that need to communicate with each other over a network need not know the intricate details (such as the communications protocol used, the exact address of the receiving process, etc.) involved in transmitting information. By placing the burden of managing the network communications on the local routers, the complexity of the application code is reduced since it has only a single connection to its local router. Generic fault tolerant platform A fault tolerant platform is provided that comprises two systems running pairs of processes in the active and standby state, one process from each pair running on each system. Each system comprises a fault-tolerance controlling process, first communication channels provided between the fault-tolerance controlling process and the processes in the active or standby state running on its system, and second communication channels provided between the fault-tolerance controlling processes. Management of fault tolerance (that is, promoting a process in a standby state to the active state, and making a process in an active state exit from the active state) is handled by the fault-tolerance controlling processes. A generic management of fault tolerant processes is thus provided in which fault detection and switchover is carried out independently of the applications. The invention thus ensures efficient and coherent switchover between active and standby processes. Method and apparatus for providing scaleable levels of application availability A method and an apparatus for providing scalable layers of highly available applications using loosely coupled commercially available computers. The software running on the loosely coupled computers is divided into three layers: the system layer, the platform layer, and the application layer, each having its own process group activation and fault recovery strategy. A process group contains software processes that depend upon a set of resources common to the process group. In addition to depending upon a common set of resources, processes within a process group share a fault recovery strategy. Fault recovery is performed at the process group level, such that if one process within a process group fails, fault recovery is takes place for all processes within the process group. In the preferred embodiment, an application layer process group may be paired with another application layer process group on a separate computer. As part of certain escalated process group fault recovery strategies, upon taking an application layer process group out of service, its paired application layer process group, if any exists, takes over performing the functions of the process group that was taken out of service. Data distribution techniques for load-balanced fault-tolerant web access A server system for processing client requests received over a communication network includes a cluster of N document servers and at least one redirection server. The redirection server receives a client request from the network and redirects it to one of the document servers, based on a set of pre-computed redirection probabilities. Each of the document servers may be an HTTP server that manages a set of documents locally and can service client requests only for the locally-available documents. A set of documents are distributed across the document servers in accordance with a load distribution algorithm which may utilize the access rates of the documents as a metric for distributing the documents across the servers and determining the redirection probabilities. The load distribution algorithm attempts to equalize the sum of the access rates of all the documents stored at a given document server across all of the document servers. In the event of a server failure, the redirection probabilities may be recomputed such that the load of client requests is approximately balanced among the remaining document servers. The redirection probabilities may also be recomputed periodically in order to take into account changes in document access rates and changes in server capacity. The recomputation may be based on a maximum-flow minimum-cost solution of a network flow problem. System for balancing loads among network servers A system which distributes requests among a plurality of network servers receives a request from a remote source at a first one of the network servers, and determines whether to process the request in the first network server. The request is processed in the first network server in a case that it is determined that the request should be processed in the first network server. On the other hand, the request is routed to another network server in a case that it is determined that the request should not be processed in the first network server. Synchronization of processors in a fault tolerant multi-processor system A method and system are described for synchronizing a first processor unit with a second processor unit in a fault tolerant system comprising a plurality of processing units where all processing units are executing the same processes in synchronization. The invention is readily adapted to a system of loosely coupled processing units with a low bandwidth communication channel coupled between the processing units. Apparatus, method and system for file synchronization for a fault tolerate network An apparatus, method and system are provided for file synchronization for a fault tolerant network, and are both application and platform independent. The fault tolerant network generally includes an active network entity, such as a telecommunication server, and a standby network entity to assume the functionality of the active network entity in the event of a failure of the active network entity. The method of the present invention includes accessing a file within the active network entity, such as through a read or write request of any network application. A file access request within the active network entity is generated and transmitted to the standby network entity, which also performs the file access request. The standby network entity then generates and transmits a file access confirmation to the active network entity. The active network entity then determines whether the file access request of the active network entity has a corresponding file access confirmation from the standby network entity. When the file access request has the corresponding file access confirmation, indicating that the files are in synchrony between the active and standby network entities, the active network entity then deletes the file access request and the corresponding file access confirmation from memory; but when the file access request does not have the corresponding file access confirmation, indicating a lack of synchrony, the active network entity then generates an error message and transfers the file access request to an error log, for subsequent use. Method and apparatus for fault tolerant execution of computer programs A circuit arrangement for the fault tolerant execution of digital computer programs includes a plurality of arithmetic logic units embodied as processor pool elements connected together so that they can each execute the program in parallel. The processor elements are connected to each other through respective data, clock and reset cross-strapping interconnect lines, and are each connected to one or more serial field buses. Each processor element includes at least one microprocessor controller for controlling the functions of the processor element in such a manner that any selected number of the processor elements can be automatically actuated at any time to simultaneously execute the program in parallel and thereby achieve a prescribed degree of redundancy in the circuit arrangement. The data cross-strapping line transmits data among the several processor elements, the clock signal cross-strapping line achieves a compelled synchronization of all of the processor elements, and the reset cross-strapping line carries out the deactivation of any processor element that is recognized as carrying out a faulty execution of the program or that is not necessary for achieving the required degree of redundancy. A deactivated processor element may later be reactivated to again participate in the parallel execution of the program. System and method for efficient transfer of data blocks from client to server A system transfers data between a client computer and a server computer over a network, wherein communications are established over a first data link between the client and the server to provide the server with identification of the data to be transferred, then communications are established over a second data link between the client and the server for data transfer such that the second data link has a faster data transfer rate than the first data link, then the identified data is transferred from the client to the server; and then finally the client computer is provided with status information relating to the transfer of the identified data. The first data link is sufficient to support normal data operations utilizing existing network resources. The second data link can connect the clients to one or more of the servers, or may connect only particular clients and servers with special needs for large data transfer. The system provides efficient transfer of large data blocks from clients to servers over the network, without disruption to normal data operations and without a requirement for extensive and expensive resource upgrades or cumbersome and inconvenient archive methodologies. Dynamic load balancing during message processing in a wireless communication service network A system and method for performing dynamic load balancing during system operation between a pair of APs (AP pair) serving at least one cell in common. A first RCS instance runs as an active RCS instance on one member of the AP pair and a second RCS instance runs as a standby RCS instance on the other member of the AP pair. The first RCS instance is redesignated as a standby RCS instance for the cell and the second RCS instance is redesignated as an active RCS instance for the cell. Active message processing is then transferred from the first RCS instance to the second RCS instance during network operation and without service interruption to the cell. System and method for dynamic content routing A system for directing a request for dynamic content to an application server which having access to a database containing updated data relevant to the request. The system contains a dynamic content router, database replication agents and web server plug-ins. The dynamic content router directs the web server plug-ins to forward the request to the appropriate application server. Fault tolerant network element for a common channel signaling (CCS) system A fault tolerant CCS system has two similar peer systems, one being an active system and the other a standby system. Each peer system has a local application which runs therein and which has an access to a common database that is used for storing critical status and application information. Further, each peer system includes a protocol stack for handling the multiple dialogs comprising exchanges of messages between the application and a remote network element. The protocol stack is enhanced by a first function that allows the active application to request the protocol stack to provide the current status of a given dialog and by a second function that is issued by the standby application to re-initialize the standby protocol stack. The first function is used to regularly retrieve, for any dialog, the current state of its associated protocol stack state machine and to store the latter into the common database. Upon occurrence of a failure, the standby application can access the common database for retrieval of the current state data, as well as issue a command to re-initialize the standby protocol stack so that the ongoing dialog can resume.