Distributed network query
First Claim
Patent Images
1. A method of identifying a plurality of nodes on a network, comprising:
- receiving a query sent from a caller node, wherein;
the query comprises a delay constant; and
the query is received by at least one of a plurality of nodes on a network;
determining at the at least one node an answer to the query;
calculating a delay period by at least multiplying the delay constant by at least a portion of a network address associated with the at least one node; and
after the delay period, forwarding the answer to the query from the at least one node to the caller node, wherein the caller node is operable to maintain a list of nodes which responded to the query.
1 Assignment
0 Petitions
Accused Products
Abstract
A method of identifying a plurality of nodes on a network, includes receiving at at least one of the plurality of nodes on the network a query posed by a caller node determining at the at least one of the plurality of nodes on the network an answer to the query, forwarding the answer to the query from the at least one of the plurality of nodes on the network to the caller node and receiving, at the caller node, the answer to the query from the at least one of the plurality of nodes on the network and maintaining a list of nodes which responded to the query.
56 Citations
50 Claims
-
1. A method of identifying a plurality of nodes on a network, comprising:
-
receiving a query sent from a caller node, wherein; the query comprises a delay constant; and the query is received by at least one of a plurality of nodes on a network; determining at the at least one node an answer to the query; calculating a delay period by at least multiplying the delay constant by at least a portion of a network address associated with the at least one node; and after the delay period, forwarding the answer to the query from the at least one node to the caller node, wherein the caller node is operable to maintain a list of nodes which responded to the query. - View Dependent Claims (2, 3, 4, 5, 6)
-
-
7. A method of identifying nodes on a network, comprising:
-
sending a query from a caller node to a subnet, the query comprising a delay constant; receiving the query at a plurality of nodes on the subnet; calculating a delay period by at least multiplying the delay constant by at least a potion of a network address associated with at least one of the plurality of nodes; after the delay period, sending a local response to the query from the at least one node to at least one other node on the subnet; receiving, at one of the plurality of nodes on the subnet, the local response and compiling a list identifying responding nodes; and sending the list of responding nodes to the caller node. - View Dependent Claims (8, 9, 10, 11, 12, 13, 14, 15, 16)
-
-
17. A method of controlling a node in a network, comprising:
-
receiving at the node a query from a caller node, the query comprising a delay constant; determining an answer to the query; calculating a delay period to wait before responding to the query, the delay period calculated by at least multiplying the delay constant by at least a portion of a network address associated with the node; determining whether the node has a lowest address in the network; if the node does not have the lowest address in the network, waiting the period of time and then responding to the query; if the node does have the lowest address in the network, determining an address of a node having a highest address in the network; determining, based at least in part on the highest address in the network, a query timeout period; if the node does have the lowest address in the network, listening for responses to the query from other nodes in the network and preparing a list of responding nodes; and transferring the list of responding nodes to the caller node. - View Dependent Claims (18, 19, 20)
-
-
21. A method of identifying a plurality of nodes on a network, comprising:
-
receiving a query sent from a caller node, wherein; the query comprises a delay constant; and the query is received by at least one of a plurality of nodes on a network; calculating a delay period by at least multiplying the delay constant by at least a portion of a network address associated with the at least one node; after the delay period, transmitting an answer to the query from the at least one node; and monitoring, at a responder node which received the query, responses from other nodes to the query and maintaining a list of nodes which responded to the query. - View Dependent Claims (22, 23, 24, 25)
-
-
26. A network, comprising:
-
a server for posing a query to a plurality of client nodes on the network, the server comprising a computer and the query comprising a delay constant; and a plurality of client nodes for receiving the query posed by a caller node and for determining an answer to the query, each of the plurality of client nodes forwarding, after a respective delay period calculated by at least multiplying the delay constant by at least a portion of a network address, the answer to the query to the caller node, wherein; the server receives the answers to the query from the plurality of client nodes; and the server maintains a list of client nodes which responded to the query. - View Dependent Claims (27, 28, 29, 30)
-
-
31. A system for identifying nodes on a network, comprising:
-
a server for sending a query to a subnet, wherein the query comprises a delay constant and the server is a computer; a plurality of client nodes on the subnet for receiving the query from the server, wherein, after a delay period calculated by at least multiplying the delay constant by at least a portion of a network address, at least one client node on the subnet sends a local response to the query to at least one other client node on the subnet, the at least one other client node on the subnet compiling a list identifying responding nodes, the at least one other client node sending the list identifying the responding nodes to the server. - View Dependent Claims (32, 33, 34, 35, 36, 37, 38, 39)
-
-
40. A node for use on a subnet, comprising:
-
a section for receiving a query from a caller node, the query comprising a delay constant; a section for determining an answer to the query; a section for calculating a delay period to wait before responding to the query, the delay period calculated by at least multiplying the delay constant by at least a portion of a network address; a section for determining whether the node has a lowest address in the network, the node comprising a machine in the network, wherein; if the node does not have the lowest address in the network, the node responds to the query after the delay period; if the node does have the lowest address in the network, a section of the node determines an address of a node having a highest address in the network and based at least in part on the highest address in the network, determines a query timeout period; and if the node does have the lowest address in the network, a section listens for responses to the query from other nodes in the network and prepares a list of responding nodes; and a section for transferring the list of responding nodes to the caller node. - View Dependent Claims (41, 42, 43, 44)
-
-
45. A computer readable medium having computer executable code for identifying nodes on a network, comprising:
-
server code for posing a query to a plurality of client nodes on the network, the query comprising a delay constant; and client code for use by a plurality of client nodes for receiving the query posed by a caller node and for determining an answer to the query, the client code comprising code instructing at least one of the plurality of client nodes to forward, after a delay period calculated by at least multiplying the delay constant by at least a portion of a network address, the answer to the query to the caller node, wherein a node running the server code maintains a list of client nodes which responded to the query.
-
-
46. A computer readable medium having computer executable code for identifying nodes on a network, comprising:
-
server code for use by a server for sending a query to a subnet, the query comprising a delay constant; client code for use by a plurality of client nodes on the subnet for receiving the query from the server, wherein in response to the query, the client code for at least one of the plurality of client nodes on the subnet sends, after a delay period calculated by at least multiplying the delay constant by at least a portion of a network address, a local response to the query to at least one other client node on the subnet, the client code of the at least one other client node on the subnet compiling a list identifying responding nodes and sending the list identifying the responding nodes to the server.
-
-
47. A computer readable medium comprising computer executable code to be executed by a node on a subnet, comprising:
-
code for receiving a query from a caller node, the query comprising a delay constant; code for determining an answer to the query; code for calculating a delay period to wait before responding to the query, the delay period calculated by at least multiplying the delay constant by at least a portion of a network address; code for determining whether the node has a lowest address in the network, wherein; if the node does not have the lowest address in the network, the code directs the node to respond to the query after the delay period; if the node does have the lowest address in the network, the code directs the node to determine an address of a node having a highest address in the network and, based at least in part on the highest address in the network, determine a query timeout period; and if the node does have the lowest address in the network, the code directs the node to listen for responses to the query from other nodes in the network and to prepare a list of responding nodes; and code for transferring the list of responding nodes to the caller node.
-
-
48. A program storage device readable by a machine, tangibly embodying a program of instructions executable by the machine to identify a plurality of nodes on a network, comprising:
-
instructions to receive a query posed by a caller node, wherein; the query comprises a delay constant; and the query is received by at least one of the plurality of nodes on the network; instructions to calculate a delay period by at least multiplying the delay constant by at least a portion of a network address associated with the at least one of the plurality of nodes; instructions to transmit, after the delay period, an answer to the query from the at least one of the plurality of nodes; and instructions to monitor, at a responder node which received the query, responses from other nodes to the query and to maintain a list of nodes which responded to the query.
-
-
49. A network device comprising:
-
a receiving query section for receiving a query sent by a caller node to a plurality of nodes on a network, the query comprising a delay constant; a delay calculating section for calculating a delay period by at least multiplying the delay constant by at least a portion of a network address, the delay period usable to determine when to transmit a response to the query; and a list processing section for monitoring responses from other nodes to the query and maintaining a list of nodes which responded to the query.
-
-
50. A network of nodes comprising:
-
a caller node for sending a Distributed Query to a plurality of nodes, the caller node comprising a machine in a network, the Distributed Query comprising a delay constant; and at least one responder node comprising; a receiving query section for receiving the Distributed Query sent by the caller node; a delay calculating section for calculating a delay period by at least multiplying the delay constant by at least a portion of a network address, the delay period usable to determine when to transmit a response to the query; and a list processing section for monitoring responses from other nodes to the Distributed query and maintaining a list of nodes which responded to the Distributed Query.
-
Specification