Reliability of Computer and Communication Networks ( DIMACS - Series in Discrete Mathematics and Theoretical Computer Science )

Publication series ：DIMACS - Series in Discrete Mathematics and Theoretical Computer Science

Author： Fred Stephen Roberts;Frank K. Hwang;Clyde L. Monma  

Publisher： American Mathematical Society‎

Publication year： 2017

E-ISBN: 9781470439637

P-ISBN(Paperback): 9780821865927

Subject： O1 Mathematics

Keyword： 暂无分类

Language： ENG

Access to resources Favorite

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Reliability of Computer and Communication Networks

Description

Reliability problems arise with increasing frequency as our systems of telecommunications, information transmission, transportation, and distribution become more and more complex. In December 1989 at DIMACS at Rutgers University, a Workshop on Reliability of Computer and Communication Networks was held to examine the discrete mathematical methods relevant to these problems. There were nearly ninety participants, including theoretical mathematicians, computer scientists, and electrical engineers from academia and industry, as well as network practitioners, engineers, and reliability planners from leading companies involved in the use of computer and communications networks. This volume, published jointly with the Association for Computing Machinery, contains the proceedings from this Workshop. The aim of the Workshop was to identify the latest trends and important open problems, as well as to survey potential practical applications. The Workshop explored questions of computation of reliability of existing systems and of creating new designs to insure high reliability, in addition to the closely related notion of survivability. Redundancy, single stage and multistage networks, interconnected networks, and fault tolerance were also covered. The Workshop emphasized practical applications, with many invited speakers from a variety of companies which are dealing with practical network reliability problems. The success of the Workshop in fostering many new interactions among resea

Chapter

Cover

Title page

Contents

Preface

Program

List of Participants

Robust design of dynamic routing networks

Graph searching, path-width, tree-width and related problems (A survey)

On residual connectedness network reliability

Survivable fiber network design

Decomposable probabilistic influence diagrams

Bounding network parameters by approximating graphs

The optimal multiterminal cut problem

Polyhedral approaches to network survivability

A survey on double loop networks

Quantitative reliability analysis of redundant multistage interconnection networks

An axiomatic characterization of the reliability polynomial

Fault-tolerant VLSI architectures based on de Bruijn graphs (Galileo in the mid nineties)

The use of binomial moments for bounding network reliability

Boolean decomposition schemes and the complexity of reliability computations

On dynamic full access in multistage interconnection networks

Algebraic methods for bounding network reliability

Back Cover

The users who browse this book also browse


No browse record.