3 papers
cs.CR2021
Topology Inference of Networks utilizing Rooted Spanning Tree Embeddings
Martin Byrenheid, Stefanie Roos, Thorsten Strufe
Due to its high efficiency, routing based on greedy embeddings of rooted spanning trees is a promising approach for dynamic, large-scale networks with restricted topologies. Friend…
cs.CR2019
Attack-resistant Spanning Tree Construction in Route-Restricted Overlay Networks
Martin Byrenheid, Stefanie Roos, Thorsten Strufe
Nodes in route-restricted overlays have an immutable set of neighbors, explicitly specified by their users. Popular examples include payment networks such as the Lightning network…
cs.NI2017
Balanced Dynamic Content Addressing in Trees
Stefanie Roos, Martin Byrenheid, Clemens Deusser +1
Balancing the load in content addressing schemes for route-restricted networks represents a challenge with a wide range of applications. Solutions based on greedy embeddings mainta…