5934 search results - page 102 / 1187 » Detecting a Network Failure |
115
click to vote
IJFCS
2006
15 years 3 months ago
2006
ion for Parametric Time-Interval Automata Akio Nakata, Tadaaki Tanimoto, Suguru Sasaki, Teruo Higashino Department of Information Networking, Graduate School of Information Science...
152
click to vote
SIGECOM
2005
ACM
15 years 9 months ago
2005
ACM
We introduce a new class of games, congestion games with failures (CGFs), which extends the class of congestion games to allow for facility failures. In a basic CGF (BCGF) agents ...
132
click to vote
PPL
2000
15 years 3 months ago
2000
In this paper we analyze the computational power of random geometric networks in the presence of random (edge or node) faults considering several important network parameters. We ...
140
Voted
PODC
2009
ACM
15 years 10 months ago
2009
ACM
We study communication complexity of consensus in synchronous message-passing systems with processes prone to crashes. The goal in the consensus problem is to have all the nonfaul...
141
Voted
EUROPAR
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. The performance of consensus and atomic broadcast algorithms using failure detectors is often affected by a trade-off between the number of communication steps and the ...