Efficient Conflict Graph Creation for Time-Sensitive Networks with Dynamically Changing Communication Demands
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909376621576192 |
|---|---|
| author | Geppert, Heiko Dürr, Frank Rothermel, Kurt |
| author_facet | Geppert, Heiko Dürr, Frank Rothermel, Kurt |
| contents | Many applications of cyber-physical systems require real-time communication: manufacturing, automotive, etc. Recent Ethernet standards for Time Sensitive Networking (TSN) offer time-triggered scheduling in order to guarantee low latency and jitter bounds. This requires precise frame transmission planning, which becomes especially hard when dealing with many streams, large networks, and dynamically changing communications. A very promising approach uses conflict graphs, modeling conflicting transmission configurations. Since the creation of conflict graphs is the bottleneck in these approaches, we provide an improvement to the conflict graph creation. We present a randomized selection process that reduces the overall size of the graph in half and three heuristics to improve the scheduling success. In our evaluations we show substantial improvements in the graph creation speed and the scheduling success compared to existing work, updating existing schedules in fractions of a second. Additionally, offline planning of 9000 streams was performed successfully within minutes. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2411_01902 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Efficient Conflict Graph Creation for Time-Sensitive Networks with Dynamically Changing Communication Demands Geppert, Heiko Dürr, Frank Rothermel, Kurt Networking and Internet Architecture C.2.1; C.2.3; C.3 Many applications of cyber-physical systems require real-time communication: manufacturing, automotive, etc. Recent Ethernet standards for Time Sensitive Networking (TSN) offer time-triggered scheduling in order to guarantee low latency and jitter bounds. This requires precise frame transmission planning, which becomes especially hard when dealing with many streams, large networks, and dynamically changing communications. A very promising approach uses conflict graphs, modeling conflicting transmission configurations. Since the creation of conflict graphs is the bottleneck in these approaches, we provide an improvement to the conflict graph creation. We present a randomized selection process that reduces the overall size of the graph in half and three heuristics to improve the scheduling success. In our evaluations we show substantial improvements in the graph creation speed and the scheduling success compared to existing work, updating existing schedules in fractions of a second. Additionally, offline planning of 9000 streams was performed successfully within minutes. |
| title | Efficient Conflict Graph Creation for Time-Sensitive Networks with Dynamically Changing Communication Demands |
| topic | Networking and Internet Architecture C.2.1; C.2.3; C.3 |
| url | https://arxiv.org/abs/2411.01902 |