Flow-Directed Collaborative Communication

1. An apparatus for resolving a query received from a first node in a network, the apparatus comprising: a processor located at a second node in the network; and a computer readable storage medium containing an executable program that, when executed by the processor, causes the processor to perform steps comprising: accepting, by the second node, ownership of the query from the first node; receiving, by the second node, an identification of a third node in the network, wherein the identification is received from a user of the second node and the user of the second node believes that a user of the third node has information necessary to resolve at least part of the query; transferring, by the second node, ownership of the at least part of the query to the third node; accepting, by the second node, ownership of a first response from the third node, wherein the first response contains information responsive to the at least a part of the query; and transferring, by the second node, ownership of a second response to the first node, wherein the second response includes at least some of the information responsive to the at least a part of the query, wherein the accepting ownership of the query, the receiving the identification, the transferring ownership of the at least part of the query, the accepting ownership of the first response, and the transferring ownership of the second response dynamically generates a data structure that traces a propagation of the query, and the data structure is accessible to an origin of the query.

2. The apparatus of claim 1 , wherein the steps further comprise, prior to transferring ownership of the second response: reviewing, by the second node, the first response; and generating the second response in accordance with the reviewing.

3. The apparatus of claim 2 , wherein the reviewing comprises: aggregating the first response with information received by the second node from a fourth node.

4. The apparatus of claim 2 , wherein the steps further comprise: closing, by the second node, wherein the closing renders the second node inactive in the data structure.

5. The apparatus of claim 1 , wherein the steps further comprise: receiving, by the second node prior to receiving the first response, a deadline from the third node, wherein the deadline provides a timeframe within which the third node expects to provide the first response.

6. The apparatus of claim 1 , wherein the query is subject to a restriction.

7. The apparatus of claim 6 , wherein the restriction comprises a deadline by which the first node requires a response to the query.

8. The apparatus of claim 6 , wherein the restriction comprises a limit on with whom the query can be shared.

9. The apparatus of claim 6 , wherein the restriction comprises a constraint on a form of a response to the query.

10. The apparatus of claim 6 , wherein the at least a part of the query that is transferred to the third node is also subject to the restriction.

11. The apparatus of claim 1 , wherein the steps further comprise: delivering, by the second node, a deadline to the first node, wherein the deadline provides a timeframe within which the second node expects to provide a response to the query.

12. The apparatus of claim 11 , wherein the deadline accounts for any further deadlines by which the second node expects to receive a response to the at least part of the query.

13. The apparatus of claim 12 , wherein the deadline and the further deadlines sum together to satisfy an original deadline by which the first node requests satisfaction of the query.

14. The apparatus of claim 9 , wherein the deadline is alterable by the origin of the query.

15. The apparatus of claim 1 , wherein data structure is alterable by the origin of the query.

16. The apparatus of claim 1 , wherein the steps further comprise: imposing, by the second node, a restriction on the query.

17. The apparatus of claim 1 , wherein the data structure is stored once the query is resolved.

18. A computer readable storage device containing an executable program for resolving a query received from a first node in a network, where the program performs steps of: accepting, by a second node in the network, ownership of the query from the first node; receiving, by the second node, an identification of a third node in the network, wherein the identification is received from a user of the second node and the user of the second node believes that a user of the third node has information necessary to resolve at least part of the query; transferring, by the second node, ownership of the at least part of the query to the third node; accepting, by the second node, ownership of a first response from the third node, wherein the first response contains information responsive to the at least a part of the query; and transferring, by the second node, ownership of a second response to the first node, wherein the second response includes at least some of the information responsive to the at least a part of the query, wherein the accepting ownership of the query, the receiving the identification, the transferring ownership of the at least part of the query, the accepting ownership of the first response, and the transferring ownership of the second response dynamically generates a data structure that traces a propagation of the query, and the data structure is accessible to an origin of the query.

19. The apparatus of claim 1 , wherein the data structure comprises a plurality of nodes including the first node, the second node, and the third node, the plurality of nodes is arranged in a hierarchy that illustrates the propagation.

20. A computer readable storage device containing an executable program for resolving a query received from a first node in a network, where the program performs steps of: accepting, by a second node in the network, ownership of the query from the first node; transferring, by the second node, ownership of at least part of the query to a third node in the network; accepting, by the second node, ownership of a first response from the third node, wherein the first response contains information responsive to the at least a part of the query; and transferring, by the second node, ownership of a second response to the first node, wherein the second response includes at least some of the information responsive to the at least a part of the query, wherein the accepting ownership of the query, the transferring ownership of the at least part of the query, the accepting ownership of the first response, and the transferring ownership of the second response dynamically generates a data structure that traces a propagation of the query, and the data structure is accessible to an origin of the query.