Showing papers on "Network topology published in 1976"

An Efficient Algorithm for Deducing the Minimal Cuts and Reliability Indices of a General Network Configuration

Abstract: The paper describes an efficient algorithm for evaluating the minimal cut sets of any general network. The algorithm is based on Boolean algebra and set theory, and contains many important improvements. The four most important features are 1. only one set of topological input data is required to evaluate the minimal cuts and reliability indices of every output node; 2. a mix of undirectional, bidirectional and multi ended components can be included very simply; 3. any number of input nodes may be specified; 4. a new concept of overall system reliability permits different, large, and complex systems to be compared. The computational efficiency of the algorithm is clearly indicated by the fact that the time required to analyse Example 1 on a CDC7600 was 0.7 sec. The storage required with the appropriate arrays dimensioned for a system having 100 components and up to 125 minimal cut sets per output node is 15 k-words. These times and storage include the overall system reliability analysis.

Synthesis of Available Networks

Abstract: In order to design an available network efficiently, a parameter characterizing the network availability is needed. The global availability is suggested and algorithms are given for its exact or approximate evaluation. The design of minimum cost networks with a given availability is discussed for different models of the cost-availability function in the links. Some example network optimizations are reported.

On reliable topologies for computer networks

Abstract: A computer communiation network is topologically described as a linear graph. Network topologies are characterized by their associated reliability (invulnerability), overall link capacity (bandwidth) and maximal average message terminal delay. The corresponding graph theoretical parameters are the connectivity, number of lines and diameter of the underlying graph. For store-and-forward computer networks, k-connected topologies yielding the minimal delay-capacity product values are presented. Such structures are noted to have a node of very high degree (i.e., connected to many other nodes). Subsequently, we consider k-connected networks with regular nodes (of low degree) containing also a set of “advanced” (“central”) nodes (of higher, though appropriately bounded) degree. Corresponding extremal k-connected topologies which guarantee every regular node to be within a prescribed distance from the center (being the set of central nodes), and to include a minimal center size, are derived. The optimal radius values for such network structures, to yield a minimal delay-capacity product value, are also noted.

Remreed switching networks for No. 1 and No. 1A ESS: Remreed network electronic control

Abstract: The new remreed network was designed to reduce the cost and the size of the No. 1 ess network. It uses a new self-latching sealed contact and a new switch-package design. This new package includes components directly related to the control of the switch. Remreed network control, the subject of this paper, is all electronic. It uses a mixture of silicon integrated circuits and discrete circuits to accomplish its control functions. The network topology and modularity has not been changed. The design was undertaken with the goal of complete compatibility with all existing system programs, including fault-recognition and diagnostic programs. This has permitted the addition of remreed networks to existing No. 1 ess offices with no program changes or modification of ferreed networks. The resulting remreed-ferreed mix is operated and maintained by the same software. The new network offers reduced manufacturing costs, simplified installation, improved reliability and maintainability, and a 3:1 to 4:1 space reduction.

Research in Functionally Distributed Computer Systems Development. Volume XVI. A Minicomputer Based Distributed Data Base System.

Abstract: : This paper describes a data base management system under development at Kansas State University, intended for use in a network composed primarily of minicomputers The report presents a description of the computers forming the network and their intercomputer communication system The data base management system is a network type as specified by CODASYL An extension of a CODASYL-type DBMS to multicomputer configurations is presented and several DBMS network topologies are discussed We then conclude with a discussion of a completely distributed data base network (Author)

On the Exchange of Messages Between Processes

Abstract: In this paper a message exchange protocol is defined which is currently under design for the AMOS Operating System. This protocol uses a set of communication primitives which in a network of computers are necessary to spread the operating sytem across the network. In order to achieve this goal the communications primitives must be endowed with properties for process synchronization. Most of the past work in computer network design seems to concentrate on the problems of network topology, transmission technologies and transmission protocols. All these questions are of secondary import to us. We assume that messages or message packets can be exchanged error-free between any of two host processors.

Optimal routing strategies in a class of networks

Abstract: For networks with given topology and fixed one-way link capacities the problem of the dynamic minimization of the average message delay over priority disciplines and routing procedures at each node is studied. It is assumed that a controller is available at each node and that a strategy is to be found for traffic direction on the basis of varying information patterns, such as the sizes of the queues in the different incoming and outgoing links, with or without the Poisson and exponential statistics assumptions.