Concept

Congestion (réseau)

Publications associées (225)

Distributed Rate Allocation With Intersession Network Coding

Pascal Frossard, Nikolaos Thomos, Eirina Bourtsoulatze

In this paper, we propose a distributed rate allocation algorithm for delay minimal data delivery in overlay networks where multiple sources compete simultaneously for the available network resources. In order to efficiently utilize the network resources, ...

IEEE2012

A Dynamic Cordon Pricing Scheme combining a Macroscopic and an Agent-based traffic Models

Nikolaos Geroliminis, Nan Zheng

Pricing is considered an effective management policy to reduce traffic congestion in transportation networks. In this paper we combine a macroscopic model of traffic congestion in urban networks with an agent-based simulator to study congestion pricing sch ...

2012

Non-Pareto Optimality of MPTCP: Performance Issues and a Possible Solution

Jean-Yves Le Boudec, Nicolas Gabriel Gast, Ramin Khalili, Utkarsh Upadhyay, Miroslav Popovic

MPTCP has been proposed as a mechanism to support transparently multiple connections to the application layer and is under discussion at the IETF. It can use effectively the available bandwidth and it improves throughput and fairness, compared to independe ...

2012

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

A Measurement-Based Algorithm to Maximize the Utility of Wireless Networks

Patrick Thiran, Julien Pierre Sacha Herzen, Ruben Merz, Adel Aziz

The goal of jointly providing fairness and efficiency in wireless networks can be seen as the problem of maximizing a given utility function. The main difficulty when solving this problem is that the capacity region of wireless networks is typically unknow ...

2011

Enhance & Explore: an Adaptive Algorithm to Maximize the Utility of Wireless Networks

Patrick Thiran, Julien Pierre Sacha Herzen, Ruben Merz, Adel Aziz

The goal of jointly providing efficiency and fairness in wireless networks can be seen as the problem of maximizing a given utility function. In contrast with wired networks, the capacity of wireless networks is typically time-varying and not known explici ...

2011

Hysteresis phenomena of a Macroscopic Fundamental Diagram in freeway networks

Nikolaos Geroliminis

Observations of traffic pairs of flow vs. density or occupancy for individual locations in freeways or arterials are usually scattered about an underlying curve. Recent observations from empirical data in arterial networks showed that in some cases by aggr ...

2011

Hysteresis Phenomena of a Macroscopic Fundamental Diagram in Freeway Networks

Nikolaos Geroliminis

Elsevier Science, Reg Sales Off, Customer Support Dept, 655 Ave Of The Americas, New York, Ny 10010 Usa2011

Optimizing Mixing in Pervasive Networks: A Graph-Theoretic Perspective

Jean-Pierre Hubaux, Murtuza Jadliwala, Igor Bilogrevic

One major concern in pervasive wireless applications is location privacy, where malicious eavesdroppers, based on static device identifiers, can continuously track users. As a commonly adopted countermeasure to prevent such identifier-based tracking, devic ...

Springer2011

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