Edges-disjoint spanning trees on the binary wrapped butterfly network with applications to fault tolerance.
Abderezak TouzenePublished in: Parallel Comput. (2002)
Keyphrases
- spanning tree
- fault tolerance
- fault tolerant
- edge disjoint
- peer to peer
- minimum spanning tree
- minimum cost
- high availability
- distributed systems
- load balancing
- undirected graph
- response time
- minimum spanning trees
- fault management
- database replication
- group communication
- single point of failure
- distributed computing
- component failures
- mobile agents
- replicated databases
- failure recovery
- data replication
- edge weights
- mobile agent system
- multi agent
- upper bound
- artificial intelligence
- metadata