Concept

Reliability (computer networking)

Related publications (120)

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.

Deterministic End-to-End Delay Guarantees in a Heterogeneous Route Interference Environment

Jean-Yves Le Boudec

Some of the known results for delivering deterministic bounds on end-to-end queuing delay in networks with constant packet sizes and constant link rates rely on the concept of Route Interference. Namely, it is required to know the number of flows joining o ...

2003

Optimistic atomic broadcast: a pragmatic viewpoint

André Schiper, Fernando Pedone

Optimistic atomic broadcast: a pragmatic viewpoint F.Pedone and A.Schiper This paper presents the Optimistic Atomic Broadcast algorithm (OPT-ABcast) which exploits the spontaneous total-order property experienced in local-area networks in order to allow fa ...

2003

Updates in Highly Unreliable, Replicated Peer-to-Peer Systems

Karl Aberer, Manfred Hauswirth, Anwitaman Datta

In this paper we study the problem of updates in truly decentralised and self-organising systems such as pure P2P systems. We assume low online probabilities of the peers (

2003

Dynamic Group Communication

André Schiper

Group communication is the basic infrastructure for implementing fault-tolerant replicated servers. While group communication is well understood in the context of static systems (in which all processes are created at the start of the computation), current ...

2003

Probabilistic Guarantees and Algorithms for Ad Hoc Networks

Patrick Eugster

Reasoning about the success of distributed computations in the face of node and communication failures is an ever hard issue. This is particularly true in highly dynamic ad hoc networks where communication between two nodes can often take place only via in ...

2003

Route Driven Gossip: Probabilistic Reliable Multicast in Ad Hoc Networks

Jean-Pierre Hubaux, Jun Luo, Patrick Eugster

Traditionally, reliable multicast protocols are deterministic in nature. It is precisely this determinism which tends to become their limiting factor when aiming at reliability and scalability, particularly in highly dynamic networks, e.g., ad hoc networks ...

2003

Route Driven Gossip: Probabilistic Reliable Multicast in Ad Hoc Networks

Jean-Pierre Hubaux, Patrick Eugster

Traditionally, reliable multicast protocols are deterministic in nature. It is precisely this determinism that tends to become their limiting factor when aiming at reliability and scalability, particularly in highly dynamic networks, e.g., ad hoc networks. ...

2003

A Cooperative Backup System

Sameh Mohamed Elnikety

We present a novel peer-to-peer backup technique that allows computers connected to the Internet to back up their data cooperatively: Each computer has a set of partner computers, which collectively hold its backup data. In return, it holds a part of each ...

2003

Optimal Filter Banks for Multiple Description Coding: Analysis and Synthesis

Martin Vetterli, Pier Luigi Dragotti

Multiple description (MD) coding is a source coding technique for information transmission over unreliable networks. In MD coding, the coder generates several different descriptions of the same signal and the decoder can produce a useful reconstruction of ...

Institute of Electrical and Electronics Engineers2002

Path Set Selection in Mobile Ad Hoc Networks

Panagiotis Papadimitratos

Topological changes in mobile ad hoc networks frequently render routing paths unusable. Such recurrent path failures have detrimental effects on the network ability to support QoS-driven services. A promising technique for addressing this problem is to use ...

ACM2002