TY - THES A1 - Hock, David Rogér T1 - Analysis and Optimization of Resilient Routing in Core Communication Networks T1 - Analyse und Optimierung von ausfallsicherem Routing in Kernkommunikationsnetzen N2 - Routing is one of the most important issues in any communication network. It defines on which path packets are transmitted from the source of a connection to the destination. It allows to control the distribution of flows between different locations in the network and thereby is a means to influence the load distribution or to reach certain constraints imposed by particular applications. As failures in communication networks appear regularly and cannot be completely avoided, routing is required to be resilient against such outages, i.e., routing still has to be able to forward packets on backup paths even if primary paths are not working any more. Throughout the years, various routing technologies have been introduced that are very different in their control structure, in their way of working, and in their ability to handle certain failure cases. Each of the different routing approaches opens up their own specific questions regarding configuration, optimization, and inclusion of resilience issues. This monograph investigates, with the example of three particular routing technologies, some concrete issues regarding the analysis and optimization of resilience. It thereby contributes to a better general, technology-independent understanding of these approaches and of their diverse potential for the use in future network architectures. The first considered routing type, is decentralized intra-domain routing based on administrative IP link costs and the shortest path principle. Typical examples are common today's intra-domain routing protocols OSPF and IS-IS. This type of routing includes automatic restoration abilities in case of failures what makes it in general very robust even in the case of severe network outages including several failed components. Furthermore, special IP-Fast Reroute mechanisms allow for a faster reaction on outages. For routing based on link costs, traffic engineering, e.g. the optimization of the maximum relative link load in the network, can be done indirectly by changing the administrative link costs to adequate values. The second considered routing type, MPLS-based routing, is based on the a priori configuration of primary and backup paths, so-called Label Switched Paths. The routing layout of MPLS paths offers more freedom compared to IP-based routing as it is not restricted by any shortest path constraints but any paths can be setup. However, this in general involves a higher configuration effort. Finally, in the third considered routing type, typically centralized routing using a Software Defined Networking (SDN) architecture, simple switches only forward packets according to routing decisions made by centralized controller units. SDN-based routing layouts offer the same freedom as for explicit paths configured using MPLS. In case of a failure, new rules can be setup by the controllers to continue the routing in the reduced topology. However, new resilience issues arise caused by the centralized architecture. If controllers are not reachable anymore, the forwarding rules in the single nodes cannot be adapted anymore. This might render a rerouting in case of connection problems in severe failure scenarios infeasible. N2 - Routing stellt eine der zentralen Aufgaben in Kommunikationsnetzen dar. Es bestimmt darüber, auf welchem Weg Verkehr von der Quelle zum Ziel transportiert wird. Durch geschicktes Routing kann dadurch eine Verteilung der Verkehrsflüsse zum Beispiel zur Lastverteilung erreicht werden. Da Fehler in Kommunikationsnetzen nicht vollständig verhindert werden können, muss Routing insbesondere ausfallsicher sein, d.h., im Falle von Fehlern im Netz muss das Routing weiterhin in der Lage sein, Pakete auf alternativen Pfaden zum Ziel zu transportieren. Es existieren verschiedene gängige Routingverfahren und Technologien, die sich hinsichtlich Ihrer Arbeitsweise, Ihrer Kontrollstrukturen und Ihrer Funktionalität in bestimmten Fehlerszenarien unterscheiden. Für diese verschiedenen Ansätze ergeben sich jeweils eigene Fragestellungen hinsichtlich der Konfiguration, der Optimierung und der Berücksichtigung von Ausfallsicherheit. Diese Doktorarbeit behandelt am Beispiel bestimmter Technologien einige konkrete Fragestellungen zur Analyse und Optimierung der Ausfallsicherheit. Sie liefert damit einen Beitrag zum besseren generellen Verständnis verschiedenartiger Routingansätze und deren unterschiedlichen Potentials für den Einsatz in zukünftigen Netzarchitekturen. Zuerst wird dezentrales Routing behandelt, basierend auf administrativen Linkgewichten und dem Prinzip der kürzesten Pfade, wie es beispielsweise in den Protokollen IS-IS und OSPF genutzt wird. Diese Routingverfahren beinhalteten automatische Rekonvergenz-Mechanismen um im Falle von Fehlern auf der verbleibenden Netzstruktur weiterhin einen Transport von Verkehr zu ermöglichen. Spezielle IP-Fast Reroute Mechanismen ermöglichen zudem eine schnelle Reaktion im Falle von Fehlern. Routing basierend auf Linkgewichten lässt sich nur indirekt durch die Wahl geeigneter Gewichte beeinflussen und optimieren. Die zweite in der Doktorarbeit behandelte Routingart ist MPLS-basiertes Routing, bei dem Labels für Pakete verwendet werden und Pakete anhand sogenannter vorkonfigurierter Label Switched Paths weitergeleitet werden. Diese Technologie bietet mehr Freiheiten bei der Wahl des Pfadlayouts, was aber wiederum im Allgemeinen einen erhöhten Konfigurationsaufwand mit sich bringt. Schließlich greift die Doktorarbeit auch das Routing in SDN Netzen auf. Dort erfolgt eine Trennung von Control Plane und Data Plane, so dass einzelne dedizierte Controller die Routingentscheidungen festlegen und ansonsten einfache Switches mit reduzierter Komplexität den Verkehr lediglich entsprechend der festgelegten Regeln weiterleiten. Dies ermöglicht die größte Freiheit bei der Konfiguration des Routing bringt aber wiederum neue Fragestellungen bedingt durch die zentralen Kontrolleinheiten mit sich. T3 - Würzburger Beiträge zur Leistungsbewertung Verteilter Systeme - 02/14 KW - Leistungsbewertung KW - Verteiltes System KW - Routing KW - Netzwerk KW - Optimization KW - Routing KW - Software Defined Networking KW - Optimierung Y1 - 2014 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:bvb:20-opus-101681 SN - 1432-8801 ER - TY - JOUR A1 - Hock, Michael A1 - Terekhov, Maxim A1 - Stefanescu, Maria Roxana A1 - Lohr, David A1 - Herz, Stefan A1 - Reiter, Theresa A1 - Ankenbrand, Markus A1 - Kosmala, Aleksander A1 - Gassenmaier, Tobias A1 - Juchem, Christoph A1 - Schreiber, Laura Maria T1 - B\(_{0}\) shimming of the human heart at 7T JF - Magnetic Resonance in Medicine N2 - Purpose Inhomogeneities of the static magnetic B\(_{0}\) field are a major limiting factor in cardiac MRI at ultrahigh field (≥ 7T), as they result in signal loss and image distortions. Different magnetic susceptibilities of the myocardium and surrounding tissue in combination with cardiac motion lead to strong spatio‐temporal B\(_{0}\)‐field inhomogeneities, and their homogenization (B0 shimming) is a prerequisite. Limitations of state‐of‐the‐art shimming are described, regional B\(_{0}\) variations are measured, and a methodology for spherical harmonics shimming of the B\(_{0}\) field within the human myocardium is proposed. Methods The spatial B\(_{0}\)‐field distribution in the heart was analyzed as well as temporal B\(_{0}\)‐field variations in the myocardium over the cardiac cycle. Different shim region‐of‐interest selections were compared, and hardware limitations of spherical harmonics B\(_{0}\) shimming were evaluated by calibration‐based B0‐field modeling. The role of third‐order spherical harmonics terms was analyzed as well as potential benefits from cardiac phase–specific shimming. Results The strongest B\(_{0}\)‐field inhomogeneities were observed in localized spots within the left‐ventricular and right‐ventricular myocardium and varied between systolic and diastolic cardiac phases. An anatomy‐driven shim region‐of‐interest selection allowed for improved B\(_{0}\)‐field homogeneity compared with a standard shim region‐of‐interest cuboid. Third‐order spherical harmonics terms were demonstrated to be beneficial for shimming of these myocardial B\(_{0}\)‐field inhomogeneities. Initial results from the in vivo implementation of a potential shim strategy were obtained. Simulated cardiac phase–specific shimming was performed, and a shim term‐by‐term analysis revealed periodic variations of required currents. Conclusion Challenges in state‐of‐the‐art B\(_{0}\) shimming of the human heart at 7 T were described. Cardiac phase–specific shimming strategies were found to be superior to vendor‐supplied shimming. KW - 7 T KW - B KW - cardiac MRI KW - shimming KW - ultrahigh field Y1 - 2021 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:bvb:20-opus-218096 VL - 85 IS - 1 SP - 182 EP - 196 ER - TY - JOUR A1 - Ankenbrand, Markus J. A1 - Shainberg, Liliia A1 - Hock, Michael A1 - Lohr, David A1 - Schreiber, Laura M. T1 - Sensitivity analysis for interpretation of machine learning based segmentation models in cardiac MRI JF - BMC Medical Imaging N2 - Background Image segmentation is a common task in medical imaging e.g., for volumetry analysis in cardiac MRI. Artificial neural networks are used to automate this task with performance similar to manual operators. However, this performance is only achieved in the narrow tasks networks are trained on. Performance drops dramatically when data characteristics differ from the training set properties. Moreover, neural networks are commonly considered black boxes, because it is hard to understand how they make decisions and why they fail. Therefore, it is also hard to predict whether they will generalize and work well with new data. Here we present a generic method for segmentation model interpretation. Sensitivity analysis is an approach where model input is modified in a controlled manner and the effect of these modifications on the model output is evaluated. This method yields insights into the sensitivity of the model to these alterations and therefore to the importance of certain features on segmentation performance. Results We present an open-source Python library (misas), that facilitates the use of sensitivity analysis with arbitrary data and models. We show that this method is a suitable approach to answer practical questions regarding use and functionality of segmentation models. We demonstrate this in two case studies on cardiac magnetic resonance imaging. The first case study explores the suitability of a published network for use on a public dataset the network has not been trained on. The second case study demonstrates how sensitivity analysis can be used to evaluate the robustness of a newly trained model. Conclusions Sensitivity analysis is a useful tool for deep learning developers as well as users such as clinicians. It extends their toolbox, enabling and improving interpretability of segmentation models. Enhancing our understanding of neural networks through sensitivity analysis also assists in decision making. Although demonstrated only on cardiac magnetic resonance images this approach and software are much more broadly applicable. KW - deep learning KW - neural networks KW - cardiac magnetic resonance KW - sensitivity analysis KW - transformations KW - augmentation KW - segmentation Y1 - 2021 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:bvb:20-opus-259169 VL - 21 IS - 1 ER - TY - RPRT A1 - Baumgart, Michael A1 - Bredebach, Patrick A1 - Herm, Lukas-Valentin A1 - Hock, David A1 - Hofmann, Adrian A1 - Janiesch, Christian A1 - Jankowski, Leif Ole A1 - Kampik, Timotheus A1 - Keil, Matthias A1 - Kolb, Julian A1 - Kröhn, Michael A1 - Pytel, Norman A1 - Schaschek, Myriam A1 - Stübs, Oliver A1 - Winkelmann, Axel A1 - Zeiß, Christian ED - Winkelmann, Axel ED - Janiesch, Christian T1 - Plattform für das integrierte Management von Kollaborationen in Wertschöpfungsnetzwerken (PIMKoWe) N2 - Das Verbundprojekt „Plattform für das integrierte Management von Kollaborationen in Wertschöpfungsnetzwerken“ (PIMKoWe – Förderkennzeichen „02P17D160“) ist ein Forschungsvorhaben im Rahmen des Forschungsprogramms „Innovationen für die Produktion, Dienstleistung und Arbeit von morgen“ der Bekanntmachung „Industrie 4.0 – Intelligente Kollaborationen in dynamischen Wertschöpfungs-netzwerken“ (InKoWe). Das Forschungsvorhaben wurde mit Mitteln des Bundesministeriums für Bildung und Forschung (BMBF) gefördert und durch den Projektträger des Karlsruher Instituts für Technologie (PTKA) betreut. Ziel des Forschungsprojekts PIMKoWe ist die Entwicklung und Bereitstellung einer Plattformlösung zur Flexibilisierung, Automatisierung und Absicherung von Kooperationen in Wertschöpfungsnetzwerken des industriellen Sektors. T3 - Working Paper Series of the Institute of Business Management - 8 KW - Blockchain KW - Supply Chain Management KW - Blockchain KW - Plattform KW - Wertschöpfungsnetzwerke KW - Supply Chain Networks Y1 - 2022 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:bvb:20-opus-293354 SN - 2199-0328 ER -