Granted Patent B1

US 7,356,578 · App. 10/446,308 · Granted Apr 8, 2008

Abstract

Claims (47)

1. A method for determining a spanning tree for a computer network, the method comprising:

discovering multicast alias domains from the computer network, wherein multicast alias domains comprise a plurality of computing devices that see each other's multicast traffic without crossing a router;

coordinating discovery of communication metrics by the multicast alias domains, wherein coordinating includes:

dividing work for discovering the communication metrics between a plurality of multicast alias domains; and

assigning the divided work for discovering the communication metrics to the plurality of multicast alias domains, wherein the communication metrics are between the multicast alias domains;

obtaining the communication metrics from each of the plurality of multicast alias domains;

constructing a spanning tree for the computer network by using the communication metrics;

storing the spanning tree; and

using the spanning tree in computer system administration.

2. The method of claim 1 , wherein the communication metrics comprise hop counts.

3. The method of claim 2 , wherein the spanning tree is a minimum spanning tree.

4. The method of claim 3 , wherein the spanning tree was constructed for the computer network using an iterative algorithm.

5. The method of claim 4 , wherein the iterative algorithm comprises a modified Kruskal's algorithm.

6. The method of claim 4 , wherein using the spanning tree in computer system administration comprises transferring a file over the computer network.

7. The method of claim 4 , wherein using the spanning tree in computer system administration comprises transferring data over the computer network.

8. The method of claim 4 , wherein using the spanning tree in computer system administration comprises presenting a graphical representation of the computer network.

9. The method of claim 4 , wherein using the spanning tree in computer system administration comprises analyzing the computer network.

10. The method of claim 4 , wherein using the spanning tree in computer system administration comprises performing software updates.

11. A computer-readable medium for storing program data, wherein the program data comprises executable instructions to:

discover multicast alias domains from the computer network, wherein multicast alias domains comprise a plurality of computing devices that see each other's multicast traffic without crossing a router;

coordinate discovery of communication metrics by the multicast alias domains, wherein coordinating includes:

dividing work for discovering the communication metrics between a plurality of multicast alias domains; and

assigning the divided work for discovering the communication metrics to the plurality of multicast alias domains, wherein the communication metrics are between the multicast alias domains;

obtain the communication metrics from each of the plurality of multicast alias domains;

construct a spanning tree for the computer network by using the communication metrics; and

store the spanning tree.

12. The computer-readable medium of claim 11 , wherein the instructions are further executable to use the spanning tree in computer system administration.

13. The computer-readable medium of claim 11 , wherein the communication metrics comprise hop counts.

14. The computer-readable medium of claim 11 , wherein the spanning tree is a minimum spanning tree.

15. The computer-readable medium of claim 11 , wherein the spanning tree was constructed for the computer network using a modified Kruskal's algorithm.

16. A system for determining a spanning tree for a computer network, the system comprising:

a computing device;

a computer-readable medium that is part of the computing device or in electronic communication with the computing device, the computer-readable medium comprising executable instructions to:

discover domains from the computer network, wherein domains comprise a plurality of computing devices that see each other's multicast traffic without crossing a router;

coordinate discovery of communication metrics by the domains, wherein coordinating includes:

dividing work for discovering the communication metrics between a plurality of domains; and

assigning the divided work for discovering the communication metrics to the plurality of domains, wherein the communication metrics are between the domains;

obtain the communication metrics from each of the plurality of domains;

construct a minimum spanning tree for the computer network by using the communication metrics;

store the minimum spanning tree; and

use the minimum spanning tree in computer system administration.

17. The system of claim 16 , wherein the communication metrics comprise hop counts.

18. The system of claim 17 , wherein the minimum spanning tree was constructed for the computer network using a modified Kruskal's algorithm.

19. The system of claim 16 , wherein the instructions are further executable to use bandwidth characterizing technologies to determine link types in the computer network.

20. The system of claim 16 , wherein the domains comprise multicast alias domains.

21. The system of claim 16 , wherein the domains comprise multipoint communication domains.

22. The system of claim 16 , wherein the domains comprise broadcast domains.

Assignments (29)