8 search results - page 1 / 2 » Byzantine Failures and Security: Arbitrary is not (always) R... |
GI
2003
Springer
13 years 10 months ago
2003
Springer
: The Byzantine failure model allows arbitrary behavior of a certain fraction of network nodes in a distributed system. It was introduced to model and analyze the effects of very s...
ICALP
2004
Springer
13 years 10 months ago
2004
Springer
In order to enable communication between a dynamic collection of peers with given ID’s, such as “machine.cs.school.edu”, over the Internet, a distributed name service must b...
OPODIS
2010
13 years 2 months ago
2010
: Provide application processes with strong agreement guarantees despite failures is a fundamental problem of fault-tolerant distributed computing. Correct processes have not to be...
PDPTA
2008
13 years 6 months ago
2008
Abstract - With the growth of the Internet and increased demand for Web Services has come a heightened need for scalable wide-area group communication systems. The need for trust i...
OPODIS
2008
13 years 6 months ago
2008
Abstract. We consider the problem of Rendezvous or gathering of multiple autonomous entities (called mobile agents) moving in an unlabelled environment (modelled as a graph). The p...