Concept

Traffic policing

Publications associées (41)

A WIM-Based Assessment of Multiple Vehicle Presence Effects on Fatigue Damage of Highway Bridges

Alain Nussbaumer, Scott Walbridge, Matthew James Sjaarda

The fatigue provisions for bridge design in North America and Europe are highly simplified for the sake of practical implementation, in comparison with the state of the art in understanding of the true fatigue behavior. Historically, one significant simpli ...

2024

Localizing Traffic Differentiation

Pavlos Nikolopoulos, Muhammad Abdullah, Zeinab Shmeis

Network neutrality is important for users, content providers, policymakers, and regulators interested in understanding how network providers differentiate performance. When determining whether a network differentiates against certain traffic, it is importa ...

2023

On the Necessity of Traffic Shaping for PMU Measurement Data Streams

Jean-Yves Le Boudec, Dan-Cristian Tomozei, Peng Gao, Miroslav Popovic

We study the communication network of an on-campus active distribution network (ADN) that comprises phasor measurement units (PMUs) connected to medium-voltage transformers. Within stringent time delays and with minimal loss the PMUs periodically transfer ...

2013

Optinal Source-Based Filtering of Malicious Traffic

In this paper, we consider the problem of blocking malicious traffic on the Internet via source-based filtering. In particular, we consider filtering via access control lists (ACLs): These are already available at the routers today, but are a scarce resour ...

2012

Integrality gap of the hypergraphic relaxation of Steiner trees: A short proof of a 1.55 upper bound

David Pritchard

Recently, Byrka, Grandoni, RothvoBand Sanita gave a 1.39 approximation for the Steiner tree problem, using a hypergraph-based linear programming relaxation. They also upper-bounded its integrality gap by 1.55. We describe a shorter proof of the same integr ...

Elsevier2010

One Bit Is Enough: a Framework for Deploying Explicit Feedback Congestion Control Protocols

Dejan Kostic, Nedeljko Vasic

Since the bandwidth-delay products of Internet links keep increasing, issues with TCP's convergence time, throughput, and amount of queuing in these environments are becoming more pressing. As we move toward the next-generation Internet, it is important to ...

2009

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

Distributed Sender-Driven Video Streaming

Pascal Frossard

A system for sender-driven video streaming from multiple servers to a single receiver is considered in this paper. The receiver monitors incoming packets on each network path and returns, to the senders, estimates of the available bandwidth on all the netw ...

INTEL2006

Worst Case Burstiness Increase due to FIFO Multiplexing

Jean-Yves Le Boudec, Juan Echagüe

We consider a FIFO multiplexer fed by flows that are individually constrained by arrival curves, and look for the best possible arrival curve for every output flow. This problem arises in scenarios where aggregate multiplexing is performed, such as differe ...

2002

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