Efficient calculation of reliability and performability of large computer networks
This thesis introduces two algorithms for the calculation of reliability and performability metrics of computer networks. Both have several key advantages over existing approaches. Firstly, they have greatly decreased memory usage, including constant space complexity and linear time complexity for f...
| Main Author: | |
|---|---|
| Format: | Thesis |
| Language: | English |
| Published: |
Curtin University
2013
|
| Online Access: | http://hdl.handle.net/20.500.11937/1666 |
| _version_ | 1848743733274607616 |
|---|---|
| author | Herrmann, Johannes Ulrich |
| author_facet | Herrmann, Johannes Ulrich |
| author_sort | Herrmann, Johannes Ulrich |
| building | Curtin Institutional Repository |
| collection | Online Access |
| description | This thesis introduces two algorithms for the calculation of reliability and performability metrics of computer networks. Both have several key advantages over existing approaches. Firstly, they have greatly decreased memory usage, including constant space complexity and linear time complexity for families of networks with identical inter-connectivity of devices. Further, they are the first algorithms to address the Expected Hop Count problem, and can be efficiently applied to a wide range of network models. |
| first_indexed | 2025-11-14T05:50:15Z |
| format | Thesis |
| id | curtin-20.500.11937-1666 |
| institution | Curtin University Malaysia |
| institution_category | Local University |
| language | English |
| last_indexed | 2025-11-14T05:50:15Z |
| publishDate | 2013 |
| publisher | Curtin University |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | curtin-20.500.11937-16662017-02-20T06:37:02Z Efficient calculation of reliability and performability of large computer networks Herrmann, Johannes Ulrich This thesis introduces two algorithms for the calculation of reliability and performability metrics of computer networks. Both have several key advantages over existing approaches. Firstly, they have greatly decreased memory usage, including constant space complexity and linear time complexity for families of networks with identical inter-connectivity of devices. Further, they are the first algorithms to address the Expected Hop Count problem, and can be efficiently applied to a wide range of network models. 2013 Thesis http://hdl.handle.net/20.500.11937/1666 en Curtin University fulltext |
| spellingShingle | Herrmann, Johannes Ulrich Efficient calculation of reliability and performability of large computer networks |
| title | Efficient calculation of reliability and performability of large computer networks |
| title_full | Efficient calculation of reliability and performability of large computer networks |
| title_fullStr | Efficient calculation of reliability and performability of large computer networks |
| title_full_unstemmed | Efficient calculation of reliability and performability of large computer networks |
| title_short | Efficient calculation of reliability and performability of large computer networks |
| title_sort | efficient calculation of reliability and performability of large computer networks |
| url | http://hdl.handle.net/20.500.11937/1666 |