Back to search
Virginia Polytechnic Institute and State University
A recursively defined computer network
Abstract
dc:description.abstractA 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.
Degree
thesis:*- Name thesis:degree_name
- M.S.
- Level thesis:degree_level
- masters
- Discipline thesis:degree_discipline
- Computer Science and Applications
- Department dc:contributor.department
- Computer Science and Applications
- Grantor dc:publisher
- Virginia Polytechnic Institute and State University
- Year dc:date.issued
- 1983
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Van Eester, Dirk F.
Rights
dc:rights- Statement dc:rights
-
- In Copyright
- Licence dc:rights.uri
- Language dc:language.iso
- en
Identifiers
dc:identifier.*- Handle dc:identifier.uri
- http://hdl.handle.net/10919/113500
- OAI identifier oai:identifier
- oai:vtechworks.lib.vt.edu:10919/113500