de
en
Schliessen
Detailsuche
Bibliotheken
Projekt
Impressum
Datenschutz
Schliessen
Publizieren
Besondere Sammlungen
Digitalisierungsservice
Hilfe
Impressum
Datenschutz
zum Inhalt
Detailsuche
Schnellsuche:
OK
Ergebnisliste
Titel
Titel
Inhalt
Inhalt
Seite
Seite
Im Werk suchen
Local graph transformation primitives for some basic problems in Overlay networks / submitted by Alexander Setzer ; [Reviewers: Prof. Dr. Christian Scheideler, Prof. Dr. Friedhelm Meyer auf der Heide]. Paderborn, 2020
Inhalt
Abstract
Zusammenfassung
Contents
Introduction
Four Basic Graph Transformation Primitives
Motivation
Related Work
List of Own Publications
Contribution and Outline of the Thesis
Preliminaries
Model Overview
Further Known Results and Additional Terminology
Formal Problem Definitions
Pseudocode Explanation
The Complexity of Local Graph Transformations
NP-Hardness and Approximability of Local Graph Transformations
Problem Statement
NP-hardness Results
Approximation Algorithms
Monotonic Searchability in Self-Stabilizing Topologies
Monotonic Searchability for Supergraphs of the Line
Communication Model and Problem Statement
Primitives for Monotonic Searchability
Transforming Classical Protocols
The Generic Search Protocol
Examples
A Short Digression: The Bridge-SKIP+ Graph
Monotonic Searchability under Leaving Nodes
Problem Statement
Protocol Description of Build-List* and Search*
Build-List* Solves the FDP
Build-List* Self-Stabilizes to the Line Topology
Build-List* Satisfies Monotonic Searchability
Relays: A New Interconnection Model for Overlay Networks
The Relay Model and Its Self-Stabilizing Realization
Communication Model and Problem Statement
The Relay Layer
Self-Stabilization Proofs
Universal Relay Primitives
Solving the FDP with Relays
Conclusion
Applications and Open Research Questions
Bibliography
Die detaillierte Suchanfrage erfordert aktiviertes Javascript.