Models of Network Reliability

Analysis, Combinatorics, and Monte Carlo

Ilya B. Gertsbakh, Yoseph Shpungin

$179

Hardback

Not in-store but you can order this
How long will it take?

Availability Information

We source books from suppliers in Australia and overseas. For books we don't currently have in stock, the time it takes to get them from our suppliers can vary widely - from a few days to a few months - so we check each book with each supplier to determine the expected time it will take to be supplied to us.

We then advise you accordingly. If the time taken to get any book is too long for you, you can let us know and we will cancel or adjust your order, and refund as required.

To find out the anticipated arrival time for specific items prior to ordering, please contact us by phone or email:

Phone +61 2 9264 3111, or 1800 4 BOOKS (1800 4 26657) if outside Sydney:
option 1 Abbey's Bookshop (Crime, History, Science, Kids & more) • info@abbeys.com.au
option 2 Language Book Centre (ESL & Foreign Languages) • language@abbeys.com.au
option 3 Galaxy Bookshop (Sci-fi, Fantasy, Romance, Graphic Novels) • sf@galaxybooks.com.au

QTY:

English

CRC Press Inc
22 December 2009

Combinatorics & graph theory; Applied mathematics

Unique in its approach, Models of Network Reliability: Analysis, Combinatorics, and Monte Carlo provides a brief introduction to Monte Carlo methods along with a concise exposition of reliability theory ideas. From there, the text investigates a collection of principal network reliability models, such as terminal connectivity for networks with unreliable edges and/or nodes, network lifetime distribution in the process of its destruction, network stationary behavior for renewable components, importance measures of network elements, reliability gradient, and network optimal reliability synthesis. Solutions to most principal network reliability problems--including medium sized computer networks--are presented in the form of efficient Monte Carlo algorithms and illustrated with numerical examples and tables. Written by reliability experts with significant teaching experience, this reader-friendly text is an excellent resource for software engineering, operations research, industrial engineering, and reliability engineering students, researchers, and engineers. Stressing intuitive explanations and providing detailed proofs of difficult statements, this self-contained resource includes a wealth of end-of-chapter exercises, numerical examples, tables, and offers a solutions manual--making it ideal for self-study and practical use.

By: Ilya B. Gertsbakh, Yoseph Shpungin
Imprint: CRC Press Inc
Country of Publication: United States
Dimensions: Height: 234mm, Width: 156mm,
Weight: 430g
ISBN: 9781439817414
ISBN 10: 1439817413
Pages: 219
Publication Date: 22 December 2009
Audience: Professional and scholarly , College/higher education , Undergraduate , Primary
Format: Hardback
Publisher's Status: Active

Ilya B. Gertsbakh, Professor Emeritus, Department of Mathematics, Ben Gurion University, Beer Sheva, Israel. Dr. Gertsbakh has authored more than 70 research papers and six books. He has taught courses in Probability, Statistics, Reliability Theory, and Operations Research. His research interests include Reliability Theory, Probabilistic Methods in Operations Research, and Monte Carlo Methods. Yoseph Shpungin, Department Head, Software Engineering Department, Shamoon College of Engineering, Beer Sheva, Israel. Throughout his career, Dr. Shpungin has gained extensive experience in both practical and theoretical operations research and software engineering issues. He has taught courses in Probability, Statistics, Reliability, Algorithms, Databases, and Programming Languages. His field of research is Reliability Theory and Monte Carlo Methods, in which he has authored one book and many publications in international scientific journals and in the proceedings of international conferences.

Reviews for Models of Network Reliability: Analysis, Combinatorics, and Monte Carlo

The 13 chapters and three appendixes make the material accessible to readers with a basic background in reliability. ... Formal proofs are minimally presented, the methods are widely supported by examples and exercises, and guidelines for developing computer programs are provided. -Ron S. Kenett, KPA, Raanana, Israel, in Quality Progress ... a concise and compact book on the subject of how to compute k-terminal reliability of a given communication network, where the edges or links can fail. ... To make a beginner understand the subject matter, the treatment in a chapter starts with examples and leads a reader to the definitions and theorems that are incidental to the explanation of an approach. ... helps in understanding the intricacies involved in the problem of computing network reliability. The concept of spanning trees is used to ensure connectivity of nodes of interest. Other measures of interest in reliability of networks such as component criticality and Birnbaum Importance are also discussed ... students and teachers pursuing reliability of communication reliability will find this book of interest. ...very useful for reliability engineers and those dealing with design of communication networks ... . -Krishna B. Misra, in Performability Engineering, May 2011, Vol. 7, No. 3