Worst-case end-to-end delays evaluation for \texttt{SpaceWire} networks

DOI10.1007/S10626-011-0103-1zbMATH Open1226.93097OpenAlexW1963562957MaRDI QIDQ645049FDOQ645049

Authors: Thomas Ferrandiz, Fabrice Frances, Christian Fraboul 

Publication date: 8 November 2011

Published in: Discrete Event Dynamic Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10626-011-0103-1

Recommendations

• Numerical analysis of worst-case end-to-end delay bounds in FIFO tandem networks
• Timing analysis of rate-constrained traffic in TTEthernet using network calculus
• Tight performance bounds in the worst-case analysis of feed-forward networks
• Integrated end-to-end delay analysis for regulated ATM networks
• Network calculus for bounding delays in feedforward networks of FIFO queueing systems

zbMATH Keywords

performance evaluationembedded networkspacewirewormhole routingworst-case end-to-end delays

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Control/observation systems involving computers (process control, etc.) (93C83)

Cites Work

• Deadlock-Free Message Routing in Multiprocessor Interconnection Networks

Cited In (2)

• Using non-preemptive regions and path modification to improve schedulability of real-time traffic over priority-based NOCs
• Real-time analysis of priority-preemptive NoCs with arbitrary buffer sizes and router delays

This page was built for publication: Worst-case end-to-end delays evaluation for \texttt{SpaceWire} networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q645049)