Intelligent discovery of network information from multiple information gathering agents

• US 8,019,851 B2
• Filed: 04/21/2010
• Issued: 09/13/2011
• Est. Priority Date: 09/20/2003
• Status: Expired due to Fees

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Padbidri, Sumant, Heitman, Allen R., Nagarajrao, Sunil K., Basham, Robert, Axberg, Gary T., Merbach, David L.
• Primary Examiner(s): Chea; Philip J
• Application Number:
  US12/764,868
• Publication Number:
  US 20100205299A1
• Time in Patent Office: 510 Days
• Field of Search: 709/202, 709/220, 709/223, 709/224, 370/254
• US Class Current: 709/223
• CPC Class Codes: H04L 41/00 Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
• CPC Class Codes: H04L 41/046 comprising network management agents or mobile agents therefor
• CPC Class Codes: H04L 41/12 Discovery or management of network topologies
• CPC Class Codes: H04L 67/1097 for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]
• CPC Class Codes: H04L 67/51 Discovery or management thereof, e.g. service location protocol [SLP] or web services
• CPC Class Codes: H04L 69/329 in the application layer [OSI layer 7]

Abstract

A system, method and computer program product for intelligent discovery of network information from multiple information gathering agents adapted to discover information concerning the network. The discovery agents each have an associated discovery capability. Based on consideration of the agent discovery capabilities, discovery assignments are computed and network discovery is performed according to the assignments so as to reduce discovery poll overhead.

Claims

1. A network management system for discovering information about a network, comprising:

a plurality of processing nodes;

plural discovery agents on said nodes adapted to discover information concerning said network;

each of said discovery agents having an associated discovery capability;

each of said discovery agents having an associated discovery assignment computed prior to discovery;

collectively, said agent discovery assignments being a subset of said agent discovery capabilities; and

said agent discovery capabilities being overlapping due to some of said agents being capable of discovering the same information from the same network device, and said discovery assignments being non-overlapping, such that (1) no network device is discovered more than once by different discovery agents seeking the same information, (2) one or more agents are not permitted to perform full discovery of information due to one or more other discovery agents being assigned to discover the same information, and (3) no duplicate discovery information is generated.

2. In a network containing a plurality of processing nodes, a method for discovering information about said network, comprising:

providing plural discovery agents on said nodes adapted to discover information concerning said network;

each of said discovery agents having an associated discovery capability;

prior to discovery, computing a discovery assignment for each of said discovery agents;

collectively, said agent discovery assignments being a subset of said agent discovery capabilities; and

said agent discovery capabilities being overlapping due to some of said agents being capable of discovering the same information from the same network device, and said discovery assignments being non-overlapping, such that (1) no network device is discovered more than once by different discovery agents seeking the same information, (2) one or more agents are not permitted to perform full discovery of information due to one or more other discovery agents being assigned to discover the same information, and (3) no duplicate discovery information is generated.

3. The method of claim 2 wherein said agent discovery assignments are computed based on said discovery capabilities of different discovery agents and by determining which said discovery agents having overlapping discovery capabilities are most fit to receive said agent discovery assignments.

4. The method of claim 2 wherein said agent discovery assignments are computed by a network manager in said network and reflect one or more of data collection service registrations in which said network manager registers with said plural discovery agents and receives information regarding specified discovery, agent cost to obtain network information, load balancing among said plural discovery agents, and assignment churn.

5. The method of claim 2 wherein said agent discovery assignments comprise both inband and outband discovery assignments.

6. The method of claim 2 wherein said agent discovery assignments are based on said discovery capabilities being processed by a network manager in said network and each discovery agent'"'"'s discovery assignment being stored at said discovery agent for subsequent reference.

7. The method of claim 2 wherein said agent discovery assignments are based on an input listing of said discovery agents, the network devices they are capable of discovering and a cost to discover each network device, and an output listing of said discovery agents and the network devices said discovery agents are assigned to discover.

8. The method of claim 7, wherein said agent discovery assignments are further based on an entity-sorting computation that produces an entity-sorting listing that associates each network device and one or more discovery agents each having a cost to discover that network device, said listing ordering said network devices according to the discovery costs of the associated discovery agents.

9. The method of claim 8, wherein said agent discovery assignments are further based on an agent-sorting computation that produces an agent-sorting listing that modifies said entity-sorting listing to order the discovery agents associated with each network device according to one or more of agent cost, load factor and agent identifier.

10. The method of claim 2 wherein said discovery agents conduct agent capability queries in response to capability polls requested by a network manager in said network.

11. The method of claim 10 wherein said agent capability queries seek a minimal subset of information required to effect calculation of said agent discovery assignments.

12. The method of claim 10 wherein each of said discovery agents implements a full discovery query that returns a complete information hierarchy identifying all levels of discoverable entities in a path from said agent to all network endpoints reachable by that agent, and further implement said agent capability query that gathers a subset of said complete information hierarchy for use in computing said agent assignments.

13. The method of claim 10 wherein said agents conduct said agent capability queries based on said capability polls being issued in response to one or more of (1) a network event being detected, (2) an agent'"'"'s discovery capabilities having changed, (3) and an agent being added, removed or modified.

14. A computer program product, comprising:

one or more non-transitory computer-readable storage media;

software code stored on said one or more non-transitory storage media for programming one or more network processing nodes to perform network management operations for discovering information about a network, said operations comprising;

providing plural discovery agents on said nodes adapted to discover information concerning said network;

each of said discovery agents having an associated discovery capability;

prior to discovery, computing a discovery assignment for each of said discovery agents;

collectively, said agent discovery assignments being a subset of said agent discovery capabilities; and

said agent discovery capabilities being overlapping due to some of said agents being capable of discovering the same information from the same network device, and said discovery assignments being non-overlapping, such that (1) no network device is discovered more than once by different discovery agents seeking the same information, (2) one or more agents are not permitted to perform full discovery of information due to one or more other discovery agents being assigned to discover the same information, and (3) no duplicate discovery information is generated.

15. The computer program product of claim 14 wherein said agent discovery assignments are computed based on said discovery capabilities of different discovery agents and by determining which said discovery agents having overlapping discovery capabilities are most fit to receive said agent discovery assignments.

16. The computer program product of claim 14 wherein said agent discovery assignments are computed by a network manager in said network and reflect one or more of data collection service registrations in which said network manager registers with said plural discovery agents and receives information regarding specified discovery, agent cost to obtain network information, load balancing among said plural discovery agents, and assignment churn.

17. The computer program product of claim 14 wherein said agent discovery assignments comprise both inband and outband discovery assignments.

18. The computer program product of claim 14 wherein said agent discovery assignments are based on said discovery capabilities being processed by a network manager in said network and each discovery agent'"'"'s discovery assignment being stored at said discovery agent for subsequent reference.

19. The computer program product of claim 14 wherein said agent discovery assignments are based on an input listing of said discovery agents, the network devices they are capable of discovering and a cost to discover each network device, and an output listing of said discovery agents and the network devices said discovery agents are assigned to discover.

20. The computer program product of claim 19, wherein said agent discovery assignments are further based on an entity-sorting computation that produces an entity-sorting listing that associates each network device and one or more discovery agents each having a cost to discover that network device, said listing ordering said network devices according to the discovery costs of the associated discovery agents.

21. The computer program product of claim 20, wherein said agent discovery assignments are further based on an agent-sorting computation that produces an agent-sorting listing that modifies said entity-sorting listing to order the discovery agents associated with each network device according to one or more of agent cost, load factor and agent identifier.

22. The computer program product of claim 14 wherein said discovery agents conduct agent capability queries in response to capability polls requested by a network manager in said network.

23. The computer program product of claim 22 wherein said agent capability queries seek a minimal subset of information required to effect calculation of said agent discovery assignments.

24. The computer program product of claim 22 wherein each of said discovery agents implements a full discovery query that returns a complete information hierarchy identifying all levels of discoverable entities in a path from said agent to all network endpoints reachable by that agent, and further implement said agent capability query that gathers a subset of said complete information hierarchy for use in computing said agent assignments.

25. The computer program product of claim 22 wherein said agents conduct said agent capability queries based on said capability polls being issued in response to one or more of (1) a network event being detected, (2) an agent'"'"'s discovery capabilities having changed, (3) and an agent being added, removed or modified.