Abstract: Modifying a priority for at least one flow class of an application includes registering flow classes for an application with a SDN controller, determining, with the SDN controller, a priority for each of the flow classes based on other installed applications and network services on the SDN controller, modifying, based on an event, the priority for at least one of the flow classes of the application by mapping a priority key associated with the priority to a new priority value, receiving, from the application, at least one flow modification rule using a priority key as the priority, and validating the at least one flow modification rule against registered parameters of at least one of the flow classes of the application to determine a flow of traffic based on the priority.

Abstract: Prioritizing at least one flow class for an application on a software defined networking (SDN) controller includes registering flow classes for an application with a SDN controller, determining, with the SDN controller, a priority for each of the flow classes based on other installed applications and network services on the SDN controller, receiving, from the application, at least one flow modification rule using a priority key as the priority, and validating the at least one flow modification rule against registered parameters of at least one of the flow classes of the application to determine a flow of traffic based on the priority.

Abstract: Prioritizing at least one flow class for an application on a software defined networking (SDN) controller includes registering flow classes for an application with a SDN controller, determining, with the SDN controller, a priority for each of the flow classes based on other installed applications and network services on the SDN controller, receiving, from the application, at least one flow modification rule using a priority key as the priority, and validating the at least one flow modification rule against registered parameters of at least one of the flow classes of the application to determine a flow of traffic based on the priority.

Abstract: Modifying a priority for at least one flow class of an application includes registering flow classes for an application with a SDN controller, determining, with the SDN controller, a priority for each of the flow classes based on other installed applications and network services on the SDN controller, modifying, based on an event, the priority for at least one of the flow classes of the application by mapping a priority key associated with the priority to a new priority value, receiving, from the application, at least one flow modification rule using a priority key as the priority, and validating the at least one flow modification rule against registered parameters of at least one of the flow classes of the application to determine a flow of traffic based on the priority.

Abstract: Keys of an index are associated with corresponding data chunks in a storage system. In response to a request for a particular key, a particular location is accessed in a first data structure which is maintained in a first storage using a first portion of the particular key. In response to the particular location containing a first value, indicating that the particular key is not present in the index. In response to the particular location containing a second value, a map is accessed using a second portion of the particular key to retrieve an entry in a second data structure maintained in a second storage. The second data structure provides a collision chain to link entries of the second data structure that share a common value of the second portion of the particular key. The first data structure, map, and second data structure are part of the index.

Abstract: An embodiment of the invention provides an apparatus and method for data verification by challenge. The apparatus and method perform acts including: sending a hash value of a data piece in a sender; if the hash value matches a stored hash value in a receiver, then sending a challenge from the receiver to the sender; sending a sample data set from the data piece in the sender, wherein the sample data set is determined by a window that is identified by the challenge; comparing the sample data set with a data set that is overlapped by the window for a stored data piece in the receiver; and performing a response based on the comparison of the sample data set and the stored data set that is overlapped by the window for the stored data piece.

Abstract: Keys of an index are associated with corresponding data chunks in a storage system. In response to a request for a particular key, a particular location is accessed in a first data structure which is maintained in a first storage using a first portion of the particular key. In response to the particular location containing a first value, indicating that the particular key is not present in the index. In response to the particular location containing a second value, a map is accessed using a second portion of the particular key to retrieve an entry in a second data structure maintained in a second storage. The second data structure provides a collision chain to link entries of the second data structure that share a common value of the second portion of the particular key. The first data structure, map, and second data structure are part of the index.

Abstract: An embodiment of the invention provides an apparatus and method for data verification by challenge. The apparatus and method perform acts including: sending a hash value of a data piece in a sender; if the hash value matches a stored hash value in a receiver, then sending a challenge from the receiver to the sender; sending a sample data set from the data piece in the sender, wherein the sample data set is determined by a window that is identified by the challenge; comparing the sample data set with a data set that is overlapped by the window for a stored data piece in the receiver; and performing a response based on the comparison of the sample data set and the stored data set that is overlapped by the window for the stored data piece.

Abstract: A code arrangement for facilitating the localization of an information source comprising a collector module for collecting information units to be localized from the information source and for causing a copy of the information units to be localized, a synchronization module for receiving the localized information units and comparing each to a current version of the information unit from the information source to determine if the information unit has changed and a dispersing module for storing the localized information unit if the information unit is unchanged. A related processor and method may include features similar to the elements of the code arrangement.

Abstract: The system and method described herein automatically detect various corruptions in a file system and notify a system administrator of the corruption. Detailed information on the file system is collected by a probe process. If the file system is corrupt or inaccessible, the system and method marks the file system as bad, notifies the system administrator and then ceases to attempt to collect information on that system again until it has been repaired.

Abstract: A measurement apparatus which is reconfigurable in accordance with at least one category and at least one metric, to apply at least one threshold to the at least one category and at least one metric and generate at least one event exception if the at least one threshold is violated. The measurement apparatus is capable of setting one or more threshold for categories of events.

Abstract: A code arrangement for facilitating the localization of an information source comprising a collector module for collecting information units to be localized from the information source and for causing a copy of the information units to be localized, a synchronization module for receiving the localized information units and comparing each to a current version of the information unit from the information source to determine if the information unit has changed and a dispersing module for storing the localized information unit if the information unit is unchanged. A related processor and method may include features similar to the elements of the code arrangement.

Abstract: A code arrangement on a computer-readable medium or media for use in a system for processing localization information may include a transformation module receiving at least one non-localized information unit, the transformation module converting the non-localized information unit into an intermediate format using at least one resource file. A related processor and method may include features similar to the elements of the code arrangement.

Abstract: When read by a machine, a computer-readable code arrangement medium causes the machine to parse a command string resulting in the execution of the commands. Such a computer-readable code arrangement includes: a command processor code portion for processing at least one command string having a command-name and at least one parameter; at least one parameter-handler code portion associated with the at least one parameter and adapted for processing the at least one parameter; and at least one syntax store for storing a plurality of syntax descriptions for a set of the command strings and for storing associations between the parameters and the parameter-handler code portions. Such a command processor code portion syntax processes the command string using the syntax descriptions and the parameter-handler code portions.

Abstract: A method of data extraction for use with a host, connected to one or more logical units (LUNs), that is operable to host a volume manager that manages access to the one or more LUNs via the creation of one or more volume groups, the method includes: providing one or more queries to the volume manager; and determining, for each volume group, which of the one or more LUNs are members of the volume group based upon results of the queries, respectively.

Abstract: The system and method described herein automatically detect various corruptions in a file system and notify a system administrator of the corruption. Detailed information on the file system is collected by a probe process. If the file system is corrupt or inaccessible, the system and method marks the file system as bad, notifies the system administrator and then ceases to attempt to collect information on that system again until it has been repaired.

Abstract: A measurement apparatus which is reconfigurable in accordance with at least one category and at least one metric, to apply at least one threshold to the at least one category and at least one metric and generate at least one event exception if the at least one threshold is violated. The measurement apparatus is capable of setting one or more threshold for categories of events.

Abstract: A method and apparatus is described to migrate database. Data transformations are specified in a configuration file. The configuration file contains both control information and data transformation information. The migration is performed automatically using the configuration file using an object-oriented migration application. A new database is created using the control information in the configuration file. The new database is populated with the appropriate data based on the data transformation information in the configuration file, resulting in a properly updated database.

Abstract: An apparatus and method for using pre-described patterns and reflection to generate a database schema for a persistent object management system. A code generator processes a plurality of source templates using reflection mechanism. The source templates including a plurality of pre-described patterns. A schema generator analyzes output of the code generator using reflection mechanism to generate a data-store schema.

Abstract: A source-code generator for an object management system uses source templates. The source templates include pre-described patterns. A code generator uses a reflection mechanism to analyze the source templates. The code generator generates a plurality of object manipulation codes that manipulate objects in association with a data-store.