{"id":{"repo_id":"vt","oai_identifier":"oai:vtechworks.lib.vt.edu:10919/113500"},"canonical_url":"https://search.dev.ndltd.org/etd/vt/oai:vtechworks.lib.vt.edu:10919/113500","repository":{"repo_id":"vt","name":"Virginia Tech","base_url":"https://vtechworks.lib.vt.edu/oai/request"},"display":{"title":"A recursively defined computer network","abstract":"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.","abstract_html":"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.","abstract_has_math":false,"creators":["Van Eester, Dirk F."],"institution":"Virginia Polytechnic Institute and State University","degree_name":"M.S.","degree_level":"masters","degree_discipline":"Computer Science and Applications","degree_department":"Computer Science and Applications","school":null,"contributors":[],"advisors":[],"committee_chairs":[],"committee_members":[],"year":1983,"date_issued":"1983","date_published":"1983","updated_at":"2026-07-22T22:19:10Z","subjects":[],"languages":["en"],"rights":["In Copyright"],"rights_urls":["http://rightsstatements.org/vocab/InC/1.0/"],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/10919/113500","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.department","label":"Department","values":["Computer Science and Applications"]},{"key":"dc:creator","label":"Author","values":["Van Eester, Dirk F."]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2023-01-27T04:47:48Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2023-01-27T04:47:48Z"]},{"key":"dc:date.issued","label":"Date","values":["1983"]},{"key":"dc:publisher","label":"Institution","values":["Virginia Polytechnic Institute and State University"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]},{"key":"dc:type.dcmitype","label":"Dc Type Dcmitype","values":["Text"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Science and Applications"]},{"key":"thesis:degree_level","label":"Degree Level","values":["masters"]},{"key":"thesis:degree_name","label":"Degree Name","values":["M.S."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["Virginia Polytechnic Institute and State University"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["en"]},{"key":"dc:rights","label":"Dc Rights","values":["In Copyright"]},{"key":"dc:rights.uri","label":"Rights URI","values":["http://rightsstatements.org/vocab/InC/1.0/"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/10919/113500"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["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."]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["M.S."]},{"key":"dc:format.mimetype","label":"Dc Format Mimetype","values":["application/pdf"]},{"key":"dc:title","label":"Title","values":["A recursively defined computer network"]}]}],"canonical_facts":{"dc:contributor.department":["Computer Science and Applications"],"dc:creator":["Van Eester, Dirk F."],"dc:date.accessioned":["2023-01-27T04:47:48Z"],"dc:date.available":["2023-01-27T04:47:48Z"],"dc:date.issued":["1983"],"dc:description.abstract":["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."],"dc:description.degree":["M.S."],"dc:format.mimetype":["application/pdf"],"dc:identifier.uri":["http://hdl.handle.net/10919/113500"],"dc:language.iso":["en"],"dc:publisher":["Virginia Polytechnic Institute and State University"],"dc:rights":["In Copyright"],"dc:rights.uri":["http://rightsstatements.org/vocab/InC/1.0/"],"dc:title":["A recursively defined computer network"],"dc:type":["Thesis"],"dc:type.dcmitype":["Text"],"thesis:degree_discipline":["Computer Science and Applications"],"thesis:degree_level":["masters"],"thesis:degree_name":["M.S."],"thesis:institution_name":["Virginia Polytechnic Institute and State University"]},"updated_at":"2026-07-22T22:19:10Z"}