Abstract: Embodiments of the present invention relate to a method, system, and computer program product for query system management. In a method, a question that is to be processed by a group of query systems is received. A group of answers to the question are received from the group of query systems, wherein the group of answers comprise an answer to the question from each of the query systems associated with the group of query systems. An association relationship is determined between the question and a query system from the group of query systems, wherein the association relationship is determined based on user feedback to the answer that is provided by the query system, and wherein the association relationship includes an association between the query and the query system and is used for selecting the query system for answering the question and further questions that are determined to be similar.

Abstract: Embodiments of the present invention relate to a method, system, and computer program product for query system management. In a method, a question that is to be processed by a group of query systems is received. A group of answers to the question are received from the group of query systems, wherein the group of answers comprise an answer to the question from each of the query systems associated with the group of query systems. An association relationship is determined between the question and a query system from the group of query systems, wherein the association relationship is determined based on user feedback to the answer that is provided by the query system, and wherein the association relationship includes an association between the query and the query system and is used for selecting the query system for answering the question and further questions that are determined to be similar.

Abstract: Optimizing receive side scaling (RSS) key selection is provided. Different weights are assigned to different fields of flow data corresponding to a network connection of a registered client device. A score is generated representing an amount of balanced processor loading for each RSS key corresponding to the registered client device based on the different fields of the flow data with assigned weights. A current RSS key on the registered client device is updated with an optimal RSS key based on the score corresponding to the optimal RSS key representing balanced loading of processors on the registered client device.

Abstract: A data packet is received. The data packet is a unit of data transmitted across a packet-switched network. A determination is made whether a new connection is detected. The data packet is transmitted using the new connection. In response to determining that a new connection is detected, a connection context for the new connection is added to a current connection context in a dynamic event table. The dynamic event table includes the current connection context, one or more previous connection contexts, and a listing of one or more events. Each event of the one or more events is a malicious activity and is retrieved from a repository. A score for each event is calculated based on the current connection context. Each event in the dynamic event table is prioritized based on the calculated score for each event. The event with the highest score receives the highest priority.

Abstract: A method of locating one or more endpoint connectors of a network cable wherein the network cable includes a first endpoint connector and a second endpoint connector comprises: one or more processors capturing an incoming packet carrying therein a specific identifier, wherein the specific identifier is a specific bit string that has been predefined to trigger an activation of one or more indicating devices located on one or more endpoint connectors on the network cable; determining that the incoming packet carries therein the specific identifier; and in response to determining that the incoming packet carries therein the specific identifier, triggering an activation of a first indicating device indicative of a location of the first endpoint connector.

Abstract: Computing a protocol complexity indicator (PCI) for a communication protocol of interest in a networked computer system that processes network traffic of multiple protocols. The PCI provides an indication of predicted bandwidth usage by traffic of the protocol of interest. The PCI is used together with a throughput limit to establish a threshold amount for traffic of the protocol of interest. The PCI may then be used, for instance, to determine when to spawn a new instance of a network traffic-processing component for that protocol to maintain processing throughput at an acceptable level.

Abstract: Optimizing receive side scaling (RSS) key selection is provided. Different weights are assigned to different fields of flow data corresponding to a network connection of a registered client device. A score is generated representing an amount of balanced processor loading for each RSS key corresponding to the registered client device based on the different fields of the flow data with assigned weights. A current RSS key on the registered client device is updated with an optimal RSS key based on the score corresponding to the optimal RSS key representing balanced loading of processors on the registered client device.

Abstract: Optimizing receive side scaling (RSS) key selection is provided. Different weights are assigned to different fields of flow data corresponding to a network connection of a registered client device. A score is generated representing an amount of balanced processor loading for each RSS key corresponding to the registered client device based on the different fields of the flow data with assigned weights. A current RSS key on the registered client device is updated with an optimal RSS key based on the score corresponding to the optimal RSS key representing balanced loading of processors on the registered client device.

Abstract: Selecting a receive side scaling (RSS) key is provided. It is determined whether a defined time interval expired. In response to determining that the defined time interval has expired, it is determined whether one or more keys in a set of randomly generated candidate RSS keys have a higher packet distribution score than an active RSS key. In response to determining that one or more keys in the set of randomly generated candidate RSS keys have a higher packet distribution score than the active RSS key, an RSS key having a highest packet distribution score is selected from the one or more keys in the set of randomly generated candidate RSS keys that have a higher packet distribution score than the active RSS key. The RSS key having the highest packet distribution score is used to distribute incoming network packets across a plurality of processors.

Abstract: A data packet is received. The data packet is a unit of data transmitted across a packet-switched network. A determination is made whether a new connection is detected. The data packet is transmitted using the new connection. In response to determining that a new connection is detected, a connection context for the new connection is added to a current connection context in a dynamic event table. The dynamic event table includes the current connection context, one or more previous connection contexts, and a listing of one or more events. Each event of the one or more events is a malicious activity and is retrieved from a repository. A score for each event is calculated based on the current connection context. Each event in the dynamic event table is prioritized based on the calculated score for each event. The event with the highest score receives the highest priority.

Abstract: Optimizing receive side scaling (RSS) key selection is provided. Different weights are assigned to different fields of flow data corresponding to a network connection of a registered client device. A score is generated representing an amount of balanced processor loading for each RSS key corresponding to the registered client device based on the different fields of the flow data with assigned weights. A current RSS key on the registered client device is updated with an optimal RSS key based on the score corresponding to the optimal RSS key representing balanced loading of processors on the registered client device.

Abstract: Selecting a receive side scaling (RSS) key is provided. It is determined whether a defined time interval expired. In response to determining that the defined time interval has expired, it is determined whether one or more keys in a set of randomly generated candidate RSS keys have a higher packet distribution score than an active RSS key. In response to determining that one or more keys in the set of randomly generated candidate RSS keys have a higher packet distribution score than the active RSS key, an RSS key having a highest packet distribution score is selected from the one or more keys in the set of randomly generated candidate RSS keys that have a higher packet distribution score than the active RSS key. The RSS key having the highest packet distribution score is used to distribute incoming network packets across a plurality of processors.

Abstract: A data packet is received. The data packet is a unit of data transmitted across a packet-switched network. A determination is made whether a new connection is detected. The data packet is transmitted using the new connection. In response to determining that a new connection is detected, a connection context for the new connection is added to a current connection context in a dynamic event table. The dynamic event table includes the current connection context, one or more previous connection contexts, and a listing of one or more events. Each event of the one or more events is a malicious activity and is retrieved from a repository. A score for each event is calculated based on the current connection context. Each event in the dynamic event table is prioritized based on the calculated score for each event. The event with the highest score receives the highest priority.

Abstract: A method of locating one or more endpoint connectors of a network cable wherein the network cable includes a first endpoint connector and a second endpoint connector comprises: one or more processors capturing an incoming packet carrying therein a specific identifier, wherein the specific identifier is a specific bit string that has been predefined to trigger an activation of one or more indicating devices located on one or more endpoint connectors on the network cable; determining that the incoming packet carries therein the specific identifier; and in response to determining that the incoming packet carries therein the specific identifier, triggering an activation of a first indicating device indicative of a location of the first endpoint connector.

Abstract: Computing a protocol complexity indicator (PCI) for a communication protocol of interest in a networked computer system that processes network traffic of multiple protocols. The PCI provides an indication of predicted bandwidth usage by traffic of the protocol of interest. The PCI is used together with a throughput limit to establish a threshold amount for traffic of the protocol of interest. The PCI may then be used, for instance, to determine when to spawn a new instance of a network traffic-processing component for that protocol to maintain processing throughput at an acceptable level.

Abstract: A method of locating endpoint connectors of a network cable comprises: capturing an incoming packet carrying therein a specific identifier from an echo request instruction; determining whether the incoming packet carries therein the specific identifier; and in response to determining that the incoming packet received carries therein the specific identifier, triggering an indicating device indicative of locations of endpoint connectors of a network cable.

Abstract: Selecting a receive side scaling (RSS) key is provided. It is determined whether a defined time interval expired. In response to determining that the defined time interval has expired, it is determined whether one or more keys in a set of randomly generated candidate RSS keys have a higher packet distribution score than an active RSS key. In response to determining that one or more keys in the set of randomly generated candidate RSS keys have a higher packet distribution score than the active RSS key, an RSS key having a highest packet distribution score is selected from the one or more keys in the set of randomly generated candidate RSS keys that have a higher packet distribution score than the active RSS key. The RSS key having the highest packet distribution score is used to distribute incoming network packets across a plurality of processors.

Abstract: Selecting a receive side scaling (RSS) key is provided. It is determined whether a defined time interval expired. In response to determining that the defined time interval has expired, it is determined whether one or more keys in a set of randomly generated candidate RSS keys have a higher packet distribution score than an active RSS key. In response to determining that one or more keys in the set of randomly generated candidate RSS keys have a higher packet distribution score than the active RSS key, an RSS key having a highest packet distribution score is selected from the one or more keys in the set of randomly generated candidate RSS keys that have a higher packet distribution score than the active RSS key. The RSS key having the highest packet distribution score is used to distribute incoming network packets across a plurality of processors.

Abstract: Computing a protocol complexity indicator (PCI) for a communication protocol of interest in a networked computer system that processes network traffic of multiple protocols. The PCI provides an indication of predicted bandwidth usage by traffic of the protocol of interest. The PCI is used together with a throughput limit to establish a threshold amount for traffic of the protocol of interest. The PCI may then be used, for instance, to determine when to spawn a new instance of a network traffic-processing component for that protocol to maintain processing throughput at an acceptable level.

Abstract: A data packet is received. The data packet is a unit of data transmitted across a packet-switched network. A determination is made whether a new connection is detected. The data packet is transmitted using the new connection. In response to determining that a new connection is detected, a connection context for the new connection is added to a current connection context in a dynamic event table. The dynamic event table includes the current connection context, one or more previous connection contexts, and a listing of one or more events. Each event of the one or more events is a malicious activity and is retrieved from a repository. A score for each event is calculated based on the current connection context. Each event in the dynamic event table is prioritized based on the calculated score for each event. The event with the highest score receives the highest priority.