Skip to main content

Deterministic Network Calculus

Deterministic Network Calculus

Anne Bouillard, Marc Boyer, Euriell Le Corronc

ISBN: 978-1-848-21852-9

Dec 2018, Wiley-ISTE

300 pages

Select type: Hardcover

Product not available for purchase


This book is about the (min,+) algebra and its application to worst-case performances in networks, the network calculus theory. Mastering worst-case delays and memory usage in networks is a quality in soft real-time systems (like the one on the Internet: audio, video, etc.) and a requirement for critical real-time systems (like the cyber-physical ones: aircrafts, factories, etc.). The network calculus theory has been designed, implemented and used to compute such bounds. This book offers an up-to-date overview of this framework, from its mathematical background (the min-plus algebra) to its applications, through its implementations.

1 Introduction

Part I Min,plus functions and algorithms

2 The (min,plus) functions semi-ring

3 Sub-classes of functions

4 Algorithms

Part II Network Calculus: local analysis

5 Single server, single flow

6 Single server, multiple flow

7 Packets

8 Design and control

9 Hierarchy

Part III Network Calculus: global analysis

10 Modular analysis: computing with contracts

11 Exact worst-case delays

12 Cycles

13 Conclusion