Concept

Measuring network throughput

Publications associées (199)

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

Variable delay ripple carry adder with carry chain interrupt detection

Andreas Peter Burg

A statistical approach for the area efficient implementation of fast wide operand adders using early termination detection is described and analyzed. It is shown that high throughput can be achieved based on area- and routing-efficient ripple-carry adders ...

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

Analysis of power consumption on switch fabrics in network routers

Giovanni De Micheli, Luca Benini

In this paper, we introduce a framework to estimate the power consumption on switch fabrics in network routers. We propose different modeling methodologies for node switches, internal buffers and interconnect wires inside switch fabric architectures. A sim ...

2002

On the Long-Run Behavior of Equation-Based Rate Control

Jean-Yves Le Boudec, Milan Vojnovic

We consider unicast equation based rate control, where a source estimates the loss event ratio p, and, primarily at loss events, adjusts its sending rate to f(p). Function f is assumed to represent the loss-throughput relation that TCP would experience. Wh ...

2002

On the Long-Run Behavior of Equation-Based Rate Control

Jean-Yves Le Boudec, Milan Vojnovic

2002

Observations on Equation-Based Rate Control

Jean-Yves Le Boudec, Milan Vojnovic

We consider unicast equation based rate control defined as follows. A source adjusts its rate primarily at loss events to f(p) where p is an estimator of loss event ratio. Function f is typically the loss-throughput formula of a TCP source. In absence of l ...

2002

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

Rate Loss Due to Power Equalization in Cellular Communications

Bixio Rimoldi

For a cellular communication network, the loss in up-link bandwidth-efficiency resulting from power equalization is considered. Here power equalization refers to the operation of adjusting the transmit power of mobile units in such a way that the received ...

2001

Rate Loss Due to Power Equalization in Cellular Communications

Bixio Rimoldi

2001