Network reliability and algebraic structures
著者
書誌事項
Network reliability and algebraic structures
Clarendon Press , Oxford University Press, 1991
大学図書館所蔵 件 / 全17件
-
該当する所蔵館はありません
- すべての絞り込み条件を解除する
この図書・雑誌をさがす
注記
Includes bibliographical references and index
内容説明・目次
内容説明
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.
目次
- 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.
「Nielsen BookData」 より