|
|
|
|
| LEADER |
02946nmm a2200421 u 4500 |
| 001 |
EB001917504 |
| 003 |
EBX01000000000000001080406 |
| 005 |
00000000000000.0 |
| 007 |
cr||||||||||||||||||||| |
| 008 |
210123 ||| eng |
| 020 |
|
|
|a 1119563410
|
| 020 |
|
|
|a 9781119563419
|
| 020 |
|
|
|a 1119563402
|
| 020 |
|
|
|a 9781119563402
|
| 100 |
1 |
|
|a Bouillard, Anne
|
| 245 |
0 |
0 |
|a Deterministic network calculus
|c Anne Bouillard, Marc Boyer, Euriell Le Corronc
|
| 250 |
|
|
|a 1st
|
| 260 |
|
|
|a London
|b Wiley-ISTE
|c 2018
|
| 300 |
|
|
|a 1 online resource
|
| 653 |
|
|
|a Théorie des files d'attente
|
| 653 |
|
|
|a Calculus / fast
|
| 653 |
|
|
|a Calcul infinitésimal
|
| 653 |
|
|
|a calculus / aat
|
| 653 |
|
|
|a Calculus / http://id.loc.gov/authorities/subjects/sh85018802
|
| 653 |
|
|
|a Queuing theory / http://id.loc.gov/authorities/subjects/sh85109832
|
| 653 |
|
|
|a Queuing theory / fast
|
| 700 |
1 |
|
|a Boyer, Marc
|e author
|
| 700 |
1 |
|
|a Le Corronc, Euriell
|e author
|
| 041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
| 989 |
|
|
|b OREILLY
|a O'Reilly
|
| 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>
|
| 015 |
|
|
|a GBB8J0240
|
| 776 |
|
|
|z 9781119563402
|
| 776 |
|
|
|z 9781848218529
|
| 776 |
|
|
|z 9781119563419
|
| 856 |
4 |
0 |
|u https://learning.oreilly.com/library/view/~/9781848218529/?ar
|x Verlag
|3 Volltext
|
| 082 |
0 |
|
|a 519.82
|
| 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
|