Efficient calculation of reliability and performability of large computer networks
MetadataShow full item record
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.
Showing items related by title, author, creator and subject.
Success factors for new business start-up in Hong Kong: a study of the external networks of small business start-upMa, Victor Kee Kin (2009)Most small new firms face problems in surviving the gestation process and achieving a viable performance thereafter because of the very fact of their smallness and newness. Due to a lack of internal resources, entrepreneurs ...
Chai, Pey San Nancy (2011)Backhaul networks are used to interconnect access points and further connect them to gateway nodes which are located in regional or metropolitan centres. Conventionally, these backhaul networks are established using ...
Mostafa, Fahed. (2011)Market risk refers to the potential loss that can be incurred as a result of movements inmarket factors. Capturing and measuring these factors are crucial in understanding andevaluating the risk exposure associated with ...