5934 search results - page 95 / 1187 » Detecting a Network Failure |
125
click to vote
STOC
2010
ACM
15 years 8 months ago
2010
ACM
Dynamic graph connectivity algorithms have been studied for many years, but typically in the most general possible setting, where the graph can evolve in completely arbitrary ways...
127
click to vote
MOBIHOC
2008
ACM
16 years 3 months ago
2008
ACM
It was shown recently [7?9], under quite general conditions, that retransmission-based protocols may result in power-law delays and possibly zero throughput even if the distributi...
123
Voted
SPAA
2009
ACM
16 years 4 months ago
2009
ACM
Dining philosophers is a classic scheduling problem for local mutual exclusion on arbitrary conflict graphs. We establish necessary conditions to solve wait-free dining under even...
130
click to vote
IM
2003
15 years 5 months ago
2003
: Poison message failure propagation is a mechanism that has been responsible for large scale failures in both telecommunications and IP networks: Some or all of the network elemen...
111
click to vote
ITC
2000
IEEE
15 years 8 months ago
2000
IEEE
Concurrent error detection (CED) techniques (based on hardware duplication, parity codes, etc.) are widely used to enhance system dependability. All CED techniques introduce some ...