Abstract: Methods and systems for load balancing and failover among gateway devices are disclosed. One method provides for assigning communication transaction handling to a gateway. The method includes receiving a request for a license from a computing device at a control gateway within a group of gateway devices including a plurality of gateway devices configured to support communication of cryptographically split data. The method also includes assigning communications from the computing device to one of the plurality of gateway devices based on a load balancing algorithm, and routing the communication request to the assigned gateway device.

Abstract: A distributed computer system comprises an enterprise server and a network server. The distributed computer system utilizes a distributed transmission control protocol (TCP) to establish an off-loaded dialog through the network server. If the off-loaded dialog is interrupted by, e.g., failure of the hosting network server, dialog recovery is performed to move the off-loaded dialog.

Abstract: A data simulator receives a set of directives specified in a file and creates one or more datastreams from which a data structure may be built as specified by the directives. The directives may specify configuration settings, constants, changing fields, values and probabilities.

Abstract: The process of traversing a K may involve determining a match between a root node and a Result node of a node on the asCase list of a current K node. When learning is off and a match is not found, the procedure may ignore the particle being processed. An alternative solution determines which node on the asCase list is the most likely to be the next node. While the K Engine is traversing and events are being recorded into a K structure, a count field may be added to each K node to contain a record of how many times each K path has been traversed. The count field may be updated according to the processes traversing the K. Typically, the count is incremented only for learning functions. This count field may be used in determining which node may be the most (or least) probable.

Abstract: A method for managing data transfer from at least one input tape to an output tape begins by opening the output tape. For each input tape, the input tape is opened and directory information about the opened input tape is gathered. Data is read from the opened input tape, the data is encrypted, the encrypted data is written to the output tape, and the input tape is closed. The directory information for each input tape is written to a directory file on the output tape and the output tape is closed.

Abstract: A secure storage appliance is disclosed, along with methods of storing and reading data in a secure storage network. In one aspect, a method includes assigning a volume to a primary secure storage appliance located in a secure data storage network, the secure data storage network including a plurality of secure data paths between the primary secure storage appliance and a client device and a plurality of secure data paths between the secure storage appliance and a plurality of storage systems, the volume corresponding to physical storage at each of the plurality of storage systems. The method also includes detecting a connectivity problem on at least one of the secure data paths. The method further includes assessing whether to reassign the volume to a different secure storage appliance based upon the connectivity problem.

Abstract: An embodiment of the invention is a technique to manage failover and failback. A failover of a first path is detected. The first path corresponds to a first device in a plurality of physical devices having M device types. A connection status of the first device is determined if the failover is detected. The connection status is one of a connected status and a disconnected status. The disconnected status corresponds to the failover. The first path is adjusted according to the connection status.

Abstract: To enhance data structure processing performance, data is organized bi-directionally in a data structure. That is, depending on the value of a data key associated with an entry, the entry is stored either from a low end or from a high end of the data structure. For example, the low end of the data structure may store entries having even-valued keys, while the high end of the data structure may store entries having odd-valued keys. Subsequent data structure processing can be facilitated by searching the data structure in either a forward direction starting with the low end or a reverse direction starting with the high end, depending on whether a search key is even or odd.

Abstract: The KStore is a datastore made up of a forest of interconnected, highly unconventional trees of one or more levels. One KStore can be added to an existing KStore to create an updated KStore by traversing the trees of the KStores and incrementing the count fields to reflect the added counts of analogous nodes. New KStore structure is added as needed. A KStore can be subtracted from an existing KStore to create an updated KStore by traversing trees KStores and decrementing the count fields in the updated KStore to reflect the subtracted counts of analogous nodes. KStore structure is removed as needed. Portions of a KStore can be added or subtracted from another KStore by isolating the paths to be used for updating. Instead of incrementing or decrementing counts, a dataset of individual records can be recreated from the KStore.

Abstract: A scenario simulator processor receives a declarative file and invokes one or more data simulators to create one or more datastreams from a data structure may be built as specified by the declarative file. The declarative file may specify one or more scenario names, and a set of information corresponding to the one or more scenarios (one set for each scenario). Each set of scenario information includes one or more of the following pieces of information: parameters and settings for the data simulator and the number of threads to be started for each data simulator invoked.

Abstract: Embodiments of the present invention provide a virtualization infrastructure that allows multiple guest operating systems to run and communicate amongst each other within a host hardware partition. The host system is divided into distinct logical/virtual partitions and special infrastructure partitions are implemented to control resource management and to control physical I/O device drivers that are, in turn, used by operating systems in other distinct logical/virtual guest partitions. Host hardware resource management runs as a tracking application in a resource management “ultravisor” partition, while host resource management decisions are performed in a higher-level command partition based on policies maintained in a separate operations partition.

Abstract: A method of handing off connection requests from a file server to other receivers on a network includes receiving a connection request from a receiver, checking to see if the requested content is currently being provided by the file server to another receiver, and, if so, handing off the request to the another receiver.

Abstract: A usage metering system for determining computer resource utilization is described herein. Computer resource utilization is determined by accumulating instances of computer resource utilization based on array of counters. This enables an accurate determination of instances of when a predetermined threshold baseline of computer resource utilization is exceeded over an accumulated period of time. By using an array of counters to collect data rather than averaging values over time, a more accurate indication of computer resource utilization is determined. The usage metering system has little impact on computer system resources, because snapshots can be taken on a fairly infrequent basis, and any computer resource utilization calculations can be performed on computer platforms separated from the system being monitored.

Abstract: Typically, field names are saved separately from tables as metadata in modern databases. Databases did not traditionally get built into interlocking trees datastores that recorded the data as events. However, in cases where one may wish to do that, thus avoiding the need for saving separate metadata from the table data of the data base, a need was found to establish an identity for particular columns or fields when working with databases or sources of data that provide table data in field/record format. So, to build interlocking trees datastores from such records a mechanism to record such data was created, adding a column ID, preferably to each field within each record or sequence that is to be recorded. Putting the column ID or identifier is inserted into the record during particlization between each column variable. In preferred embodiments a delimiter was included between the column ID or field name and the field variable. Appropriate hardware and software systems were employed to implement the invention.

Abstract: A computing system having an apparatus for providing an inline data conversion processor. The inline data conversion processor includes a host processor interface, a network interface, a peripheral interface, and a packer stream address for defining a data transformation applied to a block of data as it passes between the host processor interface and the peripheral and network interfaces.

Abstract: A system, method, and machine readable medium for monitoring and administering a distributed application implementation is disclosed where an agent is associated with an application server. The agent monitors and collects information relating to all active distributed data sessions occurring on the application server and transmits the session information to a central data repository, for example, a database. The central data repository stores data session information relating to a plurality of application servers and may contain session information relating to application servers located in a plurality of server farms. A software application is provided that is capable of receiving input from a user related to the session data in the central data repository, querying the repository and returning a subset of session data relating to the user's input. Query results are displayed to the user allowing for administration of the distributed computing environment across multiple servers and server farms.

Abstract: Various approaches for updating system monitoring policy parameters. In one approach, updates to the monitoring policy parameters are transmitted to an event server via an event report. The event server transmits the event report to a subcomponent manager executing on the monitored system. The subcomponent manager determines to which of a plurality of monitoring subcomponents the update is to be applied. The subcomponent manager then suspends the execution thread of the monitoring subcomponents, updates monitoring policy parameters of the subcomponent with data from the event report, and thereafter resumes the execution thread of the subcomponents. The subcomponent then operates with the updated monitoring policy parameters.

Abstract: A tree-based datastore comprising a forest of interconnected trees is generated and/or accessed. The tree-based datastore comprises a first tree that depends from a first root node and may include a plurality of branches. Each of the branches of the first tree ends in a leaf node. Each leaf node may represent an end product, as described more fully below. A second root of the same tree-based datastore is linked to each leaf node representing an end product. Hence, the second root is essentially a root to an inverted order of the first tree, but the first tree is not duplicated. Finally, the tree-based datastore comprises a plurality of trees in which the root node of each of these trees is an elemental node, as described more fully below. The root node of each of these trees may be linked to one or more nodes in one or more branches of the first tree. The nodes of the tree-based datastore contain only pointers to other nodes in the tree-based datastore.

Abstract: Methods and systems for containing data errors in a computing system are disclosed. One method includes receiving data from an endpoint at the communication interface in response to a data request. The method also includes detecting an error in the data. The method further includes ignoring subsequent data received from the endpoint.

Abstract: A connector assembly is provided having a cable end plug with a body adapted to be connected to a cable with a connector part, and at least one outwardly extending flange on the body. A mating receptacle receives the cable end plug. The receptacle has a body with a complementary connector part to the cable end plug connector part. A retention clip is connected to the receptacle body, and includes at least one spring arm extending outwardly therefrom with a distal entry ramp portion, a retaining shoulder portion and a flange receiving portion. A thickness of the flange is approximately equal to a depth of the flange receiving portion so that the retaining shoulder portion engages behind the flange in a connected position of the cable end plug in the mating receptacle. For release, the retaining shoulder can be set at an angle of at least 94° to the flange receiving portion to form a release ramp that allows disengagement when a sufficiently high predetermined release force is applied to the cable end plug.