Item Successfully Added to Cart
An error was encountered while trying to add the item to the cart. Please try again.
OK
Please make all selections above before adding to cart
OK
Share this page via the icons above, or by copying the link below:
Copy To Clipboard
Successfully Copied!
Reliability of Computer and Communication Networks
 
A co-publication of the AMS, DIMACS, and Association for Computing Machinery
Reliability of Computer and Communication Networks
Hardcover ISBN:  978-0-8218-6592-7
Product Code:  DIMACS/5
List Price: $65.00
MAA Member Price: $58.50
AMS Member Price: $52.00
eBook ISBN:  978-1-4704-3963-7
Product Code:  DIMACS/5.E
List Price: $60.00
MAA Member Price: $54.00
AMS Member Price: $48.00
Hardcover ISBN:  978-0-8218-6592-7
eBook: ISBN:  978-1-4704-3963-7
Product Code:  DIMACS/5.B
List Price: $125.00 $95.00
MAA Member Price: $112.50 $85.50
AMS Member Price: $100.00 $76.00
Reliability of Computer and Communication Networks
Click above image for expanded view
Reliability of Computer and Communication Networks
A co-publication of the AMS, DIMACS, and Association for Computing Machinery
Hardcover ISBN:  978-0-8218-6592-7
Product Code:  DIMACS/5
List Price: $65.00
MAA Member Price: $58.50
AMS Member Price: $52.00
eBook ISBN:  978-1-4704-3963-7
Product Code:  DIMACS/5.E
List Price: $60.00
MAA Member Price: $54.00
AMS Member Price: $48.00
Hardcover ISBN:  978-0-8218-6592-7
eBook ISBN:  978-1-4704-3963-7
Product Code:  DIMACS/5.B
List Price: $125.00 $95.00
MAA Member Price: $112.50 $85.50
AMS Member Price: $100.00 $76.00
  • Book Details
     
     
    DIMACS - Series in Discrete Mathematics and Theoretical Computer Science
    Volume: 51991; 259 pp
    MSC: Primary 05; 68; 90; 94;

    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 researchers and practitioners is reflected in the proceedings, which provide an exciting look at some of the major advances at the forefront of this important field of research.

    Co-published with the Center for Discrete Mathematics and Theoretical Computer Science beginning with Volume 8. Volumes 1–7 were co-published with the Association for Computer Machinery (ACM).

  • Table of Contents
     
     
    • Chapters
    • 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
  • Requests
     
     
    Review Copy – for publishers of book reviews
    Accessibility – to request an alternate format of an AMS title
Volume: 51991; 259 pp
MSC: Primary 05; 68; 90; 94;

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 researchers and practitioners is reflected in the proceedings, which provide an exciting look at some of the major advances at the forefront of this important field of research.

Co-published with the Center for Discrete Mathematics and Theoretical Computer Science beginning with Volume 8. Volumes 1–7 were co-published with the Association for Computer Machinery (ACM).

  • Chapters
  • 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
Review Copy – for publishers of book reviews
Accessibility – to request an alternate format of an AMS title
Please select which format for which you are requesting permissions.