Network Reliability and Algebraic Structures - Rilegato

Shier, Douglas R.

Rilegato

ISBN 10: 0198533861 ISBN 13: 9780198533863

Casa editrice: Clarendon Press, 1991

Riassunto

Networks of computer systems, distribution systems, and telecommunication systems play an increasingly important role in our lives. This book is concerned with analysing and assessing the reliability of such networks whose components are prone to possible failure.

The field of network reliability has expanded rapidly to provide various mathematical models and computational procedures. In this book the emphasis is on identifying a number of algebraic structures that serve to unify the study of networks, and to suggest new techniques and procedures for analysing the probabilistic behaviour of networks. Consequently, amongst the topics covered are pseudopolynomial algorithms, lattice structures, spaces of polynomials, reliability covering problems, and stochastic path problems.

The result is a book which will be an invaluable account of the subject for all mathematicians, computer scientists, reliability engineers, and operations researchers whose work touches on network reliability.

Su questo libro

Recensione

'Theoretical explanations in this book are very well-written, and even the basic notions of partial orders and graph theory are introduced ... this concise monograph will be very useful to researchers and graduate students in applied probability, computer science, and operations research, and as well to engineers faced with network reliability problems.' J. Kamburowski, Zentralblatt für Mathematik und ihre Grenzgebiete, Band 72, 9/92

'The book is very readable.' D.H. Smith, London Mathematical Society

'Inexpensive booklets like these are worht their weight in gold. One can quickly acquire an overview of the subject and despite the multitude of aspects, it is presented in a clear manner. Recommended.'Mededelingen van het wiskundig genootschap, nr.8 - november 1993

Contenuti

Overview of network reliability; Approaches for calculating network reliability; An algebraic formulation of network reliability problems; Bounds on two-terminal reliability; Enumeration of paths and cutsets; Pseudopolynomial algorithms for calculating reliability; Reliability covering problems; State-space approximation; Stochastic shortest-path problems; Glossary of terms; References; Index.

Dettagli dell?edizione

• Editore: Clarendon Press
• Data di pubblicazione: 1991
• Lingua: Inglese
• ISBN 10: 0198533861
• ISBN 13: 9780198533863
• Rilegatura: Copertina rigida
• Numero di pagine: 154
• Contatto del produttore: non disponibile
• Persona responsabile: Ufficio Anagrafiche Messaggerie; ufficio.anagrafiche@meli.it; ; Via Verdi, 8; Assago Milano; 20090; Italia