Concept

Ping (logiciel)

Publications associées (32)

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

Bits of Internet traffic control

Milan Vojnovic

In this work, we consider four problems in the context of Internet traffic control. The first problem is to understand when and why a sender that implements an equation-based rate control would be TCP-friendly, or not—a sender is said to be TCP-friendly if ...

EPFL2003

Measurement and Analysis of Single-Hop Delay on an IP Backbone Network

Patrick Thiran

We measure and analyze the single-hop packet delay through operational routers in the Sprint Internet protocol (IP) backbone network. After presenting our delay measurements through a single router for OC-3 and OC-12 link speeds, we propose a methodology t ...

2003

Delay aspects in Internet telephony

Catherine Boutremans

In this work, we address the transport of high quality voice over the Internet with a particular concern for delays. Transport of interactive audio over IP networks often suffers from packet loss and variations in the network delay (jitter). Forward Error ...

EPFL2003

A Novel Scheduler for a Low Delay Service Within Best-Effort

Jean-Yves Le Boudec, Patrick Thiran, Paul Hurley

We present a novel scheduling algorithm, Duplicate Scheduling with Deadlines (DSD). This algorithm implements the ABE service which allows interactive, adaptive applications, that mark their packets green, to receive a low bounded delay at the expense of m ...

2001

A Novel Scheduler For a Low Delay Service Within Best-Effort

Jean-Yves Le Boudec, Patrick Thiran, Paul Hurley

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

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

A Proposal for an Asymmetric Best-Effort Service

Jean-Yves Le Boudec, Paul Hurley

We propose Asymmetric Best-Effort, a novel service to provide a throughput versus delay jitter differentiated service for IP packets. With this service, every best effort packet is marked as either Green or Blue. Green packets, typically sent by real-time ...

1999

Locality-Aware Request Distribution in Cluster-Based Network Servers

Willy Zwaenepoel

We consider cluster-based network servers in which a front-end directs incoming requests to one of a number of back-ends. Specifically, we consider content-based request distribution: the front-end uses the content requested, in addition to information abo ...

1998

The Push Model in Web-Based Network Management

Jean-Philippe Martin-Flatin

The management of IP networks is currently based on the SNMP protocol, and the use of expensive network management platforms designed according to the manager/agent paradigm of the SNMP framework. It uses two different schemes to transfer management data: ...

1998