309 search results - page 46 / 62 » Fault Tolerance of Embryonic Algorithms in Mobile Networks |
SIROCCO
2003
14 years 11 months ago
2003
For networks employing shortest-path routing, we introduce a new recovery scheme which needs only one backup routing table. By precomputing this backup table, the network recovers...
MOBIHOC
2008
ACM
15 years 9 months ago
2008
ACM
A Connected Dominating Set (CDS) working as a virtual backbone is an effective way to decrease the overhead of routing in a wireless sensor network. Furthermore, a kConnected m-Do...
DSN
2011
IEEE
13 years 9 months ago
2011
IEEE
Computer systems are usually made fault tolerant through replication. By replicating a service on multiple servers we make sure that if some replicas fail, the service can still b...
ISPDC
2008
IEEE
15 years 4 months ago
2008
IEEE
Self-stabilizing token circulation algorithms are not always adapted for dynamic networks. Random walks are well known to play a crucial role in the design of randomized algorithm...
100
click to vote
CONCURRENCY
2000
14 years 9 months ago
2000
The 1990s are seeing the explosive growth of the Internet and Web-based information sharing and dissemination systems. The Internet is also showing a potential of forming of a sup...