An Efficient And Scalable Intrusion Detection System On Logs Of Distributed Applications | 0 | 0.34 | 2019 |
A Scalable and Efficient Correlation Engine to Detect Multi-Step Attacks in Distributed Systems | 0 | 0.34 | 2018 |
Towards a Restrained Use of Non-Equivocation for Achieving Iterative Approximate Byzantine Consensus | 1 | 0.36 | 2016 |
Inferring a Distributed Application Behavior Model for Anomaly Based Intrusion Detection | 0 | 0.34 | 2016 |
Reputation Propagation and Updating in Mobile Ad Hoc Networks with Byzantine Failures | 0 | 0.34 | 2015 |
Generation and assessment of correlation rules to detect complex attack scenarios | 0 | 0.34 | 2015 |
Assessment of an Automatic Correlation Rules Generator. | 0 | 0.34 | 2015 |
Reputation Propagation and Updating in Mobile Ad Hoc Networks with Byzantine Failures | 0 | 0.34 | 2015 |
Clock Synchronization in Mobile Ad Hoc Networks Based on an Iterative Approximate Byzantine Consensus Protocol | 0 | 0.34 | 2014 |
Reliable mobile agents with transactional behaviour | 0 | 0.34 | 2014 |
Approximate Byzantine consensus in sparse, mobile ad-hoc networks | 3 | 0.41 | 2014 |
Adaptive Strategies for Speeding Up Sequences of Consensus | 0 | 0.34 | 2012 |
Reconstruction attack through classifier analysis | 0 | 0.34 | 2012 |
Brief announcement: reaching approximate byzantine consensus in partially-connected mobile networks | 2 | 0.38 | 2012 |
Providing Reliability for Transactional Mobile Agents. | 0 | 0.34 | 2012 |
Évaluation de politiques d'adaptation au risque de collisions dans un consensus de type « Fast Paxos ». | 0 | 0.34 | 2012 |
AMORES: an architecture for mobiquitous resilient systems | 3 | 0.42 | 2012 |
Reaching Approximate Byzantine Consensus in Partially-Connected Mobile Networks | 1 | 0.40 | 2012 |
An Adaptive Fast Paxos for Making Quick Everlasting Decisions | 1 | 0.35 | 2011 |
Cloud-Based Support for Transactional Mobile Agents | 1 | 0.35 | 2011 |
From SSIR to CIDre: A New Security Research Group in Rennes, France | 0 | 0.34 | 2011 |
Remote Reliable Services to Support Transactional Mobile Agents | 0 | 0.34 | 2010 |
Design and Performance Evaluation of a Resource Allocation System Based on Agreement Services | 0 | 0.34 | 2008 |
Evaluating the Impact of Simultaneous Round Participation and Decentralized Decision on the Performance of Consensus | 4 | 0.42 | 2007 |
Clock synchronization in the Byzantine-recovery failure model | 2 | 0.36 | 2007 |
Using agreement services in grid computing | 1 | 0.37 | 2006 |
A dependable intrusion detection architecture based on agreement services | 2 | 0.42 | 2006 |
OPEN EDEN: a portable fault tolerant CORBA architecture | 3 | 0.39 | 2003 |
A Fault-Tolerant Protocol for Resource Allocation in a Grid Dedicated to Genomic Applications | 3 | 0.46 | 2003 |
Solving the group priority inversion problem in a timed asynchronous system | 4 | 0.40 | 2002 |
An Efficient Solution to the k-Set Agreement Problem | 1 | 0.38 | 2002 |
Avoiding Priority Inversion on the Processing of Requests by Active Replicated Servers | 4 | 0.42 | 2001 |
A Consensus Protocol Based on a Weak FailureDetector and a Sliding Round Window | 0 | 0.34 | 2001 |
Primary Component Asynchronous Group Membership as an Instance of a Generic Agreement Framework | 7 | 0.69 | 2001 |
Eva: An Event-Based Framework for Developing Specialized Communication Protocols | 8 | 0.62 | 2001 |
Consensus Based on Strong Failure Detectors: A Time and Message-Efficient Protocol | 4 | 0.45 | 2000 |
Time and message-efficient S-based consensus (brief announcement) | 2 | 0.47 | 2000 |
A simple and fast asynchronous consensus protocol based on a weak failure detector | 56 | 3.47 | 1999 |
A General Framework to Solve Agreement Problems | 35 | 1.60 | 1999 |
Consensus in asynchronous systems where processes can crash and recover | 42 | 3.62 | 1998 |
Efficient Distributed Detection of Conjunctions of Local Predicates | 29 | 1.28 | 1998 |
On-the-Fly Detection of Conjunctions of Local Predicates in Distributed Computations | 2 | 0.42 | 1996 |
Detecting Diamond Necklaces in Labeled Dags (A Problem from Distributed Debugging) | 0 | 0.34 | 1996 |
On Granularity of Events in Distributed Computations. | 0 | 0.34 | 1994 |
On-the-fly replay: a practical paradigm and its implementation for distributed debugging. | 7 | 0.71 | 1994 |
Debugging Tool For Distributed Estelle Programs | 9 | 0.76 | 1993 |
Detecting atomic sequences of predicates in distributed computations | 29 | 2.50 | 1993 |