| 1. |
- Auvert, Marine, et al.
(författare)
-
On Router Control for Congestion Avoidance
- 2002
-
Konferensbidrag (refereegranskat)abstract
- This short paper deals with active queue management for computer networks. The goal is to develop control mechanisms for routers in heterogeneous networks that reduce traffic fluctuations. The proposed control strategy operates with local information (such as estimated arrival rates) and actively use the buffers to smooth traffic, and thus it avoids the buildup and propagation of traffic bursts.
|
|
| 2. |
- Briat, Corentin, et al.
(författare)
-
An axiomatic fluid-flow model for congestion control analysis
- 2011
-
Ingår i: 2011 50th IEEE Conference on Decision and Control andEuropean Control Conference (CDC-ECC). ; , s. 3122-3129
-
Konferensbidrag (refereegranskat)abstract
- An axiomatic model for congestion control isderived. The proposed four axioms serve as a basis for theconstruction of models for the network elements. It is shownthat, under some assumptions, some models of the literature canbe recovered. A single-buffer/multiple-users topology is finallyderived and studied for illustration.
|
|
| 3. |
- Briat, Corentin, et al.
(författare)
-
Nonlinear state-dependent delay modeling and stability analysis of internet congestion control
- 2010
-
Ingår i: 49TH IEEE CONFERENCE ON DECISION AND CONTROL (CDC). - 9781424477463 ; , s. 1484-1491
-
Konferensbidrag (refereegranskat)abstract
- It is shown that the queuing delay involved in the congestion control algorithm is state-dependent and does not depend on the current time. Then, using an accurate formulation for buffers, networks with arbitrary topologies can be built. At equilibrium, our model reduces to the widely used setup by Paganini et al. Using this model, the delay-derivative is analyzed and it is proved that the delay time-derivative does not exceed one for the considered topologies. It is then shown that the considered congestion control algorithm globally stabilizes a delay-free single buffer network. Finally, using a specific linearization result for systems with state-dependent delays from Cooke and Huang, we show the local stability of the single bottleneck network.
|
|
| 4. |
|
|
| 5. |
|
|
| 6. |
- Risuleo, Riccardo Sven, 1986-, et al.
(författare)
-
A benchmark for data-based office modeling: challenges related to CO2 dynamics
- 2015
-
Ingår i: IFAC-PapersOnLine. - : IFAC Papers Online. - 2405-8963. ; , s. 1256-1261
-
Konferensbidrag (refereegranskat)abstract
- This paper describes a benchmark consisting of a set of synthetic measurements relative to an office environment simulated with the software IDA-ICE. The simulated environment reproduces a laboratory at the KTH-EES Smart Building, equipped with a building management system. The data set contains measurement records collected over a period of several days. The signals correspond to CO2 concentration, mechanical ventilation airows, air infiltrations and occupancy. Information on door and window opening is also available. This benchmark is intended for testing data-based modeling techniques. The ultimate goal is the development of models to improve the forecast and control of environmental variables. Among the numerous challenges related to this framework, we focus on the problem of occupancy estimation using information on CO2 concentration, which we treat as a blind identification problem. For benchmarking purposes, we present two different identification approaches: a baseline overparameterization method and a kernel-based method.
|
|
| 7. |
- Sandberg, Henrik, et al.
(författare)
-
On performance limitations of congestion control
- 2009
-
Ingår i: Proceedings of the IEEE Conference on Decision and Control. - 9781424438716 ; , s. 5869-5876
-
Konferensbidrag (refereegranskat)abstract
- Fundamental performance limitations on congestion control is discussed in relation to the information that is available in the controller. Three control architectures that all use bottle-neck buffer delay information of various form as inputs and sending rate as outputs are considered. It is shown that feedback delays from buffer to senders set limits on the achievable performance measured through fairness, efficiency and stability. We apply our findings to TCP FAST and can make some new interesting control theoretic interpretations of that protocol.
|
|
| 8. |
- Tang, Ao, et al.
(författare)
-
Queue Dynamics With Window Flow Control
- 2010
-
Ingår i: IEEE/ACM Transactions on Networking. - 1063-6692 .- 1558-2566. ; 18:5, s. 1422-1435
-
Tidskriftsartikel (refereegranskat)abstract
- This paper develops a new model that describes the queueing process of a communication network when data sources use window flow control. The model takes into account the burstiness in sub-round-trip time (RTT) timescales and the instantaneous rate differences of a flow at different links. It is generic and independent of actual source flow control algorithms. Basic properties of the model and its relation to existing work are discussed. In particular, for a general network with multiple links, it is demonstrated that spatial interaction of oscillations allows queue instability to occur even when all flows have the same RTTs and maintain constant windows. The model is used to study the dynamics of delay-based congestion control algorithms. It is found that the ratios of RTTs are critical to the stability of such systems, and previously unknown modes of instability are identified. Packet-level simulations and testbed measurements are provided to verify the model and its predictions.
|
|
| 9. |
- Tang, Ao, et al.
(författare)
-
Window flow control : Macroscopic properties from microscopic factors
- 2008
-
Ingår i: 27TH IEEE CONFERENCE ON COMPUTER COMMUNICATIONS (INFOCOM). - 9781424420254 ; , s. 538-546
-
Konferensbidrag (refereegranskat)abstract
- This paper studies window flow control focusing on bridging the gap between microscopic factors such as burstiness in sub-RTT timescales, and observable macroscopic properties such as steady state bandwidth sharing and flow level stability. Using new models, we analytically capture notable effects of microscopic behavior on macroscopic quantities. For loss-based protocols, we calculate the loss synchronization rate for different flows and use it to quantitatively explain the unfair bandwidth sharing between paced and unpaced TCP flows. For delay-based protocols, we show that the ratios of round trip delays are critical to the stability of the system. These results deepen the fundamental understanding of congestion control systems. Packet level simulations are used to verify our theoretical claims.
|
|
| 10. |
|
|
