Publication

Routing Attacks as a Viable Threat: Can Software Systems Protect Themselves?

Publications associées (34)

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search

Self-Organizing Subsets: From Each According to His Abilities, To Each According to His Needs

Dejan Kostic

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 ...

2002

Chasing the FLP Impossibility Result in a LAN or How Robust Can a Fault Tolerant Server Be?

André Schiper, Xavier Défago

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 ...

2001

Genuine atomic multicast in asynchronous distributed systems

Rachid Guerraoui, André Schiper

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 ...

2001

Solving consensus

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 ...

EPFL2000

The Semantics of COALA in CO-OPN/2

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 ...

1999

Generic Broadcast

André Schiper, Fernando Pedone

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 ...

1999

Transparent Replication for Fault Tolerance in Distributed Ada 95

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 ...

ACM Press1999

Fault Tolerance by Transparent Replication for Distributed Ada 95

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 ...

Springer Verlag1999

Soft real-time analysis of asynchronous agreement algorithms using Petri nets

Nicoleta Sergent

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 ...

EPFL1998

Exploiting Various Levels of Semantics in CO-OPN for the SANDS Environment Tools

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 ...

1997