Passive testing and applications to network management

  title={Passive testing and applications to network management},
  author={David Lee and Arun N. Netravali and Krishan K. Sabnani and Binay Sugla and Ajita John},
  journal={Proceedings 1997 International Conference on Network Protocols},
  • David Lee, A. Netravali, A. John
  • Published 28 October 1997
  • Computer Science
  • Proceedings 1997 International Conference on Network Protocols
An important aspect of network management is fault management-determining, locating, isolating and correcting faults in the network. The paper deals with the algorithms for detecting faults, i.e., behavior of the network different from specifications. It is important for communication networks to detect faults "in-process" i.e., while the network is in its normal operation. Thus, we detect faults by examining the input-output behavior without forcing the system to specialized inputs explicitly… 
On fault location in networks by passive testing
  • R.E. Miller, K. A. Arisha
  • Computer Science
    Conference Proceedings of the 2000 IEEE International Performance, Computing, and Communications Conference (Cat. No.00CH37086)
  • 2000
A variant of the communicating finite state machine (CFSM) model for networks to investigate fault detection and location using passive testing is employed, and a multiple node-cut approach for a general network is proposed.
Fault management using passive testing for mobile IPv6 networks
This paper introduces the CFSM model, the observer model and the fault model with necessary assumptions, and introduces the fault detection algorithm using passive testing, and presents a new passive testing approach for fault location, fault identification, and fault coverage based on the C FSM model.
A formal approach for passive testing of protocol data portions
This work studies passive testing of data portions of network protocols and presents two algorithms, using an event-driven extended finite state machine model.
Network Monitoring with Real-Time Properties: A Step Forward
This paper represents timing information in the form of time-intervals between successive occurrence of events (i.e., packets/messages exchanged among peers) in a network system with real-time properties.
Passive Testing - A Constrained Invariant Checking Approach
This paper proposes algorithms for checking the correctness of given invariants on the specification and extracting the required constraints on the variables (data portion) and shows the applicability of the algorithm on a case study: the simple connection protocol.
A discrete event systems approach to network fault management: detection and diagnosis of faults
This approach provides a systematic way of performing fault diagnosis for network fault management and allows the utilization of discrete event system analysis for the detection and diagnosis of faults.
Network Protocol System Passive Testing for Fault Management: A Backward Checking Approach
A backward checking method is proposed that analyzes in a backward fashion the input/output trace from passive testing and its past and effectively checks both the control and data portion of a protocol system.
What packets may come: automata for network monitoring
The problem of external monitoring as a language recognition problem is formulated, and a series of properties of device specifications or protocols that can be exploited to construct language recognizers at the monitor are described.
Passive mid-stream monitoring of real-time properties
The approach is implemented using the real-time model checker UPPAAL, and its application to passively test fault tolerance software in a telecommunications switch developed at Lucent Technologies is reported on.
Network protocol system monitoring: a formal approach with passive testing
After describing a formal model of event-driven extended finite state machines, two algorithms for passive testing of protocol system control and data portions are presented.


Principles and methods of testing finite state machines-a survey
The fundamental problems in testing finite state machines and techniques for solving these problems are reviewed, tracing progress in the area from its inception to the present and the stare of the art is traced.
Reverse-engineering of communication protocols
The authors study the problem of locating the differences between a protocol specification and its implementation. They give an exact procedure for solving this problem. If there is only one
Optimization problems from feature testing of communication protocols
  • David Lee, M. Yannakakis
  • Computer Science
    Proceedings of 1996 International Conference on Network Protocols (ICNP-96)
  • 1996
This work model the protocols by extended finite state machines and reduce the test generation process to optimization problems on graphs, and reports experimental results on real systems, including Personal HandyPhone System, a 5ESS based ISDN wireless system, and 5ESS Intelligent Network Application Protocol.
Signaling System No.7: a tutorial
A tutorial overview of the salient features of SS7 is provided and the SS7 network services part (NSP), which corresponds to the first three layers of the Open Systems Interconnection (OSI) Reference Model, is described.
On Communicating Finite-State Machines
A model of commumcations protocols based on finite-state machines is investigated and it is determined to what extent the problem is solvable, and one approach to solving it is described.
Fault coverage of protocol test methods
  • D. Sidhu, Ting-Kau Leung
  • Computer Science
    IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?
  • 1988
This study shows that a test sequence produced by T-method has a poor fault detection capability whereas test sequences produced by U-, D- and W-methods have fault coverage comparable to each other and superior to that for T- method on several classes of randomly generated machines used.
Multiple fault diagnosis for finite state machines
A generalized diagnostic algorithm that guarantees the correct diagnosis of certain configurations of faults (output and/or transfer) in an implementation, which are characterized by a certain type of independence of the different faults.
Testing Finite State Machines: Fault Detection
Simple randomized algorithms for the fault detection problem: Given a specification in the form of a deterministic finite state machine A and an implementation machine B, determine whether B is equal to A in randomized polynomial time.