Synopses & Reviews
Synopsis
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.
Synopsis
Deterministic network calculus is a theory based on the (min, plus) algebra. Its aim is to compute worst-case performance bounds in communication networks. Our goal is to provide a comprehensive view of this theory and its recent advances, from its theoretical foundations to its implementations.
The book is divided into three parts. The first part focuses on the (min, plus) framework and its algorithmic aspects. The second part defines the network calculus model and analyzes one server in isolation. Different service and scheduling policies are discussed, particularly when data is packetized. The third part is about network analyses. Pay burst only once and pay multiplexing only once phenomena are exhibited, and different analyses are proposed and compared. This includes the linear programming approaches that compute tight performance bounds. Finally, some partial results on the stability are detailed.