Scalable and programmable query distribution and collection in a network of queryable devices

• US 20020073086A1
• Filed: 07/06/2001
• Published: 06/13/2002
• Est. Priority Date: 07/10/2000
• Status: Active Grant

• Current Assignee: Google LLC (Alphabet Inc.)
• Original Assignee: Fastforward Networks
• Inventors: Lang, Kevin J., Podolsky, Matthew G., McCanne, Steven, Thompson, Nicholas, Welch, William
• Granted Patent: US 6,826,564 B2
• Time in Patent Office: Days
• US Class Current: 707/10
• CPC Class Codes: H04L 41/0213 Standardised network management protocols, e.g. simple network management protocol [SNMP]
• CPC Class Codes: H04L 41/04 Network management architectures or arrangements
• CPC Class Codes: H04L 41/046 comprising network management agents or mobile agents therefor
• CPC Class Codes: H04L 41/34 Signalling channels for network management communication
• CPC Class Codes: Y10S 707/99934 Query formulation, input preparation, or translation
• CPC Class Codes: Y10S 707/99935 Query augmenting and refining, e.g. inexact access

Abstract

In a network, a query originator injects queries of network devices into the network at a query node using query messages. The network transports the query messages to the network devices, or to network nodes at which queries about the network devices can be answered. Query responses from the network devices or network nodes are directed through the network to a collection node or nodes. As an internal network node receives multiple query responses from network devices, the internal network node might aggregate, as needed, the multiple query responses into an aggregated query response that preferably occupies less bandwidth than the aggregated multiple query responses. Where the result desired at the collection node is a computed function of the multiple query responses, the computed function can be performed at each internal network node on the multiple query responses received at that node, thus distributing the computation needed to form a collected response to the query. Queries might request real-time or non-real-time responses and queries might request one response, periodic responses or one response for each occurrence of an event. The internal network nodes might store lookup tables, or access a centralized lookup table, that specify details of queries, thus obviating the need for each query message to carry all of the necessary details of the query.

Claims

1. In a data network wherein a plurality of queryable network devices respond to queries from a query originator, an aggregator at an aggregation node of the data network, the aggregator comprising:

a query response collector coupled to receive a plurality of query responses;

a query identifier for identifying an aggregation function for the plurality of query responses;

a processor, coupled to the query identifier and the query response collector, for applying the aggregation function to response data in the plurality of query responses to form an aggregated query response representing the plurality of query responses; and

an aggregated query response generator that generates a query response in a form expected by another recipient of query responses.

2. The aggregator of claim 1, wherein the query identifier includes a query function lookup table and the query identifier includes logic to read a query reference from the plurality of query responses and to use the query reference as an index into the lookup table to identify the aggregation function for the plurality of query responses.

3. The aggregator of claim 1, wherein the query identifier includes a query function lookup table and the query identifier includes logic to read a query reference from the plurality of query responses and to use the query reference as an index into the lookup table to identify the aggregation function for the plurality of query responses.

4. The aggregator of claim 1, wherein the data network is a content distribution network and the queries are queries about content distribution in the data network.

5. The aggregator of claim 1, wherein the aggregation function is one or more of concatenation, addition and a binary logical operation.

6. The aggregator of claim 1, further comprising query pathways over which queries are transmitted from the query originator to the plurality of queryable network devices.

7. The aggregator of claim 6, wherein the query pathways are unicast packet paths.

8. The aggregator of claim 6, wherein the query pathways are multicast packet paths.

9. A query management system, wherein a query originator coupled to a network at a query node generates a query and a plurality of respondents, coupled to the network at device nodes, receives queries directed at their associated device nodes and include logic to generate responses to the query from the query originator, the responses being directed at a response collector coupled to the network at a collection node that collects responses to the query, the query management system comprising:

a plurality of aggregators, each at an aggregation node of the network, each aggregator comprising;

a) a query response collector coupled to receive query responses from device nodes and/or other aggregator nodes;

b) a query identifier for identifying an aggregation function for the plurality of query responses;

c) a processor, coupled to the query identifier and the query response collector, for applying the aggregation function to response data in the plurality of query responses to form an aggregated query response representing the plurality of query responses; and

d) an aggregated query response generator that generates a query response in a form expected by another recipient of query responses; and

logic coupling each of the plurality of respondents to at least one associated device to which the query relates.

10. The query management system of claim 9, wherein the query node and the collection node are the same node.

11. The query management system of claim 10, wherein the query originator is the response collector for queries originated at that query originator.

12. The query management system of claim 9, wherein the query identifier includes a query function lookup table and the query identifier includes logic to read a query reference from the plurality of query responses and to use the query reference as an index into the lookup table to identify the aggregation function for the plurality of query responses.

13. The query management system of claim 9, wherein the network is a content distribution network and the queries are queries about content distribution in the network.

14. The query management system of claim 9, wherein the aggregation function is one or more of concatenation, addition and a binary logical operation.

15. The query management system of claim 9, wherein the respondents include reference translators to translate elements of a query or of a response such that the elements are made uniform over the devices being queried.

16. The query management system of claim 9, wherein the plurality of aggregators are active aggregators and the query management system further comprises at least one passive aggregator that includes a query response collector coupled to receive query responses from device nodes and/or other passive or active aggregator nodes and includes an aggregated query response generator that generates a passive query response in a form expected by another recipient of query responses.

17. The query management system of claim 9, wherein at least one of the plurality of aggregators is an aggregator that can be an active aggregator or a passive aggregator.