000			02016 a2200205 4500
020			_a1439817413 (hardcover)
020			_a9781439817414 (hardcover)
082			_a621.3821 _bGEM
100	1		_aGertsbakh, Ilya B. _996982
245	1	0	_aModels of network reliability _b: analysis, combinatorics, and monte carlo / _cIlya B. Gertsbakh and Yoseph Shpungin.
260			_aBoca Raton: _bCRC Press, _c2010.
300			_axvi, 217p.
500			_aHB
520			_aUnique 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
546			_aEng
650			_aNetwork performance (Telecommunication) _97185
650			_aReliability (Engineering)-Statistical methods _996983
700			_aShpungin, Yoseph (jt. auth.) _996984
942			_cBK
999			_c62823 _d62823