Claims
- 1. A method of indicating a path in a computer network, comprising:
executing a background process which dynamically determines additional nodes in a path from a first node to a second node, the additional nodes including a routing node, the background process dynamically examining a routing table in the routing node to determine changes in the path; and providing information concerning the path, the information including indications of the additional nodes.
- 2. The method of claim 1, wherein the background process is configured to use a network socket to provide the information to another process.
- 3. The method of claim 1, wherein the routing table is accessed using a network management protocol.
- 4. The method of claim 1, wherein the information identifies interfaces of the additional nodes.
- 5. The method of claim 1, wherein the information includes indications of a non-routing node in the path.
- 6. The method of claim 5, wherein the non-routing node is determined from stored topology data.
- 7. The method of claim 1, wherein the information indicates plural paths from the first node to the second node.
- 8. The method of claim 1, wherein the information indicates a mesh included in the path.
- 9. The method of claim 1, wherein the information is provided to another process that polls nodes to determine their accessibility.
- 10. The method of claim 1, wherein another process uses the information to identify a point of primary failure.
- 11. A method of identifying a point of primary failure among nodes of a computer network, comprising:
storing information regarding plural paths between a first node and a second node of the network, the information indicating a third node of the network on one of the plural paths; polling the second node and the third node to determine their accessibility by the first node; and using the stored information and the accessibility of the second and third nodes to determine a point of primary failure.
- 12. The method of claim 11, wherein the information indicates plural paths by indicating a mesh.
- 13. The method of claim 11, wherein the information identifies interfaces of the nodes.
- 14. The method of claim 13, wherein the information includes indications of any non-routing nodes in the plural paths between the first and second node.
- 15. The method of claim 11, wherein additional information of a path between the first node and a fourth node is stored
- 16. The method of claim 15, wherein the additional information is used to determine the point of primary failure.
- 17. The method of claim 16, wherein the fourth node is polled to determine its accessibility by the first node.
- 18. A computer-readable medium comprising a program which executes the following procedure for indicating a path in a computer network:
executing a background process which dynamically determines additional nodes in a path from a first node to a second node, the additional nodes including a routing node, the background process dynamically examining a routing table in the routing node to determine changes in the path; and providing information concerning the path, the information including indications of the additional nodes.
- 19. The computer-readable medium of claim 18, wherein the background process is configured to use a network socket to provide the information to another process.
- 20. The computer-readable medium of claim 18, wherein the routing table is accessed using a network management protocol.
- 21. The computer-readable medium of claim 18, wherein the information identifies interfaces of the additional nodes.
- 22. The computer-readable medium of claim 18, wherein the information includes indications of a non-routing node in the path.
- 23. The computer-readable medium of claim 22, wherein the non-routing node is determined from stored topology data.
- 24. The computer-readable medium of claim 18, wherein the information indicates plural paths from the first node to the second node.
- 25. The computer-readable medium of claim 18, wherein the information indicates a mesh included in the path.
- 26. The computer-readable medium of claim 18, wherein the information is provided to another process that polls nodes to determine their accessibility.
- 27. The computer-readable medium of claim 18, wherein another process uses the information to identify a point of primary failure.
- 28. A management computer comprising:
a processor configured to execute a background process which dynamically determines additional nodes in a path from a first node to a second node, the additional nodes including a routing node, the background process dynamically examining a routing table in the routing node to determine changes in the path; and a memory configured to store information concerning the path, the information including indications of the additional nodes.
- 29. The management computer of claim 28, wherein the background process is configured to use a network socket to provide the information to another process.
- 30. The management computer of claim 28, wherein the routing table is accessed using a network management protocol.
- 31. The management computer of claim 28, wherein the information identifies interfaces of the additional nodes.
- 32. The management computer of claim 28, wherein the information includes indications of a non-routing node in the path.
- 33. The management computer of claim 32, wherein the non-routing node is determined from stored topology data.
- 34. The method of claim 28, wherein the information indicates plural paths from the first node to the second node.
- 35. The management computer of claim 28, wherein the information indicates a mesh included in the path.
- 36. The management computer of claim 28, wherein the information is provided to another process that polls nodes to determine their accessibility.
- 37. The management computer of claim 28, wherein another process uses the information to identify a point of primary failure.
RELATED APPLICATIONS
[0001] The present application is related to the U.S. applications, “METHOD OF DETERMINING A MAXIMAL MESH”, Natarajan et al., Ser. No. ______, (Attorney Docket No. 100202314), “METHOD OF DETERMINING A MESH IN A COMPUTER NETWORK”, Walker, et al., Ser. No. ______, (Attorney Docket No. 100202326), and “METHOD OF STORING DATA CONCERNING A COMPUTER NETWORK” Ho et al., Ser. No. ______ (Attorney Docket No. 100204008). Each of these application is are filed on the same day as the present application and is incorporated herein by reference.