Routing Attacks as a Viable Threat: Can Software Systems Protect Themselves?
Graph Chatbot
Chat with Graph Search
Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
Fault tolerance can be achieved in distributed systems by replication. However, Fischer, Lynch and Paterson have proven an impossibility result about consensus in the asynchronous system model. Similar impossibility results have been established for atomic ...
This report presents the formal semantics of COALA, a design language based on the concept of Coordinated Atomic Actions (CA actions). COALA has been developped with the intent of providing a concrete language to express CA actions and thus facilitate the ...
Distributed systems are the basis of widespread computing facilities enabling many of our daily life activities. Telebanking, electronic commerce, online booking-reservation, and telecommunication are examples of common services that rely on distributed sy ...
The key principles behind current peer-to-peer research include fully distributing service functionality among all nodes participating in the system and routing individual requests based on a small amount of locally maintained state. The goals extend much ...
Message ordering is a fundamental abstraction in distributed systems. However, usual ordering guarantees are purely syntactic'', that is, message semantics'' is not taken into consideration, despite the fact that in several cases semantic information a ...
A distributed algorithm comprises a collection of sequential-code entities, which are spread over different computers connected to a network. The process of designing a distributed algorithm is influenced by the assumptions we make on the computational env ...
This paper describes the techniques and tools developed to support the construction of CO-OPN specifications (Concurrent Object Oriented Petri Nets) [7] and the kind of semantics that are needed for each part of the environment. CO-OPN is a specification l ...
This paper presents the foundations of Rapids ("Replicated Ada Partitions In Distributed Systems"), an implementation of the Distributed Systems Annex E incorporating the transparent replication of partitions in distributed Ada 95 applications. Rapids is a ...
In this paper we present the foundations of Rapids ("Replicated Ada Partitions In Distributed Systems"), an implementaion of the PCS supporting the transparent replication of partitions in distributed Ada 95 using semi-active replication. The inherently no ...
This paper addresses the problem of atomic multicasting messages in asynchronous distributed systems. Firstly, we give a characterization of the notion of ``genuine atomic multicast''. This characterization leads to a better understanding of the difference ...
