Sciweavers

2947 search results - page 76 / 590
» The timely token protocol
Sort
View
COMCOM
2006
96views more  COMCOM 2006»
15 years 4 months ago
Design and implementation of a dynamic protocol framework
-- Future distributed applications are expected to be deployed in an environment that is more dynamic and heterogeneous than ever before. The environment features are difficult to ...
Liming An, Hung Keng Pung, Lifeng Zhou
ICPADS
2006
IEEE
15 years 10 months ago
Snap-Stabilizing PIF and Useless Computations
A snap-stabilizing protocol, starting from any configuration, always behaves according to its specification. In other words, a snap-stabilizing protocol is a self-stabilizing pr...
Alain Cournier, Stéphane Devismes, Vincent ...
SAPIR
2004
Springer
15 years 9 months ago
Probabilistic Routing in Intermittently Connected Networks
We consider the problem of routing in intermittently connected networks. In such networks there is no guarantee that a fully connected path between source and destination exist at...
Anders Lindgren, Avri Doria, Olov Schelén
ESA
2001
Springer
110views Algorithms» more  ESA 2001»
15 years 9 months ago
Round Robin Is Optimal for Fault-Tolerant Broadcasting on Wireless Networks
We study the completion time of broadcast operations on static ad hoc wireless networks in presence of unpredictable and dynamical faults. Concerning oblivious fault-tolerant dist...
Andrea E. F. Clementi, Angelo Monti, Riccardo Silv...
CHARME
2003
Springer
110views Hardware» more  CHARME 2003»
15 years 8 months ago
Exact and Efficient Verification of Parameterized Cache Coherence Protocols
Abstract. We propose new, tractably (in some cases provably) efficient algorithmic methods for exact (sound and complete) parameterized reasoning about cache coherence protocols. F...
E. Allen Emerson, Vineet Kahlon