Lisa Maile

Lisa Maile, M. Sc.

Department of Computer Science
Chair of Computer Science 7 (Computer Networks and Communication Systems)

Room: Room 06.138
Martensstr. 3
91058 Erlangen

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”.


More Information









  • Network Calculus for Time-Sensitive Networking

    (Own Funds)

    Term: since 2018-10-01
    This 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-01

    Network 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.


Winter Term 2023/24

Summer Term 2023

Summer Term 2022

Winter Term 2021/22

Summer Term 2021

Winter Term 2020/21

Summer Term 2020

Winter Term 2019/20

Summer Term 2019

Winter Term 2018/19