Abstract: Reputations of objects are determined by a reputation system using reports from clients identifying the objects. Confidence metrics for the clients are generated using information determined from the reports. Confidence metrics indicate the amounts of confidence in the veracity of the reports. Reputation scores of objects are calculated using the reports from the clients and the confidence metrics for the clients. Confidence metrics and reputation scores are stored in correlation with identifiers for the objects. An object's reputation score is provided to a client in response to a request.

Abstract: A system for utilizing an object library to dynamically match the type structures of a client and a server to determine compatibility. Once compatibility has been established, the client and server can communicate through a secure connection. Information can be sent asynchronously between the client and the server, and a flow control provides a buffer at the flow origin to ensure that there is no overflow of information to the recipient of the flow.

Abstract: A method for routing packets in a multipath network of nodes balances the loading of system resources while guaranteeing a FIFO network (i.e., First In First Out). Acyclic directed graphs based on local network information are used at each node with routing bias tables that allow for local preferences. A randomizing function may be used throughout the network to allow uniform utilization of system resources. A normalizing function may be used throughout the network to reduce bit operations in routing packets.

Abstract: A system for utilizing an object library to dynamically match the type structures of a client and a server to determine compatibility. Once compatibility has been established, the client and server may communicate through a secure connection. Information may be sent asynchronously between the client and the server, and a flow control provides a buffer at the flow origin to ensure that there is no overflow of information to the recipient of the flow.

Abstract: The disclosure is a method for dynamically matching a server and a client, the server and client being matched using an object library. A flow control of information is used to provide a buffer so there is no overflow of information to the recipient of the flow. The flow of information between the server and the client is provided through a secure communication. The server and client are also connected asynchronously.

Abstract: A scalable parallel packet router comprises a massively parallel computer 10 and a plurality of multiplexers 15, and is controlled by a disclosed packet routing algorithm, and a method of very high-speed packet routing. The method includes selection of an destination node by computing a hash function from source and destination addresses of a packet, so the ordering of packets is preserved.

Abstract: The present invention allows a data packet to reach its destination by automatically routing the data packet around failed components by means of a simple and efficient routing algorithms. The present invention is directed to a method and apparatus for routing a data packet through a series of ring stations, a series of mid-switch routing elements, and end-switch routing elements. An apparatus according to the invention includes a first series of ring stations and routing elements that are adapted to communicate with each other, and formed in a ring. Each ring is paired with another ring that includes a second series of ring stations and routing elements that are also adapted to communicate with each other as described above to form a second ring, and thus the two rings forming a ring pair. Each routing element, mid-switch and end-switch, is adapted to switch the path of the data packet between the two rings.

Abstract: A parallel local area network server is capable of sharing data and routing messages between workstations in a local area network. An apparatus according to the invention includes a plurality of processing nodes, each constituted by at least a single data processor, and an interconnect by which the processing nodes communicate. A plurality of mass storage devices are associated with the processing nodes, and a plurality of workstation computers are connected to the processing nodes. Each processing node includes is adapted to route messages to workstation computers associated with other processing nodes and to access data located both locally and at data storage devices associated with other processing nodes. A method according to the invention includes receiving a message at a first processing node and determining if the message is directed to a workstation computer at a second processing node and sending the message to the second processing node for subsequent delivery to the workstation computer.