... atomic broadcast protocol that is suitable for building highly available and intrusion-tolerantservices in the ... system that the adversary can exploit, for example, through denial-of-service attacks. ... polynomial-time feasibility... more
... atomic broadcast protocol that is suitable for building highly available and intrusion-tolerantservices in the ... system that the adversary can exploit, for example, through denial-of-service attacks. ... polynomial-time feasibility of randomized agreement [5,6,7] and atomic broadcast [8 ...
Research Interests:
Research Interests:
Research Interests:
Anomaly Detection in Network Traffic Based on Statistical Inference and ��-Stable Modeling F. Simmross-Wattenberg, JI Asensio-P��rez, P. Casaseca-de-la-Higuera, M. Mart��n-Fern��ndez, IA Dimitriadis, and C. Alberola-L��pez... more
Anomaly Detection in Network Traffic Based on Statistical Inference and ��-Stable Modeling F. Simmross-Wattenberg, JI Asensio-P��rez, P. Casaseca-de-la-Higuera, M. Mart��n-Fern��ndez, IA Dimitriadis, and C. Alberola-L��pez ................................................................. ..................................................................................... ... ... Efficient Fault Detection and Diagnosis in Complex Software Systems with Information-Theoretic Monitoring M. Jiang, MA Munawar, T. Reidemeister, and PAS Ward...............................................................................................
Research Interests:
Page 18. Declarative Security Specification of Virtual Networks (Position Paper) Serdar Cabuk Chris I. Dalton Hewlett-Packard Labs, Bristol, United Kingdom serdar. cabuk@ hp. com, cid@ hp. com HariGovind Ramasamy IBM ...
We propose a resource-e-cient way to execute requests in Byzantine-fault-tolerant replication that is particularly well-suited for services in which request processing is resource-intensive. Previous ef- forts took a failure-masking... more
We propose a resource-e-cient way to execute requests in Byzantine-fault-tolerant replication that is particularly well-suited for services in which request processing is resource-intensive. Previous ef- forts took a failure-masking all-active approach of using all 2t+1 execu- tion replicas to execute all requests, where t is the maximum number of failures tolerated. We describe an asynchronous execution protocol that combines failure
Research Interests:
In this paper, we present the architecture of CoBFIT, a component-based framework for building intrusion-tolerant distributed systems. The CoBFIT framework, by virtue of its design and implementation principles, can serve as a convenient... more
In this paper, we present the architecture of CoBFIT, a component-based framework for building intrusion-tolerant distributed systems. The CoBFIT framework, by virtue of its design and implementation principles, can serve as a convenient base for building components that implement intrusion-tolerant protocols and for combining these com- ponents in an efficient manner to provide a number of ser- vices for dependability.
Research Interests:
Research Interests:
survive certain kinds of attacks. The goal of this paper is to introduce several features of the ITUA project that are illus-trated in a use scenario. Section 2 explains the importance of unpredictable adaptation in intrusion tolerance.... more
survive certain kinds of attacks. The goal of this paper is to introduce several features of the ITUA project that are illus-trated in a use scenario. Section 2 explains the importance of unpredictable adaptation in intrusion tolerance. Section 3 presents the assumptions made by the ITUA project. The remaining sections address the ITUA architecture. In Sec-tion 4, we give a
Research Interests:
Research Interests:
Research Interests:
Research Interests:
Research Interests:
Research Interests:
... 9. Alfred J. Menezes , Scott A. Vanstone , Paul C. Van Oorschot, Handbook of Applied Cryptography, CRC Press, Inc., Boca Raton, FL ... 27. Navin Budhiraja , Keith Marzullo , Fred B. Schneider , Sam Toueg, The primary-backup approach,... more
... 9. Alfred J. Menezes , Scott A. Vanstone , Paul C. Van Oorschot, Handbook of Applied Cryptography, CRC Press, Inc., Boca Raton, FL ... 27. Navin Budhiraja , Keith Marzullo , Fred B. Schneider , Sam Toueg, The primary-backup approach, Distributed systems (2nd Ed.), ACM Press ...
Research Interests:
... Under load conditions, the VMs can be seamlessly migrated (using live migration technology [6]) to a lightly loaded or a more powerful ... service running inside the VM is stateful, then additional techniques based on a combi-nation... more
... Under load conditions, the VMs can be seamlessly migrated (using live migration technology [6]) to a lightly loaded or a more powerful ... service running inside the VM is stateful, then additional techniques based on a combi-nation of VM checkpointing and VM live migration [6 ...
Research Interests:
... my work and for their contribution to the ITUA project. I owe a big thanks to all the other PERFORM group members: Ryan, Kaustubh, Sudha, ... UIUC University of Illinois at Urbana-Champaign UCSB University of California at Santa... more
... my work and for their contribution to the ITUA project. I owe a big thanks to all the other PERFORM group members: Ryan, Kaustubh, Sudha, ... UIUC University of Illinois at Urbana-Champaign UCSB University of California at Santa Barbara LAN Local Area Network ...
Research Interests:
We describe a Byzantine-fault-tolerant state machine replication algorithm that reduces computation and commu- nication costs in the fault-free case, and is reasonably efficient even in the presence of faults. Such an algorithm is... more
We describe a Byzantine-fault-tolerant state machine replication algorithm that reduces computation and commu- nication costs in the fault-free case, and is reasonably efficient even in the presence of faults. Such an algorithm is practically significant, because failures are the exception than the norm, and much of a system's runtime is fault-free. The algorithm is geared towards applications that require Byzantine-fault
Research Interests:
Fault-tolerant distributed protocols, by definition, are designed with the worst in mind. This focus on tol-erating the worst often leads to expensive designs that overlook the practical observation that the occurrence of disruptions and... more
Fault-tolerant distributed protocols, by definition, are designed with the worst in mind. This focus on tol-erating the worst often leads to expensive designs that overlook the practical observation that the occurrence of disruptions and failures is rare relative to the lifetime or mission periods of many systems. The class of opti-mistic fault-tolerant protocols leverages that observation and strives to achieve
Research Interests:
Research Interests:
Semi-passive replication is a variant of passive replication that does not rely on a group membership service. D´ efago et al. (4) defined the semi-passive replication concept in the crash fault model and described a semi-passive... more
Semi-passive replication is a variant of passive replication that does not rely on a group membership service. D´ efago et al. (4) defined the semi-passive replication concept in the crash fault model and described a semi-passive replication algorithm based on a lazy consensus algorithm. In this paper, we consider semi- passive replication and lazy consensus for a Byzantine fault model.
Research Interests:
Research Interests:
... fault injection scenarios. iii Page 4. To Rachel, Amma, Naina, and Ashok. iv Page 5. ... through the completion of this thesis. I am also very thankful to Rachel's family for their kindness and support. Finally, I would like to... more
... fault injection scenarios. iii Page 4. To Rachel, Amma, Naina, and Ashok. iv Page 5. ... through the completion of this thesis. I am also very thankful to Rachel's family for their kindness and support. Finally, I would like to thank my friends Nitin Aggarwal, Prof. Raghupathy Sivakumar, ...
Virtual data centers allow the hosting of virtualized infrastructures (networks, storage, machines) that belong to several customers on the same physical infrastructure. Virtualization theoretically provides the capability for sharing the... more
Virtual data centers allow the hosting of virtualized infrastructures (networks, storage, machines) that belong to several customers on the same physical infrastructure. Virtualization theoretically provides the capability for sharing the infrastructure among ...