Name: Deterministic Network Calculus: From Theory to Practical Implementation (Networks and Telecommunications) (en Inglés)
Price: 541525.00 COP
Availability: InStock
Author: Anne Bouillard; Marc Boyer; Euriell Le Corronc
ISBN: 9781848218529

portada Deterministic Network Calculus: From Theory to Practical Implementation (Networks and Telecommunications) (en Inglés)

Formato

Libro Físico

Editorial

Iste Ltd And John Wiley & Sons Inc

Autor

Anne Bouillard; Marc Boyer; Euriell Le Corronc

Año

2018

Idioma

Inglés

N° páginas

350

Encuadernación

Tapa Dura

ISBN13

9781848218529

N° edición

Categorías

Algoritmos y estructuras de datos

Deterministic Network Calculus: From Theory to Practical Implementation (Networks and Telecommunications) (en Inglés)

Anne Bouillard; Marc Boyer; Euriell Le Corronc (Autor) · Iste Ltd And John Wiley & Sons Inc · Tapa Dura

Libro Físico

$ 541.525

$ 1.079.375

Ahorras: $ 537.850

50% descuento

Envío normal

Origen: Reino Unido (Costos de importación incluídos en el precio)

Se enviará desde nuestra bodega entre el Martes 21 de Mayo y el Martes 28 de Mayo.

Lo recibirás en cualquier lugar de Colombia entre 1 y 5 días hábiles luego del envío.

Reseña del libro "Deterministic Network Calculus: From Theory to Practical Implementation (Networks and Telecommunications) (en Inglés)"

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.