Byzantine consensus in asynchronous message-passing systems has been shown to require at least 3f + 1 processes to be solvable in several system models (e.g., with failure detecto...
Miguel Correia, Giuliana Santos Veronese, Lau Cheu...
Distributed storage systems apply erasure-tolerant codes to guarantee reliable access to data despite failures of storage resources. While many codes can be mapped to XOR operatio...
Abstract— Paths with loops, even transient ones, pose significant stability problems in high-speed networks. We present a new algorithm, named Distributed Path Computation with ...
We study the problem of data propagation in sensor networks, comprised of a large number of very small and low-cost nodes, capable of sensing, communicating and computing. The dis...
Ioannis Chatzigiannakis, Tassos Dimitriou, Sotiris...
Wide-area networks provide an easy access to many different distributed and heterogeneous data sources. The development of automated operating tools is still complex, particularly...
Jean-Paul Arcangeli, Sebastien Leriche, Marc Pante...