Santos, Allan ; Rizk, Amr ; Steinke, Florian (2023)
Adaptive Global Coordination of Local Routing Policies for Communication Networks.
In: Computer Communications, 204
doi: 10.1016/j.comcom.2023.03.027
Artikel, Bibliographie
Kurzbeschreibung (Abstract)
We consider optimal routing of data packets in communication networks featuring time-variable flow rates and bandwidth limitations. Taking into account recent programmability developments in communication systems, we propose a two-level control scheme: routers with a programmable data plane implement local proportional control policies that forward the incoming data to different available output interfaces at line rate. The local controllers’ parameters are adapted periodically on a slower time scale by a logically centralized (software-defined) network controller running a global coordination algorithm that keeps the routing feasible and optimal with respect to a network metric, such as the average packet delay. A robust optimization approach is selected to handle traffic variations in-between global adaptation steps. The outcome is a non-convex Quadratically Constrained Quadratic Program (QCQP), for which we present an iterative solution approach that is computationally suitable for realistically-sized backbone communication networks. With simulation experiments, we demonstrate the advantages of adaptive, global routing coordination compared to fixed, globally or locally-determined policies, especially concerning packet loss.
| Typ des Eintrags: | Artikel |
|---|---|
| Erschienen: | 2023 |
| Autor(en): | Santos, Allan ; Rizk, Amr ; Steinke, Florian |
| Art des Eintrags: | Bibliographie |
| Titel: | Adaptive Global Coordination of Local Routing Policies for Communication Networks |
| Sprache: | Englisch |
| Publikationsjahr: | 15 April 2023 |
| Verlag: | Elsevier |
| Titel der Zeitschrift, Zeitung oder Schriftenreihe: | Computer Communications |
| Jahrgang/Volume einer Zeitschrift: | 204 |
| DOI: | 10.1016/j.comcom.2023.03.027 |
| Kurzbeschreibung (Abstract): | We consider optimal routing of data packets in communication networks featuring time-variable flow rates and bandwidth limitations. Taking into account recent programmability developments in communication systems, we propose a two-level control scheme: routers with a programmable data plane implement local proportional control policies that forward the incoming data to different available output interfaces at line rate. The local controllers’ parameters are adapted periodically on a slower time scale by a logically centralized (software-defined) network controller running a global coordination algorithm that keeps the routing feasible and optimal with respect to a network metric, such as the average packet delay. A robust optimization approach is selected to handle traffic variations in-between global adaptation steps. The outcome is a non-convex Quadratically Constrained Quadratic Program (QCQP), for which we present an iterative solution approach that is computationally suitable for realistically-sized backbone communication networks. With simulation experiments, we demonstrate the advantages of adaptive, global routing coordination compared to fixed, globally or locally-determined policies, especially concerning packet loss. |
| Freie Schlagworte: | emergenCITY_CPS, emergenCITY |
| Fachbereich(e)/-gebiet(e): | 18 Fachbereich Elektrotechnik und Informationstechnik 18 Fachbereich Elektrotechnik und Informationstechnik > Institut für Datentechnik > Energieinformationsnetze und Systeme (EINS) 18 Fachbereich Elektrotechnik und Informationstechnik > Institut für Datentechnik DFG-Sonderforschungsbereiche (inkl. Transregio) DFG-Sonderforschungsbereiche (inkl. Transregio) > Sonderforschungsbereiche LOEWE LOEWE > LOEWE-Zentren LOEWE > LOEWE-Zentren > emergenCITY Forschungsfelder Forschungsfelder > Energy and Environment Forschungsfelder > Energy and Environment > Integrated Energy Systems DFG-Sonderforschungsbereiche (inkl. Transregio) > Sonderforschungsbereiche > SFB 1053: MAKI – Multi-Mechanismen-Adaption für das künftige Internet DFG-Sonderforschungsbereiche (inkl. Transregio) > Sonderforschungsbereiche > SFB 1053: MAKI – Multi-Mechanismen-Adaption für das künftige Internet > B: Adaptionsmechanismen DFG-Sonderforschungsbereiche (inkl. Transregio) > Sonderforschungsbereiche > SFB 1053: MAKI – Multi-Mechanismen-Adaption für das künftige Internet > B: Adaptionsmechanismen > Teilprojekt B4: Planung |
| Hinterlegungsdatum: | 28 Jul 2023 08:11 |
| Letzte Änderung: | 11 Okt 2023 07:59 |
| PPN: | |
| Export: | |
| Suche nach Titel in: | TUfind oder in Google |
 |
Frage zum Eintrag |
Optionen (nur für Redakteure)
 |
Redaktionelle Details anzeigen |
Drucken
Impressum