Publication

iPRP - the Parallel Redundancy Protocol for IP Networks: Protocol Design and Operation

Publications associées (113)

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

Video Multicast in (large) local area networks

Martin Vetterli, Jean-Paul Wagner

We consider the problem of distributing high-quality video signals over IP multicast in large Local Area Networks (LANs), under real-time delay constraints, and with software-only processing. In a large LAN (such as the network of a university campus, or t ...

2002

The provision of a low delay service within the best-effort Internet

Paul Hurley

In this work, we define a novel Internet service, called ABE (Alternative Best-Effort), which allows interactive multimedia applications to receive low queuing delay within the existing best-effort Internet. We then develop and analyse a number of innovati ...

EPFL2002

Ruminations on Domain-Based Reliable Broadcast

Fernando Pedone

A distributed system is no longer confined to a single administrative domain. Peer-to-peer applications and business-to-business e-commerce systems, for example, typically span multiple local-area and wide-area networks, raising issues of trust, security, ...

2002

Broadcast quality video over IP

We consider the problem of designing systems for the transmission of high-quality video signals over certain high-speed segments of the public IP network. Our most important contribution is the definition of a network/coder interface for IP networks which ...

2001

ABE: Providing a Low-Delay Service within best-effort

Jean-Yves Le Boudec, Patrick Thiran, Paul Hurley

We propose Alternative Best-Effort (ABE), a novel service for IP networks, which relies on the idea of providing low-delay at the expense of maybe less throughput. The objective is to retain the simplicity of the original Internet single class, best effort ...

2001

Self Organized Terminode Routing Simulation

Jean-Yves Le Boudec, Ljubica Blazevic

In this paper we simulated terminode routing. This routing scheme is designed for wide area networks, where a large part or all the nodes are mobile. Terminode routing is a combination of two protocols called Terminode Local Routing (TLR) and Terminode Rem ...

2001

Distributed Core Multicast (DCM): a routing protocol for many small groups with application to mobile IP telephony

Jean-Yves Le Boudec, Ljubica Blazevic

This paper specifies a multicast routing protocol called Distributed Core Multicast (DCM). It is intended for use within a large single Internet domain network with a very large number of small multicast groups. We present how DCM can be used to route pack ...

2000

ABE: Providing a Low Delay Service Within Best-Effort

Jean-Yves Le Boudec, Patrick Thiran, Paul Hurley

We propose Alternative Best-Effort (ABE), a novel service for IP networks, which retains the simplicity of the original Internet single class, best effort service, while providing low delay to interactive, adaptive applications. With ABE, applications choo ...

2000

Web-based management of IP networks and systems

Jean-Philippe Martin-Flatin

The management of IP networks and systems is currently based on the Simple Network Management Protocol (SNMP) and the SNMP management architecture. This poses a number of problems. Some are related to the efficiency, scalability, latency, and expressivenes ...

EPFL2000

Global fairness of additive-increase and multiplicative-decrease with heterogeneous round-trip times

Jean-Yves Le Boudec, Milan Vojnovic, Catherine Boutremans

Consider a network with an arbitrary topology and arbitrary communication delays, in which congestion control is based on additive--increase and multiplicative--decrease. We show that the source rates tend to be distributed in order to maximize an objectiv ...

2000