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...
| Clasificación: | Libro Electrónico |
|---|---|
| Autor principal: | |
| Otros Autores: | , |
| Formato: | Electrónico eBook |
| Idioma: | Inglés |
| Publicado: |
Somerset :
John Wiley & Sons, Incorporated,
2018.
|
| Temas: | |
| Acceso en línea: | Texto completo |
MARC
| LEADER | 00000cam a2200000Mu 4500 | ||
|---|---|---|---|
| 001 | EBOOKCENTRAL_on1061095092 | ||
| 003 | OCoLC | ||
| 005 | 20240329122006.0 | ||
| 006 | m o d | ||
| 007 | cr |n|---||||| | ||
| 008 | 181103s2018 xx o 000 0 eng d | ||
| 040 | |a EBLCP |b eng |e pn |c EBLCP |d OCLCQ |d DEBBG |d OCLCQ |d LOA |d OCLCO |d K6U |d OCLCF |d OCLCO |d SGP |d OCLCQ |d OCLCO |d OCLCL | ||
| 020 | |a 9781119563419 | ||
| 020 | |a 1119563410 | ||
| 029 | 1 | |a AU@ |b 000067288845 | |
| 035 | |a (OCoLC)1061095092 | ||
| 050 | 4 | |a T57.9 |b .B685 2018 | |
| 082 | 0 | 4 | |a 519.82 |2 23 |
| 049 | |a UAMI | ||
| 100 | 1 | |a Bouillard, Anne. | |
| 245 | 1 | 0 | |a Deterministic Network Calculus. |
| 260 | |a Somerset : |b John Wiley & Sons, Incorporated, |c 2018. | ||
| 300 | |a 1 online resource (354 pages) | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a computer |b c |2 rdamedia | ||
| 338 | |a online resource |b cr |2 rdacarrier | ||
| 588 | 0 | |a Print version record. | |
| 505 | 0 | |a Cover; Half-Title Page; Title Page; Copyright Page; Contents; Acknowledgments; Introduction; I.1. Organization of the book; I.2. How to read this book; I.3. Network calculus in four pages; 1. Basic Model: Single Server, Single Flow; 1.1. Modeling principles; 1.2. Constant rate server; 1.3. Flow model; 1.4. Server model; 1.5. Delay and memory usage models; 1.6. Summary; PART 1: (min, plus) Functions and Algorithms; 2. The (min, plus) Functions Semi-ring; 2.1. The (min, plus)-based dioids; 2.1.1. Dioids; 2.1.2. The (min, plus) dioid; 2.1.3. The dioid of (min, plus) functions. | |
| 505 | 8 | |a 2.2. Sub-additive closure2.2.1. Kleene star operator; 2.2.2. Sub-additive closure; 2.3. Deconvolution; 2.3.1. Residuation theory; 2.3.2. (min, plus) deconvolution as a residuation operator; 2.4. Link with (max, plus) dioid; 2.5. Summary; 3. Sub-classes of Functions; 3.1. Usual functions; 3.1.1. Convolution and deconvolution of the usual classes of functions; 3.1.2. Horizontal and vertical deviations for the usual classes of functions; 3.2. Non-negative and non-decreasing functions; 3.2.1. Pseudo-inverse of a function; 3.2.2. Convolution and continuity; 3.3. Concave and convex functions. | |
| 505 | 8 | |a 3.3.1. Concave functions3.3.2. Convex functions; 3.4. Summary; 4. Efficient Computations for (min, plus) Operators; 4.1. Classes of functions with finite representations; 4.2. Piecewise linear concave/convex functions; 4.2.1. Representation of piecewise linear concave and convex functions; 4.2.2. (min, plus)-convolution of convex and concave functions; 4.3. A stable class of functions; 4.3.1. Examples of instability of some classes of functions; 4.3.2. Class of plain piecewise linear ultimately pseudo-periodic functions; 4.3.3. Functions with discrete domain. | |
| 505 | 8 | |a 4.4. Containers of (min, plus) functions4.4.1. Notations and context; 4.4.2. The object container; 4.4.3. Inclusion functions for containers; 4.5. Implementations; PART 2: Network Calculus: Local Analysis; 5. Network Calculus Basics: a Server Crossed by a Single Flow; 5.1. Arrival curve; 5.2. Service curves; 5.2.1. Min-plus minimal service curve; 5.2.2. Strict minimal service curve; 5.2.3. Comparison of min-plus and strict minimal service curves; 5.2.4. Maximal service curve; 5.3. From curves to performance guarantees; 5.3.1. Backlog and delay bounds. | |
| 505 | 8 | |a 5.3.2. Arrival curve for the departure cumulative function5.3.3. Complements on the performance operators; 5.4. Bibliographic and historic notes; 5.5. Summary; 6. Single Flow Crossing Several Servers; 6.1. Servers in tandem; 6.1.1. Concatenation and service convolution; 6.1.2. The pay burst only once phenomenon; 6.1.3. Composition of strict service curves; 6.2. Control design; 6.2.1. Tandem control; 6.2.2. Feedback control; 6.3. Essential use cases; 6.3.1. Essential services curves; 6.3.2. Essential arrival curves; 6.4. Summary; 7. Multiple Flows Crossing One Server. | |
| 500 | |a 7.1. MIMO servers and aggregation of flows. | ||
| 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 ProQuest Ebook Central |b Ebook Central Academic Complete | ||
| 650 | 0 | |a Queuing theory. | |
| 650 | 0 | |a Computer networks |x Mathematical models. | |
| 650 | 6 | |a Théorie des files d'attente. | |
| 650 | 6 | |a Réseaux d'ordinateurs |x Modèles mathématiques. | |
| 650 | 7 | |a Computer networks |x Mathematical models |2 fast | |
| 650 | 7 | |a Queuing theory |2 fast | |
| 700 | 1 | |a Boyer, Marc. | |
| 700 | 1 | |a Le Corronc, Euriell. | |
| 758 | |i has work: |a Deterministic network calculus (Text) |1 https://id.oclc.org/worldcat/entity/E39PCFYxm4y4DrgqCkTb8Hp8bq |4 https://id.oclc.org/worldcat/ontology/hasWork | ||
| 776 | 0 | 8 | |i Print version: |a Bouillard, Anne. |t Deterministic Network Calculus. |d Somerset : John Wiley & Sons, Incorporated, ©2018 |z 9781848218529 |
| 856 | 4 | 0 | |u https://ebookcentral.uam.elogim.com/lib/uam-ebooks/detail.action?docID=5566694 |z Texto completo |
| 938 | |a ProQuest Ebook Central |b EBLB |n EBL5566694 | ||
| 994 | |a 92 |b IZTAP | ||