{"id":{"repo_id":"qucosa-diss","oai_identifier":"oai:qucosa:de:qucosa:33755"},"canonical_url":"https://search.dev.ndltd.org/etd/qucosa-diss/oai:qucosa:de:qucosa:33755","repository":{"repo_id":"qucosa-diss","name":"QUCOSA","base_url":"http://www.qucosa.de/oai/"},"display":{"title":"Analysis and Optimization of Communication Networks with Flow Requirements","abstract":"In this thesis, we will study the concept of k-edge connected and k-connected reliability. There, vertices are modelled as fail-safe and edges fail stochastically independent. For a fixxed k, the network is then considered operational when each pair of vertices has k edge disjoint or internally disjoint paths, respectively, connecting them in the surviving subnetwork. Thus, the property of being operating covers the connectivity of the surviving graph together with some minimum bandwidth. We study essential and irrelevant edges for those reliability measures. Further, we study a splitting approach to transform the reliability of the graph into the probability that subgraphs have a certain connectivity. We also extend an approximation algorithm of Karger from the All-Terminal Unreliability to k-edge connected Unreliability and study the k-edge connected Reliability for some special graph classes, namely graphs with restricted treewidth, edge-transitive graphs and the complete graph.","abstract_html":"In this thesis, we will study the concept of k-edge connected and k-connected reliability. There, vertices are modelled as fail-safe and edges fail stochastically independent. For a fixxed k, the network is then considered operational when each pair of vertices has k edge disjoint or internally disjoint paths, respectively, connecting them in the surviving subnetwork. Thus, the property of being operating covers the connectivity of the surviving graph together with some minimum bandwidth. We study essential and irrelevant edges for those reliability measures. Further, we study a splitting approach to transform the reliability of the graph into the probability that subgraphs have a certain connectivity. We also extend an approximation algorithm of Karger from the All-Terminal Unreliability to k-edge connected Unreliability and study the k-edge connected Reliability for some special graph classes, namely graphs with restricted treewidth, edge-transitive graphs and the complete graph.","abstract_has_math":false,"creators":["Lange, Thomas"],"institution":"TU Bergakademie Freiberg","degree_name":null,"degree_level":"thesis.doctoral","degree_discipline":null,"degree_department":null,"school":null,"contributors":["Schiermeyer, Ingo","Tittmann, Peter"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2019,"date_issued":"2019-02-18","date_published":"2019-02-18","updated_at":"2026-07-24T03:56:21Z","subjects":["graph theory","network reliability","connectivity","probabilistic graphs","Graphentheorie","Netzwerkzuverlässigkeit","Zusammenhangswahrscheinlichkeit"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":null,"outbound_label":null,"outbound_source":null},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Schiermeyer, Ingo","Tittmann, Peter"]},{"key":"dc:creator","label":"Author","values":["Lange, Thomas"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:publisher","label":"Institution","values":["Technische Universität Bergakademie Freiberg"]},{"key":"dc:type","label":"Dc Type","values":["doctoralThesis"]},{"key":"thesis:degree_level","label":"Degree Level","values":["thesis.doctoral"]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["TU Bergakademie Freiberg"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["graph theory","network reliability","connectivity","probabilistic graphs","Graphentheorie","Netzwerkzuverlässigkeit","Zusammenhangswahrscheinlichkeit"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["In this thesis, we will study the concept of k-edge connected and k-connected reliability. There, vertices are modelled as fail-safe and edges fail stochastically independent. For a fixxed k, the network is then considered operational when each pair of vertices has k edge disjoint or internally disjoint paths, respectively, connecting them in the surviving subnetwork. Thus, the property of being operating covers the connectivity of the surviving graph together with some minimum bandwidth. We study essential and irrelevant edges for those reliability measures. Further, we study a splitting approach to transform the reliability of the graph into the probability that subgraphs have a certain connectivity. We also extend an approximation algorithm of Karger from the All-Terminal Unreliability to k-edge connected Unreliability and study the k-edge connected Reliability for some special graph classes, namely graphs with restricted treewidth, edge-transitive graphs and the complete graph."]},{"key":"dc:title","label":"Title","values":["Analysis and Optimization of Communication Networks with Flow Requirements"]}]}],"canonical_facts":{"dc:contributor":["Schiermeyer, Ingo","Tittmann, Peter"],"dc:creator":["Lange, Thomas"],"dc:description.abstract":["In this thesis, we will study the concept of k-edge connected and k-connected reliability. There, vertices are modelled as fail-safe and edges fail stochastically independent. For a fixxed k, the network is then considered operational when each pair of vertices has k edge disjoint or internally disjoint paths, respectively, connecting them in the surviving subnetwork. Thus, the property of being operating covers the connectivity of the surviving graph together with some minimum bandwidth. We study essential and irrelevant edges for those reliability measures. Further, we study a splitting approach to transform the reliability of the graph into the probability that subgraphs have a certain connectivity. We also extend an approximation algorithm of Karger from the All-Terminal Unreliability to k-edge connected Unreliability and study the k-edge connected Reliability for some special graph classes, namely graphs with restricted treewidth, edge-transitive graphs and the complete graph."],"dc:publisher":["Technische Universität Bergakademie Freiberg"],"dc:subject":["graph theory","network reliability","connectivity","probabilistic graphs","Graphentheorie","Netzwerkzuverlässigkeit","Zusammenhangswahrscheinlichkeit"],"dc:title":["Analysis and Optimization of Communication Networks with Flow Requirements"],"dc:type":["doctoralThesis"],"thesis:degree_level":["thesis.doctoral"],"thesis:institution_name":["TU Bergakademie Freiberg"]},"updated_at":"2026-07-24T03:56:21Z"}