Hewlett-packard Development Company, L.P.

Hewlett-packard Company

Darren D Smith

Srikanth Natarajan

Eric A Pulsipher

David M Rhodes

Kam Chooi Wong

Anthony Paul Michael Walker

Wallace Clayton Davis

William Girard McCollom

Stephen Craig Booth

Lawrence M Besaw

Robert Dwight Schettler

James R Greuel

Jeff C Wu

Russell Huonder

Toni Atkinson

Paul H Price

John T Ward

Julio Cesar Garcia

Srikanth Nataraian

Anthony Walker

Mark J Kean

Cho Y Chang

Dominic L Ruffatto

Steven J Constant

A method and system for reducing fault analysis times in a network having a plurality of pollable objects. Poll responses are received from pollable objects, priorities are assigned to each received poll response in accordance with one or more of a received poll response value, a pollable object status and a type of pollable object, and the assigned priorities are processed and to determine any fault locations, wherein a pollable object with a higher priority is processed before a second pollable object with a lower priority. A status manager is operable to receive poll responses from one or more of the pollable objects, a status analyzer is operable to assign, in conjunction with one or more analyzers, priorities to each received poll response in accordance with the received poll response value, a pollable object status and a type of pollable object, and analyzers coupled the status analyzer use the assigned priorities and the corresponding received poll responses to determine a fault location.

Priority-based network fault analysis

A method and system are described for managing a computer network. In accordance with exemplary embodiments of the present invention, a collection computer is assigned a management domain identifier uniquely associated with a management domain in which each collection computer resides. Information that includes the management domain identifier is received in at least one management computer from the collection computer. A database of the information accessed using the management domain identifier is maintained within the at least one management computer.

Method and system for consolidating network topology in duplicate IP networks

A method and system for locating a fault in a network. According to the system, an address analyzer and interface analyzer of a network manager of the network detect that there is a failure associated with a node of the network, a node analyzer of the network manager determines if the node responds to a poll, and if the node does not respond to the poll, a neighbor analyzer of the network manager models the failure, further comprising determining a number and a polling of a plurality of neighbor nodes of the node and assigning the fault in accordance with the number and the polling of the plurality of neighbor nodes According to the method, in response to a node having one or more of one or more addresses and one or more interfaces that fail to respond to a poll, polling the node and polling a plurality of neighbor nodes of the node and assigning the fault in accordance with the polling of the node and a number and the polling of the plurality of neighbor nodes.

Method and system for network fault analysis

The present invention is directed to finding a path between two nodes, including the routing and non-routing nodes of the path. Exemplary embodiments of the present invention are directed to a computer implemented method of finding a path between two nodes in a network. Exemplary steps of the method include obtaining information from a routing table of a first node in the path to determine a second node in the path; determining whether any non-routing nodes are in the path between the first and second nodes; and producing a representation of nodes in the path.

Method of finding a path between two nodes in a network

A preferred system includes a processor, a discovery mechanism and a layout mechanism. The discovery mechanism is configured to generate and store topology data specifying connectors and segments of a communication network. The layout mechanism, which interfaces with the discovery mechanism, is configured to receive topology data from the discovery mechanism and drive a display based upon the topology data. Additionally, the discovery mechanism is configured to determine a path between a start node and an end node based upon the topology data. For instance, such a path(s) may be based upon information corresponding to a type of path of interest and/or information corresponding to a type of connector of interest. Methods and computer readable media also are provided.

System and method for determining probable network paths between nodes in a network topology

Automatic failover methodology provides a mechanism whereby a central control unit, such as a management station, will automatically takeover interface status polling of objects of a collection station that is temporarily unreachable. This methodology is applicable to any distributed computing environment, such as a data communications network, in which it is desirable to have a central control unit assume the interface status polling operation of a temporarily inaccessible collection station. The collection station may be inaccessible due to the network on which the central control unit and the collection station reside being down or due to the collection station being down for maintenance.

Status polling failover of devices in a distributed network management hierarchy

Automatic status polling failover or devices in a distributed network management hierarchy

A system and method synchronizes multiple data stores and achieves data consistency in a non-transactional multiprocessing computer system. Processes are paused and later resumed according to their position in a dependency tree of the system. The data input sources of the system are in effect disabled and any data flow currently in progress in the system is flushed out the various data flow paths to the different data stores. When this process is complete, each of the multiple data stores is synchronized and the data is in a consistent state.

Achieving consistency and synchronization among multiple data stores that cooperate within a single system in the absence of transaction monitoring

A system and method for enforcing configuration parameters and detecting tampering of configuration files used by a software application. An enforced configuration packet (ECP) file generator generates an enforced configuration packet (ECP) file from a configuration parameter description file containing a set of configuration parameters. The ECP file includes a set of enforced configuration packets, which each include one of the configuration parameters from the ECP description file and a corresponding configuration parameter fingerprint unique to that particular configuration parameter. At startup of the software application, an ECP file reader validates the ECP file and each of the enforced configuration packets contained in the ECP file. Validation is achieved by regenerating the configuration parameter fingerprint of each configuration parameter and comparing the regenerated fingerprint to the fingerprint contained in the enforced configuration packet. If any of the fingerprints in the enforced configuration packets do not match their regenerated fingerprint, the ECP file reader indicates that the configuration parameter fingerprint is not valid. If all of the configuration parameter fingerprints match up to their regenerated fingerprints, and the ECP file itself is determined to be valid, the configuration parameters encoded in the ECP file are used by the software application to set up its configuration.

Method of securing software configuration parameters with digital

A network monitor for distinguishing between broken and inaccessible network elements. The network monitor includes one or more computer readable storage mediums, and computer readable program code stored in the one or more computer readable storage mediums. The computer readable program code includes code for discovering the topology of a plurality of network elements, code for periodically polling a plurality of network interfaces associated with the plurality of network elements, code for computing or validating a criticalRoute attribute for each of the plurality of network interfaces, and code for analyzing a status of network interfaces identified by the criticalRoute attribute of an interface in question (IIQ) which is not responding to a poll or ping. The computer readable program code may also include code for establishing a slowPingList and placing in-memory representations of broken or failed network interfaces thereon, thereby reducing the amount of information which is presented to a network administrator from inaccessible elements not responding to a network interface poll. A means for correlating and/or suppressing events in response to the determination of whether a network interface is failed or broken is also provided. Information which is not critical to a network administrator may be suppressed, and then viewed in a 'drill down' of a particular network interface.

Network management event correlation in environments containing

An internet monitoring system efficiently discovers topology data of a network by utilizing a distributed object model. The topology data represents the devices and interconnections of the network and can be used to display various conceptual views of the network at a management station. In accordance with the internet monitoring system, different sets of topology data are discovered with corresponding sets of computer-based stations, such as management stations or collection stations, by discovering the topology at respective regions of the network. Further, the different sets of topology data can be combined at a management station to derive a global view of the network. Both management and remote stations include a layout mechanism for receiving topology data and driving the output device based upon the topology data and a discovery mechanism for discovering and storing the topology data. The discovery mechanism includes a network monitor for discovering topology data corresponding with a particular station-specific region of the network, a topology database for storing topology data, and a topology manager for controlling the topology database. The management station, unlike the collection station, utilizes a replicator for communicating with at least one other station to receive topology data from a different region of the network and to forward the different set of topology data to its respective topology manager. The management station has algorithms for handling overlap in monitored regions through the choice of a primary station for each object monitored.

Distributed internet monitoring system and method

A system for automatically laying out and graphically displaying the topology of a computer network system. The layout system retrieves a list of the nodes within the network and their interconnections from a database which can be manually built by a network administrator or automatically constructed by other software. The system will provide any of three views that can be requested by the user. An internet view is the largest and shows the interconnection of different networks. A network view can be shown for any of the networks described in the internet view. A network is comprised of segments and the system will display a view of the nodes connected to any one of the segments. The system will automatically update the view as new nodes become available in the database. This aspect of the system and allows the system to dynamically update the graph when the list of nodes is being supplied by other software. The system also allows the user to dynamically alter the graph by using a graphical input device to move any of the objects displayed on the graph.

Growing community of inventors

Fort Collins, CO, United States of America

Darren D Smith