In this presentation, we propose the Simple Network Management Knowledge (SNMK). It is an approach towards network management knowledge representation, exchanging, and sharing. We will illustrate the concept of SNMK, provide a formal syntax to define it, and present a system architecture which incorporates SNMK with current network management standards. We also discuss the motivations for proposing it, relative advantages of using it, and its feasible applications.

The simple network management protocol (SNMP) is currently the dominant network management standard for the TCP/IP networking environment. Fundamental to SNMP is the management information base (MIB). The heart of SNMP is the protocol. In this paper, we propose an approach to formalize our understanding of SNMP. We prove that MIB with lexicographic order is a well-founded set. We also provide formal semantics for protocol operations by derivation.

This paper describes the performance of a store-store-and-forward communications network with an adaptive routing strategy. The network chosen is a simplification of the AUTODIN network (described below) and the strategy is a modification of the routing of ARPANET. The objective is to make a network such as AUTODIN, with its wide variation in message length, effectively responsive for computercomputer and terminal-computer messages as well as record traffic. A second objective is to increase survivability following isolated equipment failures. A simulation study is used to show that improved performance is achieved.

This paper presents a single-moment method for determining the node-to-node grades of service of a circuit-switched communication network employing a routing strategy called "originating-office control with spill-forward." An example of such a network is the European AUTOVON. The new method makes use of the concept of "path-loss sequence" and the techniques in system reliability analysis to determine the probability of each route being used to complete a call. Results from a digital computer implementation of the method and comparisons with other methods are discussed.

A new design method designs nonrecursive digital filters directly from maximum and minimum frequency response constraints. The method will find the minimal length filter required to meet the constraints, or design a filter of any longer length desired. This latter option is helpful when there are constraints on monotonicity in certain bands or when finite word length must be considered. When the frequency response constraints are equal to the deviation of an optimal filter, the optimal filter is designed. If the constraints are loosened, a choice of many filter designs is available.

This study is concerned with the problem of monitoring the performance of communication links, as indicated by bit error rate, with the objective of detecting as rapidly as possible failures or extreme degradation caused by any source. The monitoring method is based on the use of an artificial threshold for the decision variable and the generation of a measurable "pseudoerror." The study relates pseudoerror probability to true-error probability for two models-one using an analytical-numerical approach and the other using a Monte Carlo simulation. Variation of the parameters in the models adequately approximates the first-order effects of many types of link failure. The results indicate that a monitor indication based on pseudoerror is feasible and has many desirable properties.