Deterministic network calculus : from theory to practical implementation /
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...
| Main Authors: | , , |
|---|---|
| Format: | eBook |
| Language: | English |
| Published: |
London, UK : Hoboken, NJ :
ISTE, Ltd. ; John Wiley & Sons, Inc.,
2018.
|
| Series: | Networks and telecommunications series.
|
| Subjects: | |
| Online Access: | Connect to the full text of this electronic book |
Table of Contents:
- Basic Model: Single Server, Single Flow
- (min,plus) Functions and Algorithms. The (min,plus) Functions Semi-ring
- Sub-classes of Functions
- Efficient Computations for (min,plus) Operators
- Network Calculus: Local Analysis. Network Calculus Basics: a Server Crossed by a Single Flow
- Single Flow Crossing Several Servers
- Multiple Flows Crossing One Server
- Packets
- A Hierarchy of Service Curves
- Network Calculus: Global Analysis. Modular Analysis: Computing with Curves
- Tight Worst-case Performances
- Stability in Networks with Cyclic Dependencies
- Conclusion
- Mathematical Background
- List of Symbols
- References
- Index
- Other titles from iSTE in Networks and Telecommunications.