A network topology, the ‘triangle’, is defined in a recursive way. This structured definition allows to analyze triangles of a practical size and to compute their reliability.
A comparison is made between triangles and various ring networks in order to show the meritt of the proposed topology.
The research also leads to the definition of 'connectivity polynomials' and to a general formula to compute the connectivity of a network for a given number of failed links as a function of the coefficients of its connectivity polynomial. / M.S.
| Identifer | oai:union.ndltd.org:VTETD/oai:vtechworks.lib.vt.edu:10919/113500 |
| Date | January 1983 |
| Creators | Van Eester, Dirk F. |
| Contributors | Computer Science and Applications |
| Publisher | Virginia Polytechnic Institute and State University |
| Source Sets | Virginia Tech Theses and Dissertation |
| Language | English |
| Detected Language | English |
| Type | Thesis, Text |
| Format | vii, 71 pages, 1 unnumbered leaves, application/pdf, application/pdf |
| Rights | In Copyright, http://rightsstatements.org/vocab/InC/1.0/ |
| Relation | OCLC# 10353139 |
Page generated in 0.002 seconds