• Treffer 28 von 38
Zurück zur Trefferliste

Evaluating Dynamic Path Reconfiguration for Time Sensitive Networks

Zitieren Sie bitte immer diese URN: urn:nbn:de:bvb:20-opus-280743
  • In time-sensitive networks (TSN) based on 802.1Qbv, i.e., the time-aware Shaper (TAS) protocol, precise transmission schedules and, paths are used to ensure end-to-end deterministic communication. Such resource reservations for data flows are usually established at the startup time of an application and remain untouched until the flow ends. There is no way to migrate existing flows easily to alternative paths without inducing additional delay or wasting resources. Therefore, some of the new flows cannot be embedded due to capacity limitationsIn time-sensitive networks (TSN) based on 802.1Qbv, i.e., the time-aware Shaper (TAS) protocol, precise transmission schedules and, paths are used to ensure end-to-end deterministic communication. Such resource reservations for data flows are usually established at the startup time of an application and remain untouched until the flow ends. There is no way to migrate existing flows easily to alternative paths without inducing additional delay or wasting resources. Therefore, some of the new flows cannot be embedded due to capacity limitations on certain links which leads to sub-optimal flow assignment. As future networks will need to support a large number of lowlatency flows, accommodating new flows at runtime and adapting existing flows accordingly becomes a challenging problem. In this extended abstract we summarize a previously published paper of us [1]. We combine software-defined networking (SDN), which provides better control of network flows, with TSN to be able to seamlessly migrate time-sensitive flows. For that, we formulate an optimization problem and propose different dynamic path configuration strategies under deterministic communication requirements. Our simulation results indicate that regularly reconfiguring the flow assignments can improve the latency of time-sensitive flows and can increase the number of flows embedded in the network around 4% in worst-case scenarios while still satisfying individual flow deadlines.zeige mehrzeige weniger

Metadaten exportieren

Weitere Dienste

Teilen auf Twitter Suche bei Google Scholar Statistik - Anzahl der Zugriffe auf das Dokument
Metadaten
Autor(en): Nurefsan Sertbas Bülbül, Doganalp Ergenc, Mathias Fischer
URN:urn:nbn:de:bvb:20-opus-280743
Dokumentart:Arbeitspapier / Working Paper
Institute der Universität:Fakultät für Mathematik und Informatik / Institut für Informatik
Sprache der Veröffentlichung:Englisch
Titel des übergeordneten Werkes / der Zeitschrift (Englisch):Würzburg Workshop on Next-Generation Communication Networks (WueWoWas'22)
Erscheinungsjahr:2022
Seitenangabe:5
DOI:https://doi.org/10.25972/OPUS-28074
Allgemeine fachliche Zuordnung (DDC-Klassifikation):0 Informatik, Informationswissenschaft, allgemeine Werke / 00 Informatik, Wissen, Systeme / 004 Datenverarbeitung; Informatik
Normierte Schlagworte (GND):Datennetz
Freie Schlagwort(e):SDN; TSN; dynamic flow migration; path computation; reconfiguration
Fachklassifikation Informatik (CCS):A. General Literature
Datum der Freischaltung:12.08.2022
Sammlungen:Sammel- und Konferenzbände (Edited volumes and conference proceedings) / Würzburg Workshop on Next-Generation Communication Networks (WueWoWas'22) / Arbeitspapiere (Working Paper)
Lizenz (Deutsch):License LogoCC BY-SA: Creative-Commons-Lizenz: Namensnennung, Weitergabe unter gleichen Bedingungen 4.0 International