Abstract: In a distributed network comprising a plurality of peer (as opposed to master-slave) computers, a method of file shadowing allows each peer computer to maintain copies of data entries originated by the other peer computers in near-real time. Each computer assigns a unique serial number to each entry, and forwards each entry with the serial number and an identification of itself to all the other computers. Each computer informs each other computer of the highest sequential serial number received from it, and each computer resends to each other computer all entries having serial numbers higher than that acknowledged by each other computer.

Abstract: In a distributed computer network having a large number of intercommunicating distributed nodes and a smaller number of control nodes in which each distributed node reports status information to a particular one of the control nodes, a method is provided for guaranteeing that at least one control node receives a status message from a distributed node despite the unavailability of the particular control node to which the distributed node normally sends its status messages. Each distributed node associates a serial number and time stamp and an identification of itself with each message it originates, and each distributed node retains copies of the messages. Should a distributed node be unsuccessful in transmitting to its normal control node it attempts to transmit to other control nodes until it transmits successfully.

Abstract: In a distributed data system in which processes running in trusted systems whose results may be proprietary or sensitive in nature may be invoked by operators at remote, untrusted workstations, and in which said processes are provided with locks which do not permit proprietary or sensitive actions unless a request includes a key matching the lock, a method of associating keys with operators is based on each operator's presenting his ID and a valid password at the workstation at the time he logs on to the system, verifying his password in a trusted system, correlating his ID with a role or group of roles he is authorized to fulfill, and retrieving and storing in the memory of the trusted system, associated with the operator's ID, a list of keys (a "keyring") for each of those roles. The operator's ID is appended to every request he invokes, a process containing a lock interrogates the stored list and will not grant a proprietary action unless the stored list contains a key matching the lock.

Abstract: In a distributed data system serving a large geographical area and having several network management systems, each for managing system components in a portion of the geographical area, the system including a number of workstations at which administrative commands for configuring or monitoring the network may be entered, each network management system and each workstation hosting a number of software processes, a method is provided of routing messages to processes as a function of the process name and the portion of the geographical area in which it has effect. This method facilitates reconfiguring network management systems to take over the functions of a failed network management system in a manner transparent to operators and administrators at workstations.