[1] Steffen Bondorf, Paul Nikolaus, and Jens B. Schmitt. Delay bounds in feed-forward networks – a fast and accurate network calculus solution. arXiv:1603.02094 [cs.NI], March 2016. [ bib | DOI | http ]
[2] Steffen Bondorf, Paul Nikolaus, and Jens B. Schmitt. Quality and cost of deterministic network calculus – design and evaluation of an accurate and fast analysis. Proceedings of the ACM on Measurement and Analysis of Computing Systems (POMACS), 1(1):34, 2017. [ bib | DOI | .pdf ]
[3] Steffen Bondorf, Paul Nikolaus, and Jens B. Schmitt. Quality and cost of deterministic network calculus – design and evaluation of an accurate and fast analysis. In Proceedings of the ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS 2017), June 2017. [ bib | DOI | .pdf ]
[4] Paul Nikolaus and Jens Schmitt. On Per-Flow Delay Bounds in Tandem Queues under (In)Dependent Arrivals. In Proceedings of 16th IFIP Networking 2017 Conference (NETWORKING'17), Stockholm, Sweden, June 2017. IEEE. ISBN 978-3-901882-94-4. [ bib | DOI | .pdf ]
[5] Steffen Bondorf, Paul Nikolaus, and Jens B. Schmitt. Catching Corner Cases in Network Calculus -- Flow Segregation Can Improve Accuracy. In Proceedings of 19th International GI/ITG Conference on Measurement, Modelling and Evaluation of Computing Systems (MMB), 2018. [ bib | DOI | .pdf ]
[6] Paul Nikolaus and Jens Schmitt. Improving Output Bounds in the Stochastic Network Calculus Using Lyapunov’s Inequality. In Proc. IFIP Networking 2018 Conference (NETWORKING'18), Zurich, Switzerland, May 2018. IEEE. ISBN 978-3-903176-08-9. [ bib | DOI | .pdf ]
[7] Paul Nikolaus, Sebastian Henningsen, Michael A. Beck, and Jens Schmitt. Integrating Fractional Brownian Motion Arrivals into the Statistical Network Calculus. In 2018 30th International Teletraffic Congress (ITC 30), volume 2, pages 37--42, Vienna, Austria, September 2018. IEEE. [ bib | DOI | .pdf ]
[8] Paul Nikolaus, Jens B. Schmitt, and Florin Ciucu. Dealing with dependence in stochastic network calculus -- using independence as a bound. Technical report, TU Kaiserslautern, Germany, May 2019. [ bib | .pdf ]
[9] Paul Nikolaus, Jens Schmitt, and Malte Schütze. h-mitigators: Improving your stochastic network calculus output bounds. Computer Communications, 144:188--197, August 2019. [ bib | DOI | .pdf ]
[10] Paul Nikolaus, Jens Schmitt, and Florin Ciucu. Dealing with dependence in stochastic network calculus -- using independence as a bound. In Proc. International Conference on Analytical and Stochastic Modeling Techniques and Applications (ASMTA'19), Moscow, Russia, October 2019. Springer. [ bib | DOI | .pdf ]
[11] Paul Nikolaus and Jens Schmitt. On the stochastic end-to-end delay analysis in sink trees under independent and dependent arrivals. In Proc. Conference on Measurement, Modelling and Evaluation of Computing Systems (MMB'20). Springer, 2020. [ bib | DOI | .pdf ]
[12] Paul Nikolaus and Jens Schmitt. Improving Delay Bounds in the Stochastic Network Calculus by Using less Stochastic Inequalities. In Proc. 13th EAI International Conference on Performance Evaluation Methodologies and Tools (VALUETOOLS 2020), Tsukuba, Japan, May 2020. [ bib | DOI | .pdf ]
[13] Anne Bouillard, Paul Nikolaus, and Jens Schmitt. Unleashing the power of paying multiplexing only once in stochastic network calculus. Technical report, TU Kaiserslautern, Germany, 2021. [ bib | DOI | .pdf ]
[14] Anne Bouillard, Paul Nikolaus, and Jens Schmitt. Unleashing the power of paying multiplexing only once in stochastic network calculus. Proceedings of the ACM on Measurement and Analysis of Computing Systems (POMACS), 6(2):1--27, 2022. [ bib | DOI | .pdf ]
[15] Paul Nikolaus. Dealing with Dependence in the End-to-End Performance Analysis in Stochastic Network Calculus. PhD thesis, Technische Universität Kaiserslautern, 2022. [ bib | DOI | .pdf ]
[16] Anne Bouillard, Paul Nikolaus, and Jens Schmitt. Unleashing the power of paying multiplexing only once in stochastic network calculus. In Abstract Proceedings of the 2022 ACM SIGMETRICS/IFIP PERFORMANCE Joint International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS/PERFORMANCE '22 Abstracts), pages 117--118, June 2022. [ bib | DOI | .pdf ]
[17] Vlad-Cristian Constantin, Paul Nikolaus, and Jens Schmitt. Improving performance bounds for weighted round-robin schedulers under constrained cross-traffic. In Proc. IFIP Networking 2022 Conference (NETWORKING'22), Catania, Italy, June 2022. IEEE. ISBN 978-3-903176-48-5. [ bib | DOI | .pdf ]
[18] Vlad-Cristian Constantin, Paul Nikolaus, and Jens Schmitt. Original and erratum: Improving performance bounds for weighted round-robin schedulers under constrained cross-traffic, December 2022. [ bib | DOI | .pdf ]
[19] Raffaele Zippo, Paul Nikolaus, and Giovanni Stea. Extending the network calculus algorithmic toolbox for ultimately pseudo-periodic functions: Pseudo-inverse and composition. Discrete Event Dynamic Systems, pages 1--39, 2023. [ bib | DOI | .pdf ]
[20] Raffaele Zippo, Paul Nikolaus, and Giovanni Stea. Isospeed: Improving (min,+) convolution by exploiting (min,+)/(max,+) isomorphism. In 35th Euromicro Conference on Real-Time Systems (ECRTS 2023). Schloss Dagstuhl-Leibniz-Zentrum f"ur Informatik, 2023. [ bib | DOI | .pdf ]