Muscariello Perino 2008a - Revision history

Scipediacontent at 10:25, 22 January 2021

2021-01-22T10:25:39Z

Scipediacontent: Scipediacontent moved page Draft Content 651770938 to Muscariello Perino 2008a

2020-10-26T10:20:35Z

Scipediacontent moved page Draft Content 651770938 to Muscariello Perino 2008a

Scipediacontent: Created page with " == Abstract == Recent literature has proved that stable dynamic routing algorithms have solid theoretical foundation that makes them suitable to be implemented in a real pro..."

2020-10-26T10:20:32Z

Created page with " == Abstract == Recent literature has proved that stable dynamic routing algorithms have solid theoretical foundation that makes them suitable to be implemented in a real pro..."

New page

== Abstract ==

Recent literature has proved that stable dynamic routing algorithms have solid theoretical foundation that makes them suitable to be implemented in a real protocol, and used in practice in many different operational network contexts. Such algorithms inherit much of the properties of congestion controllers implementing one of the possible combination of AQM/ECN schemes at nodes and flow control at sources. In this paper we propose a linear program formulation of the multi-commodity flow problem with congestion control, under max-min fairness, comprising demands with or without exogenous peak rates. Our evaluations of the gain, using path diversity, in scenarios as intra-domain traffic engineering and wireless mesh networks encourages real implementations, especially in presence of hot spots demands and non uniform traffic matrices. We propose a flow aware perspective of the subject by using a natural multi-path extension to current congestion controllers and show its performance with respect to current proposals. Since flow aware architectures exploiting path diversity are feasible, scalable, robust and nearly optimal in presence of flows with exogenous peak rates, we claim that our solution rethinked in the context of realistic traffic assumptions performs as better as an optimal approach with all the additional benefits of the flow aware paradigm.

Document type: Report

== Full document ==
<pdf>Media:Draft_Content_651770938-beopen252-4448-document.pdf</pdf>

== Original document ==

The different versions of the original document can be found in:

* [http://arxiv.org/abs/0803.1944 http://arxiv.org/abs/0803.1944]

* [https://hal.inria.fr/inria-00263813 https://hal.inria.fr/inria-00263813],[https://hal.inria.fr/inria-00263813/document https://hal.inria.fr/inria-00263813/document]

* [https://hal.inria.fr/inria-00263813 https://hal.inria.fr/inria-00263813],[https://hal.inria.fr/inria-00263813v2/document https://hal.inria.fr/inria-00263813v2/document],[https://hal.inria.fr/inria-00263813/file/RR-6474.pdf https://hal.inria.fr/inria-00263813/file/RR-6474.pdf]

@@ Line 3: / Line 3: @@
 Recent literature has proved that stable dynamic routing algorithms have solid theoretical foundation that makes them suitable to be implemented in a real protocol, and used in practice in many different operational network contexts. Such algorithms inherit much of the properties of congestion controllers implementing one of the possible combination of AQM/ECN schemes at nodes and flow control at sources. In this paper we propose a linear program formulation of the multi-commodity flow problem with congestion control, under max-min fairness, comprising demands with or without exogenous peak rates. Our evaluations of the gain, using path diversity, in scenarios as intra-domain traffic engineering and wireless mesh networks encourages real implementations, especially in presence of hot spots demands and non uniform traffic matrices. We propose a flow aware perspective of the subject by using a natural multi-path extension to current congestion controllers and show its performance with respect to current proposals. Since flow aware architectures exploiting path diversity are feasible, scalable, robust and nearly optimal in presence of flows with exogenous peak rates, we claim that our solution rethinked in the context of realistic traffic assumptions performs as better as an optimal approach with all the additional benefits of the flow aware paradigm.
@@ Line 16: / Line 11: @@
 * [http://arxiv.org/abs/0803.1944 http://arxiv.org/abs/0803.1944]
-* [https://hal.inria.fr/inria-00263813 https://hal.inria.fr/inria-00263813],[https://hal.inria.fr/inria-00263813/document https://hal.inria.fr/inria-00263813/document]
+* [https://hal.inria.fr/inria-00263813 https://hal.inria.fr/inria-00263813],
 : [https://hal.inria.fr/inria-00263813v2/document https://hal.inria.fr/inria-00263813v2/document],
-* [https://hal.inria.fr/inria-00263813 https://hal.inria.fr/inria-00263813],[https://hal.inria.fr/inria-00263813v2/document https://hal.inria.fr/inria-00263813v2/document],[https://hal.inria.fr/inria-00263813/file/RR-6474.pdf https://hal.inria.fr/inria-00263813/file/RR-6474.pdf]
+: [https://hal.inria.fr/inria-00263813/file/RR-6474.pdf https://hal.inria.fr/inria-00263813/file/RR-6474.pdf]

← Older revision	Revision as of 10:20, 26 October 2020
(No difference)