[go: up one dir, main page]

WO2001086443A1 - Systemes et procedes de gestion et d'analyse des defaillances de reseaux informatiques - Google Patents

Systemes et procedes de gestion et d'analyse des defaillances de reseaux informatiques Download PDF

Info

Publication number
WO2001086443A1
WO2001086443A1 PCT/US2001/014557 US0114557W WO0186443A1 WO 2001086443 A1 WO2001086443 A1 WO 2001086443A1 US 0114557 W US0114557 W US 0114557W WO 0186443 A1 WO0186443 A1 WO 0186443A1
Authority
WO
WIPO (PCT)
Prior art keywords
fault
network
handler
employing
data
Prior art date
Application number
PCT/US2001/014557
Other languages
English (en)
Inventor
Christopher A. Buia
Thomas S. Pantelis
David K. Taylor
Scott Ball
Nathaniel J. Rockwell
Original Assignee
Aprisma Management Technologies, Inc.
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Aprisma Management Technologies, Inc. filed Critical Aprisma Management Technologies, Inc.
Priority to US10/258,907 priority Critical patent/US7500143B2/en
Priority to AU2001261208A priority patent/AU2001261208A1/en
Publication of WO2001086443A1 publication Critical patent/WO2001086443A1/fr
Priority to US10/287,974 priority patent/US7103807B2/en

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F11/00—Error detection; Error correction; Monitoring
    • G06F11/22—Detection or location of defective computer hardware by testing during standby operation or during idle time, e.g. start-up testing
    • G06F11/2257—Detection or location of defective computer hardware by testing during standby operation or during idle time, e.g. start-up testing using expert systems
    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F11/00—Error detection; Error correction; Monitoring
    • G06F11/07—Responding to the occurrence of a fault, e.g. fault tolerance
    • G06F11/0703—Error or fault processing not based on redundancy, i.e. by taking additional measures to deal with the error or fault not making use of redundancy in operation, in hardware, or in data representation
    • G06F11/0706—Error or fault processing not based on redundancy, i.e. by taking additional measures to deal with the error or fault not making use of redundancy in operation, in hardware, or in data representation the processing taking place on a specific hardware platform or in a specific software environment
    • G06F11/0748—Error or fault processing not based on redundancy, i.e. by taking additional measures to deal with the error or fault not making use of redundancy in operation, in hardware, or in data representation the processing taking place on a specific hardware platform or in a specific software environment in a remote unit communicating with a single-box computer node experiencing an error/fault
    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F11/00—Error detection; Error correction; Monitoring
    • G06F11/07—Responding to the occurrence of a fault, e.g. fault tolerance
    • G06F11/0703—Error or fault processing not based on redundancy, i.e. by taking additional measures to deal with the error or fault not making use of redundancy in operation, in hardware, or in data representation
    • G06F11/079—Root cause analysis, i.e. error or fault diagnosis
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/06—Management of faults, events, alarms or notifications
    • H04L41/0631—Management of faults, events, alarms or notifications using root cause analysis; using analysis of correlation between notifications, alarms or events based on decision criteria, e.g. hierarchy, tree or time analysis
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L43/00—Arrangements for monitoring or testing data switching networks
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/02—Standardisation; Integration
    • H04L41/0213—Standardised network management protocols, e.g. simple network management protocol [SNMP]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/22—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks comprising specially adapted graphical user interfaces [GUI]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/50—Network service management, e.g. ensuring proper service fulfilment according to agreements
    • H04L41/5003—Managing SLA; Interaction between SLA and QoS
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/50—Network service management, e.g. ensuring proper service fulfilment according to agreements
    • H04L41/5003—Managing SLA; Interaction between SLA and QoS
    • H04L41/5009—Determining service level performance parameters or violations of service level contracts, e.g. violations of agreed response time or mean time between failures [MTBF]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/50—Network service management, e.g. ensuring proper service fulfilment according to agreements
    • H04L41/5003—Managing SLA; Interaction between SLA and QoS
    • H04L41/5009—Determining service level performance parameters or violations of service level contracts, e.g. violations of agreed response time or mean time between failures [MTBF]
    • H04L41/5012—Determining service level performance parameters or violations of service level contracts, e.g. violations of agreed response time or mean time between failures [MTBF] determining service availability, e.g. which services are available at a certain point in time
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/50—Network service management, e.g. ensuring proper service fulfilment according to agreements
    • H04L41/5003—Managing SLA; Interaction between SLA and QoS
    • H04L41/5019—Ensuring fulfilment of SLA
    • H04L41/5025—Ensuring fulfilment of SLA by proactively reacting to service quality change, e.g. by reconfiguration after service quality degradation or upgrade
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/50—Network service management, e.g. ensuring proper service fulfilment according to agreements
    • H04L41/508—Network service management, e.g. ensuring proper service fulfilment according to agreements based on type of value added network service under agreement
    • H04L41/5093—Network service management, e.g. ensuring proper service fulfilment according to agreements based on type of value added network service under agreement wherein the managed service relates to messaging or chat services
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L43/00—Arrangements for monitoring or testing data switching networks
    • H04L43/08—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters
    • H04L43/0805—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters by checking availability
    • H04L43/0817—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters by checking availability by checking functioning

Definitions

  • the present invention relates a fault management and diagnosis system with a generic, easily extensible architecture .
  • Computer networks link personal computers, workstations, servers, storage devices, printers and other devices.
  • WANs wide area computer networks
  • LANs local area networks
  • Both WANs and LANs have enabled sharing of network applications such as electronic mail, file transfer, host access and shared databases.
  • WANs and LANs have enabled efficient transfer of information, and sharing of resources, which in turn increased user productivity.
  • communications networks have become vitally important for businesses and individuals. Communications networks usually transmit digital data in frames or packets created according to predefined protocols that define their format.
  • Data frames include headers (located at the beginning and containing addresses) , footers (located at the end of the frames) , and data fields that include the transmitted data bits (payload) .
  • Data frames may have a fixed or variable length according to the used protocol or network type.
  • a communications network transmits data from one end station (i.e., a computer, workstation, server etc.) to another using a hierarchy of protocol layers (i.e., layers that are hierarchically stacked) .
  • protocol layers i.e., layers that are hierarchically stacked
  • each layer in the source communicates with the corresponding layer in the destination in accordance with a protocol defining the rules of communication. This is actually achieved by transferring information down from one layer to another across the layer stack, transmitting across a communication medium, and then transferring information back up the successive protocol layers on the other end.
  • a protocol layer communicating with its counterparts at the same layer level.
  • the open system interconnection (OSI) model has seven layers that define the rules for transferring information between the stations.
  • a physical layer (Layer 1) is responsible for the transmission of bit streams across a particular physical transmission medium. This layer involves a connection between two endpoints allowing electrical signals to be exchanged between them.
  • a data link layer (Layer 2) is responsible for moving information across a particular link by packaging raw bits into logically structured packets or frames . Layer 2 ensures good transmission and correct delivery by checking errors, re-transmitting as necessary, and attaching appropriate addresses to the data sent across a physical medium. If a destination computer does not send an acknowledgment of frame receipt, Layer 2 resends the frame.
  • the contention access methods are regarded as Layer 2 activities.
  • Layer 2 may be further divided into two sub-layers: Logical Link Control (LLC) and Media Access Control (MAC) .
  • LLC Logical Link Control
  • MAC Media Access Control
  • the MAC sublayer defines procedures the stations must follow to share the link and controls access to the transmission link in an orderly manner.
  • the MAC sublayer defines a hardware or data link address called a MAC address.
  • the MAC address is unique for each station so that multiple stations can share the same medium and still uniquely identify each other.
  • the LLC sublayer manages communications between devices over a single link of the communications network.
  • a network layer (Layer 3) is set up to route data from one network user to another.
  • Layer 3 is responsible for establishing, maintaining, and terminating the network connection between two users and for transferring data along that connection.
  • Layer 3 addresses, messages, and determines the route along the network from the source to the destination computer.
  • Layer 3 manages traffic, such as switching, routing, and controlling the congestion of data transmissions .
  • a transport layer (Layer 4) is responsible for providing data transfer between two users at an agreed level of quality. When a connection is established, this layer is responsible for selecting a particular quality of service (QoS) , for monitoring transmissions to ensure the selected QoS, and for notifying the users if the QoS deteriorates. Layer 4 also provides for error recognition and recovery, repackaging of long messages into smaller frames of information, and acknowledgments of receipt.
  • QoS quality of service
  • a session layer (Layer 5) focuses on providing services used to organize communication and synchronize the dialog that takes place between users and to manage the data exchange. The primary concern of Layer 5 is controlling when users can send and receive concurrently or alternately.
  • a presentation layer (Layer 6) is responsible for the presentation of information in a way that is meaningful to network users. This may include character code transmission, data conversion, or data compression and expansion.
  • Layer 6 translates data from both Layer 5 and from Layer 7 into an intermediate format and provides data encryption and compression services .
  • Layer 7 is an application layer that provides means for application processes to access the system interconnection facilities in order to exchange information. This includes services used to establish and terminate the connections between users and to monitor and manage the systems being interconnected, as well as the various resources they employ.
  • each layer may or may not add protocol information to the data, for example, by encapsulating frames with a header or removing the header, depending on the direction in the protocol stack.
  • the individual protocols define the format of the headers.
  • MAC address includes a source address and a destination address, which have a predefined relationship to a network station.
  • Higher network layers provide a network address that has a logical relationship established by a network administrator according to a predetermined network addressing arrangement .
  • the assigned network address conveys information that can be used by a router when routing frames through the internetwork. If the network address is hierarchical, a router may use a portion of the address to route the packet to a higher-level partition or domain in the internetwork. Some protocols are hierarchical others are not so hierarchical routing may or may not be available.
  • the global network may be subdivided into IP networks, which in turn may be subdivided into subnets.
  • An IP address includes a network number (assigned by IANA) , a subnet number (assigned by a network administrator) , and a host that identifies an end station.
  • the host number may be assigned by a network administrator, or may be assigned dynamically. This is a form of hierarchical addressing that is used by IP routing algorithms to perform hierarchical or prefix routing operations. Routing algorithms maintain information of all higher-level routing environments in routing tables for domains by recording their shortest unique address prefixes.
  • a station may support more than one network layer protocol. Such station has multiple network addresses and multiple protocol stacks that present the same MAC address on a port for the different protocols.
  • a multiprotocol stack station connected to both an IP and an IPX network includes an IP network address and an IPX network address.
  • a communications network may include a number of network entities (or nodes) , a number of interconnecting links and communication devices.
  • a network node is, for example, a personal computer, a network printer, file server or the like.
  • An interconnecting link is, for example, an Ethernet, Token-Ring or other type network link.
  • Communication devices include routers, switches, bridges or their equivalents.
  • a bridge or a switch is a Layer 2 entity that is typically a computer with a plurality of ports for establishing connections to other entities.
  • the bridging function includes receiving data from a port and transferring that data to other ports for receipt by other entities.
  • a bridge moves data frames from one port to another using the end-station MAC address information contained in the switched frames.
  • Switches interconnect the communication media to form small domains of stations, such as a subnetwork.
  • Subnetworks or subnets provide an organizational overlay to an internetwork that facilitates transmission of data between the end stations, particularly for broadcast transmissions. The subnet functions to limit the proliferation of broadcast frames to stations within a broadcast domain.
  • a router is an intermediate station that interconnects domains or subnets by providing path from a node on a first network to a node on a second network.
  • a peripheral router connects a network to a larger internetwork, and thus may be limited to a single protocol.
  • a central router may be connected to a different board in a server or a hub and thus usually has a multi-protocol capability.
  • a router provides the path by first determining a route and then providing an initial connection for the path.
  • a router executes network routing software that depends on the used protocol.
  • a router can work with different data-link layer protocols and thus can connect networks using different architectures, for example, Ethernet to Token Ring to FDDI .
  • a global communications network connects devices separated by hundreds of kilometers .
  • a LAN covers a limited area of maximum several kilometers in radius connecting devices in the same building or in a group of buildings.
  • LANs usually include bridges or switches connecting several end-stations and a server.
  • a bridge or a switch broadcasts traffic to all stations.
  • a LAN was user-owned (did not run over leased lines) with gateways to public or other private networks.
  • a network administrator had to rewire and reconfigure the user's station. This has changed with the introduction of virtual LANs .
  • a virtual LAN is a logical Layer 2 broadcast domain, which enables a logical segmentation of the network without changing the physical connections.
  • a VLAN enabled switch segments the connected stations into logically defined groups. Broadcast traffic from a server or an end- stations in a particular VLAN is replicated only on those ports connected to end-stations belonging to that VLAN. The broadcast traffic is blocked from ports with no end-points belonging to that VLAN, creating a similar type of broadcast containment that routers provide .
  • VLANs may also be defined between different domains connected by a router. In this case, the router passes network traffic from one domain to the other (as done without defining a VLAN) , and passes network traffic from one VLAN to the other. The router also passes network traffic between VLANs that are in the same domain because VLANs do not normally share user information.
  • the router is configured as a member of all VLANs.
  • VPNs Virtual Private Networks
  • owners of large communications networks can provide centralized management services to small and medium sized businesses.
  • the provider can configure VPNs that interconnect various customer sites in geographically separate locations .
  • These VPNs offer privacy and cost efficiency through sharing of network infrastructure .
  • Various VPNs have been proposed with various degrees of security, privacy, scalability, ease of deployment and manageability.
  • a global communications network may use a different levels different routing and connection management protocols such as International Standards Organization (ISO) Open
  • OSI Systems Interface
  • IS-IS Intermediate Systems to Intermediate Systems
  • OSPF Internet Open Shortest Path First
  • ATM Asynchronous Transfer Mode
  • PNNI Private Network-Network-Interface
  • the routing protocols identify a network node using a global address of a Route Server Element (RSE) .
  • RSE Route Server Element
  • the RSEs generate routing that identifies optimal routes for communication throughout the network.
  • the RSE is responsible for administration of the algorithms that enable a node to keep its view of the network topology and performance metric current, referred to as Routing Information Exchange (RIE) .
  • RIE Routing Information Exchange
  • an RSE usually acts as a central element for the routing of traffic through the node .
  • a network management process controls and optimizes the efficiency and productivity of a communications network.
  • a network management station manages the network entities (e.g., routers bridges switches, servers, storage devices, computers, printers) using a network management protocol such as a Simple Network Management Protocol (SNMP) , Internet Control Message Protocol (ICMP) , or another network management protocol known in the art .
  • SNMP Simple Network Management Protocol
  • ICMP Internet Control Message Protocol
  • the network management station can deliver information or receive information by actively polling the network entities or by receiving unsolicited information from the network entities.
  • SNMP a network management station can executes a set, get, or get- next functions to set and retrieve information from a network entity. This information may be stored within the polled network entity as Management Information Base (MIB) .
  • MIB Management Information Base
  • the network management station can receive unsolicited information from a network entity in the form of an SNMP trap.
  • Network entities may send SNMP traps to the network management station when a problem in the network or network entity occurs.
  • a network management station may be implemented using any general purpose computer system, which is programmable using a high-level computer programming language or using specially programmed, special purpose hardware.
  • the hardware includes a processor executing an operating system providing a platform for computer programs that run scheduling, debugging, input-output control, accounting compilation, storage assignment, data management, memory management, and communication control and other services.
  • the application programs are written in high level programming languages .
  • a network management station can include a network manager unit, a network communication interface, a data acquisition unit, a data correlation unit, and a graphical user interface.
  • the data correlation unit interprets data received through the data acquisition unit and presents the interpreted data to a user on the graphical user interface.
  • the network communication interface may include transport protocols and LAN drivers used to communicate information to the communications network.
  • the transport protocols may be IPX, TCP/IP or other well-known transport protocols.
  • the LAN drivers may include software required to transmit data on a communications network through the network interface.
  • the LAN drivers are generally provided by the manufacturer of the network interface for a general purpose computer for the purpose of communicating through the network interface.
  • the network manager unit may be an SNMP network manager/agent implementing SNMP functions, or another type of network manager unit performing associated management functions.
  • the network manager unit utilizes the network communication interface to transfer requests to network entities over a communications network.
  • a network management station may use a network management agent residing on a network entity.
  • the network management agent may be a software process running on a processor or may be special purpose hardware.
  • the network management agent may be an SNMP agent (or ICMP agent) , which may include a data collection unit, a network manager unit, and a network communication interface for communication as described above. For example, this communication may use network management functions such as SNMP functions.
  • a network management agent residing on a network entity, may include a data correlation unit, a data collection unit, a network manager unit and a network communication interface for communication.
  • NMS network management systems
  • the fault status represents the NMS ' s ability to contact a network element using common management protocols such as a SNMP protocol or an ICMP protocol.
  • Inference handlers perform work based on changes to a managed entity's attribute.
  • the inference handler provides the intelligence behind the objects.
  • An inference handler can perform different functions such as fault isolation or suppression, but these are frequently based on the NMS ' s ability to contact the network element, which is used as the fault status attribute .
  • the NMS can then suppress the fault status of a network element depending on the status of other neighboring network elements.
  • loss of contact information in an NMS database does not sufficiently represent various problems a network element can experience as a result of a fault in a communications network.
  • there is a need for a fault management and diagnosis process that can provide a generic, open framework applicable to any system.
  • the present invention is a system, a method and a product (that can be stored in a computer-readable storage medium) for diagnosing or analyzing faults of various types (including a complete or partial failure) .
  • a method or system for analyzing a fault includes a fault object factory constructed and arranged to receive fault data and create a fault object; and a fault diagnosis engine constructed and arranged to perform root cause analysis of the fault object.
  • the method or system may further include one of more of the following: a fault detector constructed and arranged to detect a fault in a monitored entity; a fault repository constructed and arranged to store and access the fault object; and a fault handler constructed and arranged to be triggered by the fault diagnosis engine to analyze the fault object.
  • the fault handler includes a fault handler tester and a fault handler diagnoser.
  • a method or system for analyzing a fault including means for receiving fault data, means for creating a fault object; and means for performing a root cause analysis on the object to determine a root cause.
  • the method or system may further include one of more of the following: Means for creating a fault object includes a fault object factory using fault data or a detector remotely located from the system. Means for performing the root cause analysis includes means for invoking specific fault handlers. Means for employing fault handlers includes employing a diagnoser fault handler or a tester fault handler. Means for employing fault handler includes obtaining an ordered list of fault handlers for a specified transition state of the fault object.
  • Means for obtaining the ordered list includes employing a diagnoser fault handler registered for the type of the analyzed object.
  • the diagnoser fault handler transitions fault object between processing states.
  • the present system and method provide a generic, open framework that implements a fault diagnosis engine for controlling the entire process, a fault object factory for creating fault object, a fault repository for receiving and storing fault objects, and fault handlers used for performing fault correlation and root cause analysis.
  • the fault management and diagnosis system may be used for diagnosing faults in any system or device (for example, a mechanical or electronic device, a communications network, a material transfer network, a shipping network) .
  • the fault diagnosis engine receives detected fault information from multiple sources, controls the fault management, and executes a root cause analysis.
  • the fault diagnosis engine also provides a mechanism for fault correlation and fault impact assessment. In communications networks, the impact assessment is applicable to both disruptions in services (or applications that depend on the network infrastructure) and to reduction of network performance due to the fault .
  • the fault management and diagnosis system uses a fault object factory that creates fault records, called fault objects that store some or all information pertaining to a single network problem. Each fault has a processing state, which guides the fault through its life cycle.
  • the fault management and diagnosis system uses fault handlers that are specifically designed to be triggered upon changes in the state of a given type of fault . The fault handlers perform various aspects of the automated fault management process described below.
  • the present system creates a fault hierarchy or tree as a result of diagnosis of a single detected problem in a managed system and this facilitates root cause isolation.
  • the fault tree facilitates a log of the entire diagnosis process for the analyzed fault, and inferred impact calculation based on the association of faults in the tree.
  • the fault tree also facilitates fault resolution and re-evaluation because the conditions tested during the original diagnosis of a problem are recorded in the tree, and the ability to control the processing of faults based on fault state transition.
  • Fig. 1 shows diagrammatically several network management modules connectable to a communications network.
  • Figs . 2 and 2A are block diagrams of a fault management and diagnosis process.
  • Fig. 3 is a block diagram of modules employed in a fault management and diagnosis system.
  • Figs. 3A and 3C are block diagrams of objects employed in the fault management and diagnosis system of Fig. 3.
  • Fig. 3B is a block diagram of a fault repository module employed in the fault management and diagnosis system of Fig. 3.
  • Fig. 4 is a flow diagram that illustrates a triggering mechanism for fault handlers by a fault diagnosis engine shown in Fig. 3.
  • Figs. 5 and 5A are block diagrams depicting processing states of a fault during fault analysis.
  • Figs. 6, 6A, 6B, and 6C are block diagrams of a fault tree according to one preferred embodiment .
  • Figs. 7, 7A and 7B are block diagrams of a fault tree according to another preferred embodiment .
  • Figs. 8, 8A, 8B, 8C and 8D are block diagrams of a fault tree according to yet another preferred embodiment .
  • Fig. 9 illustrates a sample network analyzed by the fault diagnosis and management system.
  • Figs. 10, 10A and 10B are block diagrams of a fault tree created by the fault diagnosis and management system analyzing the sample network of Fig 9.
  • Fig. 1 shows diagrammatically a network management system 10 including a fault diagnosis system 12, a topology mapper 14, an impact analyzer 16 and a help desk system 18.
  • the network management system communicates with a communications network 20 (or application service) .
  • the network includes a set of interconnected network elements such as routers, bridges, switches, and repeaters. These network elements provide transportation of data between end stations.
  • computers known as servers that provide services such as e-mail, accounting software, sales tools, etc.
  • data is transmitted electronically or optically, and network elements can forward data in packets, frames or cells to the intended destination.
  • Servers include network adapters and/or software that interpret the electronic or optical data packet into the data elements and pass these elements to the appropriate application being hosted.
  • the network management system 10 includes a commercially available processor (for example, Pentium microprocessor manufactured by Intel Corporation) executing an operating system providing an operating environment for a network management program.
  • the processor and the operating system provide a computer platform for which application programs are written in higher level programming languages .
  • the computer interfaces with permanent data storage, such as a magnetic or optical disk drive, a disk array, non-volatile RAM disk, or a storage area network, which maintain data files such as user configurations and policies.
  • permanent data storage such as a magnetic or optical disk drive, a disk array, non-volatile RAM disk, or a storage area network, which maintain data files such as user configurations and policies.
  • the network management program may be configured as a generic software application residing in any commercially available computing platform.
  • fault diagnosis system 12, topology mapper 14, and help desk system 18 are software applications written in Java and running on any computer with a Java Runtime Environment (JRE) .
  • JRE Java Runtime Environment
  • fault diagnosis system 12, topology mapper 14, and help desk system 18 are developed in any object oriented or structured programming language, and compiled for execution on any one or many computer platforms, or could be implemented on a neural network computing device.
  • the computer has a network adaptor that provides communication (preferably, but not necessarily, IP) to the users on the network.
  • the fault diagnosis engine application may share a host with help desk system 18, and/or the topology mapper, or each can run on a separate host, in which case they communicate using a network adaptor.
  • Topology mapper 14 determines the network topology and creates a model.
  • the permanent data storage holds data files that describe the current network topology, and configuration files that control the performance of topology mapper 14.
  • a user is an end station, interfaced to access the network or services, used by a person who is using the network, or is using services provided by the network.
  • the network management system 10 performs a fault management process 30 shown in Fig. 2.
  • the entire process is part of a phased, componentized, but interconnected method, wherein all aspects of fault management are performed.
  • the fault management process of Fig. 2 includes the following seven phases: fault detection 32, diagnosis 40, impact analysis 50, prioritization 60 presentation 70, recourse 80, and resolution 90.
  • Fault detection process 32 (performed by fault detectors 130 shown in Fig. 3) is the most basic part of the fault management system. Fault detectors 130 detect raw fault data. Fault detectors 130 receive information by SNMP polling, SNMP trap handling, performance monitoring, historical trend analysis, device configuration monitoring, application and system-level management tools, and help desk trouble tickets. Fault detection process 32 can also add information to the raw fault data enabling improved diagnosis of the fault. The fault data are assembled into fault objects. Fault diagnosis 40 occurs after a "detected" fault is entered into a fault detection and management system 100, which is a generic system for diagnosing a fault in any a mechanical, electrical or other system. A fault detection and management system 100 (Fig.
  • Fault detection system 100 finds one or more "root cause” faults and isolates these faults. Furthermore, the system can optionally suppress other symptomatic faults that were "caused” hy the root cause fault.
  • Fault diagnosis 40 can be performed in a single step or can involve many techniques such as examining device neighbor knowledge, tracing the route of management data, examining route tables and ACLs, etc.
  • Fault impact analysis 50 determines the "scope" of the analyzed fault. After receiving a root cause fault determined, by fault diagnosis 40, impact analysis 50 determines the consequences of this fault. This determination includes analyzing the network services affected by the fault, the users affected by the fault, and any other ramifications the fault has on network 20, or the application being managed. Furthermore, impact analysis 50 may involve analyzing various logical layers that exist in a communication network and correlating a fault with its possible consequences at each layer. Impact analysis 50 may use a fault causality tree located in a fault repository 140 (Fig. 3) . The interpretation schemes include analyzing how a network fault affects services like web servers or e-mail, examining how a misconfigured router running OSPF affects the users in each area, etc.
  • the network management system may also perform fault prioritization 60. After a fault has been diagnosed and its impact analyzed, the fault may be prioritized. Fault prioritization 60 assigns a priority/severity to each fault object and this is used to determine the proper presentation of the fault to a user. Fault prioritization process 60 may include multiple methods based on the type and scope of the fault such as examination of service level agreements and how the fault violates them, mission critical device analysis, and fault scope.
  • the network management system may also perform fault presentation 70.
  • Fault presentation 70 provides the mechanism by which the system alerts a user that a fault has occurred.
  • Fault presentation process 70 presents all information about the fault in a user friendly manner.
  • Fault presentation 70 may include steps and processes the systems used to diagnose the fault, thus allowing a user to verify the diagnosis and "trust" the system to accurately diagnose faults.
  • Fault presentation 70 may also include a network monitoring alarm system.
  • the network management system may also include fault recourse 80.
  • Fault recourse 80 provides a way in which a user can change the network management based on a given fault. For example, fault recourse 80 may involve reducing or stopping polling of devices downstream from a fault, reconfiguring connectivity modeling, script invocation to fix a misconfigured static route, or configuring user groups for a different email server.
  • the network management system may also include fault resolution 90.
  • problem resolution 90 After presenting a fault to a user and fixing the problem, problem resolution 90 records the process for future fault detection and diagnosis.
  • Fault resolution 90 can automatically trigger for any single resolved fault a re-evaluation of associated faults in the system. This re-evaluation proactively assesses the full scope of a resolved fault. If an associated fault is still not resolved, diagnosis can be re-started to determine the cause. This process is facilitated by the use of the fault causality tree created as a result of fault diagnosis process 40.
  • Fig. 2A shows diagrammatically in detail fault diagnosis process 40.
  • a detected- fault enters the fault detection and management system and a fault object is created (step 42) .
  • the fault diagnosis engine (101 in Fig. 3) triggers appropriate fault handlers (step 43) .
  • a diagnoser fault handler generates possible faults that may be causes of the previously entered fault (step 44) .
  • fault diagnosis engine 101 triggers appropriate tester fault handlers (step 45) .
  • Each tester fault handler performs vendor- specific and domain-specific tests to determine the existence of one or several possible faults.
  • the tester fault handler records test results (step 46) . If possible additional faults exist, the fault diagnosis engine continues to trigger tester fault handlers and diagnoser fault handlers (step 49) .
  • FIG. 3 illustrates diagrammatically a fault detection and management system 100.
  • fault detection and management system 100 includes five main parts: a fault diagnosis engine 101, a fault object factory 110, fault detectors 130, a fault repository 140, and fault handlers 150.
  • Fault detection and management system 100 has the ability to receive detected fault information from multiple sources, control the management of the faults, and produce a root cause analysis.
  • the system also provides a mechanism for performing fault correlation and impact analysis.
  • the impact assessment is not limited to the impact of the communications network, but may include disruptions in services or applications that depend on the network infrastructure.
  • Fault object factory 110 receives data from fault detectors 130 and creates fault objects 112 shown in Fig. 3A.
  • Each fault object 112 is associated with a fault type and there may be many fault types. Furthermore, each instance is a separate occurrence of a problem, potential problem, or condition of a communication network or an element located in the communication network (such as a misconfiguration, a degradation of service, physical failure or other) .
  • fault object 112 is information about a detected fault, that is, includes a description of the problem or condition stored in field 114, time and date of the reported problem 116, a fault processing state 118, and one or more test result objects 120.
  • the fault structure includes a context that is a mechanism for sharing varying amounts of data related to the fault; these amounts may exist between each instantiation of a type of fault.
  • fault detector 130 detects a problem or potential problem on an entity in a managed system.
  • Fault detector 130 provides a record of the condition to fault object factory 110, which generates fault object 112.
  • Fault detector 130 can monitor an entity or receive unsolicited notification from an entity when a problem occurs, according to different methods known in the art.
  • Fault detector 130 may perform a test and may provide to fault object factory 110 data with the results of the performed tests.
  • Fault detector 130 may share a host with fault diagnosis engine 101, or may reside externally as an agent .
  • fault repository 140 is the component used by a fault detection and management system 100 to store and access fault information, fault repository 140 stores every fault object 112 present in the system. Each component of the system (detection, diagnosis, etc.) can enter new fault objects into fault repository 140 and access any fault object 112.
  • fault repository 140 includes a table structure with services capable of searching and locating existing faults.
  • Fault repository 140 also includes fault associations 142, which provides a mechanism for relating faults to one another.
  • each defined fault association relates two fault objects. One fault object is on the left side of the association, and the other fault object is on the right side as shown for fault trees below.
  • the semantics of an association are defined by the type of the association.
  • New fault association types can be defined and added to the system, preferably using Interface Description Language (IDL) definitions of an interface for a service that uses the Common Object Request Broker Architecture (CORBA) transport protocol.
  • IDL Interface Description Language
  • CORBA Common Object Request Broker Architecture
  • each fault handler 150 performs a designated type of work as a result of a fault object entering a certain processing state (shown in Fig. 5) .
  • Fault handlers 150 may exist internal to the system, or reside externally in a separate process. Fault handlers 150 are registered for a particular fault type and state and, as part of the registration process, each fault handler 150 has an integer priority value. Then, fault handlers 150 are sorted by their priority values so that a fault handler with the lowest priority value is triggered first and subsequent handlers are triggered in sequence, as described below.
  • One type of fault handler 150 can test a fault object and create a test result record. Furthermore, fault handler 150 may create additional types of fault objects, create associations between fault objects, correlate fault objects that indicate a similar problem, or perform impact analysis on a fault object to determine the scope of a problem.
  • a tester fault handler 152 performs a selected test on a fault.
  • a diagnoser fault handler 154 creates additional types of fault objects.
  • Fault diagnosis engine 101 is the central component of fault detection and management system 100 since it drives the management and diagnosis of faults.
  • Fault diagnosis engine 101 provides a generic mechanism for fault handlers 150 to register for changes in the processing state of faults of a given fault type.
  • Fault diagnosis engine 101 may employ any mechanism to specify registrations.
  • the preferred implementation of fault diagnosis engine 101 uses XML (Extensible Markup Language) technology.
  • Fault diagnosis engine 101 can trigger one of fault handlers 150 arbitrarily or may use some ordering mechanism.
  • fault diagnosis engine 101 uses a priority mechanism to order the triggering of fault handlers that are sorted by their priority value (by triggering first a fault handler with the lowest value) .
  • Fault detection and management system 100 uses fault processing states for analyzing faults.
  • a fault's processing state represents its status in the fault management process and provides a mechanism to control the management of the fault .
  • a fault can have a large number of possible states, and a fault can transition from state to state using different ways, as shown in Figs. 5 and 5A.
  • the system utilizes a fault type hierarchy in which generic base fault types are defined and from which, new more specific fault types can be derived. Each fault, which exists in the system, is of some pre-defined fault type.
  • a test result object 120 includes a record of test results that were performed to determine the existence of the problem or condition for which the fault was created.
  • Test result object 120 includes a textual description of the test (field 122) , data identifying from the target of the fault (field 123) , test data (field 124) , any thresholds and parameters used in determining the test result (field 125) .
  • Test result record 125 also contains a state representing the status of the test.
  • a fault handler While performing its work on a fault object, a fault handler may cause the processing state of the fault to be changed. In this case, no other handlers for the current state are triggered.
  • Fault diagnosis engine 101 obtains the handlers for the new state and resumes triggering with the new handlers when the current handler completes its work.
  • Fig. 4 illustrates the triggering mechanism using a flow diagram. Fault diagnosis engine 101 provides a triggering mechanism and controls and manages the diagnosis process .
  • fault diagnosis engine 101 utilizes processing states of a fault to control the flow of diagnosis for that fault.
  • fault handlers 150 are triggered for a fault based on the current processing state.
  • the transition diagram of Fig. 5 defines the following processing states: An initial state 180 begins the life-cycle of a fault object.
  • a detected state 182 indicates that an external fault detector 130 or an internal handler 150 positively determined the condition (that the fault represents) as a problem.
  • a testing state 184 indicates the fault is unverified; that is, the condition that the fault represents requires testing to determine if it is a problem.
  • a completed state 184 indicates that fault diagnosis has completed for the fault.
  • Fault diagnosis engine 101 may allow fault handlers 150 to directly transition a fault between states, wherein preferably the processing state is hidden from fault handlers 150.
  • the engine transitions a fault's processing state based on the state of the current result of the fault as provided by the handlers.
  • Fig. 5A illustrates transition of the processing states (shown in Fig. 5) based on test results of an analyzed fault.
  • fault diagnosis engine 101 triggers tester fault handler 152 (Fig. 3) for testing state 184 and fault handler diagnoser 154 for detected state 182.
  • fault handler diagnoser 154 may also be triggered for testing state 184 if there are no tester fault handlers that can perform a direct test .
  • There may also be fault handlers for completed state 184, which would not perform diagnosis, but would perform other tasks such as correlating faults that share a common root cause (described below) or notifying a presentation system to display the diagnosis results when performing presentation process 70.
  • Fault diagnosis engine 101 may employ further rules that govern the triggering of fault handlers when there are multiple handlers (or types of handlers) for a particular processing state. If there are multiple types of handlers, the engine may impose an ordering such that all handlers of one type are triggered before any handlers of another type .
  • the engine may suppress remaining handlers of that type from being triggered and/or may suppress handlers of other types.
  • fault diagnosis engine 101 since there may be both tester fault handlers 152 and diagnoser fault handlers 154 registered for testing state 184, fault diagnosis engine 101 imposes a rule that all tester fault handlers are triggered before any diagnoser fault handler. This is because a tester fault handler can directly determine the existence or nonexistence of a problem, but a diagnoser fault handler cannot.
  • fault diagnosis engine 101 suppresses remaining handlers for the current processing state.
  • a concrete result is one whose state is either PROBLEM or NO_PROBLEM.
  • a result state of UNKNOWN is not concrete, that is a result could not be positively determined, as shown in Fig. 5A.
  • Fault detection and management system 100 utilizes a decomposition approach in the diagnosis of a fault to determine the root cause.
  • Fault detector 130 enters a problem or potential problem into fault object factory 110, which creates a fault object treated as a symptom fault.
  • the symptomatic fault is decomposed into one or more constituent faults that further refine the symptom as shown in Fig. 6.
  • Each constituent fault represents a possible suspect that may be causing the symptom.
  • tests may be performed to determine the existence of a problem or the fault may be decomposed into further suspects. The process continues until all faults have been completely decomposed and there are no more suspects .
  • the end result of this process is a hierarchy of faults in the form of a tree with the original symptomatic fault at the root as shown in Fig. 6.
  • the fault tree includes a root fault level, one or several intermediate fault levels, and a leaf fault level.
  • Each fault in the tree, except the root has at least one parent fault from which it was decomposed.
  • Each fault also has zero or more child faults that were spawned from it.
  • a child fault represents a possible cause of its parent.
  • a fault that has children but is not the root is termed an intermediate fault .
  • a fault that has no children, that is one that could not be further decomposed, is termed a leaf fault .
  • a leaf fault that indicates a problem is a probable cause of the root symptom. There may be more than one root cause .
  • fault A is the original root symptom.
  • Fault A is decomposed into faults B and C
  • fault B is decomposed into faults D and E
  • fault C is decomposed into faults F and G.
  • Faults B and C are intermediate faults because they have children but are not the root.
  • Faults D, E, F, and G are all leaf faults.
  • Fault tree 200 enables fault detection and management system 100 to locate one or several root causes of any fault in the tree by traversing the children of that fault and compiling the leaf fault (s) that indicate a problem. Fault tree 200 as a whole also embeds the entire diagnosis process. By traversing the entire sub-tree of any fault, one can compile a complete log of the steps taken and the results of tests performed to diagnosis the fault. Thus, a presentation process 70 can display the root cause (s) of a fault and/or can present a diagnosis log allowing an end user to verify the process.
  • fault diagnosis engine 101 manages the structure of fault tree 200.
  • Fault handlers 150 provide the contents and semantics of the tree. For each fault in fault tree 200, one or more fault handlers 150 are triggered. Fault handler 150 may perform a specific test on the fault and provide a result of the test to the engine or it may create one or more child faults to find a possible cause . Each new child fault creates a new branch in the fault tree .
  • a branch may be represented preferably by a fault association called MaybeCausedBy shown in Fig. 6.
  • Tester fault handler 152 performs a direct test and a diagnoser fault handler 154 spawns possible suspect faults. Other types of handlers may correlate similar faults or perform impact analysis.
  • Fault handler 150 could be both test fault handler 152, and diagnoser fault handler 154, which can perform a test, provide a result and also attempt to find the cause.
  • a handler is not both test fault handler 152 and diagnoser fault handler 154.
  • diagnoser fault handler 154 does not provide a direct result for a fault object, a composite result is computed from the results of the fault's children (shown, for example, in Fig. 6) .
  • Fault detection engine 101 or diagnoser fault handler 154 may compute the composite result according to rules provided below.
  • fault A is entered into the system by detector 130 as a problem. Also referring to Fig. 5A, the fault begins in initial state 180 and is transitioned to detected state 182. Diagnoser fault handler 154 creates two child faults, B and C. A MaybeCausedBy association is created between faults A-B and A-C, as shown in Fig. 6A.
  • the current result state for each fault is shown in the upper right corner of each fault box.
  • the result state for faults B and C is indicated by a question mark (?) because a result has not yet been computed. Since faults B and C are unverified, the engine transitions these faults to testing state 184. Diagnoser fault handler 154 creates for fault B new faults D and E, and creates for fault C new faults F and G.
  • fault diagnosis engine 101 triggers tester fault handlers 154 for faults D, E, F, and G and these testers assert results shown in Fig. 6B. Since results have been computed for faults D, E, F, and G, fault diagnosis engine 101 transitions these faults to the completed state 186 (Fig. 5A) .
  • fault diagnosis engine 101 computes a composite result for faults B and C according to the following default rules for composite result computation: 1. If any child fault result state is PROBLEM, then the parent fault's result state is PROBLEM. 2. If all child fault result states are NO_PROBLEM, then the parent fault's result is NO_PROBLEM. 3. Otherwise, the parent fault's result is UNKNOWN. Using the above rules, the composite result for fault B is NO_PROBLEM and the composite result for fault C is PROBLEM. Thus fault F is the cause of fault C. The system indicates this causality with another association called CausedBy as shown in Fig. 6C.
  • the system executed root cause analysis and determined the root cause for symptomatic fault A is fault F.
  • the diagnosis log for fault A shows that the conditions tested for faults D and E did not indicate a problem and that a result for fault G could not be determined, possibly because of the problem on fault F. If the resulting fault tree did not find a root problem, then the composite result for fault A would indicate NO_PR0BLEM. Such result would contradict the original assertion of a PROBLEM. In this case, the engine would throw out the composite result and leave the original PROBLEM result .
  • Such a problem may have been intermittent and resolved itself quickly, or the detector was faulty, or the diagnosis was incomplete, perhaps requiring additional testing and diagnosis.
  • multiple symptomatic faults may be caused by the same root problem. This may result in portions of multiple fault trees being identical, that is the diagnosis for multiple symptomatic faults would create the same faults with possibly the same results.
  • a and B shown in Fig. 7. Both faults enter the system at the same time and fault handlers for both faults A and B attempt to create same fault C.
  • the engine can handle this scenario in several different ways shown in Figs. 7 and 7A.
  • a simple implementation would create two copies of fault C, one for each fault tree .
  • Each fault tree would only be aware of its copy and, thus, each copy of fault C would be diagnosed separately. This is depicted in Fig. 7 with C being the copy.
  • the above approach may result in tests being performed for the same condition twice, which may not be desirable for performance reasons.
  • the system creates two copies of fault C but ""rates"' the results of test(s). For example, consider that fault C is created first and subsequently tested. A short time later fault C" is created. Instead of performing the same test again, the engine would use the test result from fault C for fault C" .
  • a drawback to this approach is that, depending on the semantics of the test, a significant amount of time may have passed such that the result computed for fault C may be invalid for fault C" , that is the result for C is now ""stale''.
  • the system may employ certain rules or heuristics to determine when and if a test result can be reused.
  • the system may only reuse the results from certain tests or may only reuse a result depending on its state. For example, using the test result states defined above in the preferred implementation, a NO_PROBLEM result may always be re-tested but a PROBLEM or UNKNOWN result may be reused regardless of the time elapsed.
  • the engine may also ""age"' test results.
  • Fig. 7A depicts another approach to handling identical fault tree portions or sub-trees is to share sub-trees amongst multiple symptomatic faults.
  • fault C is shared by faults A and B .
  • Fig. 7B illustrates a more complete example using the test result states defined above in the preferred implementation. In the diagram of Fig. 7B, faults A and F intersect at fault C and share its PROBLEM test result. The root cause of both A and F is fault D.
  • fault management and diagnosis system 100 enables resolution and possible re- evaluation of a previously detected problem.
  • the system reacts when a monitoring system detects that a problem has been resolved or no longer exists.
  • the system may remove faults and notify presentation 70 of the resolution. This process can be automated and/or require user intervention. If a user instructs the system that a fault has been resolved, the system could merely remove the fault or could choose to re-evaluate the condition represented by the fault and verify resolution.
  • the fault tree hierarchy can facilitate resolution and re-evaluation of faults.
  • the system provides a mechanism allowing an observer or detector to specify that a fault originally entered into the system as a problem has subsequently been resolved. Additionally, problems detected by internal handlers in the system may monitor the condition to detect resolution.
  • the engine When a fault is deemed resolved, the engine would re-test all the faults, if any, in the subtree of the resolved fault and propagate the new computed result ""up'' to its parent fault. The parent fault would then re-test and propagate its new result. This process continues until the entire tree has been re-evaluated. This may result in the entire tree being resolved or the isolation of a new cause for the root symptomatic fault if it is determined that the root symptom is still a problem even though the original root cause has been resolved.
  • the system diagnosed fault F as the root cause of symptomatic fault A. Assume the fault handler that tested fault F is monitoring the condition and, some time later, detects that the problem no longer exists. A new test result is asserted for fault F with a state of NO_PROBLEM that contradicts the original PROBLEM result shown in Fig. 6C. Fault diagnosis engine 101 then makes an ""inference'' on the parent fault of fault F with the new result state of fault F. An inference on a fault is not an assertion of a new result but a suggestion used to determine if the fault needs to be re-evaluated. If the inferred result state contradicts the current result state for the fault, the fault is re-evaluated.
  • the engine infers a result state of NO_PROBLEM on the parent fault of F, fault C. Since this inference contradicts the current result state, PROBLEM, fault C is re-evaluated.
  • Fault diagnosis engine 101 transitions the processing state of fault C from completed state 186 back to testing state 184 (shown in Fig. 5) .
  • Fault diagnosis engine 101 re-triggers diagnoser fault handler 154 for fault C (Fig. 8) , which in turn attempts to re-create fault F and fault G. However, since faults F and G already exist in the current tree, no new faults are created. The engine then infers NO_PROBLEM on faults F and G as shown in Fig. 8A. There is a contradiction for fault G, since its current result state is UNKNOWN, so it is transitioned back to testing state 184, but fault F remains in completed state 186 since no contradiction occurs and a new result was just asserted for it. Assume tester fault handler for fault G finds that G has been resolved and asserts the NO_PROBLEM result state. Diagnosis for fault G is complete so its processing state is changed to completed state 186. The composite result computed for fault C would now be NO_PROBLEM and the CausedBy association between C and F removed, as shown in Fig. 8A.
  • the new result state for fault C is now propagated to fault A, which causes A to transition back to testing state 184.
  • both child faults B and C are NO_PROBLEM
  • the composite result for fault A now becomes NO_PROBLEM and the causality association between faults A and C is removed, as shown in Fig. 8B .
  • the entire fault tree, shown in Fig. 8B was re- evaluated except for the sub-tree rooted at fault B, which was not re-evaluated because its original test result state was N0_PR0BLEM and no contradiction occurred (see Fig. 6C) . If the engine employs an aging factor for test results, as described above, then fault B could be re-evaluated if its result is deemed stale.
  • fault detection engine 101 re-evaluates fault results deemed stale. Specifically as shown in Fig. 8B, fault detection engine 101 re-evaluates fault B's sub-tree. Assume that fault E is re-tested and the result is NO PROBLEM, but fault D re-tests with a new result of PROBLEM. The composite result for fault B is now also PROBLEM and a causality association is created between faults B and D (Fig. 8C) . Fault C is also re-evaluated. Fault detection engine 101 generates a composite result for fault A according to the above rules. Referring to Fig. 8B, fault detection engine 101 re-evaluates fault B's sub-tree. Assume that fault E is re-tested and the result is NO PROBLEM, but fault D re-tests with a new result of PROBLEM. The composite result for fault B is now also PROBLEM and a causality association is created between faults B and D (Fig. 8C) . Fault
  • fault A is PROBLEM as determined in the fault tree of Fig. 6C, but now its root cause is fault D.
  • the above-described fault diagnosis and management process may be applied to any system. In the following example, the above-described fault diagnosis and management process is applied to diagnosing a fault that occurred in a communications network 210 shown in Fig. 9.
  • Communications network 210 includes a router Rl connecting a subnet 212 and a subnet 220, and includes a router R2 connecting a subnet 220 and a subnet 225.
  • Subnet 212 includes a bridge Bl, a workstation 214, and a server 216.
  • Subnet 220 includes a bridge B2 and a workstation 222
  • subnet 225 includes a bridge B3 and a HTTP server 228
  • Workstation 214 includes client agent with IP address 10.253.100.10.
  • the client agent is monitoring HTTP server 228 with IP address 10.253.102.15 by periodically requesting an HTTP web page.
  • the fault diagnosis and management process is running on workstation 222at 10.253.2.104.
  • a DNS server resides on machine 216 having IP address 10.253.100.1.
  • the client agent 214 tries to load an HTML page with the URL ""www.acme.com/index.html'' from HTTP server 228, but receives no response.
  • the client agent acting as fault detector 130, sends information about the failure to fault object factory 110.
  • Fault object factory 130 creates a fault object of type HTTPLostFault from the information provided and its processing state is set to the detected state 182 (Fig. 5) .
  • fault diagnosis engine compiles a list of fault handlers (step 172) registered for the
  • diagnoser fault handler 154 registered for the HTTPLost fault type is triggered. Diagnoser fault handler checks for two possible causes of the problem: a DNS service failure and an HTTP service failure. The DNS is checked because name resolution may be needed on the client side to determine the IP address of the HTTP server. Thus, the diagnoser creates two faults: one of type DNSServiceFailure fault 234 and the other of type HTTPServiceFailure fault 238, as shown in Fig. 10.
  • diagnoser fault handler 154 creates two faults: one of type DNSServerDown fault 235 and the other of type FullContactLost fault 236.
  • diagnoser fault handler 154 for the HTTPServiceFailure fault 238 creates two faults: one of type HTTPServerDown fault 239 and the other of type FullContactLost fault 240, as shown in Fig. 10.
  • tester fault handler 152 makes a query to agent running on HTTP server machine 228 at IP 10.253.102.15 to verify that the HTTP server process is running. Assume HTTP server 228 is running so the result state of the test is set to NO_PROBLEM.
  • DNSServerDown fault 235 makes a query to the agent on DNS server machine 216 at IP 10.253.100.1 to verify that the DNS server process is running. In this case, for example, no response is received from the agent on machine 216.
  • tester fault handler 152 asserts a test result with state UNKNOWN on DNSServerDown fault 235 because it could not be positively determined if the DNS service is available or not . The server process could be running but a network failure may be preventing access from the management station.
  • the FullContactLost fault tester handler 152 is also triggered for the other FullContactLost fault from source IP 10.253.2.104 to Destination IP 10.253.100.1, the DNS server 216. Assume the DNS server 216 is down, this ping request fails and no response is received.
  • Tester fault handler 152 asserts a result with state PROBLEM as shown, by 236P in Fig. 10A.
  • the composite result state for the HTTPServiceFailure fault 238NP is NO_PROBLEM
  • the composite result state for the DNSServiceFailure fault 234P is PROBLEM.
  • a CausedBy association is created between the DNSServiceFailure fault 234P and FullContactLost fault 236P.
  • a composite result state of PROBLEM is computed for the root HTTPLostFault, which agrees with the original PROBLEM assertion, and a CausedBy association is created between the HTTPLost fault 232P and the DNSServiceFailure fault 234P.
  • the root cause of the HTTP request failure is that the DNS server machine is down, preventing name resolution of the HTTP server machine.
  • Diagnoser fault handler 154 can be implemented for the FullContactLost fault to trace a path between the source and destination and create faults. Such a path dependent test tests the network devices and ports that the data traverses, at both Layer 2 and Layer 3, to further isolate a problem as is described in PCT application (docket No. A3- 03WO) entitled ""Systems and Methods for Diagnosing Faults in Computer Networks'' filed on 7 May 2001, which is incorporated by reference .
  • the FullContactLost faults 236 and 240 contain the client's IP address as the source instead of the management station's, as in the above example.
  • the tested path is from the client's perspective.
  • the HTTPLost fault 232 was detected by a software agent monitoring the HTTP server. Such a fault could also be injected into the fault diagnosis system via a Help Desk by a user experiencing a problem as described in the co-pending PCT application (docket no A3-05WO) entitled ""Help Desk Systems and Methods for use with Communications Networks'' filed on 7 May 2001, which is incorporated by reference .

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • General Engineering & Computer Science (AREA)
  • Quality & Reliability (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Computer Hardware Design (AREA)
  • Health & Medical Sciences (AREA)
  • Biomedical Technology (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

L'invention concerne un système (100) d'analyse de défaillances, pourvu d'un dispositif (110) de génération d'objets défaillants configuré pour recevoir des données de défaillances et créer un objet défaillant (112), et pourvu d'un moteur (101) de diagnostic des défaillances configuré pour effectuer une analyse en profondeur des causes de la défaillance de l'objet.
PCT/US2001/014557 2000-05-05 2001-05-07 Systemes et procedes de gestion et d'analyse des defaillances de reseaux informatiques WO2001086443A1 (fr)

Priority Applications (3)

Application Number Priority Date Filing Date Title
US10/258,907 US7500143B2 (en) 2000-05-05 2001-05-07 Systems and methods for managing and analyzing faults in computer networks
AU2001261208A AU2001261208A1 (en) 2000-05-05 2001-05-07 Systems and methods for managing and analysing faults in computer networks
US10/287,974 US7103807B2 (en) 2000-05-05 2002-11-05 Systems and methods for isolating faults in computer networks

Applications Claiming Priority (6)

Application Number Priority Date Filing Date Title
US20229900P 2000-05-05 2000-05-05
US20229800P 2000-05-05 2000-05-05
US20229600P 2000-05-05 2000-05-05
US60/202,299 2000-05-05
US60/202,298 2000-05-05
US60/202,296 2000-05-05

Related Parent Applications (1)

Application Number Title Priority Date Filing Date
PCT/US2001/014766 Continuation-In-Part WO2001086775A1 (fr) 2000-05-05 2001-05-07 Procedes et systemes de service de depannage utilises dans des reseaux de communications

Related Child Applications (2)

Application Number Title Priority Date Filing Date
PCT/US2001/014618 Continuation-In-Part WO2001086444A1 (fr) 2000-05-05 2001-05-07 Systemes et procedes permettant le diagnostic de pannes dans les reseaux informatiques
US10/287,974 Continuation-In-Part US7103807B2 (en) 2000-05-05 2002-11-05 Systems and methods for isolating faults in computer networks

Publications (1)

Publication Number Publication Date
WO2001086443A1 true WO2001086443A1 (fr) 2001-11-15

Family

ID=27394407

Family Applications (3)

Application Number Title Priority Date Filing Date
PCT/US2001/014557 WO2001086443A1 (fr) 2000-05-05 2001-05-07 Systemes et procedes de gestion et d'analyse des defaillances de reseaux informatiques
PCT/US2001/014767 WO2001086844A1 (fr) 2000-05-05 2001-05-07 Systemes et procedes de realisation de modeles topologiques multicouche de reseaux informatiques
PCT/US2001/014618 WO2001086444A1 (fr) 2000-05-05 2001-05-07 Systemes et procedes permettant le diagnostic de pannes dans les reseaux informatiques

Family Applications After (2)

Application Number Title Priority Date Filing Date
PCT/US2001/014767 WO2001086844A1 (fr) 2000-05-05 2001-05-07 Systemes et procedes de realisation de modeles topologiques multicouche de reseaux informatiques
PCT/US2001/014618 WO2001086444A1 (fr) 2000-05-05 2001-05-07 Systemes et procedes permettant le diagnostic de pannes dans les reseaux informatiques

Country Status (2)

Country Link
AU (3) AU2001257561A1 (fr)
WO (3) WO2001086443A1 (fr)

Cited By (15)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7043727B2 (en) 2001-06-08 2006-05-09 Micromuse Ltd. Method and system for efficient distribution of network event data
US7363368B2 (en) 2001-12-24 2008-04-22 International Business Machines Corporation System and method for transaction recording and playback
CN100388691C (zh) * 2004-03-19 2008-05-14 华为技术有限公司 一种自动定位故障的方法和系统
US7383191B1 (en) 2000-11-28 2008-06-03 International Business Machines Corporation Method and system for predicting causes of network service outages using time domain correlation
US7424530B2 (en) 2004-05-06 2008-09-09 International Business Machines Corporation Method for visualizing results of root cause analysis on transaction performance data
US7423979B2 (en) 2001-05-18 2008-09-09 International Business Machines Corporation Method and system for determining network characteristics using routing protocols
US7516208B1 (en) 2001-07-20 2009-04-07 International Business Machines Corporation Event database management method and system for network event reporting system
CN101924787A (zh) * 2009-04-30 2010-12-22 美国银行 自助服务终端远程诊断
US8738973B1 (en) 2009-04-30 2014-05-27 Bank Of America Corporation Analysis of self-service terminal operational data
CN108170566A (zh) * 2017-12-18 2018-06-15 新疆金风科技股份有限公司 产品故障信息处理方法、系统、设备和协同工作平台
CN108268365A (zh) * 2016-12-30 2018-07-10 腾讯科技（深圳）有限公司 异常任务注入方法、装置和系统
CN109981331A (zh) * 2017-12-28 2019-07-05 北京华为数字技术有限公司 一种故障诊断方法及装置
CN111630815A (zh) * 2018-02-15 2020-09-04 霍尼韦尔国际公司 用于使用流量传感器来检测冗余令牌总线控制网络上的网络问题的装置和方法
CN113608928A (zh) * 2021-08-11 2021-11-05 芯河半导体科技(无锡)有限公司 一种家庭网关故障自动诊断及恢复的系统设计与实现
CN113902288A (zh) * 2021-10-08 2022-01-07 北京京能能源技术研究有限责任公司 一种用于水资源调控与运营的管理系统及方法

Families Citing this family (12)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
AU2004220872A1 (en) * 2003-03-18 2004-09-30 Renesys Corporation Methods and systems for monitoring network routing
US9137033B2 (en) 2003-03-18 2015-09-15 Dynamic Network Services, Inc. Methods and systems for monitoring network routing
US9667552B2 (en) * 2003-09-26 2017-05-30 International Business Machines Corporation Real-time SLA impact analysis
US7469287B1 (en) * 2003-11-17 2008-12-23 Lockheed Martin Corporation Apparatus and method for monitoring objects in a network and automatically validating events relating to the objects
JP4688472B2 (ja) * 2004-11-01 2011-05-25 株式会社エヌ・ティ・ティ・ドコモ 端末制御装置及び端末制御方法
WO2008155440A1 (fr) * 2007-06-19 2008-12-24 Aito Technologies Oy Système et procédé apparenté pour l'obtention d'une assurance commerciale dans des réseaux de communication
US8521904B1 (en) 2008-12-16 2013-08-27 At&T Intellectual Property I, L.P. Devices, systems, and/or methods for determining internet topology
US8179801B2 (en) * 2009-06-09 2012-05-15 Cisco Technology, Inc. Routing-based proximity for communication networks
GB2477921A (en) * 2010-02-17 2011-08-24 Sidonis Ltd Analysing a network using a network model with simulated changes
US8831019B2 (en) 2012-05-18 2014-09-09 Renesys Path reconstruction and interconnection modeling (PRIM)
CN103560279B (zh) * 2013-11-21 2015-09-02 上海航天电源技术有限责任公司 基于can总线的电池管理系统诊断系统的诊断维护方法
CN104683170A (zh) * 2013-11-28 2015-06-03 北车大连电力牵引研发中心有限公司 车辆网络故障诊断系统

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5864662A (en) * 1996-06-28 1999-01-26 Mci Communication Corporation System and method for reported root cause analysis

Family Cites Families (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4827411A (en) * 1987-06-15 1989-05-02 International Business Machines Corporation Method of maintaining a topology database
US5734824A (en) * 1993-02-10 1998-03-31 Bay Networks, Inc. Apparatus and method for discovering a topology for local area networks connected via transparent bridges
JPH0779233A (ja) * 1993-06-29 1995-03-20 Synoptics Commun Inc トポロジを確定する装置及びトポロジ情報を通信する方法及び装置
US5850397A (en) * 1996-04-10 1998-12-15 Bay Networks, Inc. Method for determining the topology of a mixed-media network

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5864662A (en) * 1996-06-28 1999-01-26 Mci Communication Corporation System and method for reported root cause analysis

Cited By (18)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7383191B1 (en) 2000-11-28 2008-06-03 International Business Machines Corporation Method and system for predicting causes of network service outages using time domain correlation
US7423979B2 (en) 2001-05-18 2008-09-09 International Business Machines Corporation Method and system for determining network characteristics using routing protocols
US7043727B2 (en) 2001-06-08 2006-05-09 Micromuse Ltd. Method and system for efficient distribution of network event data
US7516208B1 (en) 2001-07-20 2009-04-07 International Business Machines Corporation Event database management method and system for network event reporting system
US7363368B2 (en) 2001-12-24 2008-04-22 International Business Machines Corporation System and method for transaction recording and playback
CN100388691C (zh) * 2004-03-19 2008-05-14 华为技术有限公司 一种自动定位故障的方法和系统
US7424530B2 (en) 2004-05-06 2008-09-09 International Business Machines Corporation Method for visualizing results of root cause analysis on transaction performance data
CN101924787B (zh) * 2009-04-30 2014-04-09 美国银行 确定多个操作错误中每个根本原因的设备、方法及服务器
CN101924787A (zh) * 2009-04-30 2010-12-22 美国银行 自助服务终端远程诊断
US8738973B1 (en) 2009-04-30 2014-05-27 Bank Of America Corporation Analysis of self-service terminal operational data
CN108268365A (zh) * 2016-12-30 2018-07-10 腾讯科技（深圳）有限公司 异常任务注入方法、装置和系统
CN108170566A (zh) * 2017-12-18 2018-06-15 新疆金风科技股份有限公司 产品故障信息处理方法、系统、设备和协同工作平台
CN109981331A (zh) * 2017-12-28 2019-07-05 北京华为数字技术有限公司 一种故障诊断方法及装置
CN111630815A (zh) * 2018-02-15 2020-09-04 霍尼韦尔国际公司 用于使用流量传感器来检测冗余令牌总线控制网络上的网络问题的装置和方法
CN111630815B (zh) * 2018-02-15 2022-03-11 霍尼韦尔国际公司 用于使用流量传感器来检测冗余令牌总线控制网络上的网络问题的装置和方法
CN113608928A (zh) * 2021-08-11 2021-11-05 芯河半导体科技(无锡)有限公司 一种家庭网关故障自动诊断及恢复的系统设计与实现
CN113608928B (zh) * 2021-08-11 2024-01-19 芯河半导体科技(无锡)有限公司 一种家庭网关故障自动诊断及恢复的系统设计与实现
CN113902288A (zh) * 2021-10-08 2022-01-07 北京京能能源技术研究有限责任公司 一种用于水资源调控与运营的管理系统及方法

Also Published As

Publication number Publication date
AU2001257561A1 (en) 2001-11-20
AU2001262986A1 (en) 2001-11-20
WO2001086844A1 (fr) 2001-11-15
AU2001261208A1 (en) 2001-11-20
WO2001086444A1 (fr) 2001-11-15

Similar Documents

Publication Publication Date Title
US7500143B2 (en) Systems and methods for managing and analyzing faults in computer networks
US7237138B2 (en) Systems and methods for diagnosing faults in computer networks
US7281170B2 (en) Help desk systems and methods for use with communications networks
WO2001086443A1 (fr) Systemes et procedes de gestion et d'analyse des defaillances de reseaux informatiques
US7752024B2 (en) Systems and methods for constructing multi-layer topological models of computer networks
US7103807B2 (en) Systems and methods for isolating faults in computer networks
US6182136B1 (en) Automated service elements discovery using core service specific discovery templates
US6286047B1 (en) Method and system for automatic discovery of network services
EP3975478B1 (fr) Diagnostic de systèmes de réseau fondé sur des hypothèses
Harrington Guidelines for Considering Operations and Management of New Protocols and Protocol Extensions
JP2002508555A (ja) 複合ネットワークの動的モデリングおよびその中での障害の影響の予測
CN112956158B (zh) 结构数据平面监视
Feamster et al. Verifying the correctness of wide-area Internet routing
Cisco Internetwork Management
Cisco Internetwork Management
Cisco Internetwork Management
Cisco Internetwork Management
Vanbever et al. Towards validated network configurations with NCGuard
Narain et al. Building autonomic systems via configuration
Sugawara et al. A multi-agent monitoring and diagnostic system for TCP/IP-based network and its coordination
Schuster et al. Modeling Low-Level Network Configurations for Analysis, Simulation and Testing
Sánchez Vílchez et al. Self‐modeling based diagnosis of network services over programmable networks
Kompella Fault localization in backbone networks
Hou et al. A hierarchical methodology to improve channel routing by pin permutation
Duarte Jr Fault Tolerant Network Monitoring

Legal Events

Date Code Title Description
AK Designated states

Kind code of ref document: A1

Designated state(s): AU CA US

AL Designated countries for regional patents

Kind code of ref document: A1

Designated state(s): AT BE CH CY DE DK ES FI FR GB GR IE IT LU MC NL PT SE TR

121 Ep: the epo has been informed by wipo that ep was designated in this application
DFPE Request for preliminary examination filed prior to expiration of 19th month from priority date (pct application filed before 20040101)
WWE Wipo information: entry into national phase

Ref document number: 10258907

Country of ref document: US

122 Ep: pct application non-entry in european phase