Cargando…

Deterministic network calculus /

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...

Descripción completa

Detalles Bibliográficos
Autores principales: Bouillard, Anne (Autor), Boyer, Marc (Autor), Le Corronc, Euriell (Autor)
Formato: Electrónico eBook
Idioma:Inglés
Publicado: London : Wiley-ISTE, 2018.
Edición:1st
Temas:
Acceso en línea:Texto completo (Requiere registro previo con correo institucional)

MARC

LEADER 00000cam a22000001i 4500
001 OR_on1088911394
003 OCoLC
005 20231017213018.0
006 m o d
007 cr |||||||||||
008 181003s2018 enk o 000 0 eng d
040 |a UKMGB  |b eng  |e rda  |e pn  |c UKMGB  |d OCLCO  |d UKAHL  |d OCLCF  |d OTZ  |d OCLCQ  |d TOH  |d OCLCO  |d OCLCQ 
015 |a GBB8J0240  |2 bnb 
016 7 |a 019087278  |2 Uk 
020 |a 9781119563419  |q (ePub ebook) 
020 |a 1119563410 
020 |a 9781119563402  |q (PDF ebook) 
020 |a 1119563402 
020 |z 9781848218529  |q (hbk.) 
029 0 |a UKMGB  |b 019087278 
035 |a (OCoLC)1088911394 
037 |a 9781119563419  |b Wiley 
082 0 4 |a 519.82  |2 23 
049 |a UAMI 
100 1 |a Bouillard, Anne,  |e author. 
245 1 0 |a Deterministic network calculus /  |c Anne Bouillard, Marc Boyer, Euriell Le Corronc. 
250 |a 1st 
264 1 |a London :  |b Wiley-ISTE,  |c 2018. 
300 |a 1 online resource 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
500 |a <P>1. Basic Model: Single Server, Single Flow.<br /> <br /> Part 1. (min, plus) Functions and Algorithms <br /> 2. The (min, plus) Functions Semi-ring.<br /> 3. Sub-classes of Functions.<br /> 4. Efficient Computations for (min, plus) Operators. <br /> <br /> Part 2. Network Calculus: Local Analysis <br /> 5. Network Calculus Basics: a Server Crossed by a Single Flow. <br /> 6. Single Flow Crossing Several Servers.<br /> 7. Multiple Flows Crossing One Server.<br /> 8. Packets.<br /> 9. A Hierarchy of Service Curves.<br /> <br /> Part 3. Network Calculus: Global Analysis <br /> 10. Modular Analysis: Computing with Curves.<br /> 11. Tight Worst-case Performances.<br /> 12. Stability in Networks with Cyclic Dependencies.</p> 
588 0 |a CIP data; resource not viewed. 
520 |a 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. 
590 |a O'Reilly  |b O'Reilly Online Learning: Academic/Public Library Edition 
650 0 |a Queuing theory. 
650 0 |a Calculus. 
650 6 |a Théorie des files d'attente. 
650 6 |a Calcul infinitésimal. 
650 7 |a calculus.  |2 aat 
650 7 |a Calculus.  |2 fast  |0 (OCoLC)fst00844119 
650 7 |a Queuing theory.  |2 fast  |0 (OCoLC)fst01085713 
700 1 |a Boyer, Marc,  |e author. 
700 1 |a Le Corronc, Euriell,  |e author. 
776 0 8 |i Print version :  |z 9781848218529 
856 4 0 |u https://learning.oreilly.com/library/view/~/9781848218529/?ar  |z Texto completo (Requiere registro previo con correo institucional) 
938 |a Askews and Holts Library Services  |b ASKH  |n AH35216717 
938 |a Askews and Holts Library Services  |b ASKH  |n AH35216716 
994 |a 92  |b IZTAP