Book description
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.
Table of contents
- Cover
- Acknowledgments
- Introduction
- 1 Basic Model: Single Server, Single Flow
- PART 1: (min,plus) Functions and Algorithms
- PART 2: Network Calculus: Local Analysis
- PART 3: Network Calculus: Global Analysis
- Conclusion
- Appendix
- List of Symbols
- References
- Index
- End User License Agreement
Product information
- Title: Deterministic Network Calculus
- Author(s):
- Release date: December 2018
- Publisher(s): Wiley-ISTE
- ISBN: 9781848218529
You might also like
book
The Linux Programming Interface
The Linux Programming Interface is the definitive guide to the Linux and UNIX programming interface—the interface …
book
Applied Calculus 5th Edition
Applied Calculus is praised for the creative and varied conceptual and modeling problems which motivate and …
book
Calculus I
Let's face it: most students don't take calculus because they find it intellectually stimulating. It's not …
book
Python One-Liners
Python One-Liners will teach you how to read and write “one-liners”: concise statements of useful functionality …