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.
Paga facilmente con carta, Klarna, Apple Pay o Google Pay. Non sei soddisfatto? Hai sempre 14 giorni per il rimborso. Leggi di più nei nostri termini. Per qualsiasi domanda, scrivici a hello@memmo.org.
Memmo rende lo studio più facile, ovunque tu sia nel mondo. Qui trovi i tuoi libri di testo e strumenti di studio intelligenti, tutto in un unico posto: riassunti, quiz, podcast e flashcard. E poi c'è Ted, il tuo compagno di studio che risponde a ogni tua domanda. Oltre 50.000 studenti studiano già qui: è stato creato per aiutarti a imparare più velocemente e a stressarti meno.