Sciweavers

313 search results - page 16 / 63
» Computing synchronizer failure probabilities
Sort
View
IJACT
2010
90views more  IJACT 2010»
14 years 6 months ago
Unconditionally reliable and secure message transmission in undirected synchronous networks: possibility, feasibility and optima
: We study the interplay of network connectivity and the issues related to the `possibility', `feasibility' and `optimality' for unconditionally reliable message tra...
Arpita Patra, Ashish Choudhury, C. Pandu Rangan, K...
SIROCCO
2008
15 years 1 months ago
Self-stabilizing Cuts in Synchronous Networks
Consider a synchronized distributed system where each node can only observe the state of its neighbors. Such a system is called selfstabilizing if it reaches a stable global state ...
Thomas Sauerwald, Dirk Sudholt
JSAC
2006
121views more  JSAC 2006»
14 years 11 months ago
Code-aided ML joint synchronization and channel estimation for downlink MC-CDMA
Abstract--In this paper, we present a novel code-aided joint synchronization and channel estimation algorithm for downlink multicarrier code-division multiple access. The expectati...
Mamoun Guenach, Henk Wymeersch, Heidi Steendam, Ma...
GI
2004
Springer
15 years 5 months ago
Crash Management for Distributed Parallel Systems
: With the growing complexity of parallel architectures, the probability of system failures grows, too. One approach to cope with this problem is the self-healing, one of the organ...
Jan Haase, Frank Eschmann
DSN
2002
IEEE
15 years 4 months ago
Small Byzantine Quorum Systems
In this paper we present two protocols for asynchronous Byzantine Quorum Systems (BQS) built on top of reliable channels—one for self-verifying data and the other for any data. ...
Jean-Philippe Martin, Lorenzo Alvisi, Michael Dahl...