| 1. |
|
|
| 2. |
|
|
| 3. |
|
|
| 4. |
- Briat, Corentin, et al.
(författare)
-
A conservation-law-based modular fluid-flow model for network congestion modeling
- 2012
-
Ingår i: 2012 Proceedings - IEEE INFOCOM. - : IEEE Computer Society. - 9781467307758 ; , s. 2050-2058
-
Konferensbidrag (refereegranskat)abstract
- A modular fluid-flow model for network congestion analysis and control is proposed. The model is derived from an information conservation law stating that the information is either in transit, lost or received. Mathematical models of network elements such as queues, users, and transmission channels, and network description variables, including sending/ acknowledgement rates and delays, are inferred from this law and obtained by applying this principle locally. The modularity of the devised model makes it sufficiently generic to describe any network topology, and appealing for building simulators. Previous models in the literature are often not capable of capturing the transient behavior of the network precisely, making the resulting analysis inaccurate in practice. Those models can be recovered from exact reduction or approximation of this new model. An important aspect of this particular modeling approach is the introduction of new tight building blocks that implement mechanisms ignored by the existing ones, notably at the queue and user levels. Comparisons with packet-level simulations corroborate the proposed model.
|
|
| 5. |
- Briat, Corentin, et al.
(författare)
-
Impact of Queueing Delay Estimation Error on Equilibrium and Its Stability
- 2011
-
Ingår i: NETWORKING 2011, PT II. - Berlin, Heidelberg : Springer Berlin Heidelberg. - 9783642207983 ; , s. 356-367
-
Konferensbidrag (refereegranskat)abstract
- Delay-based transmission control protocols need to separate round-trip time (RTT) measurements into their constituting parts: the propagation and the queueing delays. We consider two means for this; the first is to take the propagation delay as the minimum observed RTT value, and the second is to measure the queueing delay at the routers and feed it back to the sources. We choose FAST-TCP as a representative delay-based transmission control protocol for analysis and study the impact of delay knowledge errors on its performance. We have shown that while the first method destroys fairness and the uniqueness of the equilibrium, the stability of the protocol can easily be obtained through tuning the protocol terms appropriately. Even though the second technique is shown to preserve fairness and uniqueness of the equilibrium point, we have presented that unavoidable oscillations can occur around the equilibrium point.
|
|
| 6. |
- Briat, Corentin, et al.
(författare)
-
Stability criteria for asynchronous sampled-data systems - A fragmentation approach
- 2011
-
Ingår i: IFAC Proc. Vol. (IFAC-PapersOnline). - 9783902661937 ; , s. 1313-1318
-
Konferensbidrag (refereegranskat)abstract
- The stability analysis of asynchronous sampled-data systems is studied. The approach is based on a recent result which allows to study, in an equivalent way, the quadratic stability of asynchronous sampled-data systems in a continuous-time framework via the use of peculiar functionals satisfying a necessary boundary condition. The method developed here is an extension of previous results using a fragmentation technique inspired from recent advances in time-delay systems theory. The approach leads to a tractable convex feasibility problem involving a small number of finite dimensional LMIs. The approach is then finally illustrated through several examples.
|
|
| 7. |
- Briat, C., et al.
(författare)
-
The Conservation of Information, Towards an Axiomatized Modular Modeling Approach to Congestion Control
- 2015
-
Ingår i: IEEE/ACM Transactions on Networking. - 1063-6692 .- 1558-2566. ; 23:3, s. 851-865
-
Tidskriftsartikel (refereegranskat)abstract
- We derive a modular fluid-flow network congestion control model based on a law of fundamental nature in networks: the conservation of information. Network elements such as queues, users, and transmission channels and network performance indicators like sending/acknowledgment rates and delays are mathematically modeled by applying this law locally. Our contributions are twofold. First, we introduce a modular metamodel that is sufficiently generic to represent any network topology. The proposed model is composed of building blocks that implement mechanisms ignored by the existing ones, which can be recovered from exact reduction or approximation of this new model. Second, we provide a novel classification of previously proposed models in the literature and show that they are often not capable of capturing the transient behavior of the network precisely. Numerical results obtained from packet-level simulations demonstrate the accuracy of the proposed model.
|
|
