Abstract: A distributed data system may include nodes hosting at least one multi-threaded process operable to access portions of distributed data. A lock mechanism may grant locks to multi-threaded processes for portions of the distributed data. Only a process holding a lock may access a portion corresponding to the lock. Threads of other processes may not access the portion. A process may include one or more threads that may acquire a locks for the distributed data portion on behalf of the process. In one embodiment, the lock mechanism may allow any thread of a process release a lock held by the process. In embodiments, the last thread to access the distributed data portion corresponding to the lock may release the lock in response to no more threads of the process require access to the distributed data portion and/or in response to a request to release the lock.

Abstract: The present invention is directed to the use of a messaging component for sharing a common network communication channel by a plurality of threads of execution. The messaging component receiving a message and forwarding the message to one or more of the threads using information in a payload portion of the message, which is compared with supplied registration information. In addition, according to the present invention, messaging and job components may be used by each of a plurality of execution threads to negotiate a manner of transferring data between two network computers, wherein the job component proposes a manner of transfer, which is communicated using the messaging component to a receiving a computer. The proposed manner of transfer may be accepted or rejected by the receiving computer. An alternative manner of transfer may be proposed, where another manner of transfer is found to be unacceptable.

Abstract: In one embodiment, the present invention provides a system and method for analyzing a stream of network data. The method includes generating a statistical model from a set of record events. A most recent record event is received. The statistical model is updated using the most recent record event by adding the most recent record event to the statistical model.

Abstract: A forum for user interaction is provided. A clone of the forum is created, thereby allowing any number of users to be in the same forum while limiting the number of users in each instance of the forum. It is determined whether a relationship exists between a user entering the forum and one or more other users entering the forum or with one or more other users already in the forum. If a relationship exists, the user entering the forum is placed in a clone of the forum based on the relationship.

Abstract: An apparatus for controlling a shared screen for shared applications, which can be shared, in a network system of a plurality of connected communication terminals, with other communication terminals when running on the terminals. The communication terminals include a window information acquiring portion for acquiring window information of the application to be shared while running on the terminals. Window controlling portion controls how windows are displayed on the communication terminals. The window controlling portion displays a window of shared space for displaying windows of shared applications collectively on the communication terminals. The windows of the shared applications are displayed as sub-windows in the window of shared space. For the “entire screen sharing type”, the apparatus includes a conference managing device having a conference information managing portion for managing information about communication terminals participating in those conferences, and shared screen controlling portion.

Abstract: Systems and related methods are described for handling one or more resource requests. A protocol engine receives a resource request in accordance with a prescribed protocol, and a classification engine determines a desired class of service for the request. An analysis engine optionally analyzes the request, and, responsive thereto, determines a desired sub-class of service for the request. A policy engine then allocates a resource to the request responsive to one or both of the desired class of service, and the desired sub-class of service.

Abstract: A method and system for routing messages received by a device is described. The router routes messages to applications associated with a provider that recognizes an incoming message type. Providers register with the router to receive messages of a particular type. The providers are prioritized so that the router delivers messages to the providers based on the assigned priority. The router inquires with the providers in their relative assigned priority. The router stops inquiring the providers once an appropriate provider for the message has been found. If the message does not belong to the provider then the next provider is queried. Before delivering the message to the application, the provider formats the message to the specifications provided by the application.

Abstract: A database management system in which a plurality of nodes form a database instance, each node including a communication manager for dynamically configuring inter-nodal communication resources. The communication manager receives communication resource allocation requests from clients or a self-tuning algorithm. A resource self-tuning mechanism allocates or de-allocates memory blocks used for communication resource elements dynamically in real time without cycling the instance. Memory blocks are de-allocated asynchronously by placing associated communication resource elements in quarantine until all communication resource elements associated with the memory block are quarantined.

Abstract: A data distribution system capable of suppressing a fall of the efficiency of operation of a network due to repeated data retransmission in the network when distributing a large volume of data from a data distribution server on a data provider side to a data receiver side access server via the network. This data distribution system is comprised by a data distribution server, an access server for transferring intended data to each user, and a network cache apparatus provided in the network and having a cache function unit for temporarily storing the data from the data distribution server and an exchange function unit for routing the stored data to the access server corresponding to the destination user.

Abstract: Network monitoring device and method whereby the user can be given an alarm before a guaranteed limit of packet routing is exceeded. Counting section counts the number of nodes based on packets exchanged between the nodes, and comparing section compares the node count with an allowable value. If the node count is larger than the allowable value, alarm output section outputs a message that the node count is excessively large.