A Note on the Stochastic Bias of Some Increase-Decrease Congestion Controls: HighSpeed TCP Case Study
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.
Dynamic optimization problems affected by uncertainty are ubiquitous in many application domains. Decision makers typically model the uncertainty through random variables governed by a probability distribution. If the distribution is precisely known, then ...
Due to the presence of buffers in the inner network nodes, each congestion event leads to buffer queueing and thus to an increasing end-to-end delay. In the case of delay sensitive applications, a large delay might not be acceptable and a solution to prope ...
In this paper, we investigate an area-based pricing scheme for congested multimodal urban networks with the consideration of user heterogeneity. We propose a time-dependent pricing scheme where the tolls are iteratively adjusted through a Proportional-Inte ...
Consider a random regular graph with degree d and of size n. Assign to each edge an independent and identically distributed exponential random variable with mean one. In this paper we establish a precise asymptotic expression for the maximum number of edge ...
Recent advances in traffic flow theory at the network level, namely the Macroscopic Fundamental Diagram (MFD), reveals the existence of well-defined laws of congestion dynamics at aggregated levels. The same knowledge for multimodal networks however is lim ...
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 ...
Research on congestion and propagation in large urban city networks has been mainly based on microsimulations of link-level traffic dynamics. However, both the unpredictability of travel behaviors and high complexity of accurate physical modeling remain ch ...
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 ...
A new gating strategy for concentric cities based on the notion of the macroscopic or network fundamental diagram and the feedback-based gating concept is introduced and successfully tested. Different regions of large-scale urban networks may experience co ...
This study focuses on the morning commute problem with explicit consideration of cruising-for-parking, and its adverse impacts on traffic congestion. The cruising-for-parking is modeled through a dynamic aggregated traffic model for networks: the Macroscop ...
