Concept

Fiabilité (réseau informatique)

Publications associées (120)

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

Friend-to-Friend Computing: Building the Social Web at the Internet Edges

Wojciech Galuba

The current Social Web is centralized. Large information silos store all the users’ profiles, their social links and much of the other personal data. In return for the reliable service the users allow their data and activities to be data mined by the servi ...

2008

Virtual Infrastructure for Collision-Prone Wireless Networks

Seth Gilbert

Wireless ad hoc networks pose several significant challenges: devices are unreliable; deployments are unpredictable; and communication is erratic. One proposed solution is Virtual Infrastructure, an abstraction in which unpredictable and unreliable devices ...

2008

Landau Expansion for Ferroelectrics: Which Variable to Use?

Alexander Tagantsev

The problem of the choice of the order parameter of the Landau expansion of proper ferroelectrics is discussed. The expansion with respect to the (i) electric displacement, (ii) polarization, (iii) ferroelectric contribution to the polarization, (iv) "orde ...

2008

On the Specification of Partitionable Group Membership

André Schiper, Stefan Pleisch, Olivier Rütti

Group communication in partitionable systems has been the focus of many research activities over the last decade. Fault-tolerant applications in a partitionable system model generally rely on two basic services: a group membership service and a reliable mu ...

IEEE Computer Society2008

Broadcast and Slepian-Wolf multicast over Aref Networks

Satish Babu Korada, Dinkar Vasudevan

We consider source coding over Aref networks. In particular we consider the following two problems: (i) multicasting correlated sources to a set of receivers, (ii) broadcasting sources to their respective receivers. For the first problem we show necessary ...

2008

A Method for Routing Packets Across Multiple Paths in NoCs with In-Order Delivery and Fault-Tolerance Guarantees

Giovanni De Micheli, David Atienza Alonso, Luca Benini, Srinivasan Murali

Networks on Chips (NoCs) are required to tackle the increasing delay and poor scalability issues of bus-based communication architectures. Many of today’s NoC designs are based on single path routing. By utilizing multiple paths for routing, congestion in ...

Hindawi Publications2007

The Perfectly-Synchronized Round-based Model of Distributed Computing

Rachid Guerraoui, Bastian Pochon

The perfectly-synchronized round-based model provides the powerful abstraction of crash-stop failures with atomic and synchronous message delivery. This abstraction makes distributed programming very easy.We describe a technique to automatically transform ...

2007

On feedback for network coding

Christina Fragouli

In this paper we examine possible ways that feedback can be used, in the context of systems with network coding capabilities. We illustrate, through a number of simple examples, that use of feedback can be employed for parameter adaptation to satisfy QoS r ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2007

On feedback for network coding

Christina Fragouli

2007

MFACE: A Multicast Backbone-Assisted Face Traversal Algorithm for Arbitrary Planar Ad Hoc and Sensor Network Topologies

François Ingelrest

Face is a well-known localized routing protocol for ad hoc and sensor networks which guarantees delivery of the message as long as a path exists between the source and the destination. This is achieved by employing a left/right hand rule to route the messa ...

2007