- We will send in 10–14 business days.
/images/books/12392764/9781848218529.jpg)
- Author: Anne Bouillard
- Publisher: Wiley-ISTE
- ISBN-10: 1848218524
- ISBN-13: 9781848218529
- Format: 15.5 x 23.9 x 2 cm, hardcover
- Language: English
- SAVE -10% with code: EXTRA
Reviews
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.
EXTRA 10 % discount with code: EXTRA
The promotion ends in 19d.17:33:33
The discount code is valid when purchasing from 10 €. Discounts do not stack.
- Author: Anne Bouillard
- Publisher: Wiley-ISTE
- ISBN-10: 1848218524
- ISBN-13: 9781848218529
- Format: 15.5 x 23.9 x 2 cm, hardcover
- Language: English English
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.
Reviews