Publication

Switching Between Loss-Based and Delay-Based Mode for Real-Time Media Congestion Controllers

Related publications (33)

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.

Real-time Traffic Prediction Under Exogenous Factors

Sofia Samoili

Traffic congestion is an escalating phenomenon with multidimensional impact. The proposed research stands in the hypothesis that a traffic forecasting method, acknowledging several exogenous parameters for a more plausible representation of traffic evoluti ...

2011

Bringing Stability to Wireless Mesh Networks

Adel Aziz

Wireless mesh networks were designed as a mean to rapidly deliver large-scale communication capabilities without the support of any prior infrastructure. Among the different properties of mesh networks, the self-organizing feature is particularly interesti ...

EPFL2011

Mitigating network congestion

Carolina Osorio Pizano

Congestion is a phenomenon that arises in a variety of contexts. The most familiar representation is urban traffic congestion. Nonetheless, phenomenons such as prison cell congestion, hospital bed blocking or, at a cellular scale, ribosome congestion, also ...

EPFL2010

Describing network congestion and blocking with an analytic queueing network model

Michel Bierlaire, Carolina Osorio Pizano

In a network with capacity constraints congestion effects such as bottlenecks, spillbacks and gridlocks can be observed. These can be described with a queueing network model. The main challenge of such an approach lies in adequately capturing the between-q ...

2007

Describing network congestion and blocking with an analytic queueing network model

Michel Bierlaire, Carolina Osorio Pizano

2007

Congestion Control for Distributed Hash Tables

Jean-Yves Le Boudec, Karl Aberer, Fabius Klemm

Distributed Hash Tables (DHTs) provide a scalable mechanism for mapping identifiers to socket addresses. As each peer in the network can initiate lookup requests, a DHT has to process concurrently a potentially very large number of requests. In this paper, ...

IEEE2006

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 Note on the Stochastic Bias of Some Increase-Decrease Congestion Cont rols: HighSpeed TCP Case Study

Jean-Yves Le Boudec, Milan Vojnovic

We consider increase-decrease congestion controls, a formulation that accommodates many known congestion controls. There have been many works that aim to obtain relation between the loss-event rate

\fpp

and time-average window

\taw

for some known parti ...

2003

Modeling Internet backbone traffic at the flow level

Patrick Thiran

Our goal is to design a traffic model for non congested IP backbone links, which is simple enough to be used in network operation, while being as general as possible. The proposed solution is to model the traffic at the flow level by a Poisson shot-noise p ...

2003

A Note on the Stochastic Bias of Some Increase-Decrease Congestion Controls: HighSpeed TCP Case Study

Jean-Yves Le Boudec, Milan Vojnovic

We consider increase-decrease congestion controls, a formulation that accommodates many known congestion controls. There have been many works that aim to obtain relation between the loss-event rate

\fpp

and time-average window

\taw

for some known parti ...

2002

A Note on the Stochastic Bias of Some Increase-Decrease Congestion Controls: HighSpeed TCP Case Study

Jean-Yves Le Boudec, Milan Vojnovic

We consider increase-decrease congestion controls, a formulation that accommodates many known congestion controls. There have been many works that aim to obtain relation between the loss-event rate

\fpp

and time-average window

\taw

for some known parti ...

2002

A Note on the Stochastic Bias of Some Increase-Decrease Congestion Cont rols: HighSpeed TCP Case Study

Jean-Yves Le Boudec, Milan Vojnovic

We consider increase-decrease congestion controls, a formulation that accommodates many known congestion controls. There have been many works that aim to obtain relation between the loss-event rate

\fpp

and time-average window

\taw

for some known parti ...

2003