On the Limits of Byzantine-tolerant Spanning Tree Construction in Route-Restricted Overlay Networks.
Martin ByrenheidStefanie RoosThorsten StrufePublished in: CoRR (2019)
Keyphrases
- spanning tree
- overlay network
- structured peer to peer
- minimum spanning tree
- minimum cost
- peer to peer
- publish subscribe
- minimum spanning trees
- peer to peer file sharing
- minimum weight
- network topology
- fault tolerant
- edge disjoint
- undirected graph
- minimum total cost
- shortest path
- weighted graph
- fault tolerance
- wireless networks
- bandwidth consumption
- computational complexity