@article {ART-2022-05,
   author = {Jonathan Falk and Heiko Geppert and Frank D{\"u}rr and Sukanya Bhowmik and Kurt Rothermel},
   title = {{Dynamic QoS-Aware Traffic Planning for Time-Triggered Flows in the Real-time Data Plane}},
   journal = {IEEE Transactions on Network and Service Management},
   publisher = {IEEE},
   volume = {19},
   number = {2},
   pages = {1807--1825},
   type = {Article in Journal},
   month = {June},
   year = {2022},
   isbn = {10.1109/TNSM.2022.3150664},
   keywords = {traffic planning, QoS, reconfiguration, time-triggered},
   language = {German},
   cr-category = {C.2.3 Network Operations,
                   C.2.5 Local and Wide-Area Networks},
   ee = {ftp://ftp.informatik.uni-stuttgart.de/pub/library/ncstrl.ustuttgart_fi/ART-2022-05/ART-2022-05.pdf},
   department = {University of Stuttgart, Institute of Parallel and Distributed Systems, Distributed Systems},
   abstract = {Many networked applications, e.g., in the domain of cyber-physical systems,
      require strict service guarantees for time-triggered traffic flows, usually in
      the form of jitter and latency bounds. It is a notoriously hard problem to
      compute a network-wide traffic plan, i.e., a set of routes and transmission
      schedules, that satisfies these requirements, and dynamic changes in the flow
      set add even more challenges. Existing traffic-planning methods are ill-suited
      for dynamic scenarios because they either suffer from high computational cost,
      can result in low network utilization, or provide no explicit guarantees when
      transitioning to a new traffic plan that incorporates new flows.
      
      Therefore, we present a novel approach for dynamic traffic planning of
      time-triggered flows. Our conflict-graph-based modeling of the traffic planning
      problem allows for the reconfiguration of active flows to increase the network
      utilization, while also providing per-flow QoS guarantees during the transition
      to the new traffic plan. Additionally, we introduce a novel heuristic for
      computing the new traffic plans. Evaluations of our prototypical implementation
      show that we can efficiently compute new traffic plans in scenarios with
      hundreds of active flows for a wide range of settings.},
   url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=ART-2022-05&engl=1}
}

@article {ART-2022-04,
   author = {Jonathan Falk and Heiko Geppert and Frank D{\"u}rr and Sukanya Bhowmik and Kurt Rothermel},
   title = {{Dynamic QoS-Aware Traffic Planning for Time-Triggered Flows in the Real-time Data Plane}},
   journal = {IEEE Transactions on Network and Service Management},
   publisher = {IEEE},
   volume = {19},
   number = {2},
   pages = {1807--1825},
   type = {Article in Journal},
   month = {June},
   year = {2022},
   isbn = {10.1109/TNSM.2022.3150664},
   keywords = {traffic planning, QoS, reconfiguration, time-triggered},
   language = {German},
   cr-category = {C.2.3 Network Operations,
                   C.2.5 Local and Wide-Area Networks},
   ee = {ftp://ftp.informatik.uni-stuttgart.de/pub/library/ncstrl.ustuttgart_fi/ART-2022-04/ART-2022-04.pdf},
   department = {University of Stuttgart, Institute of Parallel and Distributed Systems, Distributed Systems},
   abstract = {Many networked applications, e.g., in the domain of cyber-physical systems,
      require strict service guarantees for time-triggered traffic flows, usually in
      the form of jitter and latency bounds. It is a notoriously hard problem to
      compute a network-wide traffic plan, i.e., a set of routes and transmission
      schedules, that satisfies these requirements, and dynamic changes in the flow
      set add even more challenges. Existing traffic-planning methods are ill-suited
      for dynamic scenarios because they either suffer from high computational cost,
      can result in low network utilization, or provide no explicit guarantees when
      transitioning to a new traffic plan that incorporates new flows.
      
      Therefore, we present a novel approach for dynamic traffic planning of
      time-triggered flows. Our conflict-graph-based modeling of the traffic planning
      problem allows for the reconfiguration of active flows to increase the network
      utilization, while also providing per-flow QoS guarantees during the transition
      to the new traffic plan. Additionally, we introduce a novel heuristic for
      computing the new traffic plans. Evaluations of our prototypical implementation
      show that we can efficiently compute new traffic plans in scenarios with
      hundreds of active flows for a wide range of settings.},
   url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=ART-2022-04&engl=1}
}

@article {ART-2022-03,
   author = {Jonathan Falk and Heiko Geppert and Frank D{\"u}rr and Sukanya Bhowmik and Kurt Rothermel},
   title = {{Dynamic QoS-Aware Traffic Planning for Time-Triggered Flows in the Real-time Data Plane}},
   journal = {IEEE Transactions on Network and Service Management},
   publisher = {IEEE},
   volume = {19},
   number = {2},
   pages = {1807--1825},
   type = {Article in Journal},
   month = {June},
   year = {2022},
   isbn = {10.1109/TNSM.2022.3150664},
   keywords = {traffic planning, QoS, reconfiguration, time-triggered},
   language = {German},
   cr-category = {C.2.3 Network Operations,
                   C.2.5 Local and Wide-Area Networks},
   ee = {ftp://ftp.informatik.uni-stuttgart.de/pub/library/ncstrl.ustuttgart_fi/ART-2022-03/ART-2022-03.pdf},
   department = {University of Stuttgart, Institute of Parallel and Distributed Systems, Distributed Systems},
   abstract = {Many networked applications, e.g., in the domain of cyber-physical systems,
      require strict service guarantees for time-triggered traffic flows, usually in
      the form of jitter and latency bounds. It is a notoriously hard problem to
      compute a network-wide traffic plan, i.e., a set of routes and transmission
      schedules, that satisfies these requirements, and dynamic changes in the flow
      set add even more challenges. Existing traffic-planning methods are ill-suited
      for dynamic scenarios because they either suffer from high computational cost,
      can result in low network utilization, or provide no explicit guarantees when
      transitioning to a new traffic plan that incorporates new flows.
      
      Therefore, we present a novel approach for dynamic traffic planning of
      time-triggered flows. Our conflict-graph-based modeling of the traffic planning
      problem allows for the reconfiguration of active flows to increase the network
      utilization, while also providing per-flow QoS guarantees during the transition
      to the new traffic plan. Additionally, we introduce a novel heuristic for
      computing the new traffic plans. Evaluations of our prototypical implementation
      show that we can efficiently compute new traffic plans in scenarios with
      hundreds of active flows for a wide range of settings.},
   url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=ART-2022-03&engl=1}
}

@article {ART-2022-02,
   author = {Jonathan Falk and Heiko Geppert and Frank D{\"u}rr and Sukanya Bhowmik and Kurt Rothermel},
   title = {{Dynamic QoS-Aware Traffic Planning for Time-Triggered Flows in the Real-time Data Plane}},
   journal = {IEEE Transactions on Network and Service Management},
   publisher = {IEEE},
   volume = {19},
   number = {2},
   pages = {1807--1825},
   type = {Article in Journal},
   month = {June},
   year = {2022},
   isbn = {10.1109/TNSM.2022.3150664},
   keywords = {traffic planning, QoS, reconfiguration, time-triggered},
   language = {German},
   cr-category = {C.2.3 Network Operations,
                   C.2.5 Local and Wide-Area Networks},
   ee = {ftp://ftp.informatik.uni-stuttgart.de/pub/library/ncstrl.ustuttgart_fi/ART-2022-02/ART-2022-02.pdf},
   department = {University of Stuttgart, Institute of Parallel and Distributed Systems, Distributed Systems},
   abstract = {Many networked applications, e.g., in the domain of cyber-physical systems,
      require strict service guarantees for time-triggered traffic flows, usually in
      the form of jitter and latency bounds. It is a notoriously hard problem to
      compute a network-wide traffic plan, i.e., a set of routes and transmission
      schedules, that satisfies these requirements, and dynamic changes in the flow
      set add even more challenges. Existing traffic-planning methods are ill-suited
      for dynamic scenarios because they either suffer from high computational cost,
      can result in low network utilization, or provide no explicit guarantees when
      transitioning to a new traffic plan that incorporates new flows.
      
      Therefore, we present a novel approach for dynamic traffic planning of
      time-triggered flows. Our conflict-graph-based modeling of the traffic planning
      problem allows for the reconfiguration of active flows to increase the network
      utilization, while also providing per-flow QoS guarantees during the transition
      to the new traffic plan. Additionally, we introduce a novel heuristic for
      computing the new traffic plans. Evaluations of our prototypical implementation
      show that we can efficiently compute new traffic plans in scenarios with
      hundreds of active flows for a wide range of settings.},
   url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=ART-2022-02&engl=1}
}