Lisa Maile
Lisa Maile, M. Sc.
Consultation hours
Please make an appointment by e-mail.
Short Biography
Lisa Maile is a research associate at the Lab of Computer Networks and Communication Systems. She holds a Master’s degree in computer science with honors from the University of Ulm. During her academic carrier, she was granted several scholarships, including the Deutschlandstipendium and two travel scholarships (granted by the German Academic Exchange Service (DAAD) and the Friedrich-Alexander-Universität Erlangen-Nürnberg).
Lisa’s research specializes on safety-critical communication networks, which require the flexibility to dynamically adapt to changing network conditions, while still ensuring maximum dependability. To face this, she uses theoretic Network Calculus models – derived from the Min-Plus Algebra – to solve practical admission control problems.
Lisa has presented her research as invited speaker on several occasions, some of her research can also be found on YouTube. Besides, her results are also discussed for the inclusion in the IEEE802.1Q standard 1) . She also had several cooperation, e.g., with the Universidad de Granada, Spain, in 2021. In 2020, she worked in an interdisciplinary collaboration on a simulation project addressing the spread of the Coronavirus, which has been also discussed in media.
Lisa Maile’s research interests are the safety and security of industrial networks, including protocol design, network and flow optimization, delay analysis, and machine learning. She is currently pursuing her PhD with the preliminary dissertation title “Combining Static and Dynamic Network Traffic for Dependable Real-Time Communication in Time-Sensitive Networking”.
1) https://www.ieee802.org/1/files/public/docs2023/new-maile-ensuring-reliable-and-predictable-behavior-of-FRER-0623-v02.pdf
More Information
2023
Estimating the Influence of SDN Controller Intervention on Smart Grid Services
2023 IEEE Green Energy and Smart Systems Conference, IGESSC 2023 (Long Beach, CA, 2023-11-13 - 2023-11-14)
In: 2023 IEEE Green Energy and Smart Systems Conference, IGESSC 2023 2023
DOI: 10.1109/IGESSC59090.2023.10321752
BibTeX: Download
, , , :
Joint Task and Flow Scheduling for Time-Triggered and Strict-Priority Networks
2023 International Conference on Computing, Networking and Communications (ICNC) (Honolulu, HI, 2023-02-20 - 2023-02-23)
In: 2023 International Conference on Computing, Networking and Communications (ICNC) 2023
DOI: 10.1109/ICNC57223.2023.10074288
URL: https://ieeexplore.ieee.org/document/10074288
BibTeX: Download
, , , , :
Towards Synthesizing Datasets for IEEE 802.1 Time-sensitive Networking
(2023)
DOI: 10.48550/arXiv.2308.10255
BibTeX: Download
(anderer)
, , , , :
Combining Static and Dynamic Traffic with Delay Guarantees in Time-Sensitive Networking
ValueTools 2023 – International Conference on Performance Evaluation Methodologies and Tools (Heraklion, 2023-09-06 - 2023-09-07)
BibTeX: Download
, , :
On the Validity of Credit-Based Shaper Delay Guarantees in Decentralized Reservation Protocols
31st International Conference on Real-Time Networks and Systems, RTNS 2023 (Dortmund, DEU, 2023-06-07 - 2023-06-08)
In: ACM International Conference Proceeding Series 2023
DOI: 10.1145/3575757.3593644
BibTeX: Download
, , , , :
Multiple DCLC Routing Algorithms for Ultra-Reliable and Time-Sensitive Applications
In: KuVS Fachgespräch - Würzburg Workshop on Modeling, Analysis and Simulation of Next-Generation Communication Networks 2023 (WueWoWAS’23) 2023
DOI: 10.25972/OPUS-32217
BibTeX: Download
, , :
2022
Delay-Guaranteeing Admission Control for Time-Sensitive Networking using the Credit-Based Shaper
In: IEEE Open Journal of the Communications Society (2022), p. 1-1
ISSN: 2644-125X
DOI: 10.1109/OJCOMS.2022.3212939
BibTeX: Download
, , :
Ensuring Reliable and Predictable Behavior of IEEE 802.1CB Frame Replication and Elimination
2022 IEEE International Conference on Communications, ICC 2022 (Seoul, South Korea, 2022-05-16 - 2022-05-20)
In: ICC 2022 - IEEE International Conference on Communications 2022
DOI: 10.1109/ICC45855.2022.9838905
URL: https://ieeexplore.ieee.org/document/9838905
BibTeX: Download
(anderer)
, , , :
2020
Modeling Exit Strategies from COVID-19 Lockdown with a Focus on Antibody Tests
(2020)
DOI: 10.1101/2020.04.14.20063750
URL: https://www.medrxiv.org/content/early/2020/04/18/2020.04.14.20063750
BibTeX: Download
(Working Paper)
, , , , :
Network Calculus Results for TSN: An Introduction
In: 2020 Information Communication Technologies Conference (ICTC) 2020
DOI: 10.1109/ICTC49638.2020.9123308
URL: https://ieeexplore.ieee.org/document/9123308
BibTeX: Download
, , :
2018
Survey of Protocol Reverse Engineering Algorithms: Decomposition of Tools for Static Traffic Analysis
In: IEEE Communications Surveys & Tutorials PP (2018), p. 1-1
ISSN: 1553-877X
DOI: 10.1109/COMST.2018.2867544
URL: https://ieeexplore.ieee.org/document/8449079/
BibTeX: Download
, , :
SDN-Assisted Network-Based Mitigation of Slow DDoS Attacks
In: Beyah Raheem, Chang Bing, Li Yingjiu, Zhu Sencun (ed.): SecureComm 2018: Security and Privacy in Communication Networks, Cham: Springer International Publishing, 2018, p. 102--121
ISBN: 978-3-030-01704-0
DOI: 10.1007/978-3-030-01704-0_6
URL: http://arxiv.org/abs/1804.06750
BibTeX: Download
, , , :
2017
SDN-Assisted Network-Based Mitigation of Slow HTTP Attacks
In: KuVS Fachgespräch "Network Softwarization" - From Research to Application 2017
DOI: 10.15496/publikation-19543
BibTeX: Download
, , :
- Ensuring Reliable and Predictable Behavior of IEEE 802.1CB Frame Replication and Elimination
(Speech / Talk)
2023-09-27, Event: TSN/A Conference, URL: https://events.weka-fachmedien.de/tsna-conference/home/ - Dynamic Reservation of Ultra-Reliable Streams in Time-Sensitive Networking
(Speech / Talk)
2023-09-22, Event: 13th International Workshop on Resilient Networks Design and Modeling (RNDM 2023), University of Gdańsk, URL: http://www.rndm.pl/2023/program.html - Ensuring Reliable and Predictable Behavior of IEEE 802.1CB Frame Replication and Elimination
(Speech / Talk)
2023-06-05, Event: TSN Task Group Meeting (Standardization Committee), URL: https://www.ieee802.org/1/files/public/docs2023/new-maile-ensuring-reliable-and-predictable-behavior-of-FRER-0623-v02.pdf - QoS mechanisms for Industrial Applications
(Speech / Talk)
2022-09-30, Event: Academic Salon on Low-Latency Communication, Programmable Network Components and In-Network Computation, URL: https://hedgedoc.net.in.tum.de/s/oUD9aresZ# - Application of Network Calculus for Reliable and Predictable Behavior of IEEE 802.1CB Frame Replication and Elimination in Time-Sensitive Networks
(Speech / Talk)
2022-09-09, Event: 6th Workshop on Network Calculus (WoNeCa-6), URL: https://plassart.github.io/WoNeCa/2022/ - Credit-Based Shaper Configuration for Delay-Constrained Flow Allocation in TSN
(Speech / Talk)
2021-10-13, Event: Academic Salon on Time-Sensitive Networking and Deterministic Applications, URL: https://codimd.net.in.tum.de/s/SkLdRrAft# - An Introduction to Network Calculus Results for Time-Sensitive Networks
(Speech / Talk)
2020-10-09, Event: 5th Workshop on Network Calculus (WoNeCa-5), URL: https://disco.cs.uni-kl.de/woneca-2020
-
Network Calculus for Time-Sensitive Networking
(Own Funds)
Term: since 2018-10-01This research project deals with the application of quality of service guarantees in Time-Sensitive Networking, in particular using Network Calculus. Real-time systems are increasingly required in industry, e.g. the automotive, automation or entertainment industries. Classical Ethernet, however, does not guarantee real-time performance, which leads the Time-Sensitive Networking Task Group (IEEE 802.1) to develop standards for real-time data transmission over Ethernet networks. These standards are summarized under the term Time-Sensitive Networking (TSN). Within the scope of this research project, the application of Network Calculus for TSN is now being investigated. Network Calculus (NC) is a system theory for deterministic performance evaluation. It uses mathematical methods to provide performance guarantees for communication systems. NC can help evaluate TSN's real-time properties, meet required latency limits, and provide insight into the optimal configuration of networks. It also enables buffer sizing and can evaluate existing or new scheduling algorithms. -
Network Calculus and Optimization
(Own Funds)
Term: since 2004-03-01Network calculus (NC) is a system theory for deterministic performanceevaluation. It uses mathematical methods to provide performanceguarantees for communication systems. It can be applied in thedesign phase of future systems as well as the analysis of existingsystems. In real-time systems, the timeliness of events plays animportant role. Therefore, the classical performance evaluation based onstochastic methods that result in (stochastic) expectation values, i.e.mean values, has to be extended by mathematical tools producingguaranteed bounds for worst case scenarios. Network calculus allows toobtain upper bounds for end-to-end delays for one nodes or aseries of nodes within a network, upper bounds for the required bufferspace and bounds for the output flow.These analytic performance bounds characterize the worst-case behaviorof traffic flows and allow dimensioning the corresponding systems.
Currently, we study the applicability of NC for multiplexed flows, inparticular when the FIFO property cannot be assumed at the merging ofindividual flows. The aggregation of data flows plays an important rolein modelling the multiplexing scheme. We apply NC for performanceevaluation both of aggregate multiplexing at one node and atconcatenation of aggregated multiple nodes in different scenarios.
We have successfully introduced network calculus methods in thefield of internal automotive communication systems in industrialapplications. Embedded in-car networks need to fulfill hardreal-time constraints. While TDMA-based access schemes in FlexRayguarantee that certain bound can be met, statistical multiplexingin CAN networks only allows to calculate bounds for the highestpriority messages. By applying network calculus, we obtained boundsfor all priority classes without the need to specify a concretescheduling of the messages. Upper bounds for the amount of datathat arrives at each network node are enough to determine hardbounds for the end-to-end delay in CAN networks.Another field of application is industrial communication.Factory automation often also requires hard real-time boundsfor the end-to-end delay of messages. The use of Ethernet withpriority tagging allows cost-efficient implementation offactory automation systems. But without stringent planningof the network, the required bounds on the end-to-end delaycannot be guaranteed. Network calculus allows to obtain therequired bounds when applied in the planning phase of thenetwork. It also allows to dimension the buffers of nodes,e.g. of industrial Ethernet switches. Nowadays, some ofthe users of industrial Ethernet need to integratenon-real-time products like web cams and remote operationterminals into existing networks. Withoutadditional analysis, the additional traffic caused by devicesthat do not require hard real-time constraints willcause a violation of the bounds for the delay and bufferspace for real-time traffic. By taking into account thisnon-real-time traffic in network calculus and by applyingtraffic shaping for the non-real-time flows allows todimension the network so that all bounds are met.Network calculus is currently integrated into an existingautomated industrial network planning tool.