An Algorithmic Toolbox for Network Calculus-Reference-Cited by-同舟云学术

An Algorithmic Toolbox for Network Calculus

Published:2007-10-16 Issue:1 Volume:18 Page:3-49
ISSN:0924-6703
Container-title:Discrete Event Dynamic Systems
language:en
Short-container-title:Discrete Event Dyn Syst

Author:

Bouillard Anne,Thierry Éric

Publisher

Springer Science and Business Media LLC

Subject

Electrical and Electronic Engineering,Modeling and Simulation,Control and Systems Engineering

Link

http://link.springer.com/content/pdf/10.1007/s10626-007-0028-x.pdf

Reference36 articles.

1. Agarwal PK, Sharir M (1995a) Davenport–Schinzel sequences and their geometric applications. Cambridge Univ. Press

2. Agarwal PK, Sharir M (1995b) Davenport–Schinzel sequences and their geometric applications, Technical report DUKE-TR-1995-21. Department of Computer Science, Duke University

3. Attalah MJ (1985) Some dynamic computational geometry problems. Comput Math Appl 11: 1171–1181

4. Baccelli F, Cohen G, Olsder GJ, Quadrat J-P (1992) Synchronization and linearity. Wiley, Download from http://www.maxplus.org

5. Boissonat JD, Yvinec M (1998) Algorithmic geometry. Cambridge Univ. Press

Cited by 37 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A novel real-time calculus for arbitrary job patterns and deadlines;Journal of Systems Architecture;2024-10

2. A Novel Real-Time Calculus for Arbitrary Demand Models;2024

3. Extending the network calculus algorithmic toolbox for ultimately pseudo-periodic functions: pseudo-inverse and composition;Discrete Event Dynamic Systems;2023-08-18

4. Efficient and Accurate Handling of Periodic Flows in Time-Sensitive Networks;2023 IEEE 29th Real-Time and Embedded Technology and Applications Symposium (RTAS);2023-05

5. Computationally Efficient Worst-Case Analysis of Flow-Controlled Networks With Network Calculus;IEEE Transactions on Information Theory;2023-04