Network reliability: measures and evaluation
In Engineering theory and applications, we think and operate in terms of logics and models with some acceptable and reasonable assumptions. The present text is aimed at providing modelling and analysis techniques for the evaluation of reliability measures (2-terminal, all-terminal, k-terminal reliab...
Gespeichert in:
Beteilige Person: | |
---|---|
Format: | Elektronisch E-Book |
Sprache: | Englisch |
Veröffentlicht: |
Hoboken, New Jersey Salem, Massachusetts
John Wiley & Sons
2016
Hoboken, New Jersey Salem, Massachusetts Scrivener Publishing 2016 |
Schriftenreihe: | Performability engineering series
|
Schlagwörter: | |
Links: | https://learning.oreilly.com/library/view/-/9781119223566/?ar |
Zusammenfassung: | In Engineering theory and applications, we think and operate in terms of logics and models with some acceptable and reasonable assumptions. The present text is aimed at providing modelling and analysis techniques for the evaluation of reliability measures (2-terminal, all-terminal, k-terminal reliability) for systems whose structure can be described in the form of a probabilistic graph. Among the several approaches of network reliability evaluation, the multiple-variable-inversion sum-of-disjoint product approach finds a well-deserved niche as it provides the reliability or unreliability expression in a most efficient and compact manner. However, it does require an efficiently enumerated minimal inputs (minimal path, spanning tree, minimal k-trees, minimal cut, minimal global-cut, minimal k-cut) depending on the desired reliability. The present book covers these two aspects in detail through the descriptions of several algorithms devised by the 'reliability fraternity' and explained through solved examples to obtain and evaluate 2-terminal, k-terminal and all-terminal network reliability/unreliability measures and could be its USP. The accompanying web-based supplementary information containing modifiable Matlab® source code for the algorithms is another feature of this book. A very concerted effort has been made to keep the book ideally suitable for first course or even for a novice stepping into the area of network reliability. The mathematical treatment is kept as minimal as possible with an assumption on the readers' side that they have basic knowledge in graph theory, probabilities laws, Boolean laws and set theory. |
Beschreibung: | Includes index. - Description based on print version record and CIP data provided by publisher; resource not viewed |
Umfang: | 1 Online-Ressource. |
ISBN: | 9781119224013 1119224012 9781119224037 1119224039 |
Internformat
MARC
LEADER | 00000cam a22000002 4500 | ||
---|---|---|---|
001 | ZDB-30-ORH-047552530 | ||
003 | DE-627-1 | ||
005 | 20240228120056.0 | ||
007 | cr uuu---uuuuu | ||
008 | 191023s2016 xx |||||o 00| ||eng c | ||
020 | |a 9781119224013 |c pdf |9 978-1-119-22401-3 | ||
020 | |a 1119224012 |9 1-119-22401-2 | ||
020 | |a 9781119224037 |c epub |9 978-1-119-22403-7 | ||
020 | |a 1119224039 |9 1-119-22403-9 | ||
035 | |a (DE-627-1)047552530 | ||
035 | |a (DE-599)KEP047552530 | ||
035 | |a (ORHE)9781119223566 | ||
035 | |a (DE-627-1)047552530 | ||
040 | |a DE-627 |b ger |c DE-627 |e rda | ||
041 | |a eng | ||
082 | 0 | |a 004.6 |2 23 | |
100 | 1 | |a Chaturvedi, Sanjay K. |e VerfasserIn |4 aut | |
245 | 1 | 0 | |a Network reliability |b measures and evaluation |c Sanjay K. Chaturvedi |
264 | 1 | |a Hoboken, New Jersey |a Salem, Massachusetts |b John Wiley & Sons |c 2016 | |
264 | 1 | |a Hoboken, New Jersey |a Salem, Massachusetts |b Scrivener Publishing |c 2016 | |
300 | |a 1 Online-Ressource. | ||
336 | |a Text |b txt |2 rdacontent | ||
337 | |a Computermedien |b c |2 rdamedia | ||
338 | |a Online-Ressource |b cr |2 rdacarrier | ||
490 | 0 | |a Performability engineering series | |
500 | |a Includes index. - Description based on print version record and CIP data provided by publisher; resource not viewed | ||
520 | |a In Engineering theory and applications, we think and operate in terms of logics and models with some acceptable and reasonable assumptions. The present text is aimed at providing modelling and analysis techniques for the evaluation of reliability measures (2-terminal, all-terminal, k-terminal reliability) for systems whose structure can be described in the form of a probabilistic graph. Among the several approaches of network reliability evaluation, the multiple-variable-inversion sum-of-disjoint product approach finds a well-deserved niche as it provides the reliability or unreliability expression in a most efficient and compact manner. However, it does require an efficiently enumerated minimal inputs (minimal path, spanning tree, minimal k-trees, minimal cut, minimal global-cut, minimal k-cut) depending on the desired reliability. The present book covers these two aspects in detail through the descriptions of several algorithms devised by the 'reliability fraternity' and explained through solved examples to obtain and evaluate 2-terminal, k-terminal and all-terminal network reliability/unreliability measures and could be its USP. The accompanying web-based supplementary information containing modifiable Matlab® source code for the algorithms is another feature of this book. A very concerted effort has been made to keep the book ideally suitable for first course or even for a novice stepping into the area of network reliability. The mathematical treatment is kept as minimal as possible with an assumption on the readers' side that they have basic knowledge in graph theory, probabilities laws, Boolean laws and set theory. | ||
650 | 0 | |a Computer networks |x Reliability | |
650 | 0 | |a Computer networks |x Mathematical models | |
650 | 4 | |a Réseaux d'ordinateurs ; Fiabilité | |
650 | 4 | |a Réseaux d'ordinateurs ; Modèles mathématiques | |
650 | 4 | |a COMPUTERS / Computer Literacy | |
650 | 4 | |a COMPUTERS / Computer Science | |
650 | 4 | |a COMPUTERS / Data Processing | |
650 | 4 | |a COMPUTERS / Hardware / General | |
650 | 4 | |a COMPUTERS / Information Technology | |
650 | 4 | |a COMPUTERS / Machine Theory | |
650 | 4 | |a COMPUTERS / Reference | |
650 | 4 | |a Computer networks ; Mathematical models | |
650 | 4 | |a Computer networks ; Reliability | |
776 | 1 | |z 9781119223566 | |
776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9781119223566 |
966 | 4 | 0 | |l DE-91 |p ZDB-30-ORH |q TUM_PDA_ORH |u https://learning.oreilly.com/library/view/-/9781119223566/?ar |m X:ORHE |x Aggregator |z lizenzpflichtig |3 Volltext |
912 | |a ZDB-30-ORH | ||
912 | |a ZDB-30-ORH | ||
951 | |a BO | ||
912 | |a ZDB-30-ORH | ||
049 | |a DE-91 |
Datensatz im Suchindex
DE-BY-TUM_katkey | ZDB-30-ORH-047552530 |
---|---|
_version_ | 1821494883231203328 |
adam_text | |
any_adam_object | |
author | Chaturvedi, Sanjay K. |
author_facet | Chaturvedi, Sanjay K. |
author_role | aut |
author_sort | Chaturvedi, Sanjay K. |
author_variant | s k c sk skc |
building | Verbundindex |
bvnumber | localTUM |
collection | ZDB-30-ORH |
ctrlnum | (DE-627-1)047552530 (DE-599)KEP047552530 (ORHE)9781119223566 |
dewey-full | 004.6 |
dewey-hundreds | 000 - Computer science, information, general works |
dewey-ones | 004 - Computer science |
dewey-raw | 004.6 |
dewey-search | 004.6 |
dewey-sort | 14.6 |
dewey-tens | 000 - Computer science, information, general works |
discipline | Informatik |
format | Electronic eBook |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03851cam a22005772 4500</leader><controlfield tag="001">ZDB-30-ORH-047552530</controlfield><controlfield tag="003">DE-627-1</controlfield><controlfield tag="005">20240228120056.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">191023s2016 xx |||||o 00| ||eng c</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781119224013</subfield><subfield code="c">pdf</subfield><subfield code="9">978-1-119-22401-3</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1119224012</subfield><subfield code="9">1-119-22401-2</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781119224037</subfield><subfield code="c">epub</subfield><subfield code="9">978-1-119-22403-7</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1119224039</subfield><subfield code="9">1-119-22403-9</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627-1)047552530</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)KEP047552530</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ORHE)9781119223566</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627-1)047552530</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">004.6</subfield><subfield code="2">23</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Chaturvedi, Sanjay K.</subfield><subfield code="e">VerfasserIn</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Network reliability</subfield><subfield code="b">measures and evaluation</subfield><subfield code="c">Sanjay K. Chaturvedi</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Hoboken, New Jersey</subfield><subfield code="a">Salem, Massachusetts</subfield><subfield code="b">John Wiley & Sons</subfield><subfield code="c">2016</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Hoboken, New Jersey</subfield><subfield code="a">Salem, Massachusetts</subfield><subfield code="b">Scrivener Publishing</subfield><subfield code="c">2016</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">Performability engineering series</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Includes index. - Description based on print version record and CIP data provided by publisher; resource not viewed</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">In Engineering theory and applications, we think and operate in terms of logics and models with some acceptable and reasonable assumptions. The present text is aimed at providing modelling and analysis techniques for the evaluation of reliability measures (2-terminal, all-terminal, k-terminal reliability) for systems whose structure can be described in the form of a probabilistic graph. Among the several approaches of network reliability evaluation, the multiple-variable-inversion sum-of-disjoint product approach finds a well-deserved niche as it provides the reliability or unreliability expression in a most efficient and compact manner. However, it does require an efficiently enumerated minimal inputs (minimal path, spanning tree, minimal k-trees, minimal cut, minimal global-cut, minimal k-cut) depending on the desired reliability. The present book covers these two aspects in detail through the descriptions of several algorithms devised by the 'reliability fraternity' and explained through solved examples to obtain and evaluate 2-terminal, k-terminal and all-terminal network reliability/unreliability measures and could be its USP. The accompanying web-based supplementary information containing modifiable Matlab® source code for the algorithms is another feature of this book. A very concerted effort has been made to keep the book ideally suitable for first course or even for a novice stepping into the area of network reliability. The mathematical treatment is kept as minimal as possible with an assumption on the readers' side that they have basic knowledge in graph theory, probabilities laws, Boolean laws and set theory.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Computer networks</subfield><subfield code="x">Reliability</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Computer networks</subfield><subfield code="x">Mathematical models</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Réseaux d'ordinateurs ; Fiabilité</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Réseaux d'ordinateurs ; Modèles mathématiques</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">COMPUTERS / Computer Literacy</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">COMPUTERS / Computer Science</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">COMPUTERS / Data Processing</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">COMPUTERS / Hardware / General</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">COMPUTERS / Information Technology</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">COMPUTERS / Machine Theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">COMPUTERS / Reference</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer networks ; Mathematical models</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer networks ; Reliability</subfield></datafield><datafield tag="776" ind1="1" ind2=" "><subfield code="z">9781119223566</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">9781119223566</subfield></datafield><datafield tag="966" ind1="4" ind2="0"><subfield code="l">DE-91</subfield><subfield code="p">ZDB-30-ORH</subfield><subfield code="q">TUM_PDA_ORH</subfield><subfield code="u">https://learning.oreilly.com/library/view/-/9781119223566/?ar</subfield><subfield code="m">X:ORHE</subfield><subfield code="x">Aggregator</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-30-ORH</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-30-ORH</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">BO</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-30-ORH</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91</subfield></datafield></record></collection> |
id | ZDB-30-ORH-047552530 |
illustrated | Not Illustrated |
indexdate | 2025-01-17T11:21:27Z |
institution | BVB |
isbn | 9781119224013 1119224012 9781119224037 1119224039 |
language | English |
open_access_boolean | |
owner | DE-91 DE-BY-TUM |
owner_facet | DE-91 DE-BY-TUM |
physical | 1 Online-Ressource. |
psigel | ZDB-30-ORH TUM_PDA_ORH ZDB-30-ORH |
publishDate | 2016 |
publishDateSearch | 2016 |
publishDateSort | 2016 |
publisher | John Wiley & Sons Scrivener Publishing |
record_format | marc |
series2 | Performability engineering series |
spelling | Chaturvedi, Sanjay K. VerfasserIn aut Network reliability measures and evaluation Sanjay K. Chaturvedi Hoboken, New Jersey Salem, Massachusetts John Wiley & Sons 2016 Hoboken, New Jersey Salem, Massachusetts Scrivener Publishing 2016 1 Online-Ressource. Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Performability engineering series Includes index. - Description based on print version record and CIP data provided by publisher; resource not viewed In Engineering theory and applications, we think and operate in terms of logics and models with some acceptable and reasonable assumptions. The present text is aimed at providing modelling and analysis techniques for the evaluation of reliability measures (2-terminal, all-terminal, k-terminal reliability) for systems whose structure can be described in the form of a probabilistic graph. Among the several approaches of network reliability evaluation, the multiple-variable-inversion sum-of-disjoint product approach finds a well-deserved niche as it provides the reliability or unreliability expression in a most efficient and compact manner. However, it does require an efficiently enumerated minimal inputs (minimal path, spanning tree, minimal k-trees, minimal cut, minimal global-cut, minimal k-cut) depending on the desired reliability. The present book covers these two aspects in detail through the descriptions of several algorithms devised by the 'reliability fraternity' and explained through solved examples to obtain and evaluate 2-terminal, k-terminal and all-terminal network reliability/unreliability measures and could be its USP. The accompanying web-based supplementary information containing modifiable Matlab® source code for the algorithms is another feature of this book. A very concerted effort has been made to keep the book ideally suitable for first course or even for a novice stepping into the area of network reliability. The mathematical treatment is kept as minimal as possible with an assumption on the readers' side that they have basic knowledge in graph theory, probabilities laws, Boolean laws and set theory. Computer networks Reliability Computer networks Mathematical models Réseaux d'ordinateurs ; Fiabilité Réseaux d'ordinateurs ; Modèles mathématiques COMPUTERS / Computer Literacy COMPUTERS / Computer Science COMPUTERS / Data Processing COMPUTERS / Hardware / General COMPUTERS / Information Technology COMPUTERS / Machine Theory COMPUTERS / Reference Computer networks ; Mathematical models Computer networks ; Reliability 9781119223566 Erscheint auch als Druck-Ausgabe 9781119223566 |
spellingShingle | Chaturvedi, Sanjay K. Network reliability measures and evaluation Computer networks Reliability Computer networks Mathematical models Réseaux d'ordinateurs ; Fiabilité Réseaux d'ordinateurs ; Modèles mathématiques COMPUTERS / Computer Literacy COMPUTERS / Computer Science COMPUTERS / Data Processing COMPUTERS / Hardware / General COMPUTERS / Information Technology COMPUTERS / Machine Theory COMPUTERS / Reference Computer networks ; Mathematical models Computer networks ; Reliability |
title | Network reliability measures and evaluation |
title_auth | Network reliability measures and evaluation |
title_exact_search | Network reliability measures and evaluation |
title_full | Network reliability measures and evaluation Sanjay K. Chaturvedi |
title_fullStr | Network reliability measures and evaluation Sanjay K. Chaturvedi |
title_full_unstemmed | Network reliability measures and evaluation Sanjay K. Chaturvedi |
title_short | Network reliability |
title_sort | network reliability measures and evaluation |
title_sub | measures and evaluation |
topic | Computer networks Reliability Computer networks Mathematical models Réseaux d'ordinateurs ; Fiabilité Réseaux d'ordinateurs ; Modèles mathématiques COMPUTERS / Computer Literacy COMPUTERS / Computer Science COMPUTERS / Data Processing COMPUTERS / Hardware / General COMPUTERS / Information Technology COMPUTERS / Machine Theory COMPUTERS / Reference Computer networks ; Mathematical models Computer networks ; Reliability |
topic_facet | Computer networks Reliability Computer networks Mathematical models Réseaux d'ordinateurs ; Fiabilité Réseaux d'ordinateurs ; Modèles mathématiques COMPUTERS / Computer Literacy COMPUTERS / Computer Science COMPUTERS / Data Processing COMPUTERS / Hardware / General COMPUTERS / Information Technology COMPUTERS / Machine Theory COMPUTERS / Reference Computer networks ; Mathematical models Computer networks ; Reliability |
work_keys_str_mv | AT chaturvedisanjayk networkreliabilitymeasuresandevaluation |