PhD Researcher Justus Rischke received the Dipl.-Ing. degree in electrical engineering from Technical University Dresden (TU Dresden), Dresden, Germany, in 2017, where he is currently pursuing the Ph.D. degree with the Deutsche Telekom Chair of Communication Networks. His research interests include network coding, reinforcement learning in software-defined networks (SDN) for low latency communication, and 5G Campus Networks.
Phone: +49 351 463-42114 Email: Justus.Rischke@tu-dresden.de Room: BAR/I9
SS 20
WS 19/20
SS 19
WS 18/19
SS 18
Diploma Thesis
Study Thesis
Zimmermann, Sandra; Rischke, Justus; Cabrera, Juan A.; Fitzek, Frank H. P.
Journey to MARS: Interplanetary Coding for relieving CDNs Proceedings Article
In: 2020 IEEE Global Communications Conference: Selected Areas in Communications: Cloud & Fog/Edge Computing, Networking and Storage (Globecom2020 SAC CCNS), Taipei, Taiwan, 2020.
BibTeX
@inproceedings{Zimm2012:Journey, title = {Journey to MARS: Interplanetary Coding for relieving CDNs}, author = {Sandra {Zimmermann} and Justus {Rischke} and Juan A. {Cabrera} and Frank H. P. {Fitzek}}, year = {2020}, date = {2020-12-07}, urldate = {2020-12-07}, booktitle = {2020 IEEE Global Communications Conference: Selected Areas in Communications: Cloud \& Fog/Edge Computing, Networking and Storage (Globecom2020 SAC CCNS)}, address = {Taipei, Taiwan}, keywords = {}, pubstate = {published}, tppubtype = {inproceedings} }
Close
Rischke, Justus; Fitzek, Frank H. P.; Müller, Julian-Steffen; Krüger, Jens
Resiliente Fehlerbehandlung in Ethernet-basierten Netzwerken Patent
2020.
@patent{Rischke2020, title = {Resiliente Fehlerbehandlung in Ethernet-basierten Netzwerken}, author = {Justus {Rischke} and Frank H. P. {Fitzek} and Julian-Steffen {M\"{u}ller} and Jens {Kr\"{u}ger}}, year = {2020}, date = {2020-07-06}, keywords = {}, pubstate = {published}, tppubtype = {patent} }
Rischke, Justus; Sossalla, Peter; Salah, Hani; Fitzek, Frank H. P.; Reisslein, Martin
QR-SDN: Towards Reinforcement Learning States, Actions, and Rewards for Direct Flow Routing in Software-Defined Networks Journal Article
In: IEEE Access, 2020, ISSN: 2169-3536.
Abstract | Links | BibTeX
@article{9201294, title = {QR-SDN: Towards Reinforcement Learning States, Actions, and Rewards for Direct Flow Routing in Software-Defined Networks}, author = {Justus {Rischke} and Peter {Sossalla} and Hani {Salah} and Frank H. P. {Fitzek} and Martin {Reisslein}}, doi = {10.1109/ACCESS.2020.3025432}, issn = {2169-3536}, year = {2020}, date = {2020-01-01}, journal = {IEEE Access}, abstract = {Flow routing can achieve fine-grained network performance optimizations by routing distinct packet traffic flows over different network paths. While the centralized control of Software-Defined Networking (SDN) provides a control framework for implementing centralized network optimizations, e.g., optimized flow routing, the implementation of flow routing that is adaptive to varying traffic loads requires complex models. The goal of this study is to pursue a model-free approach that is based on reinforcement learning. We design and evaluate QR-SDN, a classical tabular reinforcement learning approach that directly represents the routing paths of individual flows in its state-action space. Due to the direct representation of flow routes in the QR-SDN state-action space, QR-SDN is the first reinforcement learning SDN routing approach to enable multiple routing paths between a given source (ingress) switch\textendashdestination (egress) switch pair while preserving the flow integrity. That is, in QR-SDN, packets of a given flow take the same routing path, while different flows with the same source-destination switch pair may take different routes (in contrast, the recent DRL-TE approach splits a given flow on a per-packet basis incurring high complexity and out-of-order packets). We implemented QR-SDN in a Software-Defined Network (SDN) emulation testbed. Our evaluations demonstrate that the flow-preserving multi-path routing of QR-SDN achieves substantially lower flow latencies than prior routing approaches that determine only a single source-destination route. A limitation of QR-SDN is that the state-action space grows exponentially with the number of network nodes. Addressing the scalability of direct flow routing, e.g., through routing only high-rate flows, is an important direction for future research. The QR-SDN code is made publicly available to support this future research.}, keywords = {}, pubstate = {published}, tppubtype = {article} }
Rischke, Justus; Sossalla, Peter
Machine Learning for Routing Book Chapter
In: Fitzek, Frank H. P.; Granelli, Fabrizio; Seeling, Patrick (Ed.): Computing in Communication Networks – From Theory to Practice, vol. 1, Chapter 16, pp. 303-311, Elsevier, 1, 2020, (https://cn.ifn.et.tu-dresden.de/compcombook/).
@inbook{CompBookChap16, title = {Machine Learning for Routing}, author = {Justus {Rischke} and Peter {Sossalla}}, editor = {Frank H. P. {Fitzek} and Fabrizio {Granelli} and Patrick {Seeling}}, year = {2020}, date = {2020-01-01}, booktitle = {Computing in Communication Networks \textendash From Theory to Practice}, volume = {1}, pages = {303-311}, publisher = {Elsevier}, edition = {1}, chapter = {16}, series = {1}, note = {https://cn.ifn.et.tu-dresden.de/compcombook/}, keywords = {}, pubstate = {published}, tppubtype = {inbook} }
Rischke, Justus; Xiang, Zuo
Network Coding for Transport Book Chapter
In: Fitzek, Frank H. P.; Granelli, Fabrizio; Seeling, Patrick (Ed.): Computing in Communication Networks – From Theory to Practice, vol. 1, Chapter 20, pp. 357-367, Elsevier, 1, 2020, (https://cn.ifn.et.tu-dresden.de/compcombook/).
@inbook{CompBookChap20, title = {Network Coding for Transport}, author = {Justus {Rischke} and Zuo {Xiang}}, editor = {Frank H. P. {Fitzek} and Fabrizio {Granelli} and Patrick {Seeling}}, year = {2020}, date = {2020-01-01}, booktitle = {Computing in Communication Networks \textendash From Theory to Practice}, volume = {1}, pages = {357-367}, publisher = {Elsevier}, edition = {1}, chapter = {20}, series = {1}, note = {https://cn.ifn.et.tu-dresden.de/compcombook/}, keywords = {}, pubstate = {published}, tppubtype = {inbook} }
Rischke, Justus; Salah, Hani
Software-Defined Networks Book Chapter
In: Fitzek, Frank H. P.; Granelli, Fabrizio; Seeling, Patrick (Ed.): Computing in Communication Networks – From Theory to Practice, vol. 1, Chapter 6, pp. 113-125, Elsevier, 1, 2020, (https://cn.ifn.et.tu-dresden.de/compcombook/).
@inbook{CompBookChap06, title = {Software-Defined Networks}, author = {Justus {Rischke} and Hani {Salah}}, editor = {Frank H. P. {Fitzek} and Fabrizio {Granelli} and Patrick {Seeling}}, year = {2020}, date = {2020-01-01}, booktitle = {Computing in Communication Networks \textendash From Theory to Practice}, volume = {1}, pages = {113-125}, publisher = {Elsevier}, edition = {1}, chapter = {6}, series = {1}, note = {https://cn.ifn.et.tu-dresden.de/compcombook/}, keywords = {}, pubstate = {published}, tppubtype = {inbook} }
Rischke, Justus; Gabriel, Frank; Pandi, Sreekrishna; Nguyen, Giang T.; Salah, Hani; Fitzek, Frank H. P.
Improving Communication Reliability Efficiently: Adaptive Redundancy for RLNC in SDN Proceedings Article
In: 2019 IEEE Conference on Network Softwarization (NetSoft) (NetSoft 2019), Paris, France, 2019.
@inproceedings{Risc1906:Improving, title = {Improving Communication Reliability Efficiently: Adaptive Redundancy for RLNC in SDN}, author = {Justus {Rischke} and Frank {Gabriel} and Sreekrishna {Pandi} and Giang T. {Nguyen} and Hani {Salah} and Frank H. P. {Fitzek}}, year = {2019}, date = {2019-06-01}, booktitle = {2019 IEEE Conference on Network Softwarization (NetSoft) (NetSoft 2019)}, address = {Paris, France}, keywords = {}, pubstate = {published}, tppubtype = {inproceedings} }
Gabriel, Frank; Rischke, Justus; Fitzek, Frank H. P.; Mühleisen, Maciej; Lohmar, Thorsten
No Plan Survives Contact with the Enemy: On Gains of Coded Multipath over MPTCP in Dynamic Settings Proceedings Article
In: 2019 IEEE Wireless Communications and Networking Conference (WCNC) (IEEE WCNC 2019), Marrakech, Morocco, 2019.
Abstract | BibTeX
@inproceedings{Risc1904:No, title = {No Plan Survives Contact with the Enemy: On Gains of Coded Multipath over MPTCP in Dynamic Settings}, author = {Frank {Gabriel} and Justus {Rischke} and Frank H. P. {Fitzek} and Maciej {M\"{u}hleisen} and Thorsten {Lohmar}}, year = {2019}, date = {2019-04-15}, booktitle = {2019 IEEE Wireless Communications and Networking Conference (WCNC) (IEEE WCNC 2019)}, address = {Marrakech, Morocco}, abstract = {Systems for assisted and autonomous driving increasingly depend on information received and updated through wireless communication. But wireless communication often faces performance degradation because of its dynamic nature. Using multiple available communication channels, such as WiFi, LTE or 5G New Radio, simultaneously can increase the throughput and reliability, but also increases the dynamics of the system. MPTCP estimates the channel capacity and latency and schedule packets accordingly. However, in conditions with unstable channels MPTCP fails to fully utilize the available capacity. In this paper, we propose the use of Network Coding to efficiently utilize the available resources. We use a channel agnostic, random scheduler to maximize the utilization of all available channels. This prevents underestimations, but also produces a high number of packet loss and duplicate transmissions. We use Network Coding to repair the losses and reduce the overhead of redundant data. Our implementation of this protocol is evaluated against MPTCP in an emulated multipath network with time-varying path properties. The evaluation shows, that the proposed protocol utilizes the channels efficiently even in unstable conditions. In the evaluated dynamic network, the proposed protocol efficiently utilizes 94% of the available capacity, while MPTCP is below 80% due to underestimation. While our protocol is not suitable for general purpose traffic, it provides good performance for large file transfers in unstable wireless multipath networks.}, keywords = {}, pubstate = {published}, tppubtype = {inproceedings} }
Zielinski, Erich; Benze, Jörg; Burk, Andreas; Fitzek, Frank H. P.; Friedrich, Petra; Gladisch, Andreas; Kühn, Paul; Kriegler, Florian; Lange, Christoph; Mühleisen, Maciej; Müller, Andreas; Rischke, Justus; Sachs, Joachim; Schäfer, Ralf; Weidlich, Thomas; Wietfeld, Christian
VDE ITG Diskussionspapier: Offenes Internet in Deutschland – eine Bestandsaufnahme (Download) Online
2018.
Links | BibTeX
@online{zielinski_benze_burk_fitzek, title = {VDE ITG Diskussionspapier: Offenes Internet in Deutschland \textendash eine Bestandsaufnahme (Download)}, author = {Erich {Zielinski} and J\"{o}rg {Benze} and Andreas {Burk} and Frank H. P. {Fitzek} and Petra {Friedrich} and Andreas {Gladisch} and Paul {K\"{u}hn} and Florian {Kriegler} and Christoph {Lange} and Maciej {M\"{u}hleisen} and Andreas {M\"{u}ller} and Justus {Rischke} and Joachim {Sachs} and Ralf {Sch\"{a}fer} and Thomas {Weidlich} and Christian {Wietfeld}}, url = {https://shop.vde.com/de/vde-itg-diskussionspapier-offenes-internet-in-deutschland-eine-bestandsaufnahme-download}, year = {2018}, date = {2018-05-01}, journal = {https://www.vde.com/de/itg}, publisher = {VDE ITG}, keywords = {}, pubstate = {published}, tppubtype = {online} }