Sciweavers

881 search results - page 116 / 177
» A Model of Tolerance
Sort
View
SPAA
2010
ACM
15 years 4 months ago
Brief announcement: byzantine agreement with homonyms
In this work, we address Byzantine agreement in a message passing system with homonyms, i.e. a system with a number l of authenticated identities that is independent of the total ...
Carole Delporte-Gallet, Hugues Fauconnier, Rachid ...
CONEXT
2009
ACM
15 years 1 months ago
Content availability and bundling in swarming systems
BitTorrent, the immensely popular file swarming system, suffers a fundamental problem: content unavailability. Although swarming scales well to tolerate flash crowds for popular c...
Daniel Sadoc Menasché, Antonio Augusto de A...
JCP
2006
100views more  JCP 2006»
14 years 12 months ago
A Local Enumeration Protocol in Spite of Corrupted Data
We present a novel self-stabilizing version of Mazurkiewicz enumeration algorithm [1]. The initial version is based on local rules to enumerate nodes on an anonymous network. [2] p...
Brahim Hamid, Mohamed Mosbah
MOBIHOC
2003
ACM
15 years 5 months ago
PAN: providing reliable storage in mobile ad hoc networks with probabilistic quorum systems
Reliable storage of data with concurrent read/write accesses (or query/update) is an ever recurring issue in distributed settings. In mobile ad hoc networks, the problem becomes e...
Jun Luo, Jean-Pierre Hubaux, Patrick Th. Eugster
IPPS
2007
IEEE
15 years 6 months ago
The Next Generation Software Workshop - IPDPS'07
This workshop provides a forum for an overview, project presentations, and discussion of the research fostered and funded initially by the NSF Next Generation Software (NGS) Progr...
Frederica Darema