Fault tolerance with shortest paths in regular and irregular networks.
Frank Olaf Sem-JacobsenOlav LysnePublished in: IPDPS (2008)
Keyphrases
- fault tolerance
- shortest path
- fault tolerant
- path length
- node failures
- distributed systems
- shortest path algorithm
- shortest path problem
- load balancing
- distributed computing
- response time
- betweenness centrality
- road network
- mobile agents
- replicated databases
- peer to peer
- finding the shortest path
- group communication
- weighted graph
- database replication
- fault management
- network design
- edge weights
- optimal path
- flow graph
- travel time
- single point of failure
- routing algorithm
- computer networks
- error detection
- network structure
- geodesic distance
- social networks
- minimum cost flow
- failure recovery
- distance transformation
- minimal surface
- complex networks
- strongly connected components
- artificial intelligence
- component failures